The Largest Component in Subcritical Inhomogeneous Random Graphs
نویسنده
چکیده
as was introduced by Bollobás, Janson and Riordan in [1]. Here S is a separable metric space and μ is a Borel probability measure on S . No relationship is assumed between x (n) i and x (n′) i . To simplify notation we shall from now on write (x1, . . . , xn) = (x (n) 1 , . . . , x (n) n ). We begin by recalling some basic definitions and assumptions from [1]. For each n let (x1, . . . , xn) be a deterministic or random sequence of points in S , such that, for any μ-continuity set A ⊆ S , #{i : xi ∈ A} n P → μ(A), (1.1)
منابع مشابه
Asymptotics for the size of the largest component scaled to ” log n ” in inhomogeneous random graphs .
We study the inhomogeneous random graphs in the subcritical case. We derive an exact formula for the size of the largest connected component scaled to log n where n is the size of the graph. This generalizes the recent result for the ”rank 1 case”. Here we discover that the same well-known equation for the survival probability, whose positive solution determines the asymptotics of the size of t...
متن کاملThe size of the largest component below phase transition in inhomogeneous random graphs .
We study the ”rank 1 case” of the inhomogeneous random graph model. In the subcritical case we derive an exact formula for the asymptotic size of the largest connected component scaled to log n. This result is new, it completes the corresponding known result in the supercritical case. We provide some examples of application of a new formula. 2000 Mathematics Subject Classification: 60C05; 05C80.
متن کامل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 ...
متن کاملNovel scaling limits for critical inhomogeneous random graphs
We find scaling limits for the sizes of the largest components at criticality for the rank-1 inhomogeneous random graphs with power-law degrees with exponent . We investigate the case where ∈ (3, 4), so that the degrees have finite variance but infinite third moment. The sizes of the largest clusters, rescaled by n−( −2)/( −1), converge to hitting times of a ‘thinned’ Lévy process. This process...
متن کاملDuality in inhomogeneous random graphs, and the cut metric
The classical random graph model G(n, λ/n) satisfies a ‘duality principle’, in that removing the giant component from a supercritical instance of the model leaves (essentially) a subcritical instance. Such principles have been proved for various models; they are useful since it is often much easier to study the subcritical model than to directly study small components in the supercritical model...
متن کاملThe phase transition in inhomogeneous random intersection graphs
We analyze the component evolution in inhomogeneous random intersection graphs when the average degree is close to 1. As the average degree increases, the size of the largest component in the random intersection graph goes through a phase transition. We give bounds on the size of the largest components before and after this transition. We also prove that the largest component after the transiti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 20 شماره
صفحات -
تاریخ انتشار 2011