✦ LIBER ✦

Universality for the Distance in Finite Variance Random Graphs

✍ Scribed by Henri van den Esker; Remco van der Hofstad; Gerard Hooghiemstra

Book ID: 106431400
Publisher: Springer
Year: 2008
Tongue: English
Weight: 712 KB
Volume: 133
Category: Article
ISSN: 0022-4715
DOI: 10.1007/s10955-008-9594-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Embeddability of finite distance graphs

Embeddability of finite distance graphs with a large chromatic number in random graphs

✍ S. V. Nagaeva 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 177 KB

On embedding of finite distance graphs w

On embedding of finite distance graphs with large chromatic number in random graphs

✍ S. V. Nagaeva; A. M. Raigorodskii 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 293 KB

The weak zero-one laws for the random di

The weak zero-one laws for the random distance graphs

✍ M. E. Zhukovskii 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 221 KB

The Weak Zero-One Law for the Random Dis

The Weak Zero-One Law for the Random Distance Graphs

✍ Zhukovskii, M. E. 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 151 KB

On the realization of random graphs as d

On the realization of random graphs as distance graphs in spaces of fixed dimension

✍ S. V. Nagaeva; A. M. Raigorodskii 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 160 KB

On the Mean and Variance of Cover Times

On the Mean and Variance of Cover Times for Random Walks on Graphs

✍ Frank Ball; Bruce Dunham; A Hirschowitz 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 141 KB

A method is described for calculating the mean cover time for a particle performing a simple random walk on the vertices of a finite connected graph. The method also yields the variance and generating function of the cover time. A computer program is available which utilises the approach to provide