Performance Analysis of Complex Networks and Systems

1. Introduction Part I. Probability Theory: 2. Random variables 3. Basic distributions 4. Correlation 5. Inequalities 6. Limit laws Part II. Stochastic Processes: 7. The Poisson process 8. Renewal theory 9. Discrete-time Markov chains 10. Continuous-time Markov chains 11. Applications of Markov chains 12. Branching processes 13. General queueing theory 14. Queueing models Part III. Network Science: 15. General characteristics of graphs 16. The shortest path problem 17. Epidemics in networks 18. The efficiency of multicast 19. The hopcount and weight to an anycast group Appendix A. A summary of matrix theory Appendix B. Solutions to problems.

[1]  Edmund Taylor Whittaker,et al.  A Course of Modern Analysis , 2021 .

[2]  W. O. Kermack,et al.  A contribution to the mathematical theory of epidemics , 1927 .

[3]  E. C. Titchmarsh,et al.  The theory of functions , 1933 .

[4]  P. Morse,et al.  Methods of theoretical physics , 1955 .

[5]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[6]  E. C. Titchmarsh Introduction to the Theory of Fourier Integrals , 1938 .

[7]  G. A. Watson A treatise on the theory of Bessel functions , 1944 .

[8]  R. Courant,et al.  Methods of Mathematical Physics , 1962 .

[9]  D. Kendall On the Generalized "Birth-and-Death" Process , 1948 .

[10]  W. Weibull A Statistical Distribution Function of Wide Applicability , 1951 .

[11]  E. Gilbert Enumeration Of Labelled Graphs , 1956, Canadian Journal of Mathematics.

[12]  William Shockley,et al.  On the Statistics of Individual Variations of Productivity in Research Laboratories , 1957, Proceedings of the IRE.

[13]  Giovanni Sansone,et al.  Lectures on the theory of functions of a complex variable , 1961 .

[14]  Arne Jensen,et al.  The life and works of A. K. Erlang , 1960 .

[15]  L. Mirsky,et al.  The Theory of Matrices , 1961, The Mathematical Gazette.

[16]  C. Lanczos Applied Analysis , 1961 .

[17]  R. Syski,et al.  Introduction to congestion theory in telephone systems , 1962 .

[18]  T. E. Harris,et al.  The Theory of Branching Processes. , 1963 .

[19]  L. Carlitz,et al.  The inverse of the error function , 1963 .

[20]  J. H. Wilkinson The algebraic eigenvalue problem , 1966 .

[21]  Athanasios Papoulis,et al.  Probability, Random Variables and Stochastic Processes , 1965 .

[22]  Samuel Karlin,et al.  A First Course on Stochastic Processes , 1968 .

[23]  Irene A. Stegun,et al.  Handbook of Mathematical Functions. , 1966 .

[24]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[25]  N. A. Marlow,et al.  A normal limit theorem for power sums of independent random variables , 1967 .

[26]  R. A. Silverman,et al.  Theory of Functions of a Complex Variable , 1968 .

[27]  A. J. Strecok,et al.  On the calculation of the inverse of the error function , 1968 .

[28]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[29]  A. Fetter,et al.  Quantum Theory of Many-Particle Systems , 1971 .

[30]  Vincent Hodgson,et al.  The Single Server Queue. , 1972 .

[31]  T. B. Boffey,et al.  Applied Graph Theory , 1973 .

[32]  N. Biggs Algebraic Graph Theory , 1974 .

[33]  Louis H. Y. Chen Poisson Approximation for Dependent Trials , 1975 .

[34]  Aleksandr Alekseevich Borovkov,et al.  Stochastic processes in queueing theory , 1976 .

[35]  Benoit B. Mandelbrot,et al.  Fractal Geometry of Nature , 1984 .

[36]  N. Ling The Mathematical Theory of Infectious Diseases and its applications , 1978 .

[37]  P. Billingsley,et al.  Probability and Measure , 1980 .

[38]  S. Karlin,et al.  A second course in stochastic processes , 1981 .

[39]  D. Mitra,et al.  Stochastic theory of a data-handling system with multiple sources , 1982, The Bell System Technical Journal.

