Hostname: page-component-f554764f5-wjqwx Total loading time: 0 Render date: 2025-04-09T11:21:18.610Z 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: [email protected])
Get access Rights & Permissions [Opens in a new window]

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.

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable