The following pages link to Covering problems for Markov chains (Q749044):
Displaying 35 items.
- Sandwich theorem of cover times (Q361586) (← links)
- Gumbel fluctuations for cover times in the discrete torus (Q389274) (← links)
- Uniformity of the uncovered set of random walk and cutoff for lamplighter chains (Q414277) (← links)
- Cover levels and random interlacements (Q417070) (← links)
- Cover times, blanket times, and majorizing measures (Q431644) (← links)
- Random walks on highly symmetric graphs (Q923511) (← links)
- The hitting and cover times of Metropolis walks (Q964410) (← links)
- The hitting and cover times of random walks on finite graphs using local degree information (Q1001905) (← links)
- Some sample path properties of a random walk on the cube (Q1119275) (← links)
- Expected cover times of random walks on symmetric graphs (Q1194485) (← links)
- Covering with blocks in the non-symmetric case (Q1345083) (← links)
- On the mean and variance of cover times for random walks on graphs (Q1353782) (← links)
- Random walks on edge transitive graphs (Q1382191) (← links)
- Exponential concentration of cover times (Q1748936) (← links)
- An introduction to covering problems for random walks on graphs (Q1825524) (← links)
- Cover times for words in symmetric and nonsymmetric cases: A comparison (Q1917614) (← links)
- Painting a graph with competing random walks (Q1951684) (← links)
- Limit law for the cover time of a random walk on a binary tree (Q2041823) (← links)
- On an epidemic model on finite graphs (Q2180383) (← links)
- A spectral characterization for concentration of the cover time (Q2209316) (← links)
- On the cover time of \(\lambda\)-biased walk on supercritical Galton-Watson trees (Q2229565) (← links)
- Cover times for sequences of reversible Markov chains on random graphs (Q2258610) (← links)
- The generating functions of hitting times for random walk on trees (Q2462080) (← links)
- Improved approximation of the minimum cover time (Q2566000) (← links)
- Threshold limits for cover times (Q2638665) (← links)
- The cover time of a (multiple) Markov chain with rational transition probabilities is rational (Q2670806) (← links)
- The Evolution of the Cover Time (Q2998848) (← links)
- JOINT DISTRIBUTION OF THE COVER TIME AND THE LAST VISITED POINT OF FINITE MARKOV CHAINS (Q3515310) (← links)
- Hitting time of large subsets of the hypercube (Q3522838) (← links)
- How to Design a Linear Cover Time Random Walk on a Finite Graph (Q3646121) (← links)
- Estimating the Mean Cover Time of a Semi-Markov Process via Simulation (Q5488529) (← links)
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← links)
- Reversible random walks on dynamic graphs (Q6063351) (← links)
- How long is the chaos game? (Q6175064) (← links)
- Cover times for random walk on dynamical percolation (Q6564561) (← links)
