The Maximum Degree of the Barabási–Albert Random Tree

Authors:
Tamás F. Móri
Affiliations:
Department of Probability Theory and Statistics, Eötvös Loránd University, Pázmány Péter s. 1/C, Budapest, Hungary H-1117 (e-mail: moritamas@ludens.elte.hu)
Venue:
Combinatorics, Probability and Computing
Year:
2005

Citing 0
Cited 4

Profiles of random trees: Plane-oriented recursive trees

Random Structures & Algorithms
Non-searchability of random scale-free graphs

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Non-searchability of random power-law graphs

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
The clustering coefficient of a scale-free random graph

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.