Finite differences in a small world

Many complex networks in nature exhibit two properties that are seemingly at odds. They are clustered - neighbors of neighbors are very likely to be neighbors - and they are small worlds - any two nodes can typically be connected by a relatively short path. Watts and Strogatz [17] referred to this as the small world phenomenon and proposed a network model that was shown through simulation to capture the two properties. The model incorporates a parameter that interpolates between fully local and fully global regimes. As the parameter is varied the small world property is roused before the clustering property is lost.

[1]  Gene H. Golub,et al.  Extrapolation methods for accelerating PageRank computations , 2003, WWW '03.

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

[3]  Desmond J. Higham A Matrix Perturbation View of the Small World Phenomenon , 2007, SIAM Rev..

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

[5]  Peter F. Stadler,et al.  Relevant cycles in Chemical reaction Networks , 2001, Adv. Complex Syst..

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

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

[8]  D. Fell,et al.  The small world inside large metabolic networks , 2000, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[9]  J. Solé Small world patterns in food webs , 2000, cond-mat/0011195.

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

[11]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

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

[13]  P. Holgate,et al.  Matrix Population Models. , 1990 .

[14]  H. Berg Random Walks in Biology , 2018 .

[15]  D. Vere-Jones Markov Chains , 1972, Nature.