✦ LIBER ✦

The type-problem on the average for random walks on graphs

✍ Scribed by R. Burioni; D. Cassi; A. Vezzani

Publisher: Springer
Year: 2000
Tongue: English
Weight: 150 KB
Volume: 15
Category: Article
ISSN: 1434-6036
DOI: 10.1007/s100510051170

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Einstein Relation for Random Walks o

The Einstein Relation for Random Walks on Graphs

✍ András Telcs 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 185 KB

On the average of a random walk

✍ Karl Grill 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 237 KB

Biased random walks on resource network

Biased random walks on resource network graphs for

✍ M. Randles; O. Abu-Rahmeh; P. Johnson; A. Taleb-Bendiab 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 888 KB

Adaptive random walks on the class of We

Adaptive random walks on the class of Web graphs

✍ B. Tadić 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 238 KB

On the average genus of the random graph

✍ Saul Stahl 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 640 KB

## Abstract We obtain an upper bound on the expected number of regions in the randomly chosen orientable embedding of a fixed graph. This bound is ised to show that the average genus of the random graph on __v__ vertices is close to its maximum genus. More specifically, it is proven that the differ

A bound for the covering time of random

A bound for the covering time of random walks on graphs

✍ JoséLuis Palacios 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 199 KB