The following pages link to Mixing times (Q4208451):
Displaying 43 items.
- Mixing time of near-critical random graphs (Q428137) (← links)
- Mixing and hitting times for finite Markov chains (Q456220) (← links)
- Mixing under monotone censoring (Q457802) (← links)
- Mixing times are hitting times of large sets (Q495704) (← links)
- The mathematics of mixing things up (Q644914) (← links)
- Markov chain mixing time on cycles (Q719772) (← links)
- On times to quasi-stationarity for birth and death processes (Q842403) (← links)
- Faster mixing and small bottlenecks (Q863483) (← links)
- The expected hitting times for finite Markov chains (Q924349) (← links)
- Orthogonality and probability: mixing times (Q967701) (← links)
- Separation cut-offs for birth and death chains (Q997420) (← links)
- Coupling and mixing times in a Markov chain (Q1017619) (← links)
- Relaxation of product Markov chains on product spaces (Q1273731) (← links)
- Information flow on trees (Q1425477) (← links)
- Mixing times of lozenge tiling and card shuffling Markov chains (Q1431558) (← links)
- A conversation with Jim Pitman (Q1630402) (← links)
- Maximum Kolmogorov-Sinai entropy versus minimum mixing time in Markov chains (Q1706304) (← links)
- Quantum walks: a comprehensive review (Q1757875) (← links)
- Exact mixing in an unknown Markov chain (Q1897681) (← links)
- Mixing times for uniformly ergodic Markov chains (Q1965874) (← links)
- On approximating the stationary distribution of time-reversible Markov chains (Q1987513) (← links)
- Comparing with octopi (Q2028952) (← links)
- Characterizing limits and opportunities in speeding up Markov chain mixing (Q2029783) (← links)
- Mixing and hitting times for Gibbs samplers and other non-Feller processes (Q2073235) (← links)
- The toom interface via coupling (Q2175123) (← links)
- A spectral characterization for concentration of the cover time (Q2209316) (← links)
- A comparison principle for random walk on dynamical percolation (Q2212614) (← links)
- Mixing time of Markov chains for the 1-2 model (Q2328714) (← links)
- Randomized scheduling algorithm for queueing networks (Q2428047) (← links)
- Mixing times with applications to perturbed Markov chains (Q2497948) (← links)
- Mixing time for Markov chain on linear extensions (Q2680908) (← links)
- Perfect edge state transfer on cubelike graphs (Q2685574) (← links)
- Mixing times for the interchange process (Q2863811) (← links)
- Dimension-Independent MCMC Sampling for Inverse Problems with Non-Gaussian Priors (Q2945165) (← links)
- On Approximating the Stationary Distribution of Time-reversible Markov Chains (Q3304112) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- A technical report on hitting times, mixing and cutoff (Q4603436) (← links)
- Varieties of mixing (Q5234492) (← links)
- The Mixing Time of the Newman-Watts Small-World Model (Q5246170) (← links)
- Mixing Versus Stirring (Q5377504) (← links)
- (Q5743507) (← links)
- On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes (Q5936463) (← links)
- Sensitivity of mixing times of Cayley graphs (Q6622791) (← links)
