A new class of scale free random graphs
Consider the following modification of the Barabási-Albert random graph. At every step a new vertex is added to the graph. It is connected to the old vertices randomly, with probabilities proportional to the degree of the other vertex, and independently of each other. We show that the proportion of vertices of degree k decreases at the rate of k-3. Furthermore, we prove a strong law of large numbers for the maximum degree.
Year of publication: |
2006
|
---|---|
Authors: | Katona, Zsolt ; Móri, Tamás F. |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 76.2006, 15, p. 1587-1593
|
Publisher: |
Elsevier |
Subject: | Random graph Scale-free distribution |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Chebyshev-type inequalities for scale mixtures
Csiszar, Villo, (2005)
-
Asymptotic independence of 'pure head' stopping times
Móri, Tamás F., (1984)
-
The convexity method of proving moment-type inequalities
Csiszar, Villo, (2004)
- More ...