Levels of a scale‐free tree
Author:
- 27 December 2005
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 29 (2) , 194-207
Abstract
Consider the random graph model of Barabási and Albert, where we add a new vertex in every step and connect it to some old vertices with probabilities proportional to their degrees. If we connect it to only one of the old vertices the graph will be a tree. These graphs have been shown to have power law degree distributions, the same as observed in some large real‐world networks. We show that the degree distribution is the same on every sufficiently high level of the tree. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006Keywords
This publication has 9 references indexed in Scilit:
- Width of a scale-free treeJournal of Applied Probability, 2005
- The Diameter of a Scale-Free Random GraphCombinatorica, 2004
- On random treesStudia Scientiarum Mathematicarum Hungarica, 2002
- The Profile of Binary Search TreesThe Annals of Applied Probability, 2001
- The degree sequence of a scale‐free random graph processRandom Structures & Algorithms, 2001
- Emergence of Scaling in Random NetworksScience, 1999
- Note on the heights of random recursive trees and random m‐ary search treesRandom Structures & Algorithms, 1994
- On the structure of random plane‐oriented recursive trees and their branchesRandom Structures & Algorithms, 1993
- On a Nonuniform Random Recursive Tree1987