Degree asymptotics with rates for preferential attachment random graphs

Goldstein, LarryL. (2007). L 1 L^{1} bounds in normal approximation. Ann. Probab. 35 1888–1930

1930

Earlier work this paper cites.

Gordon, Robert D.R. D. (1941). Values of Mills’ ratio of area to bounding ordinate and of the normal probability integral for large values of the argument. Ann. Math. Statistics 12 364–366

1941

Earlier work this paper cites.

Abramowitz, M.M. andStegun, I. A.I. A., eds. (1964). Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Dover, New York

1964

Earlier work this paper cites.

Bustoz, JoaquinJ. andIsmail, Mourad E. H.M. E. H. (1986). On gamma function inequalities. Math. Comp. 47 659–667

1986

Earlier work this paper cites.

Stein, CharlesC. (1986). Approximate Computation of Expectations. IMS, Hayward, CA

Original

1986

Earlier work this paper cites.

Pakes, Anthony G.A. G. andKhattree, RavindraR. (1992). Length-biasing, characterizations of laws and the moment problem. Austral. J. Statist. 34 307–322

1992

Earlier work this paper cites.

Lyons, RussellR., Pemantle, RobinR. andPeres, YuvalY. (1995). Conceptual proofs of L ​ log ⁡ L L\log L criteria for mean behavior of branching processes. Ann. Probab. 23 1125–1138

1995

Earlier work this paper cites.

Goldstein, LarryL. andReinert, GesineG. (1997). Stein’s method and the zero bias transformation with application to simple random sampling. Ann. Appl. Probab. 7 935–952

1997

Earlier work this paper cites.

Barabási, Albert-LászlóA.-L. andAlbert, RékaR. (1999). Emergence of scaling in random networks. Science 286 509–512

1999

Earlier work this paper cites.

Chamayou, Jean-FrancoisJ.-F. andLetac, GérardG. (1999). Additive properties of the Dufresne laws and their multivariate extension. J. Theoret. Probab. 12 1045–1066

1999

Earlier work this paper cites.

Bollobás, BélaB., Riordan, OliverO., Spencer, JoelJ. andTusnády, GáborG. (2001). The degree sequence of a scale-free random graph process. Random Structures Algorithms 18 279–290

2001

Cited alongside, same era.

Newman, M. E. J.M. E. J. (2003). The structure and function of complex networks. SIAM Rev. 45 167–256 (electronic)

2003

Cited alongside, same era.

Móri, Tamás F.T. F. (2005). The maximum degree of the Barabási–Albert random tree. Combin. Probab. Comput. 14 339–348

2005

Cited alongside, same era.

Reinert, GesineG. (2005). Three general approaches to Stein’s method. In An Introduction to Stein’s Method. Lect. Notes Ser. Inst. Math. Sci. Natl. Univ. Singap. 4 183–221. Singapore Univ. Press, Singapore

2005

Cited alongside, same era.

Brown, MarkM. (2006). Exploiting the waiting time paradox: Applications of the size-biasing transformation. Probab. Engrg. Inform. Sci. 20 195–230

Arratia, R.R. andGoldstein, L.L. (2010). Size bias, sampling, the waiting time paradox, and infinite divisibility: When is the increment independent? Unpublished manuscript. Available at arXiv: \arxivurl

2010

Later among the works it cites.

Durrett, RickR. (2010). Probability: Theory and Examples, 4th ed. Cambridge Univ. Press, Cambridge

2010

Later among the works it cites.

Janson, SvanteS. (2010). Moments of gamma type and the Brownian supremum process area. Probab. Surv. 7 1–52

2010

Later among the works it cites.

Backhausz, ÁgnesÁ. (2011). Limit distribution of degrees in random family trees. Electron. Commun. Probab. 16 29–37

2011

Closest in time.

Chen, Louis H. Y.L. H. Y., Goldstein, LarryL. andShao, Qi-ManQ.-M. (2011). Normal Approximation by Stein’s Method. Springer, Heidelberg

2011

Closest in time.