Conditional percolation on one-dimensional lattices
From MaRDI portal
Publication:3558940
DOI10.1239/aap/1261669588zbMath1196.60159MaRDI QIDQ3558940
Marina Axelson-Fisk, Olle Häggström
Publication date: 11 May 2010
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/aap/1261669588
Markov chain; stochastic domination; ladder graph; conditional percolation; connected one-dimensional periodic lattice; weak stochastic monotonicity
60K35: Interacting random processes; statistical mechanics type models; percolation theory
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
82B43: Percolation
Related Items
Regularity of the speed of biased random walk in a one-dimensional percolation model, The tail of the length of an excursion in a trap of random size, Einstein relation for random walk in a one-dimensional percolation model, The speed of critically biased random walk in a one-dimensional percolation model
Cites Work
- Biased random walk in a one-dimensional percolation model
- The incipient infinite cluster in two-dimensional percolation
- The speed of biased random walk on percolation clusters
- On the anisotropic walk on the supercritical percolation cluster
- A uniqueness condition for Gibbs measures, with application to the 2- dimensional Ising antiferromagnet
- Incipient infinite percolation clusters in 2D.
- The random-cluster model on a homogeneous tree
- Random self-avoiding walks on one-dimensional lattices