The interchange process with reversals on the complete graph
From MaRDI portal
Publication:2279301
Abstract: We consider an extension of the interchange process on the complete graph, in which a fraction of the transpositions are replaced by `reversals'. The model is motivated by statistical physics, where it plays a role in stochastic representations of -models. We prove convergence to PD() of the rescaled cycle sizes, above the critical point for the appearance of macroscopic cycles. This extends a result of Schramm on convergence to PD(1) for the usual interchange process.
Recommendations
- On interchange graphs
- On \(f\)-reversible processes on graphs
- scientific article; zbMATH DE number 1560890
- Some properties of a class of interchange graphs
- Some properties for a class of interchange graphs
- Existence of a phase transition of the interchange process on the Hamming graph
- A computational study of \(f\)-reversible processes on graphs
- Interchanging graphs associated with sorting by transpositions
- Reversible iterative graph processes
- The evolution of the random reversal graph
Cites work
- Compositions of random transpositions
- Critical parameter of random loop model on trees
- Critical point for infinite cycles in a random loop model on trees
- Critical temperature of Heisenberg models on regular trees, via random loops
- Existence of a phase transition of the interchange process on the Hamming graph
- Geometric aspects of quantum spin states
- scientific article; zbMATH DE number 3776540 (Why is no real title available?)
- scientific article; zbMATH DE number 2046051 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- Improved lower bound on thermodynamic pressure of the spin 1/2 Heisenberg ferromagnet
- Infinite cycles in the random stirring model on trees
- Loop correlations in random wire models
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Phase transition for loop representations of quantum spin systems on trees
- Phase transition for the interchange and quantum Heisenberg models on the Hamming graph
- Poisson–Dirichlet and GEM Invariant Distributions for Split-and-Merge Transformations of an Interval Partition
- Quantum Heisenberg models and their probabilistic representations
- Quantum spins and random loops on the complete graph
- Random loop representations for quantum spin systems
- Sharp phase transition in the random stirring model on trees
- Stationary Random Partitions of Positive Integers
- The random interchange process on the hypercube
Cited in
(12)- Phase transition for the interchange and quantum Heisenberg models on the Hamming graph
- Sharp phase transition for random loop models on trees
- Characterising random partitions by random colouring
- Split-and-merge in stationary random stirring on lattice torus
- The interchange process on high-dimensional products
- Loop correlations in random wire models
- Existence of a phase transition of the interchange process on the Hamming graph
- Critical parameters for loop and Bernoulli percolation
- Cutoff for rewiring dynamics on perfect matchings
- Mixing of fast random walks on dynamic random permutations
- Directed spatial permutations on asymmetric tori
- Loop percolation versus link percolation in the random loop model
This page was built for publication: The interchange process with reversals on the complete graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279301)
