Percolation phase transition in weight-dependent random connection models
From MaRDI portal
Abstract: We investigate spatial random graphs defined on the points of a Poisson process in -dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point is assigned an independent weight. Given the weight and position of the points, we form an edge between any pair of points independently with a probability depending on the two weights of the points and their distance. Preference is given to short edges and connections to vertices with large weights. We characterize the parameter regime where there is a nontrivial percolation phase transition and show that it depends not only on the power-law exponent of the degree distribution but also on a geometric model parameter. We apply this result to characterize robustness of age-based spatial preferential attachment networks.
Recommendations
- Percolation transition of random networks under a piecewise linear weighted function
- Phase transitions and percolation at criticality in enhanced random connection models
- Percolation transition and distribution of connected components in generalized random network ensembles
- Phase transition in the diffusion and bootstrap percolation models on regular random and Erdős-Rényi networks
- Phase transition in dependent percolation
- Recurrence versus transience for weight-dependent random connection models
- scientific article; zbMATH DE number 2166043
- The percolation transition in correlated hypergraphs
- The phase transition in site percolation on pseudo-random graphs
- Interlacement percolation on transient weighted graphs
Cites work
- A note on disjoint-occurrence inequalities for marked Poisson point processes
- Continuum Percolation
- scientific article; zbMATH DE number 4000257 (Why is no real title available?)
- Lectures on the Poisson Process
- On a continuum percolation model
- One dimensional \(1/| j-i| ^ s\) percolation models: The existence of a transition for s\(\leq 2\)
- Recurrence of distributional limits of finite planar graphs
- Robustness of scale-free spatial networks
- Scale-free percolation
- Scale-free percolation in continuum space
- Spatial preferential attachment networks: power laws and clustering coefficients
- Structures in supercritical scale-free percolation
- Subcritical regimes in some models of continuum percolation
- Subcritical regimes in the Poisson Boolean model of continuum percolation
- The age-dependent random connection model
- Weak laws of large numbers in geometric probability
Cited in
(30)- Robustness of scale-free spatial networks
- Phase transitions and percolation at criticality in enhanced random connection models
- Distance evolutions in growing preferential attachment graphs
- Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting)
- Recurrence versus transience for weight-dependent random connection models
- Percolation and connection times in multi-scale dynamic networks
- The age-dependent random connection model
- Scale-free percolation in continuum space
- Connectivity patterns in loop percolation. I: The rationality phenomenon and constant term identities
- Chemical distance in geometric random graphs with long edges and scale-free degree distribution
- Multi-type directed scale-free percolation
- The incipient giant component in bond percolation on general finite weighted graphs
- Scale-free percolation
- Scale-free percolation in continuous space: quenched degree and clustering coefficient
- Transience versus recurrence for scale-free spatial networks
- Graph distances in scale-free percolation: the logarithmic case
- The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects
- Recurrence and transience of symmetric random walks with long-range jumps
- Geometric random intersection graphs with general connection probabilities
- Critical exponents for marked random connection models
- Condensation in scale-free geometric graphs with excess edges
- Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs
- All spatial random graphs with weak long-range effects have chemical distance comparable to Euclidean distance
- Limit theorems under heavy-tailed scenario in the age-dependent random connection models
- On the uniqueness of the infinite cluster and the cluster density in the Poisson driven random connection model
- Finiteness of the percolation threshold for inhomogeneous long-range models in one dimension
- On the topology of higher-order age-dependent random connection models
- Poisson approximation of fixed-degree nodes in weighted random connection models
- Large deviations of the giant in supercritical kernel-based spatial random graphs
- Random connection hypergraphs
This page was built for publication: Percolation phase transition in weight-dependent random connection models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013248)
