✦ LIBER ✦

The Diameter of a Scale-Free Random Graph

✍ Scribed by Béla Bollobás*; Oliver Riordan

Publisher: Springer-Verlag
Year: 2004
Tongue: English
Weight: 350 KB
Volume: 24
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-004-0002-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degree distribution of a scale-free rand

Degree distribution of a scale-free random graph model

✍ Li Tan; Zhen Ting Hou; Xin Ru Liu 📂 Article 📅 2012 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 350 KB

Random walks and diameter of finite scal

Random walks and diameter of finite scale-free networks

✍ Sungmin Lee; Soon-Hyung Yook; Yup Kim 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 498 KB

The Diameter of Sparse Random Graphs

✍ Fan Chung; Linyuan Lu 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 150 KB

We consider the diameter of a random graph G n p for various ranges of p close to the phase transition point for connectivity. For a disconnected graph G, we use the convention that the diameter of G is the maximum diameter of its connected components. We show that almost surely the diameter of rand

Random removal of edges from scale free

Random removal of edges from scale free graphs

✍ S. Martin; R.D. Carr; J.-L. Faulon 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 175 KB

On a 2-parameter class of scale free ran

On a 2-parameter class of scale free random graphs

✍ T. F. Móri 📂 Article 📅 2007 🏛 Akadmiai Kiad 🌐 English ⚖ 206 KB

Diameter of random spanning trees in a g

Diameter of random spanning trees in a given graph

✍ Fan Chung; Paul Horn; L. Lu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract Motivated by the observation that the sparse tree‐like subgraphs in a small world graph have large diameter, we analyze random spanning trees in a given host graph. We show that the diameter of a random spanning tree of a given host graph __G__ is between and with high probability., w