198
个编辑
更改
跳到导航
跳到搜索
第386行：
第386行： − − === Watts–Strogatz small world model === − [[File:Watts-Strogatz-rewire.png|thumb|The [[Watts and Strogatz model]] uses the concept of rewiring to achieve its structure. The model generator will iterate through each edge in the original lattice structure. An edge may changed its connected vertices according to a given rewiring probability. <math>\langle k\rangle = 4</math> in this example.]] − The [[Watts and Strogatz model]] is a random graph generation model that produces graphs with [[small-world properties]]. − − An initial lattice structure is used to generate a Watts–Strogatz model. Each node in the network is initially linked to its <math>\langle k\rangle</math> closest neighbors. Another parameter is specified as the rewiring probability. Each edge has a probability <math>p</math> that it will be rewired to the graph as a random edge. The expected number of rewired links in the model is <math>pE = pN\langle k\rangle/2</math>. − − As the Watts–Strogatz model begins as non-random lattice structure, it has a very high clustering coefficient along with high average path length. Each rewire is likely to create a shortcut between highly connected clusters. As the rewiring probability increases, the clustering coefficient decreases slower than the average path length. In effect, this allows the average path length of the network to decrease significantly with only slightly decreases in clustering coefficient. Higher values of p force more rewired edges, which in effect makes the Watts–Strogatz model a random network. −
→Watts–Strogatz small world model
对于出分量。
对于出分量。
=== Watts–Strogatz 小世界模型 ===
=== Watts–Strogatz 小世界模型 ===