We use the method of Balister, Bollobás, and Walters [Random Struct. Algorithms 26, 392 (2005)] to give rigorous 99.9999% confidence intervals for the critical probabilities for site and bond percolation on the 11 Archimedean lattices. In our computer calculations, the emphasis is on simplicity and ease of verification, rather than obtaining the best possible results. Nevertheless, we obtain intervals of width at most 0.0005 in all cases
AbstractIn simulation studies in the physics literature, there is only one pair of graphs which have...
International audienceWe obtain confidence intervals for the location of the percolation phase trans...
We show that one half is a lower bound for the critical probability of an oriented site percolation ...
Abstract. We present three techniques for determining rigorous bounds for site percolation critical ...
The critical probability for site percolation on the square lattice is not known exactly. Several au...
The critical probability for site percolation on the square lattice is not known exactly. Several au...
The problem of percolation on Archimedean and 2-uniform lattices is investigated. An empirical formu...
This paper presents a comprehensive survey of site and bond percolation distributions. Agreement wit...
This paper presents a comprehensive survey of site and bond percolation distributions. Agreement wit...
Ž.Any infinite graph G V, E has a site percolation critical probabil-ity psite and a bond percolati...
AbstracL We have derived long series expansions of the percolation probability for site and bond per...
AbstractIn 1990 Kesten [15] proved that the critical probability pc (Zn, site) for site percolation ...
AbstractIn 1990 Kesten [15] proved that the critical probability pc (Zn, site) for site percolation ...
Abstract. We have derived long-series expansions of the percolation probability for site, bond and s...
In 1990 Kesten [15] proved that the critical probability pc (Zn, site) for site percolation in Zn is...
AbstractIn simulation studies in the physics literature, there is only one pair of graphs which have...
International audienceWe obtain confidence intervals for the location of the percolation phase trans...
We show that one half is a lower bound for the critical probability of an oriented site percolation ...
Abstract. We present three techniques for determining rigorous bounds for site percolation critical ...
The critical probability for site percolation on the square lattice is not known exactly. Several au...
The critical probability for site percolation on the square lattice is not known exactly. Several au...
The problem of percolation on Archimedean and 2-uniform lattices is investigated. An empirical formu...
This paper presents a comprehensive survey of site and bond percolation distributions. Agreement wit...
This paper presents a comprehensive survey of site and bond percolation distributions. Agreement wit...
Ž.Any infinite graph G V, E has a site percolation critical probabil-ity psite and a bond percolati...
AbstracL We have derived long series expansions of the percolation probability for site and bond per...
AbstractIn 1990 Kesten [15] proved that the critical probability pc (Zn, site) for site percolation ...
AbstractIn 1990 Kesten [15] proved that the critical probability pc (Zn, site) for site percolation ...
Abstract. We have derived long-series expansions of the percolation probability for site, bond and s...
In 1990 Kesten [15] proved that the critical probability pc (Zn, site) for site percolation in Zn is...
AbstractIn simulation studies in the physics literature, there is only one pair of graphs which have...
International audienceWe obtain confidence intervals for the location of the percolation phase trans...
We show that one half is a lower bound for the critical probability of an oriented site percolation ...