Bisection for kinetically constrained models revisited

@article{Hartarsky2021BisectionFK,
  title={Bisection for kinetically constrained models revisited},
  author={Ivailo Hartarsky},
  journal={Electronic Communications in Probability},
  year={2021}
}
  • Ivailo Hartarsky
  • Published 1 January 2021
  • Mathematics
  • Electronic Communications in Probability
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 performing it, based on a novel two-block dynamics with a probabilistic proof instead of the original spectral one. We illustrate the method by very directly proving an upper bound on the relaxation time of KCM like the one for the East model in a strikingly general setting. Namely, we treat KCM on finite… 
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 25 REFERENCES
Interacting particle systems with kinetic constraints
  • preparation. Acknowledgments. We thank Cristina Toninelli for stimulating discussions and helpful remarks. We are also grateful to the anonymous referee for careful proofreading and helpful comments on the presentation of the paper. ECP 0
  • 2021
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
The Asymmetric One-Dimensional Constrained Ising Model: Rigorous Results
AbstractWe study a one-dimensional spin (interacting particle) system, with product Bernoulli (p) stationary distribution, in which a site can flip only when its left neighbor is in state +1. Such
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.
Coalescing and branching simple symmetric exclusion process
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
Combinatorics for General Kinetically Constrained Spin Models
TLDR
A combinatorial question is solved that is a generalization of a problem addressed by Chung, Diaconis and Graham in 2001 for a specific one-dimensional KCM, the East model, and is used by Mar\^ech\'e, Martinelli and Toninelli to complete the proof of a conjecture put forward by Morris.
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.
Universality for critical KCM: infinite number of stable directions
Kinetically constrained models (KCM) are reversible interacting particle systems on $${{\mathbb {Z}}} ^d$$ Z d with continuous-time constrained Glauber dynamics. They are a natural non-monotone
BOOTSTRAP PERCOLATION AND KINETICALLY CONSTRAINED MODELS IN HOMOGENEOUS AND RANDOM ENVIRONNEMENTS
This thesis concerns with Kinetically Constrained Models and Bootstrap Percolation, two topics in the intersection between probability, combinatorics and statistical mechanics. Kinetically
TIME SCALES OF THE FREDRICKSON-ANDERSEN MODEL ON POLLUTED Z AND Z
TLDR
For a quenched polluted environment with low pollution density, the Kinetically Constrained Model on the polluted square lattice is studied, with two-neighbor constraints, to give bounds on the infection time of the origin.
...
1
2
3
...