Mixing of the averaging process and its discrete dual on finite-dimensional geometries
From MaRDI portal
Publication:6103993
DOI10.1214/22-AAP1838zbMATH Open1521.60018OpenAlexW4285787687MaRDI QIDQ6103993FDOQ6103993
Ergodicity, mixing, rates of mixing (37A25) Continuous-time Markov processes on general state spaces (60J25) Continuous-time Markov processes on discrete state spaces (60J27) Interacting particle systems in time-dependent statistical mechanics (82C22) Exchangeability for stochastic processes (60G09)
Abstract: We analyze the -mixing of a generalization of the Averaging process introduced by Aldous. The process takes place on a growing sequence of graphs which we assume to be finite-dimensional, in the sense that the random walk on those geometries satisfies a family of Nash inequalities. As a byproduct of our analysis, we provide a complete picture of the total variation mixing of a discrete dual of the Averaging process, which we call Binomial Splitting process. A single particle of this process is essentially the random walk on the underlying graph. When several particles evolve together, they interact by synchronizing their jumps when placed on neighboring sites. We show that, given the number of particles and the (growing) size of the underlying graph, the system exhibits cutoff in total variation if and . Finally, we exploit the duality between the two processes to show that the Binomial Splitting satisfies a version of Aldous' spectral gap identity, namely, the relaxation time of the process is independent of the number of particles.
Recommendations
- The power of averaging at two consecutive time steps: proof of a mixing conjecture by Aldous and Fill
- Cutoff for the mean-field zero-range process
- The mixing time for simple exclusion
- Cutoff phenomenon for the simple exclusion process on the complete graph
- Cutoff for the mean-field zero-range process with bounded monotone rates
Cites Work
- scientific article; zbMATH DE number 3896009 (Why is no real title available?)
- scientific article; zbMATH DE number 1069282 (Why is no real title available?)
- A Gibbs sampler on the \(n\)-simplex
- A lecture on the averaging process
- A new proof of Moser's parabolic Harnack inequality using the old ideas of Nash
- A phase transition for repeated averages
- A version of Aldous' spectral-gap conjecture for the zero range process
- Analysis of convergence rates of some Gibbs samplers on continuous state spaces
- Continuity of Solutions of Parabolic and Elliptic Equations
- Cutoff for general spin systems with arbitrary boundary conditions
- Cutoff for lamplighter chains on fractals
- Cutoff for the mean-field zero-range process
- Cutoff for the mean-field zero-range process with bounded monotone rates
- Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
- Cutoff phenomenon for the simple exclusion process on the complete graph
- Cutoff profile of ASEP on a segment
- Duality and hidden symmetries in interacting particle systems
- Equations différentielles provenant de la genetique des populations
- Estimation of spectral gap for elliptic operators
- Factorized duality, stationary product measures and generating functions
- Finite exchangeable sequences
- Generalized immediate exchange models and their symmetries
- Glauber dynamics for the mean-field Ising model: cut-off, critical power law, and metastability
- Gradient flows of the entropy for finite Markov chains
- Hydrodynamic limits and propagation of chaos for interacting random walks in domains
- Interacting particle systems as stochastic social dynamics
- Isoperimetry and heat kernel decay on percolation clusters.
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Mathematical methods for hydrodynamic limits
- Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
- Mixing time and cutoff for the weakly asymmetric simple exclusion process
- Mixing time of the adjacent walk on the simplex
- Mixing times for the interchange process
- Mixing times for the simple exclusion process in ballistic random environment
- Mixing times of lozenge tiling and card shuffling Markov chains
- Moderate growth and random walk on finite groups
- Nash inequalities for finite Markov chains
- On the Markovian similarity
- On the mixing time of Kac's walk and other high-dimensional Gibbs samplers with constraints
- On the spectral gap of the Kac walk and other binary collision processes
- Opinion exchange dynamics
- Proof of Aldous' spectral gap conjecture
- Random walks and heat kernels on graphs
- Rates of convergence to equilibrium for potlatch and smoothing processes
- Shuffling Cards and Stopping Times
- Spectral gap and cutoff phenomenon for the Gibbs sampler of \(\nabla \varphi\) interfaces with convex potential
- Spectral gap for measure-valued diffusion processes
- The \(\lambda\)-Fleming-Viot process and a connection with Wright-Fisher diffusion
- Transition probabilities for the simple random walk on the Sierpinski graph
- Ultracontractivity and Nash type inequalities
- Upper bounds for symmetric Markov transition functions
Cited In (7)
- Averages of unitary representations and weak mixing of random walks
- Cutoff for the averaging process on the hypercube and complete bipartite graphs
- Concentration and local smoothness of the averaging process
- The power of averaging at two consecutive time steps: proof of a mixing conjecture by Aldous and Fill
- Repeated averages on graphs
- Hidden temperature in the KMP model
- Large scale stochastic dynamics. Abstracts from the workshop held September 11--17, 2022
This page was built for publication: Mixing of the averaging process and its discrete dual on finite-dimensional geometries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103993)