[40]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[41]  Ronald W. Wolff,et al.  Poisson Arrivals See Time Averages , 1982, Oper. Res..

[42]  G. Grimmett,et al.  Probability and random processes , 2002 .

[43]  M. R. Leadbetter,et al.  Extremes and Related Properties of Random Sequences and Processes: Springer Series in Statistics , 1983 .

[44]  Gene H. Golub,et al.  Matrix computations , 1983 .

[45]  B. Bollobás The evolution of random graphs , 1984 .

[46]  Béla Bollobás,et al.  Random Graphs , 1985 .

[47]  H. M. Taylor,et al.  An introduction to stochastic modeling , 1985 .

[48]  Alan M. Frieze,et al.  On the value of a random minimum spanning tree problem , 1985, Discret. Appl. Math..

[49]  J. Harrison,et al.  Brownian motion and stochastic flow systems , 1986 .

[50]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[51]  E. Crow,et al.  Lognormal Distributions: Theory and Applications , 1987 .

[52]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .

[53]  D. Mitra Stochastic theory of a fluid model of producers and consumers coupled by a buffer , 1988, Advances in Applied Probability.

[54]  Bruce C. Berndt,et al.  Gauss, Landen, Ramanujan, the arithmetic-geometric mean, ellipses, p, and the Ladies Diary , 1988 .

[55]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[56]  S. Leigh,et al.  Probability and Random Processes for Electrical Engineering , 1989 .

[57]  Igor N. Kovalenko,et al.  Introduction to Queuing Theory , 1989 .

[58]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[59]  Invasion percolation as a fractal growth problem , 1990 .

[60]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[61]  S. Feld Why Your Friends Have More Friends Than You Do , 1991, American Journal of Sociology.

[62]  R. May,et al.  Infectious Diseases of Humans: Dynamics and Control , 1991, Annals of Internal Medicine.

[63]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[64]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[65]  Jean C. Walrand Communication networks - a first course , 1991 .

[66]  J. W. Roberts,et al.  Performance evaluation and design of multiservice networks , 1992 .

[67]  Svante Janson,et al.  The Birth of the Giant Component , 1993, Random Struct. Algorithms.

[68]  PAUL EMBRECHTS,et al.  Modelling of extremal events in insurance and finance , 1994, Math. Methods Oper. Res..

[69]  Ilkka Norros,et al.  A storage model with self-similar input , 1994, Queueing Syst. Theory Appl..

[70]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[71]  Erik A. van Doorn,et al.  Geomatric ergodicity and quasi-stationarity in discrete-time birth-death processes , 1995, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[72]  Svante Janson,et al.  The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph , 1995, Random Struct. Algorithms.

[73]  Robert G. Gallager,et al.  Discrete Stochastic Processes , 1995 .

[74]  Per Bak,et al.  How Nature Works: The Science of Self‐Organized Criticality , 1997 .

[75]  Piet Van Mieghem,et al.  The asymptotic behavior of queueing systems: Large deviations theory and dominant pole approximation , 1996, Queueing Syst. Theory Appl..

[76]  D. Cvetkovic,et al.  Spectra of Graphs: Theory and Applications , 1997 .

[77]  Vern Paxson,et al.  End-to-end routing behavior in the Internet , 1996, TNET.

[78]  E. Lehmann Elements of large-sample theory , 1998 .

[79]  G. Parisi A Conjecture on random bipartite matching , 1998, cond-mat/9801176.

[80]  R. Nelsen An Introduction to Copulas , 1998 .

[81]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[82]  Hongsuda Tangmunarunkit,et al.  Scaling of multicast trees: comments on the Chuang-Sirbu scaling law , 1999, SIGCOMM '99.

[83]  D. Coppersmith,et al.  Constructive bounds and exact expectation for the random assignment problem , 1999 .

[84]  Daryl J. Daley,et al.  Epidemic Modelling: An Introduction , 1999 .

[85]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[86]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[87]  Ger Koole,et al.  On the convergence of the power series algorithm , 2000, Perform. Evaluation.

