Improved bounds for 1-independent percolation on Z^n
From MaRDI portal
Publication:6966479
Cites work
- 1‐independent percolation on ℤ2×Kn
- A new lower bound for the critical probability of site percolation on the square lattice
- Asymptotic expansions inn−1 for percolation critical values on then-Cube and ℤn
- Continuum percolation with steps in the square or the disc
- Critical probabilities of 1-independent percolation models
- Domination by product measures
- Evolution of the n-cube
- Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms
- scientific article; zbMATH DE number 1759259 (Why is no real title available?)
- scientific article; zbMATH DE number 3346374 (Why is no real title available?)
- scientific article; zbMATH DE number 3198427 (Why is no real title available?)
- Largest random component of a k-cube
- Long paths and connectivity in 1-independent random graphs
- Percolation
- Predicting and Distinguishing Attacks on RC4 Keystream Generator
- Probability and Computing
- Progress in high-dimensional percolation and random graphs
- Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
- Random subgraphs of finite graphs. III: The phase transition for the n-cube
- Random subgraphs of finite graphs: I. The scaling window under the triangle condition
- The component structure of dense random subgraphs of the hypercube
- The critical probability of bond percolation on the square lattice equals 1/2
- The Evolution of Random Subgraphs of the Cube
- Unlacing hypercube percolation: a survey
Cited in
(3)
This page was built for publication: Improved bounds for 1-independent percolation on \(\mathbb{Z}^n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6966479)
