Small-world network
A small-world network is a type of mathematical graph in which most nodes are not neighbors of one another, but the neighbors of any given node are likely to be neighbors of each other and most nodes can be reached from every other node by a small number of hops or steps. Specifically, a small-world network is defined to be a network where the typical distance L between two randomly chosen nodes (the number of steps required) grows proportionally to the logarithm of the number of nodes N in the network, that is:
Small-world network - Wikipedia Jump to content From Wikipedia, the free encyclopedia Graph where most nodes are reachable in a small number of steps ''Hubs'' are bigger than other nodes"},"image1":{"wt":"Small-world-network-example.png"},"alt1":{"wt":""},"caption1":{"wt":"Average [[Degree (graph theory)|degree]]= 3.833<br />Average shortest path length = 1.803.<br />[[Clustering coefficient]] = 0.522"},"image2":{"wt":"Random graph gephi.png"},"alt2":{"wt":""},"caption2":{"wt":"Random graph<br/>Average [[Degree (graph theory)|degree]] = 2.833 <br/>Average shortest path length = 2.109.<br/>[[Cl
Explore this link on the map →related reading
- Small-world experiment - Wikipediaen.wikipedia.org
- Six degrees of separation - Wikipediaen.wikipedia.org
- Going Critical — Melting Asphaltmeltingasphalt.com
- What's The Story With HNSW? | Towards Data Sciencetowardsdatascience.com
- Towards Small-Scale Socialnotes.hyperlink.academy
- Networks, Crowds, and Markets: A Book by David Easley and Jon Kleinbergcs.cornell.edu
- Zoom In: An Introduction to Circuitsdistill.pub
- How to run a small social network site for your friendsrunyourown.social
- Betweenness centrality - Wikipediaen.wikipedia.org
- Paper Trailspapertrailshq.com
- Metcalfe's law - Wikipediaen.wikipedia.org
- Centrality - Wikipediaen.wikipedia.org