Covering problems for Markov chains
From MaRDI portal
Publication:749044
DOI10.1214/aop/1176991686zbMath0712.60076OpenAlexW2068008593MaRDI QIDQ749044
Publication date: 1988
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1176991686
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Sample path properties (60G17)
Related Items
Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving, Covering with blocks in the non-symmetric case, On the mean and variance of cover times for random walks on graphs, Threshold limits for cover times, Sandwich theorem of cover times, Some sample path properties of a random walk on the cube, Cover times for words in symmetric and nonsymmetric cases: A comparison, Random walks on edge transitive graphs, On an epidemic model on finite graphs, Gumbel fluctuations for cover times in the discrete torus, Reversible random walks on dynamic graphs, Uniformity of the uncovered set of random walk and cutoff for lamplighter chains, Cover levels and random interlacements, How long is the chaos game?, Cover times, blanket times, and majorizing measures, Painting a graph with competing random walks, Hitting time of large subsets of the hypercube, A spectral characterization for concentration of the cover time, Random walks on highly symmetric graphs, On the cover time of \(\lambda\)-biased walk on supercritical Galton-Watson trees, The Evolution of the Cover Time, The generating functions of hitting times for random walk on trees, Expected cover times of random walks on symmetric graphs, Exponential concentration of cover times, The hitting and cover times of Metropolis walks, The hitting and cover times of random walks on finite graphs using local degree information, Limit law for the cover time of a random walk on a binary tree, How to Design a Linear Cover Time Random Walk on a Finite Graph, An introduction to covering problems for random walks on graphs, Estimating the Mean Cover Time of a Semi-Markov Process via Simulation, Improved approximation of the minimum cover time
