On random trees-Reference-Cited by-同舟云学术

On random trees

Published:2002-05-01 Issue:1-2 Volume:39 Page:143-155
ISSN:0081-6906
Container-title:Studia Scientiarum Mathematicarum Hungarica
language:
Short-container-title:

Author:

Móri T.¹

Affiliation:

1. 1 Eötvös Loránd Tudományegyetem, Valószínűségelméleti és Statisztika Tanszék Pázmány Péter sétány 1/c H-1117 Budapest, Hungary

Abstract

In a one-parameter model for evolution of random trees strong law of large numbers and central limit theorem are proved for the number of vertices with low degree. The proof is based on elementary martingale theory.

Publisher

Akademiai Kiado Zrt.

Subject

General Mathematics

Link

https://www.akademiai.com/doi/pdf/10.1556/sscmath.39.2002.1-2.9

Reference4 articles.

1. The degree sequence of a scale-free random graph process;B. Bollobæs;Random Structures Algorithms,2001

2. Probability

3. Emergence of scaling in random networks;A.-L. Barabæsi;Science,1999

Cited by 44 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Degree distributions in recursive trees with fitnesses;Advances in Applied Probability;2023-03-06

2. On Several Properties of A Class of Hybrid Recursive Trees;Methodology and Computing in Applied Probability;2023-02-08

3. Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves;Random Structures & Algorithms;2022-12-28

4. Distance evolutions in growing preferential attachment graphs;The Annals of Applied Probability;2022-12-01

5. Giant descendant trees, matchings, and independent sets in age-biased attachment graphs;Journal of Applied Probability;2022-04-25