Random shuffles and group representations
From MaRDI portal
Publication:1058225
DOI10.1214/aop/1176993073zbMath0564.60007WikidataQ101004836 ScholiaQ101004836MaRDI QIDQ1058225
Leopold Flatto, Andrew M. Odlyzko, David B. Wales
Publication date: 1985
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1176993073
60G50: Sums of independent random variables; random walks
20C15: Ordinary representations and characters
20C20: Modular representations and characters
60B15: Probability measures on groups or semigroups, Fourier transforms, factorization
Related Items
Total variation cutoff for the flip-transpose top with random shuffle, Cutoff phenomenon for the warp-transpose top with random shuffle, The random \(k\) cycle walk on the symmetric group, Spectrum of Cayley graphs on the symmetric group generated by transpositions, Character-theoretic techniques for near-central enumerative problems, The distance spectra of Cayley graphs of Coxeter groups, The small world effect on the coalescing time of random walks, 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, Tests of randomness by the gambler's ruin algorithm, Intermediate range migration in the two-dimensional stepping stone model, On the Betti numbers of chessboard complexes, Decomposition of the conjugacy representation of the symmetric groups, Rate of convergence for shuffling cards by transpositions, A recursive rule for Kazhdan-Lusztig characters, Expansion properties of Cayley graphs of the alternating groups, Kazhdan constants for conjugacy classes of compact groups., Likelihood orders for the \(p\)-cycle walks on the symmetric group, Cutoff for conjugacy-invariant random walks on the permutation group, Efficiency test of pseudorandom number generators using random walks, An introduction to covering problems for random walks on graphs, Random walks on a finite graph with congestion points, The stepping stone model: New formulas expose old myths, The Poisson-Dirichlet law is the unique invariant distribution for uniform split-merge transfor\-mations., Sparse topologies with small spectrum size, Fourier transform over semi-simple algebras and harmonic analysis for probabilistic algorithms, Time inhomogeneous Markov chains with wave-like behavior, The second eigenvalue of some normal Cayley graphs of highly transitive groups, The full spectrum of random walks on complete finite \(d\)-ary trees, Signal processing on the permutahedron: tight spectral frames for ranked data analysis, Eigenvalues of Cayley graphs, Sorting by shuffling methods and a queue, Total variation cutoff for the transpose top-2 with random shuffle, \(PI\)-eigenfunctions of the Star graphs, On the spectral gap of some Cayley graphs on the Weyl group \(W(B_n)\), The second largest eigenvalues of some Cayley graphs on alternating groups, Mixing times for exclusion processes on hypergraphs, The spectral gap of graphs arising from substring reversals, Convergence of some time inhomogeneous Markov chains via spectral techniques, Modified logarithmic Sobolev inequalities for some models of random walk, Aldous' spectral gap property for normal Cayley graphs on symmetric groups, A Few Remarks on the Octopus Inequality and Aldous’ Spectral Gap Conjecture, Proof of Aldous’ spectral gap conjecture, Self-intersections of random walks on discrete groups, Hitting times for random walks on vertex-transitive graphs