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

Tamás F. Móri

Combinatorics Probability Computing · 2005 · 126 citations · 6 references

Concepts

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.

References

6