Random graphs with arbitrary i.i.d. degrees
نویسندگان
چکیده
In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree distribution is regularly varying with exponent 1 − τ . There are three distinct cases: (i) τ > 3, where the degrees have finite variance, (ii) τ ∈ (2, 3), where the degrees have infinite variance, but finite mean, and (iii) τ ∈ (1, 2), where the degrees have infinite mean. These random graphs can serve as models for complex networks where degree power laws are observed. Our results are twofold. First, we give a criterion when there exists a unique largest connected component of size proportional to the size of the graph, and study sizes of the other connected components. Secondly, we establish a phase transition for the diameter when τ ∈ (2, 3). Indeed, we show that for τ > 2 and when nodes with degree 2 are present with positive probability, the diameter of the random graph is, with high probability, bounded below by a constant times the logarithm of the size of the graph. On the other hand, assuming that all degrees are at least 3 or more, we show that, for τ ∈ (2, 3), the diameter of the graph is with high probability bounded from above by a constant times the log log of the size of the graph.
منابع مشابه
Poisson cloning model for random graphs
In the random graph G(n, p) with pn bounded, the degrees of the vertices are almost i.i.d. Poisson random variables with mean λ := p(n− 1). Motivated by this fact, we introduce the Poisson cloning model GPC(n, p) for random graphs in which the degrees are i.i.d. Poisson random variables with mean λ. We first establish a theorem that shows that the new model is equivalent to the classical model ...
متن کاملExchangeability and Realizability: De Finetti Theorems on Graphs
A classic result in probability theory known as de Finetti’s theorem states that exchangeable random variables are equivalent to a mixture of distributions where each distribution is determined by an i.i.d. sequence of random variables (an “i.i.d. mix”). Motivated by a recent application in [18] and more generally by the relationship of local vs. global correlation in randomized rounding, we st...
متن کاملDistances in random graphs with finite variance degrees
In this paper we study a random graph with N nodes, where node j has degree Dj and{Dj}j=1 are i.i.d. with P(Dj ≤ x) = F (x). We assume that 1 − F (x) ≤ cx for some τ > 3and some constant c > 0. This graph model is a variant of the so-called configuration model,and includes heavy tail degrees with finite variance.The minimal number of edges between two arbitrary connected nod...
متن کاملLimit distribution of the degrees in scaled attachment random recursive trees
We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...
متن کاملDistances in random graphs with finite mean and infinite variance degrees
In this paper we study typical distances in random graphs with i.i.d. degrees of which the tail of the common distribution function is regularly varying with exponent 1− τ . Depending on the value of the parameter τ we can distinct three cases: (i) τ > 3, where the degrees have finite variance, (ii) τ ∈ (2, 3), where the degrees have infinite variance, but finite mean, and (iii) τ ∈ (1, 2), whe...
متن کامل