Mixing of the averaging process and its discrete dual on finite-dimensional geometries

DOI10.1214/22-AAP1838zbMATH Open1521.60018arXiv2106.09552OpenAlexW4285787687MaRDI QIDQ6103993FDOQ6103993

Authors: Matteo Quattropani, Federico Sau 

Publication date: 5 June 2023

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: We analyze the $L^1$-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 $k$ the number of particles and $n$ the (growing) size of the underlying graph, the system exhibits cutoff in total variation if $koinfty$ and $k=O(n^2)$. 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.

Full work available at URL: https://arxiv.org/abs/2106.09552

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

zbMATH Keywords

mixing timesNash inequalityaveraging processdualities and intertwinings

Mathematics Subject Classification ID

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)

Cites Work

• Finite exchangeable sequences
• Shuffling Cards and Stopping Times
• Upper bounds for symmetric Markov transition functions
• A new proof of Moser's parabolic Harnack inequality using the old ideas of Nash
• Continuity of Solutions of Parabolic and Elliptic Equations
• Title not available (Why is that?)
• Gradient flows of the entropy for finite Markov chains
• Duality and hidden symmetries in interacting particle systems
• Title not available (Why is that?)
• Glauber dynamics for the mean-field Ising model: cut-off, critical power law, and metastability
• Mixing times of lozenge tiling and card shuffling Markov chains
• Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
• Cutoff phenomenon for the simple exclusion process on the complete graph
• Estimation of spectral gap for elliptic operators
• Opinion exchange dynamics
• Mixing times for the interchange process
• Mathematical methods for hydrodynamic limits
• Nash inequalities for finite Markov chains
• Equations différentielles provenant de la genetique des populations
• Mixing time of the adjacent walk on the simplex
• Interacting particle systems as stochastic social dynamics
• Ultracontractivity and Nash type inequalities
• Isoperimetry and heat kernel decay on percolation clusters.
• Proof of Aldous' spectral gap conjecture
• Moderate growth and random walk on finite groups
• A lecture on the averaging process
• On the spectral gap of the Kac walk and other binary collision processes
• Transition probabilities for the simple random walk on the Sierpinski graph
• Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
• Mixing times for the simple exclusion process in ballistic random environment
• Mixing time and cutoff for the weakly asymmetric simple exclusion process
• Title not available (Why is that?)
• Spectral gap for measure-valued diffusion processes
• A Gibbs sampler on the \(n\)-simplex
• Cutoff for General Spin Systems with Arbitrary Boundary Conditions
• Generalized immediate exchange models and their symmetries
• Cutoff for the mean-field zero-range process with bounded monotone rates
• Hydrodynamic limits and propagation of chaos for interacting random walks in domains
• Random Walks and Heat Kernels on Graphs
• On the mixing time of Kac's walk and other high-dimensional Gibbs samplers with constraints
• Cutoff for lamplighter chains on fractals
• Factorized duality, stationary product measures and generating functions
• The Λ-Fleming-Viot Process and a Connection with Wright-Fisher Diffusion
• A version of Aldous' spectral-gap conjecture for the zero range process
• Rates of convergence to equilibrium for potlatch and smoothing processes
• Cutoff for the mean-field zero-range process
• On the Markovian Similarity
• A phase transition for repeated averages
• Cutoff profile of ASEP on a segment
• Spectral gap and cutoff phenomenon for the Gibbs sampler of \(\nabla \varphi\) interfaces with convex potential
• Analysis of convergence rates of some Gibbs samplers on continuous state spaces

Cited In (6)

• 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
• 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)