Abstract: The study of real-life network modeling has become very popular in recent years. An attractive model is the scale-free percolation model on the lattice , , because it fulfills several stylized facts observed in large real-life networks. We adopt this model to continuum space which leads to a heterogeneous random-connection model on : particles are generated by a homogeneous marked Poisson point process on , and the probability of an edge between two particles is determined by their marks and their distance. In this model we study several properties such as the degree distributions, percolation properties and graph distances.
Recommendations
Cites work
- An introduction to the theory of point processes
- Continuum Percolation
- Domination by product measures
- On a continuum percolation model
- On the chemical distance for supercritical Bernoulli percolation
- On the scaling of the chemical distance in long-range percolation models
- One dimensional \(1/| j-i| ^ s\) percolation models: The existence of a transition for s\(\leq 2\)
- Percolation
- Percolation
- Random graph dynamics
- Random graph models of social networks
- Random Networks for Communication
- Random Plane Networks
- Scale-free percolation
- Transience, recurrence and critical behavior for long-range percolation
Cited in
(35)- On continuum percolation
- Structures in supercritical scale-free percolation
- Continuum percolation with unreliable and spread-out connections
- Continuum percolation of simple fluids: energetic connectivity criteria
- Poisson approximation and connectivity in a scale-free random connection model
- Phase transitions and percolation at criticality in enhanced random connection models
- Penalising transmission to hubs in scale-free spatial random graphs
- Large degrees in scale-free inhomogeneous random graphs
- Recurrence versus transience for weight-dependent random connection models
- Random walk on the random connection model
- The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation
- Graph distances of continuum long-range percolation
- The age-dependent random connection model
- Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
- Continuum percolation for quermass model
- Chemical distance in geometric random graphs with long edges and scale-free degree distribution
- Emergence of giant strongly connected components in continuum disk-spin percolation
- Scale-free percolation in continuous space: quenched degree and clustering coefficient
- Percolation phase transition in weight-dependent random connection models
- Transience versus recurrence for scale-free spatial networks
- Universal finite-size scaling for percolation theory in high dimensions
- Graph distances in scale-free percolation: the logarithmic case
- The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects
- Local limits of spatial inhomogeneous random graphs
- Scale-free percolation mixing time
- Inhomogeneous long-range percolation in the weak decay regime
- Polynomial growth in degree-dependent first passage percolation on spatial random graphs
- Condensation in scale-free geometric graphs with excess edges
- Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs
- Average distance in a general class of scale-free networks
- Finiteness of the percolation threshold for inhomogeneous long-range models in one dimension
- Improved bounds for graph distances in scale free percolation and related models
- Cluster-size decay in supercritical kernel-based spatial random graphs
- Poisson approximation of fixed-degree nodes in weighted random connection models
- Optimal subgraphs in geometric scale-free random graphs
This page was built for publication: Scale-free percolation in continuum space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2328677)
