IDEAS home Printed from https://ideas.repec.org/p/wop/safiwp/99-12-080.html
   My bibliography  Save this paper

Small Worlds: The Structure of Social Networks

Author

Listed:
  • Mark Newman

Abstract

Experimentally it has been found that any two people in the world, chosen at random, are connected to one another by a short chain of intermediate acquaintances, of typical lenth about six. This phenomenon, colloquially referred to as the "six degrees of separation", has been the subject of a considerable amount of recent research and modeling, which we review here.

Suggested Citation

  • Mark Newman, 1999. "Small Worlds: The Structure of Social Networks," Working Papers 99-12-080, Santa Fe Institute.
    • Handle: RePEc:wop:safiwp:99-12-080
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    References listed on IDEAS

    as
    1. M. E. J. Newman & D. J. Watts, 1999. "Scaling and Percolation in the Small-World Network Model," Working Papers 99-05-034, Santa Fe Institute.
    2. M. E. J. Newman & D. J. Watts, 1999. "Renormalization Group Analysis of the Small-World Network Model," Working Papers 99-04-029, Santa Fe Institute.
    3. Réka Albert & Hawoong Jeong & Albert-László Barabási, 1999. "Diameter of the World-Wide Web," Nature, Nature, vol. 401(6749), pages 130-131, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zheng, Yan Hong & Lu, Qi Shao, 2008. "Spatiotemporal patterns and chaotic burst synchronization in a small-world neuronal network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(14), pages 3719-3728.
    2. Türker, İlker, 2018. "Generating clustered scale-free networks using Poisson based localization of edges," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 497(C), pages 72-85.
    3. Chung-Yuan Huang & Chuen-Tsai Sun & Hsun-Cheng Lin, 2005. "Influence of Local Information on Social Simulations in Small-World Network Models," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 8(4), pages 1-8.
    4. Gancio, Juan & Rubido, Nicolás, 2022. "Critical parameters of the synchronisation's stability for coupled maps in regular graphs," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
    5. Liu, Hao & Chen, Xin & Huo, Long & Zhang, Yadong & Niu, Chunming, 2022. "Impact of inter-network assortativity on robustness against cascading failures in cyber–physical power systems," Reliability Engineering and System Safety, Elsevier, vol. 217(C).
    6. Lu, Zhe-Ming & Guo, Shi-Ze, 2012. "A small-world network derived from the deterministic uniform recursive tree," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(1), pages 87-92.
    7. Huang, Wei & Chen, Shengyong & Wang, Wanliang, 2014. "Navigation in spatial networks: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 132-154.
    8. Alfarano, Simone & Milakovic, Mishael, 2009. "Network structure and N-dependence in agent-based herding models," Journal of Economic Dynamics and Control, Elsevier, vol. 33(1), pages 78-92, January.
    9. Gong, Yubing & Wang, Li & Xu, Bo, 2012. "Delay-induced diversity of firing behavior and ordered chaotic firing in adaptive neuronal networks," Chaos, Solitons & Fractals, Elsevier, vol. 45(4), pages 548-553.
    10. Zengwang Xu & Daniel Sui, 2007. "Small-world characteristics on transportation networks: a perspective from network autocorrelation," Journal of Geographical Systems, Springer, vol. 9(2), pages 189-205, June.
    11. Argollo de Menezes, M & Moukarzel, C.F & Penna, T.J.P, 2001. "Geometric phase-transition on systems with sparse long-range connections," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 295(1), pages 132-139.
    12. David L. Alderson, 2008. "OR FORUM---Catching the “Network Science” Bug: Insight and Opportunity for the Operations Researcher," Operations Research, INFORMS, vol. 56(5), pages 1047-1065, October.
    13. Mitra, Tushar & Hassan, Md. Kamrul, 2022. "A weighted planar stochastic lattice with scale-free, small-world and multifractal properties," Chaos, Solitons & Fractals, Elsevier, vol. 154(C).
    14. Wang, Li & Gong, Yubing & Lin, Xiu, 2012. "Ordered chaotic bursting and multiple coherence resonance by time-periodic coupling strength in Newman–Watts neuronal networks," Chaos, Solitons & Fractals, Elsevier, vol. 45(2), pages 131-136.
    15. Zhou, Guangye & Li, Chengren & Li, Tingting & Yang, Yi & Wang, Chen & He, Fangjun & Sun, Jingchang, 2016. "Outer synchronization investigation between WS and NW small-world networks with different node numbers," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 457(C), pages 506-513.
    16. Mohd-Zaid, Fairul & Kabban, Christine M. Schubert & Deckro, Richard F. & White, Edward D., 2017. "Parameter specification for the degree distribution of simulated Barabási–Albert graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 141-152.
    17. Chen, Shu-Heng & Chang, Chia-Ling & Wen, Ming-Chang, 2014. "Social networks and macroeconomic stability," Economics - The Open-Access, Open-Assessment E-Journal (2007-2020), Kiel Institute for the World Economy (IfW Kiel), vol. 8, pages 1-40.
    18. Vinayak, & Raghuvanshi, Adarsh & kshitij, Avinash, 2023. "Signatures of capacity development through research collaborations in artificial intelligence and machine learning," Journal of Informetrics, Elsevier, vol. 17(1).
    19. Chen, Lei & Yue, Dong & Dou, Chunxia, 2019. "Optimization on vulnerability analysis and redundancy protection in interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1216-1226.
    20. Zhang, Wen-Yao & Wei, Zong-Wen & Wang, Bing-Hong & Han, Xiao-Pu, 2016. "Measuring mixing patterns in complex networks by Spearman rank correlation coefficient," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 451(C), pages 440-450.

    More about this item

    Keywords

    Small worlds; social networks; review.;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:99-12-080. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thomas Krichel (email available below). General contact details of provider: https://edirc.repec.org/data/epstfus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.