The following pages link to (Q3660628):
Displaying 50 items.
- Perfect sampling using bounding chains. (Q1879888) (← links)
- Phase transition for the mixing time of the Glauber dynamics for coloring regular trees (Q1931316) (← links)
- Cutoff for the Ising model on the lattice (Q1943673) (← links)
- Mixing time for the Ising model: a uniform lower bound for all graphs (Q1944667) (← links)
- Fast initial conditions for Glauber dynamics (Q2052711) (← links)
- Limit profiles for reversible Markov chains (Q2073176) (← links)
- Mixing time of fractional random walk on finite fields (Q2084834) (← links)
- Cutoff for the asymmetric riffle shuffle (Q2087390) (← links)
- A conversation with David J. Aldous (Q2092903) (← links)
- Cutoff for random lifts of weighted graphs (Q2119212) (← links)
- Cutoff profile of ASEP on a segment (Q2140000) (← links)
- Cutoff on Ramanujan complexes and classical groups (Q2165717) (← links)
- Cutoff for the mean-field zero-range process with bounded monotone rates (Q2179596) (← links)
- Random walks on Ramanujan complexes and digraphs (Q2216740) (← links)
- The cutoff phenomenon in total variation for nonlinear Langevin systems with small layered stable noise (Q2243931) (← links)
- The \(L^{2}\)-cutoff for reversible Markov processes (Q2269684) (← links)
- A unified approach to coupling SDEs driven by Lévy noise and some applications (Q2278676) (← links)
- Cutoff for the mean-field zero-range process (Q2280554) (← links)
- Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement (Q2312684) (← links)
- Comparing mixing times on sparse random graphs (Q2320396) (← links)
- Cutoff for the East process (Q2339204) (← links)
- Abrupt convergence and escape behavior for birth and death chains (Q2380405) (← links)
- Random walk on sparse random digraphs (Q2413249) (← links)
- A general lower bound for mixing of single-site dynamics on graphs (Q2456048) (← links)
- Path coupling without contraction (Q2457299) (← links)
- Convergence rates of random walk on irreducible representations of finite groups (Q2481391) (← links)
- Analysis of top to bottom-\(k\) shuffles (Q2494572) (← links)
- The overhand shuffle mixes in \(\Theta(n^2\log n)\) steps (Q2494578) (← links)
- Provable unlinkability against traffic analysis with low message overhead (Q2516530) (← links)
- Radiocoloring in planar graphs: Complexity and approximations (Q2566036) (← links)
- A threshold for cutoff in two-community random graphs (Q2657925) (← links)
- Large deviations for the interchange process on the interval and incompressible flows (Q2682946) (← links)
- Cutoff for permuted Markov chains (Q2686612) (← links)
- Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher (Q2692967) (← links)
- Information percolation and cutoff for the stochastic Ising model (Q2802070) (← links)
- Tweakable Blockciphers with Asymptotically Optimal Security (Q2946875) (← links)
- Optimal Co-Adapted Coupling for the Symmetric Random Walk on the Hypercube (Q3535632) (← links)
- On the time taken by random walks on finite groups to visit every state (Q3949710) (← links)
- Rapid mixing for lattice colourings with fewer colours (Q4968808) (← links)
- Sampling biased monotonic surfaces using exponential metrics (Q4987255) (← links)
- Deterministic counting of graph colourings using sequences of subgraphs (Q4993106) (← links)
- An adjacent-swap Markov chain on coalescent trees (Q5049907) (← links)
- Linear algebra and multivariate analysis in statistics: development and interconnections in the twentieth century (Q5085687) (← links)
- CUTOFF AT THE ENTROPIC TIME FOR RANDOM WALKS ON COVERED EXPANDER GRAPHS (Q5102213) (← links)
- Numerical computations of geometric ergodicity for stochastic dynamics (Q5136548) (← links)
- A non-local random walk on the hypercube (Q5233209) (← links)
- Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs (Q5252687) (← links)
- Random multiplicative walks on the residues modulo n (Q5361224) (← links)
- Optimal Coadapted Coupling for a Random Walk on the Hyper-Complete Graph (Q5407032) (← links)
- (Q5743398) (← links)
