Indexed metadata
The Maximum Degree of the Barabási–Albert Random Tree
TAMÁS F. MÓRI
Source record
Source: Crossref
Published: Apr 11, 2005
DOI: 10.1017/s0963548304006133
Open original source ↗Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.