The degree sequence of a scale‐free random graph process
Top Cited Papers
- 18 April 2001
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 18 (3) , 279-290
- https://doi.org/10.1002/rsa.1009
Abstract
No abstract availableKeywords
Funding Information
- NSF (DSM9971788)
This publication has 10 references indexed in Scilit:
- On random graphs. I.Publicationes Mathematicae Debrecen, 2022
- Scale-free characteristics of random networks: the topology of the world-wide webPhysica A: Statistical Mechanics and its Applications, 2000
- The Web as a graphPublished by Association for Computing Machinery (ACM) ,2000
- Emergence of Scaling in Random NetworksScience, 1999
- Mean-field theory for scale-free random networksPhysica A: Statistical Mechanics and its Applications, 1999
- The strong convergence of maximal degrees in uniform random recursive trees and dagsRandom Structures & Algorithms, 1995
- On the structure of random plane‐oriented recursive trees and their branchesRandom Structures & Algorithms, 1993
- Weighted sums of certain dependent random variablesTohoku Mathematical Journal, 1967
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- Random GraphsThe Annals of Mathematical Statistics, 1959