Pages that link to "Item:Q4845080"
From MaRDI portal
The following pages link to A tight lower bound on the cover time for random walks on graphs (Q4845080):
Displaying 41 items.
- Random walks on graphs with interval weights and precise marginals (Q274449) (← links)
- Exact mixing times for random walks on trees (Q354448) (← links)
- Stationary distribution and cover time of random walks on random digraphs (Q412164) (← links)
- Cover times, blanket times, and majorizing measures (Q431644) (← links)
- Cover time of a random graph with given degree sequence (Q456654) (← links)
- The best mixing time for random walks on trees (Q503614) (← links)
- Tight bounds for the cover time of multiple random walks (Q541669) (← links)
- The cover time of the preferential attachment graph (Q864904) (← links)
- A collection of results concerning electric resistance and simple random walk on distance-regular graphs (Q898134) (← 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)
- Collecting coupons on trees, and the cover time of random walks (Q1386177) (← links)
- Frogs on trees? (Q1748920) (← links)
- Linear cover time is exponentially unlikely (Q1939561) (← links)
- A spectral characterization for concentration of the cover time (Q2209316) (← links)
- Stationary distribution and cover time of sparse directed configuration models (Q2210748) (← links)
- On the cover time of \(\lambda\)-biased walk on supercritical Galton-Watson trees (Q2229565) (← links)
- The cover time of deterministic random walks for general transition probabilities (Q2310755) (← links)
- On the cover time and mixing time of random geometric graphs (Q2373731) (← links)
- The Evolution of the Cover Time (Q2998848) (← links)
- The cover time of random geometric graphs (Q2998891) (← links)
- The Cover Time of Cartesian Product Graphs (Q3000524) (← links)
- A multiple random walks based self-stabilizing<i>k</i>-exclusion algorithm in ad hoc networks (Q3557561) (← links)
- How to Design a Linear Cover Time Random Walk on a Finite Graph (Q3646121) (← links)
- On mixing times for stratified walks on thed-cube (Q4543635) (← links)
- A model of self‐avoiding random walks for searching complex networks (Q4648693) (← links)
- Theory and Practice of Discrete Interacting Agents Models (Q4686660) (← links)
- PERFORMANCE ANALYSIS AND EVALUATION OF RANDOM WALK ALGORITHMS ON WIRELESS NETWORKS (Q4902878) (← links)
- Chung-Yau Invariants and Graphs with Symmetric Hitting Times (Q4978297) (← links)
- The cover time of a biased random walk on a random cubic graph (Q4993538) (← links)
- Analytical results for the distribution of cover times of random walks on random regular graphs (Q5049469) (← links)
- (Q5091254) (← links)
- On the Cover Time of the Emerging Giant (Q5093588) (← 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)
- On the Cover Time of Dense Graphs (Q5232158) (← links)
- Cover time of a random graph with a degree sequence II: Allowing vertices of degree two (Q5256387) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
- The Weighted Coupon Collector’s Problem and Applications (Q5323093) (← links)
- Greedy Random Walk (Q5410258) (← links)
- Multiple random walks on graphs: mixing few to cover many (Q6085870) (← links)