×

The incipient giant component in bond percolation on general finite weighted graphs. (English) Zbl 1348.60136

Summary: On a large finite connected graph let edges \(e\) become “open” at independent random Exponential times of arbitrary rates \(w_e\). Under minimal assumptions, the time at which a giant component starts to emerge is weakly concentrated around its mean.

MSC:

60K35 Interacting random processes; statistical mechanics type models; percolation theory
05C80 Random graphs (graph-theoretic aspects)
PDF BibTeX XML Cite
Full Text: DOI arXiv Euclid