Comparing with octopi
interchange processmixing timesoctopus inequalityquantum Heisenberg ferromagnetrandom walk on the symmetric groupstirring process
Random graphs (graph-theoretic aspects) (05C80) Representations of finite symmetric groups (20C30) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Sums of independent random variables; random walks (60G50) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Given a graph \(G\) on \(n\) vertices, the interchange process on \(G\) is a random walk on \(S_n\) which chooses a random edge \((i,j)\) of \(G\) at each step and applies the transposition \((i,j)\) to the permutation in \(S_n\). The walk can either be discrete (with a probability of \(1/2\) of staying in place to avoid single steps always switching parity) or continuous (take steps according to a Poisson process). These graphs are of interest in interacting particle systems and quantum mechanics. The authors use the octopus inequality [\textit{P. Caputo} et al., J. Am. Math. Soc. 23, No. 3, 831--851 (2010; Zbl 1203.60145)] to prove bounds on the mixing behavior for general graphs \(G\), including a comparison to the mixing time for the complete graph \(K_n\). They also use representation theory of the symmetric group to bound the probability that the random walk reaches a large cycle in \(S_n\), and a related result for the quantum Heisenberg ferromagnet.
- A few remarks on the octopus inequality and Aldous' spectral gap conjecture
- Comparison techniques for random walk on finite groups
- Cycle structure of the interchange process and representation theory
- Diffusion of color in the simple exclusion process
- Evolving sets, mixing and heat kernel bounds
- Existence of a phase transition of the interchange process on the Hamming graph
- Generating a random permutation with random transpositions
- scientific article; zbMATH DE number 3123409 (Why is no real title available?)
- scientific article; zbMATH DE number 3771876 (Why is no real title available?)
- scientific article; zbMATH DE number 1195779 (Why is no real title available?)
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Improved lower bound on thermodynamic pressure of the spin 1/2 Heisenberg ferromagnet
- Interlacings for random walks on weighted graphs and the interchange process
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
- Mixing times for the interchange process
- Mixing times of lozenge tiling and card shuffling Markov chains
- Proof of Aldous' spectral gap conjecture
- Rate of convergence for shuffling cards by transpositions
- The exclusion process mixes (almost) faster than independent particles
- The mixing time for simple exclusion
- The moving particle lemma for the exclusion process on a weighted graph
- The probability of long cycles in interchange processes
- Validity of the spin-wave approximation for the free energy of the Heisenberg ferromagnet
- Phase transition for the interchange and quantum Heisenberg models on the Hamming graph
- The full spectrum of random walks on complete finite \(d\)-ary trees
- A sharp log-Sobolev inequality for the multislice
- The mean-field quantum Heisenberg ferromagnet via representation theory
- Coalescing and branching simple symmetric exclusion process
- The interchange process on high-dimensional products
- A version of Aldous' spectral-gap conjecture for the zero range process
- Cycle structure of the interchange process and representation theory
- Universality of cutoff for exclusion with reservoirs
- Sensitivity of mixing times of Cayley graphs
- Transition of the simple random walk on the ice model graph
- On the Aldous-Caputo spectral gap conjecture for hypergraphs
- Entropy and curvature: beyond the Peres-Tetali conjecture
This page was built for publication: Comparing with octopi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028952)