Generating a random permutation with random transpositions
DOI10.1007/BF00535487zbMATH Open0485.60006WikidataQ97613636 ScholiaQ97613636MaRDI QIDQ3945280FDOQ3945280
Authors: Persi Diaconis, Mehrdad Shahshahani
Publication date: 1981
Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stochastic matrices (15B51) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The representation theory of the symmetric groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some Characters of the Symmetric Group
- Title not available (Why is that?)
- A maximal coupling for Markov chains
- The bias of three pseudo-random shuffles
- Title not available (Why is that?)
- Speed of convergence of the n-fold convolution of a probability measure on a compact group
- A local limit theorem for the convolution of probability measures on a compact connected group
Cited In (only showing first 100 items - show all)
- On the partitions associated with the smallest eigenvalues of certain Cayley graphs on symmetric group generated by cycles
- Random surfaces with boundary
- Mixing properties of stochastic quantum Hamiltonians
- The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations
- An Erdős-Ko-Rado theorem for the group \(\mathrm{PSU}(3, q)\)
- Upper bound on the characters of the symmetric groups for balanced Young diagrams and a generalized Frobenius formula.
- Cut-off phenomenon for random walks on free orthogonal quantum groups
- Diaconis-Shahshahani upper bound lemma for finite quantum groups
- Precise estimates on the rate at which certain diffusions tend to equilibrium
- Martingales and character ratios
- Exact solution for a class of random walk on the hypercube
- Tensor powers of the defining representation of \(S_n\)
- Random doubly stochastic tridiagonal matrices
- Analysis of top to bottom-\(k\) shuffles
- The topology and geometry of random square-tiled surfaces
- Total variation cutoff in birth-and-death chains
- A stability result for balanced dictatorships in \(S_n\)
- Cutoff at the ``entropic time for sparse Markov chains
- The eigenvalues of the graphs \(D(4,q)\)
- The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
- Cutoff for general spin systems with arbitrary boundary conditions
- Faster random generation of linear extensions
- Comparing mixing times on sparse random graphs
- Largest independent sets of certain regular subgraphs of the derangement graph
- Hecke graphs, Ramanujan graphs and generalized duality transformations for lattice spin systems
- Mixing time of the card-cyclic-to-random shuffle
- Quantum reflections, random walks and cut-off
- Markov chains, \(\mathcal{R}\)-trivial monoids and representation theory
- Card shuffling and a transformation on \(S_ n\)
- Character ratios for finite groups of Lie type, and applications
- On a surface formed by randomly gluing together polygonal discs
- Mixing and concentration by Ricci curvature
- The smallest eigenvalues of the 1-point fixing graph
- Stability for intersecting families in \(\mathrm{PGL}(2,q)\)
- The spectrum and convergence rates of exclusion and interchange processes on the complete graph
- Erdős-Ko-Rado theorem for irreducible imprimitive reflection groups
- Rate of convergence for shuffling cards by transpositions
- A new large \(N\) phase transition in \(\text{YM}_2\)
- A general lower bound for mixing of single-site dynamics on graphs
- Reversal and transposition medians
- On the random Young diagrams and their cores
- LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY
- Random walks on finite quantum groups
- Cayley graph on symmetric group generated by elements fixing \(k\) points
- Mixing and covering in the symmetric groups
- On the eigenvalues of certain Cayley graphs and arrangement graphs
- Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph
- Forbidding just one intersection, for permutations
- Comment on ``Random quantum circuits are approximate 2-designs by A.W. Harrow and R.A. Low (Commun. Math. Phys. 291, 257-302 (2009))
- Characters and random walks on finite classical groups
- Integral Cayley graphs
- Limit profile for random transpositions
- Poisson-Dirichlet distribution for random Belyi surfaces
- On the spectrum of finite Cayley graphs
- A quasi-stability result for dictatorships in \(S_n\)
- Random walks and orthogonal functions associated with highly symmetric graphs
- Approximation by juntas in the symmetric group, and forbidden intersection problems
- A spectral radius formula for the Fourier transform on compact groups and applications to random walks
- Character levels and character bounds
- Ergodic properties of folding maps on spheres
- Conjugacy classes, growth and complexity
- Stein's method and random character ratios
- Another conversation with Persi Diaconis
- Analysis of casino shelf shuffling machines
- Integral Cayley multigraphs over abelian and Hamiltonian groups
- Cutoff phenomenon for random walks on Kneser graphs
- The closure of a random braid is a hyperbolic link
- Groups all of whose undirected Cayley graphs are integral
- Random walks and approximate integration on compact homogeneous spaces
- On finite groups all of whose cubic Cayley graphs are integral
- On the spectrum of Cayley graphs related to the finite groups
- Compositions of random transpositions
- On a likely shape of the random Ferrers diagram
- Uniformity of the uncovered set of random walk and cutoff for lamplighter chains
- Recurrence and Transience for a Card Shuffling Model
- Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
- Cutoff for the East process
- Convergence rates of random walk on irreducible representations of finite groups
- On the eigenvalues of Cayley graphs on the symmetric group generated by a complete multipartite set of transpositions
- Mixing times for random \(k\)-cycles and coalescence-fragmentation chains
- The random \(k\) cycle walk on the symmetric group
- Spectra of Cayley graphs of complex reflection groups
- A strong uniform time for random transpositions
- Strong uniform times and finite random walks
- A Markov chain on the symmetric group and Jack symmetric functions
- Convergence of some time inhomogeneous Markov chains via spectral techniques
- Mixing time and cutoff for the weakly asymmetric simple exclusion process
- An Erdős-Ko-Rado theorem for finite 2-transitive groups
- Efficient Computation of the Fourier Transform on Finite Groups
- The Erdős-Ko-Rado property for some 2-transitive groups
- Modified logarithmic Sobolev inequalities in discrete settings
- On the dynamical behavior of the ABC model
- Prescribed absolute values, character sums and spectrum integrality.
- Stein's method, Jack measure, and the Metropolis algorithm
- Concentration of Haar measures, with an application to random matrices
- Mixing times of lozenge tiling and card shuffling Markov chains
- Characters of symmetric groups: sharp bounds and applications.
- Spectral analysis of finite Markov chains with spherical symmetries
- Words and mixing times in finite simple groups.
- Finite Gel'fand pairs and their applications to probability and statistics
This page was built for publication: Generating a random permutation with random transpositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3945280)