Cutoff for the averaging process on the hypercube and complete bipartite graphs

DOI10.1214/23-EJP993MaRDI QIDQ6137375zbMATH OpenFDO

Authors Pietro Caputo, Matteo Quattropani, Federico Sau

Publication date 1 September 2023

Published in Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2212.08870, https://projecteuclid.org/journals/electronic-journal-of-probability/volume-28/issue-none/Cutoff-for-the-averaging-process-on-the-hypercube-and-complete/10.1214/23-EJP993.full

zbMATH Keywords

cutoff phenomenonaveraging processmixing of Markov chains

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Continuous-time Markov processes on discrete state spaces (60J27)

Abstract: We consider the averaging process on a graph, that is the evolution of a mass distribution undergoing repeated averages along the edges of the graph at the arrival times of independent Poisson processes. We establish cutoff phenomena for both the $L^1$ and $L^2$ distance from stationarity when the graph is a discrete hypercube and when the graph is complete bipartite. Some general facts about the averaging process on arbitrary graphs are also discussed.

Recommendations

• Repeated averages on graphs
• Mixing of the averaging process and its discrete dual on finite-dimensional geometries
• Concentration and local smoothness of the averaging process
• Cutoff phenomenon for the simple exclusion process on the complete graph
• Cutoff for a stratified random walk on the hypercube

Cites work

• scientific article; zbMATH DE number 1358323 (Why is no real title available?)
• A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities
• A lecture on the averaging process
• A normal approximation for beta and gamma tail probabilities
• A phase transition for repeated averages
• A sharp continuity estimate for the von Neumann entropy
• Block factorization of the relative entropy via spatial mixing
• Computing cutoff times of birth and death chains
• Cutoff for general spin systems with arbitrary boundary conditions
• Ehrenfest urn models
• Identifying Coefficients in the Spectral Representation for First Passage Time Distributions
• Interacting particle systems. With a new postface.
• Logarithmic Sobolev inequalities for finite Markov chains
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Mixing of the averaging process and its discrete dual on finite-dimensional geometries
• Modified logarithmic Sobolev inequalities in discrete settings
• On the mixing time and spectral gap for birth and death chains
• Separation cut-offs for birth and death chains
• The Rotation of Eigenvectors by a Perturbation. III
• The logarithmic Sobolev constant of Kawasaki dynamics under a mixing condition revisited
• Total variation cutoff in birth-and-death chains

Cited in

(5)

• Concentration and local smoothness of the averaging process
• Repeated averages on graphs
• Rates of convergence for Gibbs sampling in the analysis of almost exchangeable data
• Hidden temperature in the KMP model
• An averaging process on hypergraphs

This page was built for publication: Cutoff for the averaging process on the hypercube and complete bipartite graphs

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