Finite differences in a small world

D.J. Higham, D.F. Griffiths (Editor), G.A. Watson (Editor)

Research output: Chapter in Book/Report/Conference proceedingChapter

20 Downloads (Pure)

Abstract

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.
Original languageEnglish
Title of host publicationProceedings of the 20th Biennial Conference on Numerical Analysis, Dundee
Place of PublicationDundee
Pages81-84
Number of pages3
Publication statusPublished - 2003

    Fingerprint

Keywords

  • small world phenomenon
  • clustering
  • numerical analysis
  • mathematics

Cite this

Higham, D. J., Griffiths, D. F. (Ed.), & Watson, G. A. (Ed.) (2003). Finite differences in a small world. In Proceedings of the 20th Biennial Conference on Numerical Analysis, Dundee (pp. 81-84). Dundee.