Long paths and connectivity in 1‐independent random graphs
From MaRDI portal
Publication:3386526
DOI10.1002/rsa.20972zbMath1454.05108arXiv1909.13771OpenAlexW3097258605WikidataQ104486762 ScholiaQ104486762MaRDI QIDQ3386526
Robert Hancock, Victor Falgas-Ravry, A. Nicholas Day
Publication date: 5 January 2021
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.13771
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Probabilistic measure theory (60A10) Distance in graphs (05C12)
Related Items (1)
Cites Work
- 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
- \(k\)-independent percolation on trees
- Runs in m-dependent sequences
- Density conditions for triangles in multipartite graphs
- The critical probability of bond percolation on the square lattice equals 1/2
- On 1-dependent processes and \(k\)-block factors
- Domination by product measures
- An algebraic construction of a class of one-dependent processes
- Complete subgraphs in multipartite graphs
- Percolation in the secrecy graph
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- On the critical value function in the divide and color model
- Critical Probabilities of 1-Independent Percolation Models
- FINITELY DEPENDENT COLORING
- On Dependency Graphs and the Lattice Gas
- Percolation
- Percolation
- Upper bounds for the critical probability of oriented percolation in two dimensions
- 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: Long paths and connectivity in 1‐independent random graphs
