The Annals of Applied Probability
- Ann. Appl. Probab.
- Volume 26, Number 5 (2016), 3206-3250.
Connectivity thresholds for bounded size rules
In an Achlioptas process, starting with a graph that has $n$ vertices and no edge, in each round $d\ge1$ vertex pairs are chosen uniformly at random, and using some rule exactly one of them is selected and added to the evolving graph. We investigate the impact of the rule’s choice on one of the most basic properties of a graph: connectivity. In our main result we focus on the prominent class of bounded size rules, which select the edge to add according to the component sizes of its vertices, treating all sizes larger than some constant equally. For such rules we provide a fine analysis that exposes the limiting distribution and the expectation of the number of rounds until the graph gets connected, and we give a detailed picture of the dynamics of the formation of the single component from smaller components. Our results allow us to study the connectivity transition of all Achlioptas processes, in the sense that we identify a process that accelerates it as much as possible.
Ann. Appl. Probab. Volume 26, Number 5 (2016), 3206-3250.
Received: July 2014
Revised: April 2015
First available in Project Euclid: 19 October 2016
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Einarsson, Hafsteinn; Lengler, Johannes; Mousset, Frank; Panagiotou, Konstantinos; Steger, Angelika. Connectivity thresholds for bounded size rules. Ann. Appl. Probab. 26 (2016), no. 5, 3206--3250. doi:10.1214/16-AAP1174. https://projecteuclid.org/euclid.aoap/1476884316