(1) Departments of Mathematics and Statistics, Iowa State University, Ames, IA 50011, USA;(2) Department of Statistics, Iowa State University, Ames, IA 50011, USA;(3) Department of Mathematics, Iowa State University, Ames, IA 50011, USA
Abstract:
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.