[88]  Andras Veres,et al.  The chaotic nature of TCP congestion control , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[89]  W. Woess Random walks on infinite graphs and groups, by Wolfgang Woess, Cambridge Tracts , 2001 .

[90]  W. Schoutens Stochastic processes and orthogonal polynomials , 2000 .

[91]  S. Janson On concentration of probability , 2000 .

[92]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[93]  P. Krishnan,et al.  The cache location problem , 2000, TNET.

[94]  Kevin C. Almeroth,et al.  Modeling the branching characteristics and efficiency gains in global multicast trees , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[95]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[96]  Sally Floyd,et al.  Difficulties in simulating the internet , 2001, TNET.

[97]  Alessandro Vespignani,et al.  Epidemic dynamics and endemic states in complex networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[98]  Piet Van Mieghem,et al.  On the efficiency of multicast , 2001, TNET.

[99]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .

[100]  S. Strogatz Exploring complex networks , 2001, Nature.

[101]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[102]  P. V. Mieghem,et al.  PATHS IN THE SIMPLE RANDOM GRAPH AND THE WAXMAN GRAPH , 2001, Probability in the Engineering and Informational Sciences.

[103]  D. Aldous The ζ(2) limit in the random assignment problem , 2000, Random Struct. Algorithms.

[104]  Piet Van Mieghem,et al.  FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH , 2001, Probability in the Engineering and Informational Sciences.

[105]  Marvin A. Sirbu,et al.  Pricing Multicast Communication: A Cost-Based Approach , 2001, Telecommun. Syst..

[106]  P. Embrechts,et al.  Risk Management: Correlation and Dependence in Risk Management: Properties and Pitfalls , 2002 .

[107]  Piet Van Mieghem,et al.  Stability of a multicast tree , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[108]  M. Newman Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[109]  Piet Van Mieghem,et al.  The Flooding Time in Random Graphs , 2002 .

[110]  Piet Van Mieghem,et al.  On the covariance of the level sizes in random recursive trees , 2002, Random Struct. Algorithms.

[111]  Albert-László Barabási,et al.  Linked: The New Science of Networks , 2002 .

[112]  Jie Wu,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .

[113]  Piet Van Mieghem,et al.  Implications for QoS Provisioning Based on Traceroute Measurements , 2002, QofIS.

[114]  William H. Press,et al.  Numerical recipes in C , 2002 .

[115]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[116]  Svante Linusson,et al.  A proof of Parisi’s conjecture on the random assignment problem , 2003, math/0303214.

[117]  Piet Van Mieghem,et al.  The impact of correlated link weights on QoS routing , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[118]  Christos Faloutsos,et al.  Epidemic spreading in real networks: an eigenvalue viewpoint , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[119]  Sergey N. Dorogovtsev,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .

[120]  Michalis Faloutsos,et al.  Power laws and the AS-level internet topology , 2003, TNET.

[121]  P. V. Mieghem,et al.  The probability distribution of the hopcount to an anycast group , 2003 .

[122]  I. Goulden,et al.  Combinatorial Enumeration , 2004 .

[123]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[124]  P. V. Mieghem The limit random variable W of a branching process , 2005 .

[125]  L. da F. Costa,et al.  Characterization of complex networks: A survey of measurements , 2005, cond-mat/0505185.

[126]  B. Prabhakar,et al.  Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures , 2005 .

[127]  Piet Van Mieghem,et al.  Three-query PCPs with perfect completeness over non-Boolean domains , 2005 .

[128]  Piet Van Mieghem,et al.  Phase transition in the link weight structure of networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[129]  Donald F. Towsley,et al.  The effect of network topology on the spread of epidemics , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[130]  P. V. Mieghem,et al.  On the Mean Distance in Scale Free Graphs , 2005 .

[131]  Béla Bollobás,et al.  Mathematical results on scale‐free random graphs , 2005 .

[132]  P. Jagers,et al.  Branching Processes: Variation, Growth, and Extinction of Populations , 2005 .

[133]  Piet Van Mieghem,et al.  Data communications networking , 2006 .

