𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The cover times of random walks on random uniform hypergraphs

✍ Scribed by Cooper, Colin; Frieze, Alan; Radzik, Tomasz

Book ID
122938744
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
510 KB
Volume
509
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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

Commute times of random walks on trees
Commute times of random walks on trees
✍ Konsowa, Mokhtar; Al-Awadhi, Fahimah; Telcs, AndrΓ‘s πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 215 KB
On the Local Times of Transient Random W
On the Local Times of Transient Random Walks
✍ Endre CsΓ‘ki; AntΓ³nia FΓΆldes; PΓ‘l RΓ©vΓ©sz πŸ“‚ Article πŸ“… 2007 πŸ› Springer Netherlands 🌐 English βš– 314 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