Phase transitions in a network with range dependent connection probability
Parongama Sen, Kinjal Banerjee, Turbasu Biswas

TL;DR
This paper investigates phase transitions in a one-dimensional network with distance-dependent connection probabilities, revealing a continuous transition at a critical exponent and demonstrating that these phenomena are observable across dimensions through average bond length behavior.
Contribution
It identifies a continuous phase transition at a specific exponent in a range-dependent network and shows this transition can be detected via average bond length in any dimension.
Findings
Transition to small world behavior for < 2
Transition to a random network at = 1
Phase transitions are non-trivial across all dimensions
Abstract
We consider a one-dimensional network in which the nodes at Euclidean distance can have long range connections with a probabilty in addition to nearest neighbour connections. This system has been shown to exhibit small world behaviour for 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 . 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
