The following pages link to (Q4234053):
Displaying 10 items.
- Exact mixing times for random walks on trees (Q354448) (← links)
- Mixing times are hitting times of large sets (Q495704) (← links)
- The best mixing time for random walks on trees (Q503614) (← links)
- Faster mixing and small bottlenecks (Q863483) (← links)
- Mixing time bounds via bottleneck sequences (Q1756546) (← links)
- Mixing times for uniformly ergodic Markov chains (Q1965874) (← links)
- The access time of random walks on trees with given partition (Q2141241) (← links)
- On incentive compatibility in dynamic mechanism design with exit option in a Markovian environment (Q2150676) (← links)
- Optimal stopping of stochastic transport minimizing submartingale costs (Q3382260) (← links)
- A Hitting Time Formula for the Discrete Green's Function (Q5366895) (← links)
