A new lower bound for the critical probability of site percolation on the square lattice

@inproceedings{Berg1995ANL,
  title={A new lower bound for the critical probability of site percolation on the square lattice},
  author={Jacob van den Berg and A. Ermakov},
  year={1995}
}
  • Jacob van den Berg, A. Ermakov
  • Published 1995
  • Mathematics
  • The critical probability for site percolation on the square lattice is not known exactly. Several authors have given rigorous upper and lower bounds. Some recent lower bounds are (each displayed here with the first three digits) 0.503 (Toth [13]), 0.522 (Zuev [15]), and the best lower bound so far, 0.541 (Menshikov and Pelikh [12]). By a modification of the method of Menshikov and Pelikh we get a significant improvement, namely, 0.556. Apart from a few classical results on percolation and… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 37 CITATIONS

    Recent Improvements to the Substitution Method for Bounding Percolation Thresholds

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Probability on graphs

    VIEW 18 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Geometric Functionals of fractal percolation.

    VIEW 3 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Computational improvements in the substitution method for bounding percolation thresholds

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Rigorous Confidence Intervals on Critical Thresholds in 3 Dimensions

    VIEW 3 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets

    VIEW 2 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    The Application of Non-Crossing Partitions to Improving Percolation Threshold Bounds

    VIEW 2 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED