Growth of preferential attachment random graphs via continuous-time branching processes

By Krishna B. Athreya, Arka P. Ghosh, Sunder Sethuraman. 2007

50 citations recorded by the source corpus.

Some growth asymptotics of a version of ‘preferential attachment’ random graphs are studied through an embedding into a continuous-time branching scheme. These results complement and extend previous work in the literature.

Subfields: Computational Theory and Mathematics, Mathematical Physics, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/ac2b8b2452e50db926b1c33d0bd7e234a6f76b7c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Svante Janson
2. Cecilia Holmgren
3. Sourav Chatterjee
4. Remco van der Hofstad
5. L. Lov'asz
6. Persi Diaconis

In Mathematical Physics

1. Cecilia Holmgren
2. Svante Janson
3. Robin Pemantle
4. Philippe Flajolet
5. R. Stephenson
6. Johan Wästlund
7. David Callan
8. Remco van der Hofstad

In Statistical and Nonlinear Physics

1. Svante Janson
2. Cecilia Holmgren
3. Remco van der Hofstad

Citations in the corpus

• Random Graphs and Complex Networks (2016, unknown): “(2007), as well as Athreya (2007); Athreya et al. (2008).”
• Fringe trees, Crump-Mode-Jagers branching processes and $m$-ary search trees (2016, methodology): “See also Athreya, Ghosh, and Sethuraman [4] for an extension with multiple edges, treated by an extension of the methods used here.”