1‐independent percolation on ℤ2×Kn

DOI10.1002/rsa.21129zbMath1525.05095arXiv2106.08674OpenAlexW4312069879MaRDI QIDQ6076214

Victor Falgas-Ravry, Vincent Pfenninger

Publication date: 23 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.08674

zbMATH Keywords

percolation theoryextremal graph theorylocally dependent random graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perturbing the hexagonal circle packing: a percolation perspective
• Stable Poisson graphs in one dimension
• Percolation in invariant Poisson graphs with i.i.d. degrees
• Rigorous confidence intervals on critical thresholds in 3 dimensions
• Random walks and percolation on trees
• The critical probability of bond percolation on the square lattice equals 1/2
• Domination by product measures
• Gallai's conjecture for disconnected graphs
• Percolation in the secrecy graph
• On the critical value function in the divide and color model
• Critical Probabilities of 1-Independent Percolation Models
• Long paths and connectivity in 1‐independent random graphs
• Percolation
• Percolation
• Uniqueness in percolation theory
• Substitution Method Critical Probability Bounds for the Square Lattice Site Percolation Model
• A new lower bound for the critical probability of site percolation on the square lattice
• Continuum Percolation
• Continuum percolation with steps in the square or the disc
• Random transceiver networks

This page was built for publication: 1‐independent percolation on ℤ2×Kn