Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-09T13:39:04.163Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  11 April 2005

TAMÁS F. MÓRI
TAMÁS F. MÓRI
Affiliation:
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)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 14 , Issue 3 , May 2005 , pp. 339 - 348
Copyright
© 2005 Cambridge University Press