Small-world graphs: characterization and alternative constructions

Small-world graphs are examples of random graphs which mimic empirically observed features of social networks. We propose an intrinsic definition of small-world graphs, based on a probabilistic formulation of scaling properties of the graph, which does not rely on any particular construction. Our definition is shown to encompass existing models of small-world graphs, proposed by Watts (1999) and studied by Barbour and Reinert (2001), which are based on random perturbations of a regular lattice. We also propose alternative constructions of small-world graphs which are not based on lattices and study their scaling properties.

[1]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[2]  Stefan Bornholdt,et al.  Handbook of Graphs and Networks: From the Genome to the Internet , 2003 .

[3]  David J. Aldous.  A Tractable Complex Network Model based on the Stochastic Mean-field Model of Distance , 2003 .

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

[5]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[6]  Albert-László Barabási,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .

[7]  S H Strogatz,et al.  Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Vijaya Ramachandran,et al.  The diameter of sparse random graphs , 2007, Random Struct. Algorithms.

[9]  A. D. Barbour,et al.  Discrete small world networks , 2003, cond-mat/0304020.

[10]  Carson C. Chow,et al.  Small Worlds , 2000 .

[11]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[12]  Gesine Reinert,et al.  Small worlds , 2001, Random Struct. Algorithms.

[13]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

[14]  Alain Degenne,et al.  Introducing Social Networks , 1999 .

[15]  M. Newman,et al.  Mean-field solution of the small-world network model. , 1999, Physical review letters.

[16]  Chris H Wiggins,et al.  Bayesian approach to network modularity. , 2007, Physical review letters.

[17]  R. Durrett.  Random Graph Dynamics: References , 2006 .

[18]  Matthew O. Jackson,et al.  The Economics of Small Worlds , 2005 .

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

[20]  Béla Bollobás,et al.  The phase transition in inhomogeneous random graphs , 2007, Random Struct. Algorithms.

[21]  V. Eguíluz,et al.  Growing scale-free networks with small-world behavior. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[23]  Elise Boulding.  Book Review:The Big Two: Soviet American Perceptions of Foreign Policy. Anatol Rapoport , 1973 .

[24]  S. C. Johnson.  Hierarchical clustering schemes , 1967, Psychometrika.

[25]  Béla Bollobás,et al.  The Diameter of a Scale-Free Random Graph , 2004, Comb..

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

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

[28]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[29]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[30]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[31]  F. Chung,et al.  Complex Graphs and Networks , 2006 .

[32]  Mark E. J. Newman,et al.  Structure and Dynamics of Networks , 2009 .

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

[34]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .