Hitting times for random walks on vertex-transitive graphs

From MaRDI portal
Publication:3820630

DOI10.1017/S0305004100068079zbMath0668.05043MaRDI QIDQ3820630

David J. Aldous

Publication date: 1989

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)




Related Items (22)

Cutoff thermalization for Ornstein-Uhlenbeck systems with small Lévy noise in the Wasserstein distanceThreshold limits for cover timesStochastic forms of non-negative matrices and Perron-regularitySome inequalities for reversible Markov chains and branching random walks via spectral optimizationRandom walks on edge transitive graphsRandom Lights Out processes on graphsHitting times for random walks on tricyclic graphsA spectral characterization for concentration of the cover timeThe expected hitting times for graphs with cutpoints.Random walks on highly symmetric graphsHitting times for random walks on subdivision and triangulation graphsLaplace eigenvalues of graphs---a surveyIntermediate range migration in the two-dimensional stepping stone modelExpected hitting times for random walks on quadrilateral graphs and their applicationsExtremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover costExpected hitting times for random walks on the diamond hierarchical graphs involving some classical parametersExtremal cover cost and reverse cover cost of trees with given segment sequenceThe hitting times of random walks on bicyclic graphsRandom walks on a finite graph with congestion pointsContinuous Time Markov Processes on GraphsExpected hitting times for random walks on the \(k\)-triangle graph and their applicationsThe hitting time of random walk on unicyclic graphs



Cites Work


This page was built for publication: Hitting times for random walks on vertex-transitive graphs