2016 CMS Winter Meeting

Niagara Falls, December 2 - 5, 2016


Coxeter-James Prize

Probabilistic aspects of minimum spanning trees  [PDF]

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 present some results 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.


Centre de recherches mathématiques Pacific Institute for the Mathematical Sciences Fields Institute AARMS: Atlantic Association for Research in the Mathematical Sciences McMaster University

© Canadian Mathematical Society : http://www.cms.math.ca/