Small-world graphs: Characterization and alternative constructions

Advances in Applied Probability

Volumn 40, Issue 4, 2008, Pages 939-965

  Cont, Rama ^a   Tanimura, Emily ^b  

^a Department of Earth and Environmental Sciences   (United States)

^b ÉCOLE DES HAUTES ÉTUDES EN SCIENCES SOCIALES   (France)

Author keywords

Random graph; Small world model

Indexed keywords

GRAPH THEORY;

PROBABILISTIC FORMULATION; RANDOM GRAPHS; RANDOM PERTURBATIONS; REGULAR LATTICE; SCALING PROPERTIES; SMALL WORLD GRAPHS; SMALL WORLD MODEL;

GRAPHIC METHODS;

EID: 59549091350     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1231340159     Document Type: Article

References (26)

1. ALDOUS, D. (2004). A tractable complex network model based on the stochastic mean-field model of distance. In Complex Networks (Lecture Notes Phys. 650), Springer, Berlin, pp. 51-87.
2. BARABASI, A., NEWMAN, M. E. J. AND WATTS, D. (2005). The Structure and Dynamics of Networks. Princeton University Press.
3. BARABASI A. L. AND ALBERT, R. (1999). Emergence of scaling in random networks. Science 286, 509-512.
4. BARBOUR, A. D. AND REINERT, G. (2006). Discrete small world networks. Electron. J. Prob. 11, 1234-1283.
5. BOLLOBÁS, B. (2001). Random Graphs. Academic Press, New York.
6. BOLLOBÁS, B. AND RIORDAN, O. (2004). The diameter of a scale-free random graph. Combinatorica 24, 5-34.
7. BOLLOBÁS, B., JANSON, S. AND RIORDAN, O. (2002). Mathematical results on scale-free random graphs. Handbook of Graphs and Networks - From the Genome to the Internet, eds S. Bornholdt and H. Schuster, John Wiley, New York, pp. 1-34
8. BOLLOBÁS, B., JANSON, S. AND RIORDAN, O. (2007). The phase transition in inhomogeneous random graphs. Random Structures Algorithms 31, 3-122.
9. BOLLOBÁS, B., RIORDAN, O., SPENCER, J. AND TUSNÁDY, G. (2001). The degree sequence of a scale-free random graph process. Random Structures Algorithms 18, 279-290.
10. CHUNG, F. AND LU, L. (2006). Complex Graphs and Networks. American Mathematical Society, Providence, RI.
11. CONT, R. AND LOEWE, M. (2008). Social distance and social interactions: a discrete choice model. To appear in J. Math. Econom.
12. DEGENNE, A. AND FORSÉ, M. (1999). Introducing Social Networks. Sage Publications, London.
13. ERDOS, P. AND RéNYI, A. (1960). On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutato Int. Közl, 5, 17-61.
14. FERNHOLZ, D. AND RAMACHANDRAN, V. (2007). The diameter of sparse random graphs. Random Structures Algorithms 31, 482-516.
15. GIRVAN, M. AND NEWMAN, M. E. J. (1999). Community structure in social and biological networks. Proc. Nat. Acad. Sci. USA 99, 7821-7826.
16. GRANOVETTER, M. (1973). The strength of weak ties. Amer. J. Sociology 78, 1287-1303.
17. HOFMAN, J. AND WIGGINS, C. (2008). A Bayesian approach to network modularity. Phys. Rev. Lett. 100, 258701.
18. JACKSON, M. AND ROGERS, B. (2008). The economics of small worlds. J. Europ. Econom. Assoc. 3, 617-627.
19. JOHNSON, S. (1967). Hierarchical clustering schemes. Psychometrika 2, 241-254.
20. NEWMAN, M. (2003). The structure and function of complex networks. SIAM Rev. 45, 167-256.
21. NEWMAN, M., BARABASI, A. AND WATTS, D. (2006). The Structure and Dynamics of Networks. Princeton University Press.
22. NEWMAN, M. E. J., MOORE, C. AND WATTS, D. (2000). Mean-field solution of small world networks. Phys. Rev. Lett. 84, 3201-3204.
23. NEWMAN, M. E. J., WATTS, D. AND STROGATZ, S. H. (2002). Random graph models of social networks, Proc. Nat. Acad. Sci. USA 99, 2566-2572.
24. TRAVERS, J. AND MILGRAM, S. (1999). An experimental study of the small world problem. Sociometry 32, 425-443.
25. WATTS, D. J. (1999). Small Worlds. Princeton University Press.
26. WATTS, D. J. AND STROGATZ, S. H. (1998). Collective dynamics of small world networks. Nature 393, 440-42.