Absence of percolation in graphs based on stationary point processes with degrees bounded by two

DOI10.1002/RSA.21084MaRDI QIDQ6077057zbMATH OpenOpenAlexFDO

Authors Benedikt Jahnel, András Tóbiás

Publication date 17 October 2023

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

bidirectional \(k\)-nearest neighbor graphcontinuum percolationdegree boundsdeletion-tolerancestationary point processes

Mathematics Subject Classification ID

Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Geometric probability and stochastic geometry (60D05) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: We consider undirected graphs that arise as deterministic functions of stationary point processes such that each point has degree bounded by two. For a large class of point processes and edge-drawing rules, we show that the arising graph has no infinite connected component, almost surely. In particular, this extends our previous result for SINR graphs based on stabilizing Cox point processes and verifies the conjecture of Balister and Bollob'as that the bidirectional $k$-nearest neighbor graph of a two-dimensional homogeneous Poisson point process does not percolate for $k=2$.

Recommendations

• Absence of percolation for Poisson outdegree-one graphs
• Absence of a stationary distribution for the edge process of subcritical oriented percolation in two dimensions
• On percolation in random graphs with given vertex degrees
• Percolation on random graphs with a fixed degree sequence
• Percolation on sparse random graphs with given degree sequence
• Percolation on Sparse Random Graphs with Given Degree Sequence
• Critical percolation on certain nonunimodular graphs
• Percolation in invariant Poisson graphs with i.i.d. degrees
• A note about critical percolation on finite graphs
• Two badly behaved percolation processes on a nonunimodular graph

Cites work

• \(k\)-nearest-neighbor clustering and percolation theory
• Absence of percolation for Poisson outdegree-one graphs
• Clustering and percolation of point processes
• Continuum Percolation
• Continuum percolation for Cox point processes
• Continuum percolation for Gaussian zeroes and Ginibre eigenvalues
• Continuum percolation for Gibbs point processes
• Continuum percolation for Gibbsian point processes with attractive interactions
• Continuum percolation for quermass model
• Deterministic walk on Poisson point process
• Insertion and deletion tolerance of point processes
• Nearest neighbor and hard sphere models in continuum percolation
• On the absence of percolation in a line-segment based lilypond model
• Percolation in the signal to interference ratio graph
• Phase transitions for the Boolean model of continuum percolation for Cox point processes
• Random Plane Networks
• Rigidity and tolerance in point processes: Gaussian zeros and Ginibre eigenvalues
• Signal to interference ratio percolation for Cox point processes
• SINR percolation for Cox point processes with random powers

Cited in

(1)

• Percolation in lattice k-neighbor graphs

This page was built for publication: Absence of percolation in graphs based on stationary point processes with degrees bounded by two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6077057)