Mixing patterns in networks

Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

Volumn 67, Issue 2, 2003, Pages 13-

  Newman, M E J ^a,b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b SANTA FE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84876159694     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.67.026126     Document Type: Article

References (78)

1. S.H. Strogatz, Nature (London) 410, 268 (2001).
2. R. Albert and A.-L. Barabási, Rev. Mod. Phys. 74, 47 (2002).
3. S.N. Dorogovtsev and J.F.F. Mendes, Adv. Phys. 51, 1079 (2002).
4. J. Travers and S. Milgram, Sociometry 32, 425 (1969).
5. D.J. Watts and S.H. Strogatz, Nature (London) 393, 440 (1998).
6. A.-L. Barabási and R. Albert, Science 286, 509 (1999).
7. L.A.N. Amaral, A. Scala, M. Barthélémy, and H.E. Stanley, Proc. Natl. Acad. Sci. U.S.A. 97, 11 149 (2000).
8. R. Albert, H. Jeong, and A.-L. Barabási, Nature (London) 406, 378 (2000).
9. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, Comput. Netw. 33, 309 (2000).
10. R. Cohen, K. Erez, D. ben-Avraham, and S. Havlin, Phys. Rev. Lett. 85, 4626 (2000).
11. D.S. Callaway, M.E.J. Newman, S.H. Strogatz, and D.J. Watts, Phys. Rev. Lett. 85, 5468 (2000).
12. P. Holme, B.J. Kim, C.N. Yoon, and S.K. Han, Phys. Rev. E 65, 056109 (2002).
13. J. M. Kleinberg, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (Association of Computing Machinery, New York, 2000), pp. 163–170.
14. L.A. Adamic, R.M. Lukose, A.R. Puniyani, and B.A. Huberman, Phys. Rev. E 64, 046135 (2001).
15. D.J. Watts, P.S. Dodds, and M.E.J. Newman, Science 296, 1302 (2002).
16. M. Girvan and M.E.J. Newman, Proc. Natl. Acad. Sci. U.S.A. 99, 8271 (2002).
17. P. Holme, M. Huss, and H. Jeong, e-print cond-mat/0206292.
18. R. Guimerà, L. Danon, A. Díaz-Guilera, F. Giralt, and A. Arenas, e-print cond-mat/0211498.
19. R. Monasson, Eur. Phys. J. B 12, 555 (1999).
20. K.-I. Goh, B. Kahng, and D. Kim, Phys. Rev. E 64, 051903 (2001).
21. I.J. Farkas, I. Derényi, A.-L. Barabási, and T. Vicsek, Phys. Rev. E 64, 026704 (2001).
22. M.E.J. Newman, Phys. Rev. Lett. 89, 208701 (2002).
23. We find it convenient even on a undirected graph to consider the ends of the edges to be distinguishable—each edge has a unique A-end and B-end, which are marked in some way. We can think of one of the ends as having a dot or other identifying feature on it. This makes the counting of edges simpler: the matrix element (Formula presented) is defined as the probability that a randomly chosen edge is connected to a vertex of type i at its A end and type j at its B end. Thus every edge, whether it joins unlike vertices or like ones, appears only once in the matrix—no edge appears both above and below the diagonal. It is possible to construct a theory in which the ends of undirected edges are indistinguishable, but in this case each edge that joins unlike vertices appears twice in the matrix, both above and below the diagonal, and edges joining like vertices appear only once. This necessitates the introduction of an extra factor of 2 into the off-diagonal terms. This approach is adopted for example in Ref. 43.
24. J.A. Catania, T.J. Coates, S. Kegels, and M.T. Fullilove, Am. J. Public Health 82, 284 (1992).
25. M. Morris, in Epidemic Models: Their Structure and Relation to Data, edited by D. Mollison (Cambridge University Press, Cambridge, 1995), pp. 302–322.
26. S. Gupta, R.M. Anderson, and R.M. May, AIDS3, 807 (1989).
27. B. Efron, SIAM Rev. 21, 460 (1979).
28. J. L. Fleiss, Statistical Methods for Rates and Proportions (Wiley, New York, 1981).
29. J.L. Fleiss, J. Cohen, and B.S. Everitt, AAS Photo-Bull. 72, 323 (1969).
30. E.A. Bender and E.R. Canfield, J. Comb. Theory, Ser. A 24, 296 (1978).
31. T. Łuczak, in Proceedings of the Symposium on Random Graphs, Poznań 1989, edited by A. M. Frieze and T. Łuczak (Wiley, New York, 1992), pp. 165–182.
32. M. Molloy and B. Reed, Random Struct. Algorithms 6, 161 (1995).
33. M. Molloy and B. Reed, Combinatorics, Probab. Comput. 7, 295 (1998).
34. W. Aiello, F. Chung, and L. Lu, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (Association of Computing Machinery, New York, 2000), pp. 171–180.
35. M.E.J. Newman, S.H. Strogatz, and D.J. Watts, Phys. Rev. E 64, 026118 (2001).
36. M.E.J. Newman, D.J. Watts, and S.H. Strogatz, Proc. Natl. Acad. Sci. U.S.A. 99, 2566 (2002).
37. M. E. J. Newman and G. T. Barkema, Monte Carlo Methods in Statistical Physics (Oxford University Press, Oxford, 1999).
38. R. Pastor-Satorras, A. Vázquez, and A. Vespignani, Phys. Rev. Lett. 87, 258701 (2001).
39. S. Maslov and K. Sneppen, e-print cond-mat/0205379.
40. S.N. Dorogovtsev, J.F.F. Mendes, and A.N. Samukhin, e-print cond-mat/0206467.
41. A. Vazquez and M. Weigt, e-print cond-mat/0207035.
42. M. Boguñá, R. Pastor-Satorras, and A. Vespignani, Phys. Rev. E. (to be published), e-print cond-mat/0208163.
43. One can also calculate a value for r by simply ignoring the directed nature of the edges in a directed network. This approach, which we adopted in Ref. 22, will in general give a different figure from that given by Eq. (25). While Eq. (25) will normally give a more meaningful result for a directed network, there may be cases in which ignoring direction is the correct thing to do. For example, in a food web one might only be interested in which species have tropic relations with with others, and not in which direction that relation lies in terms of energy or carbon flow.
44. M.E.J. Newman, Proc. Natl. Acad. Sci. U.S.A. 98, 404 (2001).
45. J.W. Grossman and P.D.F. Ion, Congr. Numer. 108, 129 (1995).
46. G. F. Davis, M. Yoo, and W. E. Baker (unpublished).
47. P. S. Bearman, J. Moody, and K. Stovel (unpublished).
48. M.E.J. Newman, S. Forrest, and J. Balthrop, Phys. Rev. E 66, 035101 (2002).
49. Q. Chen, H. Chang, R. Govindan, S. Jamin, S. J. Shenker, and W. Willinger, in Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Comput. Soc., Los Alanitos, CA, 2002).
50. R. Albert, H. Jeong, and A.-L. Barabási, Nature (London) 401, 130 (1999).
51. H. Jeong, S. Mason, A.-L. Barabási, and Z.N. Oltvai, Nature (London) 411, 41 (2001).
52. H. Jeong, B. Tombor, R. Albert, Z.N. Oltvai, and A.-L. Barabási, Nature (London) 407, 651 (2000).
53. J.G. White, E. Southgate, J.N. Thompson, and S. Brenner, Philos. Trans. R. Soc. London, Ser. A 314, 1 (1986).
54. M. Huxham, S. Beaney, and D. Raffaelli, Oikos 76, 284 (1996).
55. N.D. Martinez, Ecol. Monogr. 61, 367 (1991).
56. D. Strauss, SIAM Rev. 28, 513 (1986).
57. T.A.B. Snijders, J. Soc. Struct. 2(2002).
58. Strictly these probabilities are only correct in a “canonical ensemble” of graphs in which the degree distribution is fixed rather than the degree sequence. This ensemble and the fixed-degree-sequence one studied here, however, become equivalent in the limit of large graph size; the error introduced here by substituting one for the other is of the order of (Formula presented) and is small compared with other sources of error in our simulations.
59. D.J. de S. Price, Science 149, 510 (1965).
60. S. Redner, Eur. Phys. J. B 4, 131 (1998).
61. M. Faloutsos, P. Faloutsos, and C. Faloutsos, Comput. Commun. Rev. 29, 251 (1999).
62. F. Liljeros, C.R. Edling, L.A.N. Amaral, H.E. Stanley, and Y. Åberg, Nature (London) 411, 907 (2001).
63. H. Ebel, L.-I. Mielsch, and S. Bornholdt, Phys. Rev. E 66, 035103 (2002).
64. Not all graphs with (Formula presented) are without degree correlations. A measurement of (Formula presented) implies only that the mean degree correlation is zero when averaged over all degrees. The grown graph model of Barabási and Albert 6 provides an example of a network that possesses degree correlations although it has (Formula presented) 22.
65. R. Cohen, K. Erez, D. ben-Avraham, and S. Havlin, Phys. Rev. Lett. 86, 3682 (2001).
66. The degree is not recalculated after each removal. Removal is in the order of vertices’ starting degree in the network before any deletion has taken place.
67. A. Vazquez and Y. Moreno, Phys. Rev. E 67, 015101 (2003).
68. F. Ball, D. Mollison, and G. Scalia-Tomba, Ann. Appl. Probab. 7, 46 (1997).
69. H. Andersson, Math. Scientist 24, 128 (1999).
70. C. Moore and M.E.J. Newman, Phys. Rev. E 61, 5678 (2000).
71. R. Pastor-Satorras and A. Vespignani, Phys. Rev. Lett. 86, 3200 (2001).
72. R. Pastor-Satorras and A. Vespignani, Phys. Rev. E 63, 066117 (2001).
73. R.M. May and A.L. Lloyd, Phys. Rev. E 64, 066112 (2001).
74. L.M. Sander, C.P. Warren, I. Sokolov, C. Simon, and J. Koopman, Math. Biosci. 180, 293 (2002).
75. M.E.J. Newman, Phys. Rev. E 66, 016128 (2002).
76. N. T. J. Bailey, The Mathematical Theory of Infectious Diseases and its Applications (Hafner Press, New York, 1975).
77. H.W. Hethcote, SIAM Rev. 42, 599 (2000).
78. A. Vazquez and Y. Moreno, e-print cond-mat/0210362.