更改

瓦茨-斯托加茨图

瓦茨-斯托加茨图

While the ER model's simplicity has helped it find many applications, it does not accurately describe many real world networks. The ER model fails to generate local clustering and [[triadic closure]]s as often as they are found in real world networks.  Therefore, the [[Watts and Strogatz model]] was proposed, whereby a network is constructed as a regular ring lattice, and then nodes are rewired according to some probability '''β'''.<ref name=WS>{{cite journal

While the ER model's simplicity has helped it find many applications, it does not accurately describe many real world networks. The ER model fails to generate local clustering and [[triadic closure]]s as often as they are found in real world networks.  Therefore, the [[Watts and Strogatz model]] was proposed, whereby a network is constructed as a regular ring lattice, and then nodes are rewired according to some probability '''β'''.<ref name=WS>{{cite journal

While the ER model's simplicity has helped it find many applications, it does not accurately describe many real world networks. The ER model fails to generate local clustering and triadic closures as often as they are found in real world networks.  Therefore, the Watts and Strogatz model was proposed, whereby a network is constructed as a regular ring lattice, and then nodes are rewired according to some probability β.<ref name=WS>{{cite journal

While the ER model's simplicity has helped it find many applications, it does not accurately describe many real world networks. The ER model fails to generate local clustering and triadic closures as often as they are found in real world networks.  Therefore, the Watts and Strogatz model was proposed, whereby a network is constructed as a regular ring lattice, and then nodes are rewired according to some probability β.<ref name=WS>{{cite journal

尽管 ER 模型的简单性帮助它找到了许多应用之处，但它并不能准确地描述许多真实世界的网络。ER 模型不能产生现实网络中常见的局部聚类和三元闭包。为此提出了 Watts-Strogatz 模型，将网络构造成规则的环网格，然后根据一定的概率'''β'''重新连接节点。 引用名称 ws { cite journal

ws { cite journal

  | author1 = Watts, D.J.

  | author1 = Watts, D.J.

数学 p (k) sim k ^ {- gamma } / math

数学 p (k) sim k ^ {- gamma } / math

 

This exponent turns out to be approximately 3 for many real world networks, however, it is not a universal constant and depends continuously on the network's parameters <ref name=Barabasi2000>{{Cite journal

This exponent turns out to be approximately 3 for many real world networks, however, it is not a universal constant and depends continuously on the network's parameters <ref name=Barabasi2000>{{Cite journal

This exponent turns out to be approximately 3 for many real world networks, however, it is not a universal constant and depends continuously on the network's parameters <ref name=Barabasi2000>{{Cite journal

This exponent turns out to be approximately 3 for many real world networks, however, it is not a universal constant and depends continuously on the network's parameters <ref name=Barabasi2000>{{Cite journal

对于许多现实世界的网络来说，这个指数大约是3。然而，它不是一个通用常数，并且连续地依赖于网络的参数。 barabasi2000{ Cite journal

barabasi2000{ Cite journal

| url = http://nd.edu/~networks/Publication%20Categories/03%20Journal%20Articles/Physics/Universality_Physical%20Rev%20Ltrs%2085,%205234%20(2000).pdf

| url = http://nd.edu/~networks/Publication%20Categories/03%20Journal%20Articles/Physics/Universality_Physical%20Rev%20Ltrs%2085,%205234%20(2000).pdf