Pages that link to "Item:Q1825525"
From MaRDI portal
The following pages link to Lower bounds for covering times for reversible Markov chains and random walks on graphs (Q1825525):
Displaying 50 items.
- Random walks on graphs with interval weights and precise marginals (Q274449) (← links)
- Sandwich theorem of cover times (Q361586) (← links)
- A lecture on the averaging process (Q431519) (← links)
- Cover times, blanket times, and majorizing measures (Q431644) (← links)
- Effective graph resistance (Q550630) (← links)
- Laplace eigenvalues of graphs---a survey (Q686298) (← links)
- Covering problems for Markov chains (Q749044) (← links)
- Random walk covering of some special trees (Q809480) (← links)
- Random walks on highly symmetric graphs (Q923511) (← links)
- Coupling and mixing times in a Markov chain (Q1017619) (← links)
- On the time to traverse all edges of a graph (Q1178251) (← links)
- A bound for the covering time of random walks on graphs (Q1198987) (← links)
- Lower bounds for one-dimensional Markov chains (Q1326274) (← 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)
- On the cover time of planar graphs (Q1572753) (← links)
- Cutoffs for product chains (Q1615913) (← links)
- New bounds for randomized busing (Q1770380) (← links)
- Bounds on the cover time (Q1823547) (← links)
- On the cover time of random walks on graphs (Q1823548) (← links)
- A spectral characterization for concentration of the cover time (Q2209316) (← links)
- Cover times for sequences of reversible Markov chains on random graphs (Q2258610) (← links)
- Reversibility of the non-backtracking random walk (Q2291971) (← links)
- On the fastest finite Markov processes (Q2326015) (← links)
- Lower bounds for transition probabilities on graphs (Q2372469) (← links)
- On the cover time and mixing time of random geometric graphs (Q2373731) (← links)
- Waiting for regulatory sequences to appear (Q2467108) (← links)
- How universal are asymptotics of disconnection times in discrete cylinders? (Q2468420) (← links)
- One-dimensional stepping stone models, sardine genetics and Brownian local time (Q2476408) (← links)
- Improved approximation of the minimum cover time (Q2566000) (← links)
- Simple permutations mix well (Q2581269) (← links)
- Poisson approximation for non-backtracking random walks (Q2655782) (← links)
- The cover time of a (multiple) Markov chain with rational transition probabilities is rational (Q2670806) (← links)
- Multiple cover time (Q3123120) (← links)
- Stochastic forms of non-negative matrices and Perron-regularity (Q3186708) (← links)
- Probabilistic embedding of discrete sets as continuous metric spaces (Q3396067) (← links)
- Combinatorial Proof of the Identity for Cover Times on Finite Graphs (Q3562951) (← links)
- A Technique for Lower Bounding the Cover Time (Q3989014) (← links)
- Markov chains on hypercubes: Spectral representations and several majorization relations (Q4034706) (← links)
- Deterministic approximation of the cover time (Q4417001) (← links)
- A semidefinite bound for mixing rates of Markov chains (Q4645923) (← links)
- A model of self‐avoiding random walks for searching complex networks (Q4648693) (← links)
- A tight lower bound on the cover time for random walks on graphs (Q4845080) (← links)
- Analytical results for the distribution of cover times of random walks on random regular graphs (Q5049469) (← links)
- Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time (Q5175230) (← links)
- Many Random Walks Are Faster Than One (Q5199503) (← links)
- Greedy Random Walk (Q5410258) (← links)
- Cover Times and Generic Chaining (Q5416554) (← links)
- Multiple random walks on graphs: mixing few to cover many (Q6085870) (← links)
- Linear cover time is exponentially unlikely (Q6670804) (← links)
