2005. On the bias of traceroute sampling or, power-law degree distributions in regular graphs. In: STOC-05: Proceedings of the 37th Annual ACMSymposium on Theory of Computing., , , and
1999. The small world web. Pages 443–454 of: Lecture Notes in Computer Science, vol. 1696. Springer.
2010. Critical random graphs: limiting constructions and distributional properties. Electron. J. Probab., 15(25), 741–775., , and
2002. random evolution in massive graphs. pages 97–122 of: handbookof massive data sets. Massive Comput., vol. 4. Dordrecht: Kluwer Acad. Publ., , and
2014. Proofs from The Book. Fifth edn. Springer-Verlag, Berlin. Including illustrations by ., and
2002. Statistical mechanics of complex networks. Rev. Modern Phys., 74(1), 47–97., and
1999. Internet: diameter of the World-Wide Web. Nature, 401, 130–131., , and
2001. Error and attack tolerance of complex networks. Nature, 406, 378–382., , and
Random graphs and complex networks. Transparencies available from http://www.stat.berkeley.edu/∼aldous/Talks/net.ps.
1991. Asymptotic fringe distributions for general families of random trees. Ann. Appl. Probab., 1(2), 228–266.
1993. Tree-based models for random distribution of mass. J. Stat. Phys., 73, 625–641.
1997. Brownian excursions, critical random graphs and the multiplicative coalescent. Ann.Probab., 25(2), 812–854.
2005. On a fluctuation identity for random walks and Lévy processes. Bull. London Math. Soc., 37(1), 141–148., , and
2000. The probabilistic method. Second edn.Wiley-Interscience Series in Discrete Mathematics and Optimization. New York: John Wiley & Sons., and
2000. Classes of small-world networks. Proc. Natl. Acad. Sci. USA, 97, 11149–11152., , , and
2016). Limit laws for self-loops and multipleedges in the configuration model. Available from http://arxiv.org/abs/1603.07172., , and Preprint (
1971. The rush in a graph. Technical Report University of Amsterdam Mathematical Center.
2005. How likely is an i.i.d. degree sequence to be graphical. Ann. Appl. Probab., 15(1B), 652–670., and
1972. Branching processes. New York: Springer-Verlag. Die Grundlehren der mathematischen Wissenschaften, Band 196., and
1959. The number of components in random linear graphs. Ann. Math. Statist, 30, 747–754., , , and
1967. Weighted sums of certain dependent random variables. Tohoku Math. J., 3, 357–367.
2012. Four degrees of separation. Pages 33–42 of: Proceedings of the 3rd Annual ACM Web Science Conference. ACM., , , , and
1996. How Nature Works: The Science of Self-Organized Criticality. New York: Copernicus.
2009. Threshold behaviour and final outcome of an epidemic on a random network with household structure. Adv. in Appl. Probab., 41(3), 765–796., , and
2010. Analysis of a stochastic SIR epidemic on a random network incorporating household structure. Math. Biosci., 224(2), 53–73., , and
2002. Linked: the new science of networks. Cambridge, Massachusetts: Perseus Publishing.
1999. Emergence of scaling in random networks. Science, 286(5439), 509–512., and
2000. Scale-free characteristics of random networks: the topology of the world-wide web. Phys. A, 311, 69–77., , and
2002. Evolution of the social network of scientific collaborations. Phys. A, 311(3-4), 590–614., , , , , and
2000. On the fluctuations of the giant component. Combin. Probab. Comput., 9(4), 287–304., , and
1950. Communication patterns in task-oriented groups. Journ. Acoust. Soc. Amer., 22(64), 725–730.
2014. Local limit theorems for the giant component of random hypergraphs. Combin. Probab. Comput., 23(3), 331–366., , and
1978. The asymptotic number of labelled graphs with given degree sequences. Journal of Combinatorial Theory (A), 24, 296–307., and
1990. The asymptotic number of labeled connected graphs with a given number of vertices and edges. Random Structures Algorithms, 1(2), 127–169., , and
1962. Probability inequaltities for the sum of independent random variables. J. Amer. Statist.Assoc., 57, 33–45.
2004. Competition-induced preferential attachment. Pages 208–221 of: Automata, languages and programming. Lecture Notes in Comput. Sci., vol. 3142. Berlin: Springer., , , , and
2005a. Degree distribution of competition-induced preferential attachment graphs. Combin. Probab. Comput., 14(5-6), 697–721., , , , and
2005b. On the spread of viruses on the Internet. Pages 301–310 of: SODA–05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discretealgorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics., , , and
2014. Asymptotic behavior and distributional limits of preferential attachment graphs. Ann. Probab., 42(1), 1–40., , , and
2006. Random fragmentation and coagulation processes. Cambridge Studies in Advanced Mathematics, vol. 102. Cambridge: Cambridge University Press.
2007). Universal techniques to analyze preferential attachment trees: globaland local analysis. Available from http://www.unc.edu/∼bhamidi/preferent.pdf. In preparation (
2010. First passage percolation on random graphs with finite mean degrees. Ann. Appl. Probab., 20(5), 1907–1965., , and
, , and
Universality for first passage percolation on sparserandom graphs. Preprint (2012). To appear in Ann. Probab.
2001a. Bose–Einstein condensation in complex networks. Phys. Rev.Lett., 86(24), 5632–5635., and
2001b. Competition and multiscaling in evolving networks. Europhys.Lett., 54, 436–442., and
1968. Convergence of probability measures. New York: John Wiley and Sons.
1995. Probability and measure. Third edn. Wiley Series in Probability and Mathematical Statistics. New York: John Wiley & Sons Inc. A Wiley-Interscience Publication.
2014. Axioms for centrality. Internet Math., 10(3-4), 222–262., and
1980. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European J. Combin., 1(4), 311–316.
1981. Degree sequences of random graphs. Discrete Math., 33(1), 1–19.
1984a. The evolution of random graphs. Trans. Amer. Math. Soc., 286(1), 257–274.
1984b. The evolution of sparse graphs. Pages 35–57 of: Graph theory and combinatorics(Cambridge, 1983). London: Academic Press.
1998. Modern graph theory. Graduate Texts in Mathematics, vol. 184. Springer-Verlag, New York.
2001. Random graphs. Second edn. Cambridge Studies in Advanced Mathematics, vol. 73. Cambridge: Cambridge University Press.
2003a. Mathematical results on scale-free random graphs. Pages 1–34 of: Handbook of graphs and networks. Wiley-VCH, Weinheim., and
2003b. Robustness and vulnerability of scale-free random graphs. InternetMath., 1(1), 1–35., and
2004. The diameter of a scale-free random graph. Combinatorica, 24(1), 5–34., and
2001. The degree sequence of a scale-free random graph process. Random Structures Algorithms, 18(3), 279–290., , , and
2003. Directed scale-free graphs. Pages 132–139 of: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD,2003). New York: ACM., , , and
2007. The phase transition in inhomogeneous random graphs. Random Structures Algorithms, 31(1), 3–122., , and
2008. A course on the web graph. Graduate Studies in Mathematics, vol. 89. Providence, RI: American Mathematical Society.
1999. Uniform boundedness of critical crossing probabilities implies hyperscaling. Random Structures Algorithms, 15(3-4), 368–413., , , and
2001. The birth of the infinite cluster: finite-size scaling in percolation. Comm. Math. Phys., 224(1), 153–204. Dedicated to Joel L. Lebowitz., , , and
2005a. Random subgraphs of finite graphs. I. The scaling window under the triangle condition. Random Structures Algorithms, 27(2), 137–184., , , , and
2005b. Random subgraphs of finite graphs. II. The lace expansion and the triangle condition. Ann. Probab., 33(5), 1886–1944., , , , and
2006. Random subgraphs of finite graphs. III. The phase transition for th. n-cube. Combinatorica, 26(4), 395–410., , , , and
2007. First to market is not everything: an analysis of preferential attachment with fitness. Pages 135–144 of: STOC–07: Proceedings of the thirty-ninthannual ACM symposium on Theory of computing. New York, NY, USA: ACM Press., , , and
1992. Probability. Classics in Applied Mathematics, vol. 7. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA. Corrected reprint of the 1968 original.
2014. Waves in neural media. Lecture Notes on Mathematical Modelling in the Life Sciences. Springer, New York. From single neurons to neural fields.
1998. The anatomy of a large-scale hypertextual Web search engine. Pages 107–117 of: Computer Networks and ISDN Systems, vol. 33., and
2006. Generating simple random graphs with prescribed degree distribution. J. Stat. Phys., 124(6), 1377–1397., ,
2000. Graph structure in the Web. Computer Networks, 33, 309–320., , , , , , , and
2004. Popularity based random graph models leading to a scale-free degree sequence. Discrete Math., 282(1-3), 53–68., and
1889. A theorem on trees. Q. J. Pure Appl. Math., 23, 376–378.
1953. A model of income distribution. Econ. J., 63, 318.
2013. Directed random graphs with given degree distributions. Stoch.Syst., 3(1), 147–186., and
1952. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statistics, 23, 493–507.
1986. A simple proof of the Erdős-Gallai theorem on graph sequences. Bull. Austral. Math.Soc., 33(1), 67–70.
2002a. The average distances in random graphs with given expected degrees. Proc.Natl. Acad. Sci. USA, 99(25), 15879–15882 (electronic)., and
2002b. Connected components in random graphs with given expected degree sequences. Ann. Comb., 6(2), 125–145., and
2003. The average distance in a random graph with given expected degrees. InternetMath., 1(1), 91–113., and
2006a. Complex graphs and networks. CBMS Regional Conference Series in Mathematics, vol. 107. Published for the Conference Board of the Mathematical Sciences, Washington, DC., and
2006b. Concentration inequalities and martingale inequalities: a survey. InternetMath., 3(1), 79–127., and
2006c. The volume of the giant component of a random graph with given expected degrees. SIAM J. Discrete Math., 20, 395–411., and
2003). Traceroute sampling makes random graphs appear to havepower law degree distributions. Available from https://arxiv.org/abs/cond-mat/0312674., and Preprint (
2005. Accuracy and scaling phenomena in Internet mapping. Phys. Rev. Lett., 94, 018701: 1–4., and
2009. Power-law distributions in empirical data. SIAM. review, 51(4), 661–703., , and
2000. Resilience of the Internet to random breakdowns. Phys. Rev. Letters, 85, 4626., , ben , and
2001. Breakdown of the Internet under intentional attack. Phys. Rev. Letters, 86, 3682., , ben , and
2003. A general model of web graphs. Random Structures Algorithms, 22(3), 311–335., and
2004. The size of the largest strongly connected component of a random digraph with a given degree sequence. Combin. Probab. Comput., 13(3), 319–337., and
1996. On the Lambert W function. Adv. Comput. Math., 5, 329–359., , , , and
2014. How clustering affects epidemics in random networks. Adv. in Appl.Probab., 46(4), 985–1008., and
1999a. Famous trails to Paul Erdős. Rev. Acad. Colombiana Cienc.Exact. Fí s. Natur., 23(89), 563–582. Translated and revised from the English., and
1999b. Famous trails to Paul Erdős. Math. Intelligencer, 21(3), 51–63. With a sidebar by ., and
2009. A preferential attachment model with random initial degrees. Ark. Mat., 47(1), 41–72., , , and
1998. Large deviations techniques and applications. 2nd Applications of Mathematics (New York), vol. 38. New York: Springer-Verlag., and
2009. Random networks with sublinear preferential attachment: Degree evolutions. Electronic Journal of Probability, 14, 122–1267., and
2011. Random networks with concave preferential attachment rule. Jahresber.Dtsch. Math.-Ver., 113(1), 21–40., and
2013. Random networks with sublinear preferential attachment: the giant component. Ann. Probab., 41(1), 329–384., and
2003. An experimental study of search in global social networks. Science, 301(5634), 827–829., , and
2010. Diameters in preferential attachment graphs. Journ. Stat. Phys., 139, 72–107., , and
2010. Lectures on complex networks. Oxford Master Series in Physics, vol. 20. Oxford University Press, Oxford. Oxford Master Series in Statistical Computational, and Theoretical Physics.
2010. Zero Pearson coefficient for strongly correlated growing trees. Phys. Rev. E, 81(3), 031135., , , and
2002. Real analysis and probability. Cambridge Studies in Advanced Mathematics, vol. 74. Cambridge: Cambridge University Press. Revised reprint of the 1989 original.
2007. Random graph dynamics. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge: Cambridge University Press.
2010. Probability: theory and examples. Fourth edn. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge.
1962. A fluctuation theorem for cyclic random variables. Ann. Math. Statist., 33, 1450–1454.
1968. A theorem about infinitely divisible distributions. Z. Wahrscheinleikheitsth., 9, 206–224.
1969. The total progeny in a branching process and a related random walk. J. Appl. Prob., 6, 682–686.
2010. Networks, crowds, and markets: Reasoning about a highly connectedworld. Cambridge University Press., and
2002. Scale-free topology of e-mail networks. Phys. Rev. E, 66, 035103., , and
2014. Vulnerability of robust preferential attachment networks. Electron. J.Probab., 19, no. 57, 47., and
1997. Modelling extremal events. Applications of mathematics (New York), vol. 33. Berlin: Springer-Verlag. For insurance and finance., , and
1947. Some remarks on the theory of graphs. Bull. Amer. Math. Soc., 53, 292–294.
1960. Graphs with points of prescribed degrees. (Hungarian). Mat. Lapok, 11, 264–274., and
1959. On random graphs. I. Publ. Math. Debrecen, 6, 290–297., and
1960. On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int.Közl., 5, 17–61., and
1961a. On the evolution of random graphs. Bull. Inst. Internat. Statist., 38, 343–347., and
1961b. On the strength of connectedness of a random graph. Acta Math. Acad. Sci.Hungar., 12, 261–267., and
1977. On the chromatic index of almost all graphs. J. Combinatorial TheorySer. B, 23(2–3), 255–257., and
2002. Growing random networks with fitness. Phys. A, 303, 261–272., and
2008. Universality for the distance in finite variance random graphs. J. Stat. Phys., 133(1), 169–202., , and
1999. On power-law relationships of the internet topology. Computer Communications Rev., 29, 251–262., , and
1991. Why your friends have more friends than you do. American Journal of Sociology, 96(6), 1464–1477.
1968. An introduction to probability theory and its applications. Volume I. 3rd edn. New York: Wiley.
1971. An introduction to probability theory and its applications. Volume II. 2nd edn. New York: Wiley.
2010. Community detection in graphs. Physics Reports, 486(3), 75–174.
1977. A set of measures in centrality based on betweenness. Sociometry, 40(1), 35–41.
2016. Enumeration of graphs with a heavy-tailed degree sequence. Adv. Math., 287, 412–450., and
1959. Random graphs. Ann. Math. Statist., 30, 1141–1144.
2006. The tipping point: How little things can make a big difference. Hachette Digital, Inc.
2007. Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws. Probab. Surv., 4, 146–171., , and
1965. Table of integrals, series, and products. Fourth edition prepared by and . Translated from the Russian by Scripta Technica, Inc. Translation edited by Alan Jeffrey. New York: Academic Press., and
1973. The strength of weak ties. American Journal of Sociology, 1360–1380.
1995. Getting a job: A study of contacts and careers. University of Chicago Press.
1999. Percolation. 2nd edn. Berlin: Springer.
2001. Probability and random processes. Third edn. New York: Oxford University Press., and
2002. The evolution of the mathematical research collaboration graph. Pages 201–212 of: Proceedings of the Thirty-third Southeastern International Conference on Combinatorics, Graph Theoryand Computing (Boca Raton, FL, 2002), vol. 158.
2006. Convergence properties of the degree distribution of some growing network models. Bull. Math. Biol., 68, 1275–1291.,
1950. Measure theory. D. Van Nostrand Company, Inc., New York N. Y.
1969. Graph theory. Addison-Wesley Publishing Co., Reading, Mass.-Menlo Park, Calif.- London.
1963. The theory of branching processes. Die Grundlehren der Mathematischen Wissenschaften, Bd. 119. Berlin: Springer-Verlag.
2011. Rich-club organization of the human connectome. The Journalof Neuroscience, 31(44), 15775–15786. van den, and
2008. Web structure in 2005. Pages 36–46 of: Algorithms and modelsfor the web-graph. Springer., , and
1963. Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc., 58, 13–30.
2010. Percolation and random graphs. Pages 173–247 of: New perspectives instochastic geometry. Oxford Univ. Press, Oxford..
2015. Random graphs and complex networks. Vol. II. In preparation, see http://www.win.tue.nl/∼rhofstad/NotesRGCNII.pdf..
2009. A local limit theorem for the critical random graph. Electron. Commun. Probab., 14, 122–131., , and
2008. An elementary proof of the hitting time theorem. Amer. Math.Monthly, 115(8), 753–756., and
2015). Hierarchical configurationmodel., , and Preprint (
2014. Degree-degree dependencies in random graphs with heavy-tailed degrees. Internet Math., 10(3-4), 287–334., and
2006. Counting connected graphs asymptotically. European J. Combin., 27(8), 1294–1320., and
2000. Large deviations. Fields Institute Monographs, vol. 14. Providence, RI: American Mathematical Society. den.
2015. Upper bounds for number of removed edges in the Erased Configuration Model. Proceedings of the 12th International Workshop on Algorithms and Models for the Web-Graph, WAW 2015, 10–11 Dec 2015, Eindhoven, pp. 54–65. Lecture Notes in Computer Science 9479. Springer International Publishing. ISSN 0302-9743 ISBN 978-3-319-26783-8., and
2012 (May). Internet topology data comparison. Tech. rept. Cooperative Association for Internet Data Analysis (CAIDA)., , and
1975. Branching processes with biological applications. London: Wiley-Interscience [John Wiley & Sons]. Wiley Series in Probability and Mathematical Statistics—Applied Probability and Statistics.
1984. The growth and composition of branching populations. Adv. in Appl.Probab., 16(2), 221–259., and
1996. The asymptotic composition of supercritical multi-type branching populations. Pages 40–54 of: Séminaire de Probabilités, XXX. Lecture Notes in Math., vol. 1626. Berlin: Springer., and
2005. Asymptotic degree distribution in random recursive trees. Random Structures Algorithms, 26(1-2), 69–83.
2007. Monotonicity, asymptotic normality and vertex degrees in random graphs. Bernoulli, 13(4), 952–965.
2009. The probability that a random multigraph is simple. Combin. Probab. Comput.,
2010. Asymptotic equivalence and contiguity of some random graphs. Random StructuresAlgorithms, 36(1), 26–45.
2011. Probability asymptotics: notes on notation. Available at http://arxiv.org/pdf/1108.3924.pdf.
2014. The probability that a random multigraph is simple. II. J. Appl. Probab., 51A (Celebrating 50 Years of The Applied Probability Trust), 123–137.
1993. The birth of the giant component. RandomStructures Algorithms, 4(3), 231–358. With an introduction by the editors., , , and
2000. Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York., , and
2007. A point process describing the component sizes in the critical window of the random graph evolution. Combin. Probab. Comput., 16(4), 631–658., and
2004. A bound for the distribution of the hitting time of arbitrary sets by random walk. Electron. Comm. Probab., 9, 152–161 (electronic)., and
2006. Small-world characteristics of Internet topologies and implications on multicast scaling. Computer Networks, 50, 648–666., and
2006. The degree sequences and spectra of scale-free random graphs. Random StructuresAlgorithms, 29(2), 226–242.
1929. Chains. In: Everything is different. Publisher unknown.
1967. Central limit theorems for certain infinite urn schemes. J. Math. Mech., 17, 373–401.
1990. The transitive closure of a random digraph. Random Structures Algorithms, 1(1), 73–93.
1961. The passage problem for a stationary Markov chain. Statistical Research Monographs, Vol. I. The University of Chicago Press, Chicago, Ill.
1966a. Additional limit theorems for indecomposable multidimensional Galton–Watson processes. Ann. Math. Statist., 37, 1463–1481., and
1966b. A limit theorem for multidimensional Galton–Watson processes. Ann.Math. Statist., 37, 1211–1223., and
1967. Limit theorems for decomposable multi-dimensional Galton–Watson processes. J. Math. Anal. Appl., 17, 309–338., and
1999. Authoritative sources in a hyperlinked environment. J. ACM, 46(5), 604–632.
2000a. Navigation in a small world. Nature, 406, 845.
2000b (May). The small-world phenomenon: an algorithm perspective. Pages 163–170 of: Proc. of the twenty-third annual ACM symposium on Principles of distributed computing.
1999. The Web as a graph: measurements, models, and methods. Pages 1–17 of: Computing and Combinatorics: 5th Annual InternationalConference, COCOON-99, Tokyo, Japan, July 1999. Proceedings. Lecture Notes in Computer Science., , , Rajagopalan, S, and
1995. Ballot theorems revisited. Statist. Probab. Lett., 24(4), 331–338.
2001. Organization of growing random networks. Phys. Rev. E, 63, 066123., and
2005. Network growth by copying. Phys. Rev. E, 71(3), 036118., and
2000. Connectivity of growing random networks. Phys. Rev.Lett., 85, 4629., , and
2012. Network cosmology. Scientific reports, 2., , , , , and
1999. Trawling the Web for emerging cyber communities. Computer Networks, 31, 1481–1493., , , and
2000. Stochastic models for the web graph. Pages 57–65 of: 42st Annual IEEE Symposium on Foundations of ComputerScience., , , , , and
2003. Sampling biases in IP topology measurements. Pages 332–341 of: Proceedings of IEEE INFOCOM 1., , , and
2013. Reliable neuronal systems: the importance of heterogeneity. PLoS ONE, 8(12), 1–10., , and
2005. Graphs over time: densification laws, shrinking diameters and possible explanations. Pages 177–187 of: Proceedings of the eleventh ACM SIGKDDinternational conference on Knowledge discovery in data mining. ACM., , and
2007. Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (TKDD), 1(1), 2., , and
2009. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Math., 6(1), 29–123., , , and
2010. Empirical comparison of algorithms for network community detection. Pages 631–640 of: Proceedings of the 19th International Conference on World Wide Web. WWW–10. New York, NY, USA: ACM., , and
2001. The web of human sexual contacts. Nature, 411, 907., , N., and
2002. Lectures on the coupling method. Dover Publications, Inc., Mineola, NY. Corrected reprint of the 1992 original.
2001. A course in combinatorics. 2nd Cambridge: Cambridge University Press., and
2013. Uncovering disassortativity in large scale-free networks. Phys.Rev. E, 87(2), 022801., and .
1926. The frequency distribution of scientific productivity. Journal of the Washington Academyof Sciences, 16(12), 317–323.
2012. Large networks and graph limits. American Mathematical Society Colloquium Publications, vol. 60. American Mathematical Society, Providence, RI.
2002. Probabilistic methods in massive graphs and Internet computing. Ph.D. thesis, University of California, San Diego. Available at http://math.ucsd.edu/∼llu/thesis.pdf.
1990a. Component behavior near the critical point of the random graph process. RandomStructures Algorithms, 1(3), 287–310.
1990b. On the number of sparse connected graphs. Random Structures Algorithms, 1(2), 171–173.
1994. The structure of a random graph at the point of the phase transition. Trans. Amer. Math. Soc., 341(2), 721–748., , and
1995. Conceptual proofs of L log L criteria for mean behavior of branching processes. Ann. Probab., 23(3), 1125–1138., , and
1986. Symmetric sampling procedures, general epidemic processes and their threshold limit theorems. J. Appl. Probab., 23(2), 265–282.
1998. The final size of a nearly critical epidemic, and the first passage time of a Wiener process to a parabolic barrier. J. Appl. Probab., 35(3), 671–682.
1967. The small world problem. Psychology Today, May, 60–67.
2009. Percolation and epidemics in random clustered networks. Phys. Rev. E, 80(Aug), 020901.
2004. A brief history of generative models for power law and lognormal distributions. Internet Math., 1(2), 226–251.
1995. A critical point for random graphs with a given degree sequence. RandomStructures Algorithms, 6(2-3), 161–179., and
1998. The size of the giant component of a random graph with a given degree sequence. Combin. Probab. Comput., 7(3), 295–305., and
2002. On random trees. Studia Sci. Math. Hungar., 39(1-2), 143–155.
2005. The maximum degree of the Barabási–Albert random tree. Combin. Probab. Comput., 14(3), 339–348.
2010. The critical random graph, with martingales. Israel J. Math., 176, 29–41., and
1984. The stable double infinite pedigree process of supercritical branching populations. Z. Wahrsch. Verw. Gebiete, 65(3), 445–460., and
2000. Models of the small world. J. Stat. Phys., 101, 819–841.
2001. The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. USA, 98, 404.
2002. Assortative mixing in networks. Phys. Rev. Lett., 89(20), 208701.
2003. The structure and function of complex networks. SIAM Rev., 45(2), 167–256 (electronic).
2005. Power laws, Pareto distributions and Zipf's law. Contemporary Physics, 46(5), 323–351.
2009. Random graphs with clustering. Phys. Rev. Lett., 103(Jul), 058701.
2010. Networks: an introduction. Oxford University Press.
2002. Random graph models of social networks. Proc. Nat.Acad. Sci., 99, 2566–2572., , and
2006. The structure and dynamics of networks. Princeton Studies in Complexity. Princeton University Press., , and
2006. On a conditionally Poissonian graph process. Adv. in Appl. Probab., 38(1), 59–75., and
1998. Some large deviation results for sparse random graphs. Probab. Theory Related Fields, 110(3), 277–285.
1958. Some inequalities relating to the partial sum of binomial probabilities. Ann. Inst. Statist.Math., 10, 29–35.
2005. Connectivity transitions in networks with super-linear preferential attachment. Internet Math., 2(2), 121–163., and
2005. Large deviations and metastability. Encyclopedia of Mathematics and its Applications. Cambridge: Cambridge University Press., and
2012. The distribution of second degrees in the Bollobás–Riordan random graph model. Mosc. J. Comb. Number Theory, 2(2), 85–110., and
1949. The multiplicative process. Ann. Math. Statist., 20, 206–224.
1998. On routes and multicast trees in the Internet. ACM SIGCOMM ComputerCommunication Review, 28(1), 41–50., and
1896. Cours d'economie politique. Geneva, Switserland: Droz.
2007. Evolution and structure of the Internet: A statistical physicsapproach. Cambridge University Press., and
2013. Degree asymptotics with rates for preferential attachment random graphs. Ann. Appl. Probab., 23(3), 1188–1218., , and
, , and Preprint (2014). Joint degree distributions of preferential attachmentrandom graphs. Available from http://arxiv.org/pdf/1402.4686.pdf.
1997. The two-parameter Poisson–Dirichlet distribution derived from a stable subordinator. Ann. Probab., 25(2), 855–900., and
1990. On tree census and the giant component in sparse random graphs. Random StructuresAlgorithms, 1(3), 311–342.
2001. On the largest component of the random graph at a nearcritical stage. J. Combin. TheorySer. B, 82(2), 237–269.
1978. Contacts and influence. Social Networks, 1, 5–51., and
1959. On connected graphs. I. Magyar Tud. Akad. Mat. Kutató Int. Közl., 4, 385–388.
2007. Heavy-tail phenomena. Springer Series in Operations Research and Financial Engineering. Springer, New York. Probabilistic and statistical modeling.
2013. Power laws in preferential attachment graphs and Stein's method for the negative binomial distribution. Adv. in Appl. Probab., 45(3), 876–893.
2007. Random trees and general branching processes. Random StructuresAlgorithms, 31(2), 186–202., , and
1969. Functional equations and the Galton-Watson process. Advances in Appl. Probability, 1, 1–42.
1991. Seven criteria for integer sequences being graphic. J. Graph Theory, 15(2), 223–231., and
2003. Power laws and the AS-level Internet topology. IEEE/ACM Trans. Netw., 11(4), 514–524., , , and
1955. On a class of skew distribution functions. Biometrika, 42, 425–440.
1951. Connectivity of random nets. Bull. Math. Biophys., 13, 107–117., and
1997. Enumerating graphs and Brownian motion. Comm. Pure Appl. Math., 50(3), 291–294.
1956. A combinatorial lemma and its application to probability theory. Trans. Amer. Math. Soc., 82, 323–339.
1976. Principles of random walk. 2nd edn. New York: Springer.
2011. Networks of the Brain. MIT Press.
1965. The existence of probability measures with given marginals. Ann. Math. Statist., 36, 423–439.
2001. Exploring complex networks. Nature, 410(8), 268–276.
1978. Regular partitions of graphs. Pages 399–401 of: Problèmes combinatoires et théoriedes graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976). Colloq. Internat. CNRS, vol. 260. CNRS, Paris.
2005. Concentration of vertex degrees in a scale-free random graph process. RandomStructures Algorithms, 26(1-2), 224–236.
2000. Coupling, stationarity, and regeneration. Probability and its applications (New York). New York: Springer-Verlag.
2007. On analytical approaches to epidemics on networks. Theoretical Population Biology, 71(2), 160–173.
1969. An experimental study of the small world problem. Sociometry, 32, 425–443., and
2011). The anatomy of the Facebook social graph. Available from http://arxiv.org/pdf/1111.4503.pdf., , , and Preprint (
2007. Complex social networks. Econometric Society Monographs, vol. 44. Cambridge University Press, Cambridge.
2009. On the evolution of user inter-action in Facebook. Pages 37–42 of: Proceedings of the 2Nd ACM Workshop on Online Social Networks. WOSN-09. New York, NY, USA: ACM., , , and
1999. Small worlds. The dynamics of networks between order and randomness. Princeton Studies in Complexity. Princeton, NJ: Princeton University Press.
2003. Six degrees. The science of a connected age. New York: W. W. Norton & Co. Inc.
1998. Collective dynamics of ‘small-world’ networks. Nature, 393, 440–442., and
1975. Left-continuous random walk and the Lagrange expansion. Amer. Math. Monthly, 82, 494–499.
1991. Probability with martingales. Cambridge Mathematical Textbooks. Cambridge: Cambridge University Press.
2009. Mathematics and the Internet: A source of enormous confusion and great potential. Notices of the American Mathematical Society, 56(5), 586–599., , and
2002. Scaling phenomena in the Internet: Critically examining criticality. Proc. Natl. Acad. Sci., 99, 2573–2580., , , , and
2012. A review of Facebook research in the social sciences. Perspectives on Psychological Science, 7(3), 203–220., , and
1977. The number of connected sparsely edged graphs. J. Graph Theory, 1(4), 317–330.
1980. The number of connected sparsely edged graphs. III. Asymptotic results. J. GraphTheory, 4(4), 393–407.
2002. Modeling the Internet's large-scale topology. Proc. Natl.Acad. Sci., 99(22), 13382–13386., , and
1925. A mathematical theory of evolution, based on the conclusions of Dr. J. C., Willis F. R. S. Phil. Trans. Roy. Soc. London, B, 213, 21–87.
1929. Relative frequency as a determinant of phonetic change. Harvard Studies in ClassicalPhilology, 15, 1–95.