Conditional percolation on one-dimensional lattices

DOI10.1239/AAP/1261669588zbMath1196.60159OpenAlexW2036462818MaRDI QIDQ3558940

Marina Axelson-Fisk, Olle Häggström

Publication date: 11 May 2010

Published in: Unnamed Author (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1261669588

zbMATH Keywords

Markov chainstochastic dominationladder graphconditional percolationconnected one-dimensional periodic latticeweak stochastic monotonicity

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Percolation (82B43)

Related Items (4)

The speed of critically biased random walk in a one-dimensional percolation model ⋮ The tail of the length of an excursion in a trap of random size ⋮ Regularity of the speed of biased random walk in a one-dimensional percolation model ⋮ Einstein relation for 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

This page was built for publication: Conditional percolation on one-dimensional lattices