• Corpus ID: 219179745

Coalescing and branching simple symmetric exclusion process

@article{Hartarsky2020CoalescingAB,
  title={Coalescing and branching simple symmetric exclusion process},
  author={Ivailo Hartarsky and Fabio Martinelli and Cristina Toninelli},
  journal={arXiv: Probability},
  year={2020}
}
Motivated by kinetically constrained interacting particle systems (KCM), we consider a reversible coalescing and branching simple exclusion process on a general finite graph $G=(V,E)$ dual to the biased voter model on $G$. Our main goal are tight bounds on its logarithmic Sobolev constant and relaxation time, with particular focus on the delicate slightly supercritical regime in which the equilibrium density of particles tends to zero as $|V|\rightarrow \infty$. Our results allow us to recover… 
Sharp threshold for the FA-2f kinetically constrained model
TLDR
This is the first sharp result for a critical KCM and it compares with Holroyd's 2003 result on bootstrap percolation and its subsequent improvements, and settles various controversies accumulated in the physics literature over the last four decades.
A Note on the Spectral Gap of the Fredrickson–Andersen One Spin Facilitated Model
  • A. Shapira
  • Mathematics
    Journal of statistical physics
  • 2020
TLDR
The purpose of this paper is to present new upper bounds that have the same asymptotics as the known lower bounds of the Fredrickson–Andersen one spin facilitated model on finite graphs.
Fredrickson--Andersen model in two dimensions
. The present expository article overviews recent mathematical advances on the Fredrickson– Andersen kinetically constrained spin model in two dimensions. It was introduced in physics as a toy model
Bisection for kinetically constrained models revisited
The bisection method for kinetically constrained models (KCM) of Cancrini, Martinelli, Roberto and Toninelli is a vital technique applied also beyond KCM. In this note we present a new way of
Refined universality for critical KCM: upper bounds
We study a general class of interacting particle systems called kinetically constrained models (KCM) in two dimensions tightly linked to the monotone cellular automata called bootstrap percolation.

References

SHOWING 1-10 OF 48 REFERENCES
Mixing times for a constrained Ising process on the torus at low density
We study a kinetically constrained Ising process (KCIP) associated with a graph G and density parameter p; this process is an interacting particle system with state space $\{0,1\}^{G}$. The
Mixing times for a constrained Ising process on the two-dimensional torus at low density
  • N. Pillai, Aaron Smith
  • Mathematics
    Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
  • 2019
We study a kinetically constrained Ising process (KCIP) associated with a graph $G$ and density parameter $p$; this process is an interacting particle system with state space $\{ 0, 1 \}^{G}$, the
The Williams Bjerknes Model on Regular Trees
TLDR
It is shown that there exists a threshold $\ lambda_c \in (1, \infty)$ such that if $\lambda > \lambda_c$ then in the above setting with positive probability all vertices will become eventually infected forever, while if $\ lambda < \lambda-c$ all vertice will becomeEventually healthy with probability 1.
Kinetically constrained spin models
We analyze the density and size dependence of the relaxation time for kinetically constrained spin models (KCSM) intensively studied in the physics literature as simple models sharing some of the
Random walks on graphs: new bounds on hitting, meeting, coalescing and returning
TLDR
A discrete-time version of the first-named author's ``Meeting time lemma"~ that bounds the probability of random walk hitting a deterministic trajectory in terms of hitting times of static vertices and bound the expected full coalescence time of multiple random walks over a graph.
Facilitated spin models: recent and new results
Facilitated or kinetically constrained spin models (KCSM) are a class of interacting particle systems reversible w.r.t. to a simple product measure. Each dynamical variable (spin) is re-sampled from
A characterization of $L_{2}$ mixing and hypercontractivity via hitting times and maximal inequalities
There are several works characterizing the total-variation mixing time of a reversible Markov chain in term of natural probabilistic concepts such as stopping times and hitting times. In contrast,
A characterization of $$L_{2}$$L2 mixing and hypercontractivity via hitting times and maximal inequalities
There are several works characterizing the total-variation mixing time of a reversible Markov chain in term of natural probabilistic concepts such as stopping times and hitting times. In contrast,
On coalescence time in graphs-When is coalescing as fast as meeting?
TLDR
It is proved that for any graph the coalescence time is bounded by O(n^3) (which is tight for the Barbell graph); surprisingly even such a basic question about the coalescing time was not answered before this work.
FREDRICKSON-ANDERSEN ONE SPIN FACILITATED MODEL OUT OF EQUILIBRIUM
We consider the Fredrickson and Andersen one spin facilitated model (FA1f) on an infinite connected graph with polynomial growth. Each site with rate one refreshes its occupation variable to a filled
...
1
2
3
4
5
...