✦ LIBER ✦

The Volume of the Giant Component of a Random Graph with Given Expected Degrees

✍ Scribed by Chung, Fan; Lu, Linyuan

Book ID: 118196897
Publisher: Society for Industrial and Applied Mathematics
Year: 2006
Tongue: English
Weight: 216 KB
Volume: 20
Category: Article
ISSN: 0895-4801
DOI: 10.1137/050630106

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A remark on the spectra of random graphs

A remark on the spectra of random graphs with given expected degrees

✍ Shang, Yilun 📂 Article 📅 2012 🏛 Informa UK (Taylor & Francis) 🌐 English ⚖ 166 KB

The number of graphs and a random graph

The number of graphs and a random graph with a given degree sequence

✍ Alexander Barvinok; J.A. Hartigan 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB

The mixing time of the giant component o

The mixing time of the giant component of a random graph

✍ Benjamini, Itai; Kozma, Gady; Wormald, Nicholas 📂 Article 📅 2014 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB

Cover time of a random graph with given

Cover time of a random graph with given degree sequence

✍ Mohammed Abdullah; Colin Cooper; Alan Frieze 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 328 KB

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

The scaling window for a random graph wi

The scaling window for a random graph with a given degree sequence

✍ Hamed Hatami; Michael Molloy 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB