✦ LIBER ✦

Stationary distribution and cover time of random walks on random digraphs

✍ Scribed by Colin Cooper; Alan Frieze

Book ID: 113698918
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 400 KB
Volume: 102
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2011.11.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random walks on networks: Cumulative dis

Random walks on networks: Cumulative distribution of cover time

✍ Zlatanov, Nikola; Kocarev, Ljupco 📂 Article 📅 2009 🏛 The American Physical Society 🌐 English ⚖ 164 KB

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 cover times of random walks on rando

The cover times of random walks on random uniform hypergraphs

✍ Cooper, Colin; Frieze, Alan; Radzik, Tomasz 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 510 KB

Collecting coupons on trees, and the cov

Collecting coupons on trees, and the cover time of random walks

✍ Uriel Feige 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 769 KB

Growth and recurrence of stationary rand

Growth and recurrence of stationary random walks

✍ Gernot Greschonig; Klaus Schmidt 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 127 KB

Extremal cover times for random walks on

Extremal cover times for random walks on trees

✍ Graham Brightwell; Peter Winkler 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 370 KB

## Abstract Let __C~ν~__(__T__) denote the “cover time” of the tree __T__ from the vertex __v__, that is, the expected number of steps before a random walk starting at __v__ hits every vertex of __T.__ Asymptotic lower bounds for __C~ν~__(__T__) (for __T__ a tree on __n__ vertices) have been obtain