Rigorous confidence intervals on critical thresholds in 3 dimensions
DOI10.1007/S10955-014-1018-7zbMATH Open1304.82035arXiv1312.0961OpenAlexW2037835358MaRDI QIDQ741350FDOQ741350
Authors: Neville Ball
Publication date: 11 September 2014
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.0961
Recommendations
- scientific article; zbMATH DE number 3988433
- Rigorous bounds relating bond percolation thresholds of two three-dimensional lattices
- An upper bound for the bond percolation threshold of the cubic lattice
- An upper bound on the critical percolation probability for the three- dimensional cubic lattice
- Tight bounds for the bond percolation threshold of the \((3,12^{2})\) lattice
Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Critical phenomena in equilibrium statistical mechanics (82B27) Percolation (82B43)
Cites Work
- Percolation
- Percolation
- Title not available (Why is that?)
- Percolation on self-dual polygon configurations
- Inhomogeneous bond percolation on square, triangular and hexagonal lattices
- Universality for bond percolation in two dimensions
- Exact bond percolation thresholds in two dimensions
- Continuum percolation with steps in the square or the disc
- Substitution Method Critical Probability Bounds for the Square Lattice Site Percolation Model
- Critical probability bounds for two-dimensional site percolation models
- Percolation on dual lattices withk-fold symmetry
- A lower bound for the critical probability of the square lattice site percolation
- A new lower bound for the critical probability of site percolation on the square lattice
- Bounds for the Percolation Threshold for a Square Lattice
- Approximate upper bounds for the critical probability of oriented percolation in two dimensions based on rapidly mixing Markov chains
Cited In (6)
- Effects of ramification and connectivity degree on site percolation threshold on regular lattices and fractal networks
- Rigorous bounds relating bond percolation thresholds of two three-dimensional lattices
- Optimal third root asymptotic bounds in the statistical estimation of thresholds
- Long paths and connectivity in 1-independent random graphs
- An upper bound for the bond percolation threshold of the cubic lattice by a growth process approach
- 1‐independent percolation on ℤ2×Kn
This page was built for publication: Rigorous confidence intervals on critical thresholds in 3 dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741350)