𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Random Geometric Graph Diameter in the Unit Ball

✍ Scribed by Robert B. Ellis; Jeremy L. Martin; Catherine Yan

Publisher
Springer
Year
2007
Tongue
English
Weight
336 KB
Volume
47
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Disjoint Hamilton cycles in the random g
Disjoint Hamilton cycles in the random geometric graph
✍ Tobias MΓΌller,; Xavier PΓ©rez-GimΓ©nez;; Nicholas Wormald πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 270 KB

We consider the standard random geometric graph process in which n vertices are placed at random on the unit square and edges are sequentially added in increasing order of edge-length. For fixed k β‰₯ 1, we prove that the first edge in the process that creates a k-connected graph coincides a.a.s. with

The Diameter of Sparse Random Graphs
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

The Diameter of a Scale-Free Random Grap
The Diameter of a Scale-Free Random Graph
✍ BΓ©la BollobΓ‘s*; Oliver Riordan πŸ“‚ Article πŸ“… 2004 πŸ› Springer-Verlag 🌐 English βš– 350 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