Comparison techniques for random walk on finite groups
DOI10.1214/AOP/1176989013zbMATH Open0790.60011OpenAlexW2065163799MaRDI QIDQ1317235FDOQ1317235
Laurent Saloff-Coste, Persi Diaconis
Publication date: 20 June 1994
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1176989013
eigenvaluescard shufflingsymmetric groupreversible Markov chainsconvergence of a symmetric random walk
Discrete-time Markov processes on general state spaces (60J05) Limit theorems in probability theory (60F99) Symmetric groups (20B30) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)
Cited In (90)
- Supercharacter formulas for pattern groups
- Trivial points on towers of curves
- Convergence of random walks on the circle generated by an irrational rotation
- Cutoff for random to random card shuffle
- Mixing time of critical Ising model on trees is polynomial in the height
- Cutoff for General Spin Systems with Arbitrary Boundary Conditions
- On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \)
- A non-local random walk on the hypercube
- Geometric analysis for the Metropolis algorithm on Lipschitz domains
- Analytic-geometric methods for finite Markov chains with applications to quasi-stationarity
- Superinduction for pattern groups.
- On random random walks
- Analysis of top to bottom-\(k\) shuffles
- On the diameter of permutation groups.
- Uniform mixing time for random walk on lamplighter graphs
- Divisibility and laws in finite simple groups.
- Short laws for finite groups and residual finiteness growth
- Consistent estimation of the spectrum of trace class data augmentation algorithms
- Super-character theory and comparison arguments for a random walk on the upper triangular matrices
- The random \(k\) cycle walk on the symmetric group
- Convergence of some time inhomogeneous Markov chains via spectral techniques
- Generating random elements of a finite group
- Comparing with octopi
- Mixing times of lozenge tiling and card shuffling Markov chains
- Markov chain decomposition for convergence rate analysis
- Mixing time of the card-cyclic-to-random shuffle
- Card shuffling and Diophantine approximation
- Growth in groups: ideas and perspectives
- The nearest neighbor random walk on subspaces of a vector space and rate of convergence
- Nash inequalities for finite Markov chains
- Convergence properties of the Gibbs sampler for perturbations of Gaussians
- Random generators of the symmetric group: diameter, mixing time and spectral gap.
- Title not available (Why is that?)
- Nilprogressions and groups with moderate growth
- Comparison theory for Markov chains on different state spaces and application to random walk on derangements
- A super-class walk on upper-triangular matrices
- Spectral computations for birth and death chains
- Cutoff for the Ising model on the lattice
- Rate of convergence for shuffling cards by transpositions
- Stein’s method and Plancherel measure of the symmetric group
- Time to reach stationarity in the Bernoulli-Laplace diffusion model with many urns
- Tensor product Markov chains
- Expander graphs, gonality, and variation of Galois representations
- Walks on generating sets of Abelian groups
- Crested products of Markov chains
- Separation cut-offs for birth and death chains
- The product replacement prospector.
- On transience of card shuffling
- Logarithmic Sobolev inequalities for finite Markov chains
- Some things we've learned (about Markov chain Monte Carlo)
- A comparison theorem on convergence rates of random walks on groups
- A sharp log-Sobolev inequality for the multislice
- The mean-field quantum Heisenberg ferromagnet via representation theory
- Information percolation and cutoff for the stochastic Ising model
- Characters and random walks on finite classical groups
- Analyzing Glauber dynamics by comparison of Markov chains
- Modified logarithmic Sobolev inequalities for some models of random walk
- A sharp diameter bound for unipotent groups of classical type over ℤ/pℤ
- Mixing time of fractional random walk on finite fields
- Hypercontractivity and logarithmic Sobolev inequality for non-primitive quantum Markov semigroups and estimation of decoherence rates
- Condensation of a self-attracting random walk
- On the local-global conjecture for integral Apollonian gaskets. With an appendix by Péter P. Varjú
- FIXED POINT RATIOS IN EXCEPTIONAL GROUPS OF RANK AT MOST TWO
- Aldous’s spectral gap conjecture for normal sets
- A phase transition for repeated averages
- Mixing of permutations by biased transpositions
- Generating a random signed permutation with random reversals
- Analysis of convergence rates of some Gibbs samplers on continuous state spaces
- Navigating directed Cayley graphs of small diameter: A potent Solovay–Kitaev procedure
- Regularized modified log-Sobolev inequalities and comparison of Markov chains
- Title not available (Why is that?)
- On the spectral gap and the diameter of Cayley graphs
- The hit-and-run version of top-to-random
- Eigenvalues of symmetrized shuffling operators
- Fast algorithms at low temperatures via Markov chains†
- Mixing times of Markov chains for self‐organizing lists and biased permutations
- Network cohesion
- Repeated averages on graphs
- No cutoff for circulants: an elementary proof
- Total variation cutoff for the flip-transpose top with random shuffle
- Shuffling cards by spatial motion
- Asymptotic behaviors of random walks on countable groups
- Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations
- Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs
- Discrete quantum walks on the symmetric group
- SPEck: mining statistically-significant sequential patterns efficiently with exact sampling
- An averaging process on hypergraphs
- Efficient unitary designs with a system-size independent number of non-Clifford gates
- Spatio-temporal dynamics of random transmission events: from information sharing to epidemic spread
- Comparing limit profiles of reversible Markov chains
This page was built for publication: Comparison techniques for random walk on finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317235)