Unique giant component implies weak concentration conjecture
Unique giant component implies weak concentration conjecture
Let be a sequence of finite edge-weighted graphs satisfying the background assumption (hypothesis (2)). Define the unique giant component property by
where is the size of the second-largest component at time . Let the weak concentration property be the property denoted by (w-c) in the source.
Unique giant component implies weak concentration conjecture. Under the background assumption, the unique giant component property implies the weak concentration property.
Equivalently, the limiting process may be deterministic and continuous or random and discontinuous, but cannot be random and continuous. This is presented as an open problem, and the source relates weak concentration to the inverse of the percolation function.
Sources & referencesView supporting material
Primary source
David J. Aldous, “The Incipient Giant Component in Bond Percolation on General Finite Weighted Graphs”, arXiv:1604.06741 (2016).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.