pith. sign in

arxiv: cond-mat/0206570 · v1 · submitted 2002-06-28 · ❄️ cond-mat.stat-mech

Phase transitions in a network with range dependent connection probability

classification ❄️ cond-mat.stat-mech
keywords networkbehaviourdeltaphasetransitionsclusteringcoefficientsconnections
0
0 comments X
read the original abstract

We consider a one-dimensional network in which the nodes at Euclidean distance $l$ can have long range connections with a probabilty $P(l) \sim l^{-\delta}$ in addition to nearest neighbour connections. This system has been shown to exhibit small world behaviour for $\delta < 2$ above which its behaviour 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 indicate 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 behaviour of a single quantity, the average bond length. The phase transitions in all dimensions are non-trivial in nature.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.