# Louigi Addario-Berry : Probabilistic aspects of minimum spanning trees

Abstract: One of the most dynamic areas of probability theory is the study of the behaviour of discrete optimization problems on random inputs. My talk will focus on the probabilistic analysis of one of the first and foundational combinatorial optimization problems: the minimum spanning tree problem. The structure of a random minimum spanning tree (MST) of a graph G turns out to be intimately linked to the behaviour of critical and near-critical percolation on G. I will describe this connection and some of my results, alone and with coauthors, on the structure, scaling limits, and volume growth of random MSTs. It turns out that, on high-dimensional graphs, random minimum spanning trees are expected to be three-dimensional when viewed intrinsically, and six-dimensional when viewed as embedded objects.

**Category**: Probability**Duration**: 01:14:46**Date**: November 3, 2016 at 4:25 PM-
**Tags:**seminar, Probability Seminar

## 0 Comments