Strict inequalities of critical values in continuum percolation

DOI10.1007/S10955-011-0122-1zbMATH Open1214.82048arXiv1007.3322OpenAlexW2161436091MaRDI QIDQ628681FDOQ628681

Authors: Massimo Franceschetti, Mathew D. Penrose, Tom Rosoman 

Publication date: 14 March 2011

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Abstract: We consider the supercritical finite-range random connection model where the points $x,y$ of a homogeneous planar Poisson process are connected with probability $f(|y-x|)$ for a given $f$. Performing percolation on the resulting graph, we show that the critical probabilities for site and bond percolation satisfy the strict inequality $p_c^{msite}>p_c^{mbond}$. We also show that reducing the connection function $f$ strictly increases the critical Poisson intensity. Finally, we deduce that performing a spreading transformation on $f$ (thereby allowing connections over greater distances but with lower probabilities, leaving average degrees unchanged) {em strictly} reduces the critical Poisson intensity. This is of practical relevance, indicating that in many real networks it is in principle possible to exploit the presence of spread-out, long range connections, to achieve connectivity at a strictly lower density value.

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

Recommendations

• Equality of critical densities in continuum percolation
• scientific article; zbMATH DE number 3919519
• Critical probabilities for site and bond percolation models
• On the continuity of the critical value for long range percolation in the exponential case
• On the spread-out limit for bond and continuum percolation

zbMATH Keywords

random connection modelbond percolationsite percolationGilbert graph

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Percolation (82B43)

Cites Work

• Random Geometric Graphs
• Continuum Percolation
• Co-Existence of the occupied and vacant phase in boolean models in three or more dimensions
• Random Networks for Communication
• Potts models and random-cluster processes with many-body interactions
• On the critical percolation probabilities
• On a continuum percolation model
• Strict inequality for critical values of Potts models and random-cluster processes
• Critical probabilities for site and bond percolation models
• On the spread-out limit for bond and continuum percolation
• Backbends in directed percolation
• The random connection model in high dimensions
• Continuum percolation with steps in an annulus
• Continuum percolation with unreliable and spread-out connections
• Optimization of shape in continuum percolation
• Quantitative Estimates and Rigorous Inequalities for Critical Points of a Graph and Its Subgraphs
• Critical intensities of Boolean models with different underlying convex shapes
• Spread‐out percolation in ℝ^d

Cited In (14)

• Continuity and convergence of the percolation function in continuum percolation
• Title not available (Why is that?)
• On the critical threshold for continuum AB percolation
• The direct-connectedness function in the random connection model
• On maximal hard-core thinnings of stationary particle processes
• The Coincidence of Critical Points in Poisson Percolation Models
• Russo's Formula, Uniqueness of the Infinite Cluster, and Continuous Differentiability of Free Energy for Continuum Percolation
• Quantitative Estimates and Rigorous Inequalities for Critical Points of a Graph and Its Subgraphs
• Strict inequality for bond percolation on a dilute lattice with columnar disorder
• A proof of factorization formula for critical percolation
• Talagrand's inequality in planar Gaussian field percolation
• Title not available (Why is that?)
• On the first and second largest components in the percolated random geometric graph
• Continuum percolation with unreliable and spread-out connections

This page was built for publication: Strict inequalities of critical values in continuum percolation

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