References
Published online by Cambridge University Press: 05 June 2014
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Performance Analysis of Complex Networks and Systems , pp. 663 - 672Publisher: Cambridge University PressPrint publication year: 2014
References
, , , and (2013). The scaling limit of the minimum spanning tree of the complete graph. arXiv:1301.1664v1.Google Scholar
, , and (2009). Critical random graphs and the structure of a minimum spanning tree. Random Structures and Algorithms 35, 3 (October), 323-347.CrossRefGoogle Scholar
(2001). The ϛ(2) limit in the random assignment problem. Random Structures and Algorithms 18, 4, 381-418.CrossRefGoogle Scholar
(1978). Probability, Statistics, and Queueing Theory. Computer Science and Applied Mathematics, (Academic Press, Inc., Orlando).Google Scholar
and (1988). Gauss, Landen, Ramanuyan, the Arithmic-Geometric Mean, Ellipses, π and the Ladies Diary. American Mathematical Monthly 95, 585-608.Google Scholar
and (1991). Infectious Diseases of Humans: Dynamics and Control. (Oxford University Press, Oxford, U.K.).Google Scholar
, , and (1982). Stochastic theory of a data-handling system with multiple sources. The Bell System Technical Journal 61, 8 (October), 1871-1894.CrossRefGoogle Scholar
, , , , and (2006). Managing Business Flows. Principles of Operations Management, 2nd edn. (Prentice Hall, Upper Saddle River).Google Scholar
(1975). The Mathematical Theory of Infectious Diseases and its Applications, 2nd edn. (Charlin Griffin & Company, London).Google Scholar
(1996). How Nature Works: The Science of Self-organized Criticality. (Copernicus, Springer-Verlag, New York).CrossRefGoogle Scholar
(2002). The beginnings of packet switching - some underlying concepts: The Franklin Institute and Drexel University seminar on the evolution of packet switching and the Internet. IEEE Communications Magazine, 2-8.Google Scholar
, , and (2008). Dynamical Processes on Complex Networks. (Cambridge University Press, Cambridge, U. K.).CrossRefGoogle Scholar
(1993). An Introduction to Probabiliy and Stochastic Processes. (Springer-Verlag, New York).CrossRefGoogle Scholar
, , and (2012). Universality for first passage percolation on sparse random graphs. arXiv:1210.6839.Google Scholar
(1996). Algebraic Graph Theory, 2nd edn. (Cambridge University Press, Cambridge, U. K.).Google Scholar
, , and (1992). On the tail approximation of the blocking probability of single server queues with finite buffer capacity. Queueing Networks with Finite Capacity, Proc. 2nd Int. Conf., 267-280.Google Scholar
and (2001). Mathematical results on scale-free random graphs. Handbook of Graphs and Networks, ed. and ; Wiley-VCH, 1-34.Google Scholar
, , , , and (2012). On the formulation of epidemic models (an appraisal of Kermack and McKendrick). Journal of Biological Dynamics 6, Supplement 2, 103-117.CrossRefGoogle Scholar
, , and (1948). The Life and Works of A. K. Erlang. (Academy of Technical Sciences, Copenhagen).Google Scholar
, , , , and (2010). Catastrophic cascade of failures in interdependent networks. Nature Letters 464, 1025-1028.CrossRefGoogle ScholarPubMed
(1963). The inverse of the error function. Pacific Journal of Mathematics 13, 459-470.CrossRefGoogle Scholar
, , and (2013). Susceptible-Infected-Susceptible epidemics on networks with general infection and curing times. Physical Review E 87, 6 (June), 062816.CrossRefGoogle Scholar
and (2012). Second order mean-field SIS epidemic threshold. Physical Review E 85, 5 (May), 056111.CrossRefGoogle ScholarPubMed
and (2013a). Nodal infection in Markovian SIS and SIR epidemics on networks are non-negatively correlated.Google Scholar
and (2013b). Susceptible-Infected-Susceptible epidemics on the complete graph and the star graph: Exact analysis. Physical Review E 87, 1 (January), 012811.CrossRefGoogle Scholar
, , , , and (2008). Epidemic thresholds in real networks. ACM Transactions on Information and System Security (TISSEC) 10, 4, 1-26.CrossRefGoogle Scholar
and (2001). Modeling the branching characteristics and eiciency gains in global multicast trees. IEEE INFOCOM2001.Google Scholar
and (2009). Contact process on random graphs with degree power-law distribution have critical value zero. Annals of Probability 37, 2332-2356.CrossRefGoogle Scholar
(1975). Poisson approximation for dependent trials. The Annals of Probability 3, 3, 534-545.CrossRefGoogle Scholar
, , , , and (2008). Finding a better immunization strategy. Physical Review Letters 101, 058701.CrossRefGoogle ScholarPubMed
and (1998). Pricing multicast communication: A cost-based approach. Proceedings of the INET'98.Google Scholar
, , and (2009). Power-law distributions in empirical data. SIAM Review 51, 4, 661-703.CrossRefGoogle Scholar
and (2010). Complex Networks: Structure, Robustness and Function. (Cambridge University Press, Cambridge, U. K.).CrossRefGoogle Scholar
(1974). Advanced Combinatorics, revised and enlarged edn. (D. Riedel Publishing Company, Dordrecht, Holland).CrossRefGoogle Scholar
and (1999). Constructive bounds and exact expectations for the random assignment problem. Random Structures and Algorithms 15, 2, 113-144.3.0.CO;2-S>CrossRefGoogle Scholar
and (1953a). Methods of Mathematical Physics, first English edition, translated and revised from the German original of Springer in 1937 edn. Wiley Classic Library, vol. II. (Interscience, New York).Google Scholar
and (1953b). Methods of Mathematical Physics, first English edition, translated and revised from the German original of Springer in 1937 edn. Wiley Classic Library, vol. I. (Interscience, New York).Google Scholar
and (1991). Elements of Information Theory. Wiley Series in Telecommunications, (John Wiley & Sons, New York).CrossRefGoogle Scholar
(1999). Mathematical Methods of Statistics, 19th edn. (Princeton Landmarks in Mathematics, Princeton, N. J.).Google Scholar
and (1988). Lognormal distributions, Theory and Applications. (Marcel Dekker, Inc., New York).Google Scholar
, , and (1995). Spectra of Graphs, Theory and Applications, third edn. (Johann Ambrosius Barth Verlag, Heidelberg).Google Scholar
, , , and (2007). Characterization of complex networks: A survey of measurements. Advances in Physics 56, 1 (Februari), 167-242.Google Scholar
and (1999). Epidemic modelling: An Introduction.(Cambridge University Press, Cambridge, U. K.).CrossRefGoogle Scholar
and (2011). Epidemic spread in human networks. 50th IEEE Conference on Decision and Control, Orlando, FL, USA; also on arXiv:1107.2464v1.Google Scholar
, , and (2013). Generalized epidemic mean-field model for spreading processes over multi-layer complex networks. IEEE/A CM Transactionon Networking 21, 5 (October), 1609-1620.Google Scholar
and (2009). Analysis of Complex Networks. (Wiley-VCH Verlag GmbH& Co., Weinheim).CrossRefGoogle Scholar
, , and (2012). Mathematical Tools for Understanding Infectious Disease Dynamics. (Princeton University Press, Princeton, USA).CrossRefGoogle Scholar
, , and (2013). Lognormal infection times of online information spread. PLoS ONE 8, 5 (May), e64349.CrossRefGoogle ScholarPubMed
and (2003). Evolution of Networks, From Biological Nets to the Internet and WWW. (Oxford University Press, Oxford).CrossRefGoogle Scholar
and (2010). Epidemics and Rumours in Complex Networks. London Mathematical Society Lecture Node Series: 369, (Cambridge University Press, Cambridge, UK).Google Scholar
, , and (2001a). Modelling Extremal Events for Insurance and Finance, 3rd edn. (Springer-Verlag, Berlin).Google Scholar
, , and (2001b). Correlation and Dependence in Risk Management: Properties and Pitfalls. Risk Management: Value at Risk and Beyond, ed. and , (Cambridge University Press, Cambridge, UK).Google Scholar
and (1960). On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutato Int. Kozl. 5, 17-61.Google Scholar
, , and (1999). On power-law relationships of the Internet Topology. Proceedings of A CM SIGCOMM'99, Cambridge, MA, 251-262.Google Scholar
(1991). Why your friends have more friends than you do. American Journal of Sociology 96, 6 (May), 1464-1477.CrossRefGoogle Scholar
(1970). An Introduction to Probability Theory and Its Applications, 3rd edn. Vol. 1. (John Wiley & Sons, New York).Google Scholar
(1971). An Introduction to Probability Theory and Its Applications, 2nd edn. Vol. 2. (John Wiley & Sons, New York).Google Scholar
and (2001). Difficultiesinsimulating the Internet. IEEE Transactions on Networking 9, 4 (August), 392-403.CrossRefGoogle Scholar
(1985). On the value of a random minimum spanning tree problem. Discrete Applied Mathematics 10, 47-56.CrossRefGoogle Scholar
, , and (2005). The effect of network topology on the spread of epidemics. IEEE INFOCOM2005.Google Scholar
(1809). Theoria motus corporum coelestium in sectionibus conicis solem ambientium. (Hamburgi sumtibus Frid. Perthes et I. H. Besser).Google Scholar
(1821). Theoria combinationis observationum erroribus minimus obnoxiae. Pars prior. Gauss Werke 4, 3-26.Google Scholar
(1930). Une loi des répartitions economique: l'effect proportionnel. Bulletin de la Statistique Générale de la France 19, 469-514.Google Scholar
(1956). Enumeration of labelled graphs. Canadian Journal of Mathematics 8, 405-411.CrossRefGoogle Scholar
and (1996). Matrix Computations, 3rd edn. (The John Hopkins University Press, Baltimore).Google Scholar
, , and (2011). Optimization of network protection against virus spread. 8th International Workshop on Design of Reliable Communication Networks (DRCN 2011), Krakow, Poland.Google Scholar
and (2001). Probability and Random Processes, 3rd edn. (Oxford University Press, Oxford).Google Scholar
, , , , and (2013). Epidemic threshold and topological structure of Susceptible-Infectious-Susceptible epidemics in adaptive networks. Physical Review E 88, 4 (October), 042802.CrossRefGoogle ScholarPubMed
, , and (2005). Branching processes: Variation, Growth and Extinction of Populations. (Cambridge University Press, Cambridge, UK).CrossRefGoogle Scholar
and (1968). An Introduction to the Theory of Numbers, 4th edn. (Oxford University Press, London).Google Scholar
(1990). Brownian Motion and Stochastic Flow Systems. (Krieger Publishing Company, Malabar, Florida).Google Scholar
and (2000). On the convergence of the power series algorithm. Performance Evaluation 42, 21-39.CrossRefGoogle Scholar
and (2001). Delay distributions on ixed Internet paths. Delft University of Technology, Report20011020 (www.nas.ewi.tudelft.nl/people/Piet/TUDelftReports).Google Scholar
and (2005). On the mean distance in scale free graphs. Methodology and Computing in Applied Probability (MCAP) 7, 285-306.Google Scholar
and (2008). The weight and hopcount of the shortest path in the complete graph with exponential weights. Combinatorics, Probability and Computing 17, 4, 537-548.CrossRefGoogle Scholar
and (1991). Topics in Matrix Analysis. (Cambridge University Press, Cambridge, U.K.).CrossRefGoogle Scholar
and (2011). Branching dynamics of viral information spreading. Physical Review E 84, 04116.CrossRefGoogle ScholarPubMed
, , , and (2002). Implications for QoS provisioning based on traceroute measurements. Proceedings of 3rd International Workshop on Quality of Future Internet Services, QofIS2002, ed. B. Stiller et al., Zurich, Switzerland; Springer Verlag LNCS 2511, 3-14.Google Scholar
(1995). The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph. Random Structures and Algorithms 7, 4 (December), 337-356.CrossRefGoogle Scholar
(2002). On concentration of probability. Contemporary Combinatorics; ed. B. Bollobas, Bolyai Soc. Math. Stud. 10, Janos Bolyai Mathematical Society, Budapest, 289-301.Google Scholar
, , , and (1993). The birth of the giant component. Random Structures and Algorithms 4, 3, 233-358.CrossRefGoogle Scholar
and (1975). A First Course in Stochastic Processes, 2nd edn. (Academic Press, San Diego).Google Scholar
and (2010). A message passing approach for general epidemic models,. Physical Review E 82, 016101.CrossRefGoogle ScholarPubMed
and (2008). Modeling Infectious diseases in Humans and Animals. (Princeton University Press, Princeton, USA).Google Scholar
(1991). Special invited paper: Loss networks. The Annals of Applied Probability 1, 3, 319-378.CrossRefGoogle Scholar
(1948). On the generalized birth-and-death process. Annals of Mathematical Statistics 19, 1, 1-15.CrossRefGoogle Scholar
and (1927). A contribution to the mathematical theory of epidemics. Proceedings of the Royal Society London, A 115, 700-721.CrossRefGoogle Scholar
(1976). Queueing Systems. Vol. 2 – Computer Applications. (John Wiley and Sons, New York).Google Scholar
, , , and (2009). A new metric for robustness with respect to virus spread. Networking 2009, LNCS 5550, 562-572.Google Scholar
, , and (2000). The cache location problem. IEEE/ACM Transactions on Networking 8, 5 (October), 586–582.CrossRefGoogle Scholar
, , and (1983). Extremes and Related Properties of Random Sequences and Processes. (Springer-Verlag, New York).CrossRefGoogle Scholar
(1994). Probability and Random Processes for Electrical Engineering, 2nd edn. (Addison-Wesley, Reading, Massachusetts).Google Scholar
, , and (2012). Susceptible-infected-susceptible model: A comparison N-intertwined and heterogeneous mean-ield approximations. Physical Review E 86, 2 (August), 026116.Google ScholarPubMed
and (2004). A proof of Parisi's conjecture on the random assignment problem. Probability Theory and Related Fields 128, 419-440.CrossRefGoogle Scholar
(1985). Theory of Functions of a Complex Variable. Vol. I–III. (Chelsea Publishing Company, New York).Google Scholar
(1967). A normal limit theorem for powersums of normal random variables. The Bell System Technical Journal 46, 9 (November), 2081-2089.CrossRefGoogle Scholar
(2000). Matrix Analysis and Applied Linear Algebra. (Society for Industrial and Applied Mathematics (SIAM), Philadelphia).CrossRefGoogle Scholar
(1988). Stochastic theory of a fluid model of producers and consumers coupled by a bufer. Advances in Applied Probability 20, 646-676.CrossRefGoogle Scholar
and (1995). A critical point for random graphs with a given degree sequence. Random Structures and Algorithms 6, 2 and 3, 161-179.CrossRefGoogle Scholar
, , , and (2013). Exponential extinction time of the contact process on inite graphs. arXiv:1203.2972v1.Google Scholar
, , and (2005). Proofs of the Parisi and Coppersmith-Sorkin random assignment conjectures. Random Structures and Algorithms 27, 4, 413-444.CrossRefGoogle Scholar
(1989). Structured Stochastic Matrices of the M/G/1 Type and Their Applications. (Marcel Dekker Inc., New York).Google Scholar
(2002). The spread of epidemic disease on networks. Physical Review E 66, 016128.CrossRefGoogle ScholarPubMed
(2006). Modularity and community structure in networks. Proceedings of the National Academy of Sciences of the United States of America (PNAS) 103, 23 (June), 8577-8582.Google ScholarPubMed
and (2004). Finding and evaluating community structure in networks. Physical Review E 69, 026113.Google ScholarPubMed
, , and (2001). Random graphs with arbitrary degree distributions and their applications. Physical Review E 64, 026118.CrossRefGoogle ScholarPubMed
(1994). A storage model with self-similar input. Queueing Systems 16, 3–4, 387-396.CrossRefGoogle Scholar
, , and (2010). Network protection against worms and cascading failures using modularity partitioning. 22nd International Teletraffic Congress (ITC 22), Amsterdam, Netherlands.Google Scholar
and (2002). Probability, Random Variables, and Stochastic Processes, 4th edn. (McGraw-Hill, Boston).Google Scholar
and (2001). Epidemic dynamics and endemic states in complex networks. Physical Review E 63, 066117.CrossRefGoogle ScholarPubMed
(1997). End-to-end Routing Behavior in the Internet. IEEE/ACM Transactions on Networking 5, 5 (October), 601-615.CrossRefGoogle Scholar
, , and (1999). Scaling of multicast trees: Comments on the chuang-sirbu scaling law. ACM Sigcomm99.Google Scholar
, , , and (1992). Numerical Recipes in C, 2nd edn. (Cambridge University Press, New York).Google Scholar
, , and (2008). Universality of citation distributions: Toward an objective measure of scientiic impact. Proceedings of the National Academy of Science of the USA (PNAS) 105, 45, 17268-17272.CrossRefGoogle Scholar
(1991). Performance Evaluation and Design of Multiservice Networks. Information Technologies and Sciences, vol. COST 224. (Commission of the European Communities, Luxembourg).Google Scholar
and (1960). Lectures on the Theory of Functions of a Complex Variable. Vol. 1 and 2. (P. Noordhof, Groningen).Google Scholar
(2000). Stochastic Processes and Orthogonal Polynomials. (Springer-Verlag, New York).CrossRefGoogle Scholar
(1957). On the statistics of individual variations of productivity in research laboratories. Proceedings of the Institute of Radio Engineers (IRE) 45, 3 (March), 279-290.Google Scholar
, , , and (2003). Power laws and the AS-level Internet topology. IEEE/ACM Transactions on Networking 11, 4 (August), 514-524.CrossRefGoogle Scholar
, , and (2011). Exact epidemic models on graphs using graph-automorphism driven lumping. Mathematical Biology 62, 479-507.CrossRefGoogle ScholarPubMed
and (1995). A survey of recursive trees. Theory of Probability and Mathematical Statistics 51, 1-27.Google Scholar
, , , , and (2012). Percolation theory on interdependent networks based on epidemic spreading. Europhysics Letters (EPL) 97, 16006.CrossRefGoogle Scholar
and (1994). Analytic derivation of the cell loss probability ininite multiserver bufers, from ininite bufer results. Proceedings of the second workshop on performance modelling and evaluation of ATM networks, Bradford UK, 18.1-11.Google Scholar
(1968). On the calculation of the inverse of the error function. Mathematics of Computation 22, 144-158.Google Scholar
(1986). Introduction to Congestion Theory in Telephone Systems, 2nd edn. Studies in Telecommunication, vol. 4. (North-Holland, Amsterdam).Google Scholar
, , , and (2011). Digging in the Digg online social network. IEEE Transactions on Multimedia 13, 5 (October), 1163-1175.CrossRefGoogle Scholar
(1948). Introduction to the Theory of Fourier Integrals, 2nd edn. (Oxford University Press, Ely House, London W.I).Google Scholar
and (1986). The Theory of the Zeta-function, 2nd edn. (Oxford Science Publications, Oxford).Google Scholar
, , , and (2013). Generating graphs that approach a prescribed modularity. Computer Communications 36, 363-372.CrossRefGoogle Scholar
, , and (2012). Maximum modular graphs. The European Physical Journal B 85, 7, 244: 1-14.CrossRefGoogle Scholar
and (2007). Nonhomogeneous birth and death models for epidemic outbreak data. Biostatistics 8, 2, 453-467.CrossRefGoogle ScholarPubMed
(2013). Random Graphs and Complex Networks, notes at www. win.tue/rhofstad/NotesRGCN.pdf edn.).Google Scholar
, , and (2001). First passage percolation on the random graph. Probability in the Engineering and Informational Sciences (PEIS) 15, 225-237.Google Scholar
, , and (2002b). On the covariance of the level sizes in recursive trees. Random Structures and Algorithms 20, 519-539.CrossRefGoogle Scholar
, , and (2005). Distances in random graphs with inite variance degree. Random Structures and Algorithms 27, 1 (August), 76-123.CrossRefGoogle Scholar
, , and (2006). Size and weight of shortest path trees with exponential link weights. Combinatorics, Probability and Computing 15, 903-926.CrossRefGoogle Scholar
, , and (2007). The weight of the shortest path tree. Random Structures and Algorithms 30, 3, 359-379.CrossRefGoogle Scholar
and (2013). Degree-degree dependencies in random graphs with heavy-tailed degrees. arXiv:1202.3071v5.Google Scholar
and (1995). Geometric ergodicity and quasi-stationarity in discrete-time birth-death processes. Journal of the Australian Mathematical Society, Series B 37, 121-144.CrossRefGoogle Scholar
(1996). The asymptotic behaviour of queueing systems: Large deviations theory and dominant pole approximation. Queueing Systems 23, 27-55.CrossRefGoogle Scholar
(2001). Paths in the simple random graph and the Waxman graph. Probability in the Engineering and Informational Sciences (PEIS) 15, 535-555.Google Scholar
(2004). The probability distribution of the hopcount to an anycast group. Delft University of Technology, Report 2003605 (www.nas.ewi.tudelft.nl/people/Piet/TUDelftReports).Google Scholar
(2005). The limit random variable W of a branching process. Delft University of Technology, Report 20050206 (www.nas.ewi.tudelft.nl/people/Piet/TUDelftReports).Google Scholar
(2010a). Data Communications Networking, 2nd edn. (Piet Van Mieghem, ISBN 978-94-91075-01-8, Delft).Google Scholar
(2010b). Weight of a link in a shortest path tree and the Dedekind Eta function. Random Structures and Algorithms 36, 3 (May), 341-371.Google Scholar
(2011). Graph Spectra for Complex Networks. (Cambridge University Press, Cambridge, U.K.).Google Scholar
(2012a). Epidemic phase transition of the SIS-type in networks. Europhysics Letters (EPL) 97, 48004.CrossRefGoogle Scholar
(2012b). Viral conductance of a network. Computer Communications 35, 12 (July), 1494-1509.CrossRefGoogle Scholar
(2013). Decay towards the overall-healthy state in SIS epidemics on networks. arXiv:1310.3980.Google Scholar
(2014). Exact Markovian SIR and SIS epidemics on networks and an upper bound for the epidemic threshold. Delft University of Technology, Report20140210 (www.nas.ewi.tudelft.nl/people/Piet/TUDelftReports); arXiv:1402.1731.CrossRefGoogle Scholar
, , and (2011a). Lognormal distribution in the Digg online social network. European Physical Journal B 83, 2, 252-261.CrossRefGoogle Scholar
and (2012). Epidemics in networks with nodal self-infections and the epidemic threshold. Physical Review E 86, 1 (July), 016116.CrossRefGoogle Scholar
, , , , , , and (2010a). A framework for computing topological network robustness. Delft University of Technology, Report20101218 (www.nas.ewi.tudelft.nl/people/Piet/TUDelftReports).Google Scholar
, , , , and (2010b). Spectral graph analysis of modularity and assortativity. Physical Review E 82, 5 (November), 056113.CrossRefGoogle ScholarPubMed
, , and (2000). A scaling law for the hopcount in the Internet. Delft University of Technology, Report2000125 (www.nas.ewi.tudelft.nl/people/Piet/TUDelftReports).Google Scholar
, , and (2001a). On the efficiency of multicast. IEEE/ACM Transactions on Networking 9, 6 (December), 719-732.CrossRefGoogle Scholar
, , and (2001b). Stochastic model for the number of traversed routers in Internet. Proceedings of Passive and Active Measurement: PAM-2001, April 23-24, Amsterdam.Google Scholar
and (2005). A phase transition in the link weight structure of networks. Physical Review E 72, 5 (November), 056138.CrossRefGoogle ScholarPubMed
and (2008). In-homogeneous virus spread in networks. Delft University of Technology, Report2008081 (www.nas.ewi.tudelft.nl/people/Piet/TUDelftReports); arXiv:1306.2588.Google Scholar
, , and (2009). Virus spread in networks. IEEE/ACM Transactions on Networking 17, 1 (Februari), 1-14.CrossRefGoogle Scholar
, , , , , , and (2011b). Decreasing the spectral radius of a graph by link removals. Physical Review E 84, 1 (July), 016101.CrossRefGoogle ScholarPubMed
and (2008). Weight of the shortest path to the irst encountered peer in a peer group of size m. Probability in the Engineering and Informational Sciences (PEIS) 22, 37-52.Google Scholar
and (2009). The observable part of a network. IEEE/ACM Transactions on Networking 17, 1, 93-105.CrossRefGoogle Scholar
, , , , and (2010c). Influence of assortativity and degree-preserving rewiring on the spectra of networks. The European Physical Journal B 76, 4, 643-652.CrossRefGoogle Scholar
, , , and (2007). Impact of non-Poissonian activity patterns on spreading processes. Physical Review Letters 98, 158702.CrossRefGoogle ScholarPubMed
, , , , , and (2013). Efect of the interconnected network structure on the epidemic threshold. Physical Review E 88, 2 (022801).CrossRefGoogle Scholar
and (2010). Sampling networks by the union of m shortest path trees. Computer Networks 54, 1042-1053.CrossRefGoogle Scholar
, , and (2011). Assortativity of complementary graphs. The European Physical Journal B 83, 2, 203-214.CrossRefGoogle Scholar
, , , and (2003). Epidemic spreading in real networks: An eigenvalue viewpoint. 22nd International Symposium on Reliable Distributed Systems (SRDS'03); IEEE Computer, 25-34.Google Scholar
(2006). Random assignment and shortest path problems. Proceedings of the Fourth Colloquium on Mathematics and Computer Science, Algorithms, Trees, Combinatorics and Probabilities; Institut Elie Cartan, Nancy, France.Google Scholar
(1995). A Treatise on the Theory of Bessel Functions, Cambridge Mathematical Library edn. (Cambridge University Press, Cambridge, UK).Google Scholar
(1999). Small Worlds, The Dynamics of Networks between Order and Randomness. (Princeton University Press, Princeton, New Jersey).Google Scholar
and (1998). Collective dynamics of “small-worlds” networks. Nature 393, 440-442.CrossRefGoogle Scholar
(1988). Routing of multipoint connections. IEEE Journal on Selected Areas in Communications 6, 9 (December), 1617-1622.CrossRefGoogle Scholar
(1951). A statistical distribution function of wide applicability. ASME Journal of Applied Mechanics, 293-297.Google Scholar
and (1996). A Course of Modern Analysis, Cambridge Mathematical Library edn. (Cambridge University Press, Cambridge, UK).CrossRefGoogle Scholar
(2000). Random Walks on Infinite Graphs and Groups. (Cambridge University Press, Cambridge, UK).CrossRefGoogle Scholar
(2009). Denumerable Markov Chains. (European Mathematical Society, Zurich, Switzerland).CrossRefGoogle Scholar
(1982). Poisson arrivals see time averages. Operations Research 30, 2 (April), 223-231.Google Scholar
(1989). Stochastic Modeling and the Theory of Queues. (Prentice-Hall International Editions, New York).Google Scholar
, , and (2011). Viral conductance: Quantifying the robustness of networks with respect to spread of epidemics. Journal of Computational Science 2, 3 (August), 286-298.CrossRefGoogle Scholar
and (2011). An individual-based approach to SIR epidemics in contact networks. Journal of Theoretical Biology 283, 136-144.CrossRefGoogle ScholarPubMed