Percolation phase transition in weight-dependent random connection models
نویسندگان
چکیده
Abstract We 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 point is assigned an independent weight. Given weight position points, we form edge between any pair independently with probability depending two weights their distance. Preference given to short edges connections vertices large weights. characterize parameter regime where there non-trivial percolation phase transition show that it depends not only power-law exponent distribution but also geometric model parameter. apply this result robustness age-based preferential attachment networks.
منابع مشابه
Phase transition in dependent percolation
In this paper we discuss two different models of dependent percolation on the graph Z2. We show that they both exhibit phase transitions. This proves a conjecture of Jonasson, Mossel and Peres [6], who proved a similar result on Z3.
متن کاملCore percolation: a new geometric phase transition in random graphs
We study both numerically and analytically what happens to a random graph of average connectivity α when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated vertices plus an induced subgraph we call the core. In the thermodynamic limit of an infinite random graph, we compute analytically the dynamics of leaf removal, the n...
متن کاملThe Phase Transition in Site Percolation on Pseudo-Random Graphs
We establish the existence of the phase transition in site percolation on pseudo-random dregular graphs. Let G = (V,E) be an (n, d, λ)-graph, that is, a d-regular graph on n vertices in which all eigenvalues of the adjacency matrix, but the first one, are at most λ in their absolute values. Form a random subset R of V by putting every vertex v ∈ V into R independently with probability p. Then f...
متن کاملMerging percolation on Zd and classical random graphs: Phase transition
We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called “rank 1 case” of inhomogeneous random graphs. This allows us to use the newly developed theory of inhomogeneous random graphs to describe the phase diagram on ...
متن کاملMerging percolation on Z and classical random graphs: Phase transition
We study a random graph model which is a superposition of the bond percolation model on Zd with probability p of an edge, and a classical random graph G(n, c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called ”rank 1 case” of inhomogeneous random graphs. This allows us to use the newly developed theory of inhomogeneous random graphs to describ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2021
ISSN: ['1475-6064', '0001-8678']
DOI: https://doi.org/10.1017/apr.2021.13