New Bounds for Edge-Cover by Random Walk
From MaRDI portal
Publication:5495676
DOI10.1017/S096354831400008XzbMath1296.05178arXiv1109.6619MaRDI QIDQ5495676
Peter M. Winkler, Angelos Georgakopoulos
Publication date: 6 August 2014
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.6619
Related Items
Cites Work
- Unnamed Item
- Cover times, blanket times, and majorizing measures
- Covering times of random walks on bounded degree trees and other graphs
- Random walks and the effective resistance of networks
- On the time to traverse all edges of a graph
- Cover times for Brownian motion and random walks in two dimensions
- On the cover time of random walks on graphs
- Graph-like continua, augmenting arcs, and Menger's theorem
- Probability on Trees and Networks
- Multiple cover time
- Random motion on binary trees
- The equivalence of diffusions on networks to Brownian motion
- Uniqueness of electrical currents in a network of finite total resistance
- Maximum hitting time for random walks on graphs
- A tight upper bound on the cover time for random walks on graphs
- Extremal cover times for random walks on trees
- On Cumulative Sums of Random Variables