Small World Network 284 浏览 1关注

A small-world network is a type of Graph (mathematics)|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. 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: :L \propto \log N In the context of a social network, this results in 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, wikis such as Wikipedia, and gene regulatory network|gene networks all exhibit small-world network characteristics. A certain category of small-world networks were identified as a class of random graphs by Duncan J. Watts|Duncan Watts and Steven Strogatz in 1998. They noted that...
 相关概念
 主要的会议/期刊 CORR IPDPS(I... PODC IJON Complex ICNC ICIC GECCO