Phase transitions in a network with a range-dependent connection probability.
暂无分享,去创建一个
We consider a one-dimensional network in which the nodes at Euclidean distance l can have long range connections with a probability P(l) approximately l(-delta) in addition to nearest neighbor connections. This system has been shown to exhibit small-world behavior for delta<2, above which its behavior is like a regular lattice. From the study of the clustering coefficients, we show that there is a transition to a random network at delta=1. The finite size scaling analysis of the clustering coefficients obtained from numerical simulations indicates that a continuous phase transition occurs at this point. Using these results, we find that the two transitions occurring in this network can be detected in any dimension by the behavior of a single quantity, the average bond length. The phase transitions in all dimensions are nontrivial in nature.
[1] Gesine Reinert,et al. Small worlds , 2001, Random Struct. Algorithms.