The probability of long cycles in interchange processes
From MaRDI portal
Abstract: We examine the number of cycles of length k in a permutation, as a function on the symmetric group. We write it explicitly as a combination of characters of irreducible representations. This allows to study formation of long cycles in the interchange process, including a precise formula for the probability that the permutation is one long cycle at a given time t, and estimates for the cases of shorter cycles.
Recommendations
- Cycle structure of the interchange process and representation theory
- Permutations without long or short cycles
- Long cycle of random permutations with polynomially growing cycle weights
- Local probabilities for random permutations without long cycles
- Asymptotic estimates for the number of permutations without short cycles
Cites work
- scientific article; zbMATH DE number 1601795 (Why is no real title available?)
- scientific article; zbMATH DE number 3771876 (Why is no real title available?)
- scientific article; zbMATH DE number 51906 (Why is no real title available?)
- scientific article; zbMATH DE number 2046051 (Why is no real title available?)
- A shuffle that mixes sets of any fixed size much faster than it mixes the whole deck
- Compositions of random transpositions
- Emergence of giant cycles and slowdown transition in random transpositions and \(k\)-cycles
- Estimating the expected reversal distance after a fixed number of reversals
- Explicit expanders with cutoff phenomena
- Generating a random permutation with random transpositions
- Improved lower bound on thermodynamic pressure of the spin 1/2 Heisenberg ferromagnet
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Minimal eigenvalue of the Coxeter Laplacian for the symmetric group
- Mixing times of lozenge tiling and card shuffling Markov chains
- Ordering the representations of \(S_n\) using the interchange process
- Proof of Aldous' spectral gap conjecture
- Sharp phase transition in the random stirring model on trees
- The mixing time for simple exclusion
Cited in
(20)- Strongly correlated random interacting processes. Abstracts from the workshop held January 28 -- February 3, 2018
- Heisenberg models and Schur-Weyl duality
- Phase transition for the interchange and quantum Heisenberg models on the Hamming graph
- Critical parameter of random loop model on trees
- Quantum spins and random loops on the complete graph
- Many-body quantum systems. Abstracts from the workshop held September 10--15, 2023
- Coxeter factorizations and the matrix tree theorem with generalized Jucys-Murphy weights
- Comparing with octopi
- The mean-field quantum Heisenberg ferromagnet via representation theory
- On the diameters of friends-and-strangers graphs
- Limit distributions for Euclidean random permutations
- Sharp phase transition in the random stirring model on trees
- Random loop representations for quantum spin systems
- Large deviations for the interchange process on the interval and incompressible flows
- The interchange process on high-dimensional products
- Permutation statistics of products of random permutations
- Cycle structure of the interchange process and representation theory
- The free energy in a class of quantum spin systems and interchange processes
- Coxeter factorizations with generalized Jucys–Murphy weights and Matrix‐Tree theorems for reflection groups
- Shuffling cards by spatial motion
This page was built for publication: The probability of long cycles in interchange processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354032)
