Strict inequalities of critical values in continuum percolation
From MaRDI portal
(Redirected from Publication:628681)
Abstract: We consider the supercritical finite-range random connection model where the points of a homogeneous planar Poisson process are connected with probability for a given . Performing percolation on the resulting graph, we show that the critical probabilities for site and bond percolation satisfy the strict inequality . We also show that reducing the connection function strictly increases the critical Poisson intensity. Finally, we deduce that performing a spreading transformation on (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.
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
Cites work
- Backbends in directed percolation
- Co-Existence of the occupied and vacant phase in boolean models in three or more dimensions
- Continuum Percolation
- Continuum percolation with steps in an annulus
- Continuum percolation with unreliable and spread-out connections
- Critical intensities of Boolean models with different underlying convex shapes
- Critical probabilities for site and bond percolation models
- On a continuum percolation model
- On the critical percolation probabilities
- On the spread-out limit for bond and continuum percolation
- Optimization of shape in continuum percolation
- Potts models and random-cluster processes with many-body interactions
- Quantitative Estimates and Rigorous Inequalities for Critical Points of a Graph and Its Subgraphs
- Random Geometric Graphs
- Random Networks for Communication
- Spread‐out percolation in ℝd
- Strict inequality for critical values of Potts models and random-cluster processes
- The random connection model in high dimensions
Cited in
(14)- On the critical threshold for continuum AB percolation
- Talagrand's inequality in planar Gaussian field percolation
- On the first and second largest components in the percolated random geometric graph
- scientific article; zbMATH DE number 4117625 (Why is no real title available?)
- Continuity and convergence of the percolation function in continuum percolation
- Strict inequality for bond percolation on a dilute lattice with columnar disorder
- Russo's Formula, Uniqueness of the Infinite Cluster, and Continuous Differentiability of Free Energy for Continuum Percolation
- Continuum percolation with unreliable and spread-out connections
- scientific article; zbMATH DE number 3919519 (Why is no real title available?)
- On maximal hard-core thinnings of stationary particle processes
- A proof of factorization formula for critical percolation
- The direct-connectedness function in the random connection model
- Quantitative Estimates and Rigorous Inequalities for Critical Points of a Graph and Its Subgraphs
- The Coincidence of Critical Points in Poisson Percolation Models
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)