Combinatorics Probability Computing · 2005 · 126 citations · 6 references
Natural SciencesMathematicsEvolutionary TheoryProbability TheoryStochastic ProcessesBranching ProcessesLaw Of Large NumbersLimit TheoremsMarkov ChainsBarabasi-albert ModelCentral Limit TheoremsLaw Of Large Numbers For MartingalesLimit LawsMartingale Central Limit TheoremMartingale TheoryRandom Graph TheoryRandom Trees
In a one-parameter model for evolution of random trees, which also includes the Barabási–Albert random graph [1], the law of large numbers and the central limit theorem are proved for the maximal degree. In the proofs martingale methods are applied.
6
Emergence of Scaling in Random Networks
Albert-Ĺaszló Barabási, Réka Albert · Science · 1999 · 36.4K citations · Full text
The degree sequence of a scale‐free random graph process
Béla Bollobás, Oliver Riordan, Joel Spencer et al. · Random Structures and Algorithms · 2001 · 838 citations
Tamás F. Móri · Studia Scientiarum Mathematicarum Hungarica · 2002 · 77 citations