𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The mixing time of the giant component of a random graph

✍ Scribed by Benjamini, Itai; Kozma, Gady; Wormald, Nicholas

Book ID
126891723
Publisher
John Wiley and Sons
Year
2014
Tongue
English
Weight
199 KB
Volume
45
Category
Article
ISSN
1042-9832

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On a random graph with immigrating verti
On a random graph with immigrating vertices: Emergence of the giant component
✍ David J. Aldous; Boris Pittel πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 186 KB πŸ‘ 2 views

A randomly evolving graph, with vertices immigrating at rate n and each possible edge appearing at rate 1/n, is studied. The detailed picture of emergence of giant components with O n 2/3 vertices is shown to be the same as in the ErdΕ‘s-RΓ©nyi graph process with the number of vertices fixed at n at t

Survival time of a random graph
Survival time of a random graph
✍ A. M. Frieze; A. M. Frieze πŸ“‚ Article πŸ“… 1989 πŸ› Springer-Verlag 🌐 English βš– 393 KB
On the Largest Component of the Random G
On the Largest Component of the Random Graph at a Nearcritical Stage
✍ Boris Pittel πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 225 KB

The random graphs G(n, Pr(edge)= p), G(n, \*edges=M) at the critical range p=(1+\*n &1Γ‚3 )Γ‚n and M=(nΓ‚2)(1+\*n &1Γ‚3 ) are studied. The limiting distribution of the largest component size is determined.