scientific article

Publication date: 1983

Full work available at URL: http://www.numdam.org/item?id=SPS_1983__17__243_0

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

hitting time expository rapidly mixing Markov chains

Sums of independent random variables; random walks (60G50) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)

Related Items (only showing first 100 items - show all)

Quantum earth mover’s distance, a no-go quantum Kantorovich–Rubinstein theorem, and quantum marginal problem ⋮ Mixing times of Markov chains for self‐organizing lists and biased permutations ⋮ The cutoff phenomenon for the stochastic heat and wave equation subject to small Lévy noise ⋮ Cutoff phenomenon for the warp-transpose top with random shuffle ⋮ Derivation of wealth distributions from biased exchange of money ⋮ Mixing time for the asymmetric simple exclusion process in a random environment ⋮ Random walks on the circle and Diophantine approximation ⋮ Cutoff profile of the metropolis biased card shuffling ⋮ Cutoff for the Glauber dynamics of the lattice free field ⋮ Interactions of computational complexity theory and mathematics ⋮ Optimal coupling of jumpy Brownian motion on the circle ⋮ Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Metropolis-Hastings transition kernel couplings ⋮ Cutoff for non-negatively curved Markov chains ⋮ The varentropy criterion is sharp on expanders ⋮ Applications of the Brauer complex: card shuffling, permutation statistics, and dynamical systems ⋮ Cutoff ergodicity bounds in Wasserstein distance for a viscous energy shell model with Lévy noise ⋮ On the diameters of friends-and-strangers graphs ⋮ Random walks on Cayley graphs of complex reflection groups ⋮ The hit-and-run version of top-to-random ⋮ Spatio-temporal dynamics of random transmission events: from information sharing to epidemic spread ⋮ Cutoff for random lifts of weighted graphs ⋮ A note on various holding probabilities for random lazy random walks on finite groups ⋮ On the rate of mixing for \(p\)-shuffles. ⋮ On the approximation of one Markov chain by another ⋮ Cutoff thermalization for Ornstein-Uhlenbeck systems with small Lévy noise in the Wasserstein distance ⋮ Perfect sampling using bounding chains. ⋮ Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion ⋮ An adjacent-swap Markov chain on coalescent trees ⋮ Cutoff profile of ASEP on a segment ⋮ Strong uniform times and finite random walks ⋮ Total variation cutoff in birth-and-death chains ⋮ A note on adiabatic theorem for Markov chains ⋮ Abrupt convergence and escape behavior for birth and death chains ⋮ Cutoff on all Ramanujan graphs ⋮ Coupling with the stationary distribution and improved sampling for colorings and independent sets ⋮ On coupling and the approximation of the permanent ⋮ Cutoff on Ramanujan complexes and classical groups ⋮ Approximate counting, uniform generation and rapidly mixing Markov chains ⋮ Randomization time for the overhand shuffle ⋮ A threshold for cutoff in two-community random graphs ⋮ Analysis of casino shelf shuffling machines ⋮ Linear algebra and multivariate analysis in statistics: development and interconnections in the twentieth century ⋮ A rapidly mixing stochastic system of finite interacting particles on the circle ⋮ Cutoff for the mean-field zero-range process with bounded monotone rates ⋮ Random walk on sparse random digraphs ⋮ Tweakable Blockciphers with Asymptotically Optimal Security ⋮ Phase transition for the mixing time of the Glauber dynamics for coloring regular trees ⋮ CUTOFF AT THE ENTROPIC TIME FOR RANDOM WALKS ON COVERED EXPANDER GRAPHS ⋮ Large deviations for the interchange process on the interval and incompressible flows ⋮ Uniformity of the uncovered set of random walk and cutoff for lamplighter chains ⋮ Cutoff for permuted Markov chains ⋮ Cutoff for the Ising model on the lattice ⋮ Mixing time for the Ising model: a uniform lower bound for all graphs ⋮ Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher ⋮ Mixing time for the solid-on-solid model ⋮ Fast uniform generation of regular graphs ⋮ The cutoff phenomenon for Ehrenfest chains ⋮ MEXIT: maximal un-coupling times for stochastic processes ⋮ Random walks on Ramanujan complexes and digraphs ⋮ Mixing times for random \(k\)-cycles and coalescence-fragmentation chains ⋮ Optimal Co-Adapted Coupling for the Symmetric Random Walk on the Hypercube ⋮ Numerical computations of geometric ergodicity for stochastic dynamics ⋮ Mixing times of lozenge tiling and card shuffling Markov chains ⋮ Separation cutoffs for random walk on irreducible representations ⋮ Cut-off and exit from metastability: Two sides of the same coin ⋮ Cutoff at the ``entropic time for sparse Markov chains ⋮ Meeting times for independent Markov chains ⋮ A general lower bound for mixing of single-site dynamics on graphs ⋮ Path coupling without contraction ⋮ Cutoff for conjugacy-invariant random walks on the permutation group ⋮ Faithful couplings of Markov chains: Now equals forever ⋮ Optimal Coadapted Coupling for a Random Walk on the Hyper-Complete Graph ⋮ The cutoff phenomenon in total variation for nonlinear Langevin systems with small layered stable noise ⋮ Coupling of Brownian motions in Banach spaces ⋮ Mixing of the exclusion process with small bias ⋮ An affine walk on the hypercube ⋮ Coupling polynomial Stratonovich integrals: the two-dimensional Brownian case ⋮ Random sampling of colourings of sparse random graphs with a constant number of colours ⋮ Convergence rates of random walk on irreducible representations of finite groups ⋮ Merging for inhomogeneous finite Markov chains. II: Nash and log-Sobolev inequalities ⋮ Simple bounds on the convergence rate of an ergodic Markov chain ⋮ Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables ⋮ A rule of thumb for riffle shuffling ⋮ Random multiplicative walks on the residues modulo n ⋮ Sharp thresholds for Hamiltonicity in random intersection graphs ⋮ Analysis of top to bottom-\(k\) shuffles ⋮ The overhand shuffle mixes in \(\Theta(n^2\log n)\) steps ⋮ The \(L^{2}\)-cutoff for reversible Markov processes ⋮ Cutoff phenomena for random walks on random regular graphs ⋮ A unified approach to coupling SDEs driven by Lévy noise and some applications ⋮ Functions of random walks on hyperplane arrangements ⋮ Cutoff for the mean-field zero-range process ⋮ Separation cut-offs for birth and death chains ⋮ Information percolation and cutoff for the stochastic Ising model ⋮ Provable unlinkability against traffic analysis with low message overhead ⋮ Convergence rates of Markov chains for some self-assembly and non-saturated Ising models

This page was built for publication: