The following pages link to Faster mixing and small bottlenecks (Q863483):
Displaying 19 items.
- Mixing time of near-critical random graphs (Q428137) (← links)
- The mixing advantage is less than 2 (Q626271) (← links)
- Markov chain mixing time on cycles (Q719772) (← links)
- Sensitivity of mixing times (Q743063) (← links)
- Random walks on the random graph (Q1747756) (← links)
- On sensitivity of mixing times and cutoff (Q1748929) (← links)
- Mixing time bounds via bottleneck sequences (Q1756546) (← links)
- Cutoff for random walk on dynamical Erdős-Rényi graph (Q2028956) (← links)
- Does adding more agents make a difference? A case study of cover time for the rotor-router (Q2323346) (← links)
- Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point (Q2428505) (← links)
- Evolving sets, mixing and heat kernel bounds (Q2571014) (← links)
- The mixing time of the giant component of a random graph (Q2930052) (← links)
- Smoothed Analysis on Connected Graphs (Q2947435) (← links)
- Rapidly mixing Markov chains (Q3976407) (← links)
- The Mixing Time of the Newman-Watts Small-World Model (Q5246170) (← links)
- (Q5743507) (← links)
- Speeding up random walk mixing by starting from a uniform vertex (Q6126961) (← links)
- Sensitivity of mixing times of Cayley graphs (Q6622791) (← links)
- Expansion in supercritical random subgraphs of expanders and its consequences (Q6623578) (← links)
