1
|
Graph distances in scale-free percolation: the logarithmic case. J Appl Probab 2022. [DOI: 10.1017/jpr.2022.44] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/05/2022]
Abstract
Abstract
Scale-free percolation is a stochastic model for complex networks. In this spatial random graph model, vertices
$x,y\in\mathbb{Z}^d$
are linked by an edge with probability depending on independent and identically distributed vertex weights and the Euclidean distance
$|x-y|$
. Depending on the various parameters involved, we get a rich phase diagram. We study graph distance and compare it to the Euclidean distance of the vertices. Our main attention is on a regime where graph distances are (poly-)logarithmic in the Euclidean distance. We obtain improved bounds on the logarithmic exponents. In the light tail regime, the correct exponent is identified.
Collapse
|
2
|
Gracar P, Heydenreich M, Mönch C, Mörters P. Recurrence versus transience for weight-dependent random connection models. ELECTRON J PROBAB 2022. [DOI: 10.1214/22-ejp748] [Citation(s) in RCA: 2] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/19/2022]
|
3
|
Abstract
AbstractWe investigate spatial random graphs defined on the points of a Poisson process in d-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 non-trivial 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.
Collapse
|
4
|
Abstract
AbstractSpatial random graphs capture several important properties of real-world networks. We prove quenched results for the continuous-space version of scale-free percolation introduced in [14]. This is an undirected inhomogeneous random graph whose vertices are given by a Poisson point process in $\mathbb{R}^d$. Each vertex is equipped with a random weight, and the probability that two vertices are connected by an edge depends on their weights and on their distance. Under suitable conditions on the parameters of the model, we show that, for almost all realizations of the point process, the degree distributions of all the nodes of the graph follow a power law with the same tail at infinity. We also show that the averaged clustering coefficient of the graph is self-averaging. In particular, it is almost surely equal to the annealed clustering coefficient of one point, which is a strictly positive quantity.
Collapse
|
5
|
Komjáthy J, Lodewijks B. Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs. Stoch Process Their Appl 2020. [DOI: 10.1016/j.spa.2019.04.014] [Citation(s) in RCA: 10] [Impact Index Per Article: 2.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Submit a Manuscript] [Subscribe] [Scholar Register] [Indexed: 11/24/2022]
|