[134]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[135]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[136]  Piet Van Mieghem,et al.  Size and Weight of Shortest Path Trees with Exponential Link Weights , 2006, Combinatorics, Probability and Computing.

[137]  Johan Wästlund Random assignment and shortest path problems , 2006 .

[138]  P. V. Mieghem,et al.  The weight of the shortest path tree , 2007 .

[139]  A. Barabasi,et al.  Impact of non-Poissonian activity patterns on spreading processes. , 2006, Physical review letters.

[140]  Hans Heesterbeek,et al.  Nonhomogeneous birth and death models for epidemic outbreak data. , 2007, Biostatistics.

[141]  P. Van Mieghem,et al.  WEIGHT OF THE SHORTEST PATH TO THE FIRST ENCOUNTERED PEER IN A PEER GROUP OF SIZE m , 2007, Probability in the Engineering and Informational Sciences.

[142]  M. Keeling,et al.  Modeling Infectious Diseases in Humans and Animals , 2007 .

[143]  Claudio Castellano,et al.  Universality of citation distributions: Toward an objective measure of scientific impact , 2008, Proceedings of the National Academy of Sciences.

[144]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks , 2008 .

[145]  Piet Van Mieghem,et al.  The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights , 2008, Comb. Probab. Comput..

[146]  Shlomo Havlin,et al.  Finding a better immunization strategy. , 2008, Physical review letters.

[147]  Christos Faloutsos,et al.  Epidemic thresholds in real networks , 2008, TSEC.

[148]  V. Sundarapandian,et al.  Probability, Statistics and Queueing Theory , 2009 .

[149]  Robert E. Kooij,et al.  A new metric for robustness with respect to virus spread , 2008, Networking.

[150]  P. Van Mieghem,et al.  Virus Spread in Networks , 2009, IEEE/ACM Transactions on Networking.

[151]  Piet Van Mieghem,et al.  The Observable Part of a Network , 2009, IEEE/ACM Transactions on Networking.

[152]  Ernesto Estrada Spectral theory of networks : from biomolecular to ecological systems , 2009 .

[153]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

[154]  Bruce A. Reed,et al.  Critical random graphs and the structure of a minimum spanning tree , 2009, Random Struct. Algorithms.

[155]  R. Durrett,et al.  Contact processes on random graphs with power law degree distributions have critical value 0 , 2009, 0912.1699.

[156]  P. Van Mieghem,et al.  Influence of assortativity and degree-preserving rewiring on the spectra of networks , 2010 .

[157]  Harry Eugene Stanley,et al.  Catastrophic cascade of failures in interdependent networks , 2009, Nature.

[158]  P Van Mieghem,et al.  Spectral graph analysis of modularity and assortativity. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[159]  Piet Van Mieghem,et al.  Network protection against worms and cascading failures using modularity partitioning , 2010, 2010 22nd International Teletraffic Congress (lTC 22).

[160]  Piet Van Mieghem Weight of a link in a shortest path tree and the Dedekind Eta function , 2010, Random Struct. Algorithms.

[161]  Moez Draief,et al.  Epidemics and Rumours in Complex Networks , 2010 .

[162]  Piet Van Mieghem,et al.  Graph Spectra for Complex Networks , 2010 .

[163]  Reuven Cohen,et al.  Complex Networks: Structure, Robustness and Function , 2010 .

[164]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[165]  Brian Karrer,et al.  Message passing approach for general epidemic models. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[166]  Piet Van Mieghem,et al.  Sampling networks by the union of m shortest path trees , 2010, Comput. Networks.

[167]  Christian Doerr,et al.  Lognormal distribution in the digg online social network , 2011 .

[168]  Esteban Moro Egido,et al.  Branching Dynamics of Viral Information Spreading , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[169]  Faryad Darabi Sahneh,et al.  Epidemic spread in human networks , 2011, IEEE Conference on Decision and Control and European Control Conference.

[170]  Robert E. Kooij,et al.  Viral conductance: Quantifying the robustness of networks with respect to spread of epidemics , 2011, J. Comput. Sci..

[171]  Peter Grassberger,et al.  Percolation theory on interdependent networks based on epidemic spreading , 2011, 1109.4447.

