Mixing of fast random walks on dynamic random permutations

DOI10.1007/S00440-025-01375-8MaRDI QIDQ6850307zbMATH OpenFDO

Authors Luca Avena, Remco van der Hofstad, F. den Hollander, Oliver Nagy

Publication date 3 March 2026

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00440-025-01375-8

zbMATH Keywords

cut-offmixing timerandom permutationsrandom walkssplit-merge dynamics

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Ergodicity, mixing, rates of mixing (37A25) Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Processes in random environments (60K37) Dynamic critical phenomena in statistical mechanics (82C27)

Cites work

• A comparison principle for random walk on dynamical percolation
• A phase transition in the random transposition random walk
• A random tree model associated with random graphs
• A sharp log-Sobolev inequality for the multislice
• A threshold for cutoff in two-community random graphs
• Birth control for giants
• Components of Random Forests
• Compositions of random transpositions
• Cover time and mixing time of random walks on dynamic graphs
• Cutoff at the ``entropic time for sparse Markov chains
• Cutoff for nonbacktracking random walks on sparse random graphs
• Cutoff for random walk on dynamical Erdős-Rényi graph
• Cutoff for rewiring dynamics on perfect matchings
• Cutoff phenomena for random walks on random regular graphs
• Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
• Generating a random permutation with random transpositions
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 44107 (Why is no real title available?)
• scientific article; zbMATH DE number 7731163 (Why is no real title available?)
• Improved lower bound on thermodynamic pressure of the spin 1/2 Heisenberg ferromagnet
• Introduction to Random Graphs
• Linking the mixing times of random walks on static and dynamic random graphs
• Mixing time for random walk on supercritical dynamical percolation
• Mixing time trichotomy in regenerating dynamic digraphs
• Mixing times for random \(k\)-cycles and coalescence-fragmentation chains
• Mixing times of random walks on dynamic configuration models
• Quantum Heisenberg models and their probabilistic representations
• Random Graphs and Complex Networks
• Random graphs.
• Random walk on sparse random digraphs
• Random walks on dynamic configuration models: a trichotomy
• Random walks on dynamic graphs: mixing times, hitting times, and return probabilities
• Random walks on dynamical percolation: mixing times, mean squared displacement and hitting times
• Random walks on the random graph
• Stationary Random Partitions of Positive Integers
• Stochastic-Process Limits
• Successive minimum spanning trees
• The Dickman–Goncharov distribution
• The interchange process on high-dimensional products
• The interchange process with reversals on the complete graph
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The probability of long cycles in interchange processes

This page was built for publication: Mixing of fast random walks on dynamic random permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6850307)