✦ LIBER ✦

The Cover Time of Random Regular Graphs

✍ Scribed by Cooper, Colin; Frieze, Alan

Book ID: 118197223
Publisher: Society for Industrial and Applied Mathematics
Year: 2005
Tongue: English
Weight: 187 KB
Volume: 18
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480103428478

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the cover time of random walks on gra

On the cover time of random walks on graphs

✍ Jeff D. Kahn; Nathan Linial; Noam Nisan; Michael E. Saks 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 368 KB

The diameter of random regular graphs

✍ Béla Bollobás; W. Fernandez de la Vega 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 421 KB

On the cover time and mixing time of ran

On the cover time and mixing time of random geometric graphs

✍ Chen Avin; Gunes Ercal 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 693 KB

The Isoperimetric Number of Random Regul

The Isoperimetric Number of Random Regular Graphs

✍ Bollobás, Bélla 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 247 KB

1-Factorizations of random regular graph

1-Factorizations of random regular graphs

✍ M. S. O. Molloy; H. Robalewska; R. W. Robinson; N. C. Wormald 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB 👁 2 views

It is shown that for each r G 3, a random r-regular graph on 2 n vertices is equivalent in a certain sense to a set of r randomly chosen disjoint perfect matchings of the 2 n vertices, as n ª ϱ. This equivalence of two sequences of probabilistic spaces, called contiguity, occurs when all events almo

Expected cover times of random walks on

Expected cover times of random walks on symmetric graphs

✍ José Luis Palacios 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 203 KB