[172]  D. Stevanović,et al.  Decreasing the spectral radius of a graph by link removals. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[173]  I. Kiss,et al.  Exact epidemic models on graphs using graph-automorphism driven lumping , 2010, Journal of mathematical biology.

[174]  C. Scoglio,et al.  An individual-based approach to SIR epidemics in contact networks. , 2011, Journal of theoretical biology.

[175]  Tony White,et al.  The Structure of Complex Networks , 2011 .

[176]  Piet Van Mieghem,et al.  Digging in the Digg Social News Website , 2011, IEEE Transactions on Multimedia.

[177]  Piet Van Mieghem,et al.  Optimization of network protection against virus spread , 2011, 2011 8th International Workshop on the Design of Reliable Communication Networks (DRCN).

[178]  Huijuan Wang,et al.  Assortativity of complementary graphs , 2011 .

[179]  P. Van Mieghem,et al.  Epidemics in networks with nodal self-infection and the epidemic threshold. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[180]  M. V. Eremin,et al.  Spin-dimerization in rare-earth substituted La2RuO5 , 2012 .

[181]  Odo Diekmann,et al.  Mathematical Tools for Understanding Infectious Disease Dynamics , 2012 .

[182]  O Diekmann,et al.  On the formulation of epidemic models (an appraisal of Kermack and McKendrick) , 2012, Journal of biological dynamics.

[183]  P. V. Mieghem,et al.  Epidemic phase transition of the SIS type in networks , 2012 .

[184]  Stojan Trajanovski,et al.  Maximum modular graphs , 2012 .

[185]  Piet Van Mieghem,et al.  The viral conductance of a network , 2012, Comput. Commun..

[186]  Remco van der Hofstad,et al.  Universality for first passage percolation on sparse random graphs , 2012, 1210.6839.

[187]  P Van Mieghem,et al.  Second-order mean-field susceptible-infected-susceptible epidemic threshold. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[188]  Qiang Yao,et al.  Exponential extinction time of the contact process on finite graphs , 2012, 1203.2972.

[189]  Piet Van Mieghem,et al.  Generalized Epidemic Mean-Field Model for Spreading Processes Over Multilayer Complex Networks , 2013, IEEE/ACM Transactions on Networking.

[190]  Correction: Lognormal Infection Times of Online Information Spread , 2013, PLoS ONE.

[191]  P. Van Mieghem,et al.  Epidemic threshold and topological structure of susceptible-infectious-susceptible epidemics in adaptive networks. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[192]  Piet Van Mieghem,et al.  Generating graphs that approach a prescribed modularity , 2013, Comput. Commun..

[193]  P. Van Mieghem,et al.  Susceptible-infected-susceptible epidemics on the complete graph and the star graph: exact analysis. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[194]  L. Addario-Berry,et al.  The local weak limit of the minimum spanning tree of the complete graph , 2013, 1301.1664.

[195]  Piet Van Mieghem,et al.  In-homogeneous Virus Spread in Networks , 2013, ArXiv.

[196]  P. Van Mieghem,et al.  Susceptible-infected-susceptible epidemics on networks with general infection and cure times. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[197]  Piet Van Mieghem,et al.  Decay towards the overall-healthy state in SIS epidemics on networks , 2013, ArXiv.

[198]  Piet Van Mieghem,et al.  Lognormal Infection Times of Online Information Spread , 2013, PloS one.

[199]  H. Stanley,et al.  Effect of the interconnected network structure on the epidemic threshold. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[200]  Piet Van Mieghem,et al.  Epidemic processes in complex networks , 2014, ArXiv.

[201]  Piet Van Mieghem,et al.  Exact Markovian SIR and SIS epidemics on networks and an upper bound for the epidemic threshold , 2014, 1402.1731.

[202]  Remco van der Hofstad,et al.  Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees , 2014, Internet Math..

[203]  Carolo Friederico Gauss Theoria Motus Corporum Coelestium in Sectionibus Conicis Solem Ambientium , 2014 .

[204]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks , 2016, Cambridge Series in Statistical and Probabilistic Mathematics.