Cutoff for conjugacy-invariant random walks on the permutation group

DOI10.1007/s00440-018-0844-yzbMath1411.60012arXiv1410.4800OpenAlexW2964082639WikidataQ129842968 ScholiaQ129842968MaRDI QIDQ1740597

Batı Şengül, Nathanaël Berestycki

Publication date: 30 April 2019

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.4800

zbMATH Keywords

conjugacy classesrandom walkssymmetric groupmixing timescoarse Ricci curvaturerandom transpositionscoalescence and fragmentation

Mathematics Subject Classification ID

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

Related Items

Cutoff for rewiring dynamics on perfect matchings, Mixing time and expansion of non-negatively curved Markov chains, Limit profile for random transpositions, Cutoff for a one-sided transposition shuffle, Mixing times for exclusion processes on hypergraphs, Limit profiles for reversible Markov chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Emergence of giant cycles and slowdown transition in random transpositions and \(k\)-cycles
• Mixing times for random \(k\)-cycles and coalescence-fragmentation chains
• Mixing and concentration by Ricci curvature
• Ricci curvature of Markov chains on metric spaces
• Random shuffles and group representations
• The phase transition in a random hypergraph
• Rapidly mixing random walks and bounds on characters of the symmetric group
• Upper bound on the characters of the symmetric groups
• Compositions of random transpositions
• The hyperbolic geometry of random transpositions
• A phase transition in the random transposition random walk
• Contact Angles of Sessile Droplets Deposited on Rough and Flat Surfaces in the Presence of External Fields
• Recent progress in coalescent theory
• Generating a random permutation with random transpositions
• Phénomène de cutoff pour certaines marches aléatoires sur le groupe symétrique
• A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
• Probability