On the time taken by random walks on finite groups to visit every state

DOI10.1007/BF00535260zbMath0488.60011OpenAlexW1997429681MaRDI QIDQ3949710

David J. Aldous

Publication date: 1983

Published in: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00535260

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)

Related Items

Covering with blocks in the non-symmetric case, Memory Efficient Anonymous Graph Exploration, A discrete random walk on the hypercube, Some sample path properties of a random walk on the cube, Statistical complexity of the power method for Markov chains, The electrical resistance of a graph captures its commute and cover times, Gumbel fluctuations for cover times in the discrete torus, Early-time measure in eternal inflation, Stationary distribution and cover time of sparse directed configuration models, Random walks on highly symmetric graphs, On the time to traverse all edges of a graph, How universal are asymptotics of disconnection times in discrete cylinders?, Laplace eigenvalues of graphs---a survey, Giant component and vacant set for random walk on a discrete torus, The hitting and cover times of Metropolis walks, Tight bounds for the cover time of multiple random walks, On the disconnection of a discrete cylinder by a random walk, Many Random Walks Are Faster Than One, The hitting and cover times of random walks on finite graphs using local degree information, How to Design a Linear Cover Time Random Walk on a Finite Graph, Bounds on the cover time, An introduction to covering problems for random walks on graphs, Self-intersections of random walks on discrete groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimization algorithms and random walk on the d-cube
• Markov chains with almost exponential hitting times