Small-World Network: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
=Definition= | =Definition= | ||
| Line 9: | Line 8: | ||
Many empirical graphs are well modeled by small-world networks. Social networks, the connectivity of the Internet, and gene networks all exhibit small-world network characteristics." | Many empirical graphs are well modeled by small-world networks. Social networks, the connectivity of the Internet, and gene networks all exhibit small-world network characteristics." | ||
(http://en.wikipedia.org/wiki/Small-world_network) | (http://en.wikipedia.org/wiki/Small-world_network) | ||
=More Information= | |||
#[[Network Theory]] | |||
#[[Network Typology]] | |||
#[[Scale-Free Networks]] | |||
Latest revision as of 11:12, 14 September 2007
Definition
From the Wikipedia [1]:
"In mathematics and physics, a small-world network is a type of mathematical graph in which most nodes are not neighbors of one another, but most nodes can be reached from every other by a small number of hops or steps. A small world network, where nodes represent people and edges connect people that know each other, captures the small world phenomenon of strangers being linked by a mutual acquaintance.
Many empirical graphs are well modeled by small-world networks. Social networks, the connectivity of the Internet, and gene networks all exhibit small-world network characteristics." (http://en.wikipedia.org/wiki/Small-world_network)