In 1998, Watts and Strogatz proposed the concept of the small world network, and the establishment of the WS model. The empirical results show that most real networks have small world (the smaller the shortest path) and clustering properties (high clustering coefficient). WS small-world model construction algorithm 1, from the rules FIG: consider a nearest neighbor coupling network with N points, they are surrounded by a ring, wherein each node and its left and right adjacent to each of K/2 connected to the node, K is an even number. The 2 randomized reconnection: randomly with probability p from the new connection on each side of the network, coming section of one of the endpoints remain unchanged, while the other endpoint is taken as the random selection of a node in the network. Which states that between any two different nodes can have at most one edge, and each node can not be connected to its own side.

small world networks\ws.fig
....................\ws_n=16_k=2_p=0.1.fig
....................\ws_n=16_k=2_p=0.fig
....................\ws_n=16_k=2_p=1.fig
....................\WS与NW两种小世界网络模型的建模及仿真研究.pdf
....................\WS小世界网络模型构造实践报告.doc
....................\代码\ws.m
....................\....\ws_net.m
....................\小世界网络--中文.pdf
....................\小世界网络--英文.pdf
....................\代码
small world networks

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．