×

Geometric phase-transition on systems with sparse long-range connections. (English) Zbl 0978.82034

Summary: Small-world networks are regular structures with a fraction \(p\) of regular connections per site replaced by totally random ones (“shortcuts”). This kind of structure seems to be present on networks arising in nature and technology. In this work we show that the small-world transition is a first-order transition at zero density \(p\) of shortcuts, whereby the normalized shortest-path distance \(L=\overline{\ell}/L\) undergoes a discontinuity in the thermodynamic limit. On finite systems the apparent transition is shifted by \(\Delta p\sim L^{-d}\). Equivalently a “persistence size” \(L^*\sim p^{-1/d}\) can be defined in connection with finite-size effects. Assuming \(L^*\sim p^{-\tau}\), simple rescaling arguments imply that \(\tau=1/d\). We confirm this result by extensive numerical simulation in one to four dimensions, and argue that \(\tau=1/d\) implies that this transition is first-order.

MSC:

82B26 Phase transitions (general) in equilibrium statistical mechanics
Full Text: DOI

References:

[1] Watts, D. J.; Strogatz, S. H., Collective dynamics of small-world networks, Nature, 393, 440 (1998) · Zbl 1368.05139
[2] Barthélémy, M.; Amaral, L. A.N., Small-world networks: evidence for a crossover picture, Phys. Rev. Lett., 82, 3180 (1999)
[3] A. Barrat, Comment on ‘Small-world networks: evidence for a crossover picture’, cond-mat/9903323.; A. Barrat, Comment on ‘Small-world networks: evidence for a crossover picture’, cond-mat/9903323.
[4] H. Herzel, How to quantify “small world” networks? Fractals 6 (1998) 4.; H. Herzel, How to quantify “small world” networks? Fractals 6 (1998) 4.
[5] Pandit, S. A.; Amritkar, R. E., Characterization and control of small-world networks, Phys. Rev. E, 60, R1119 (1999)
[6] Monasson, R., Diffusion, localization and dispersion relations on small-world lattices, Eur. Phys. J. B, 12, 555 (1999)
[7] Barrat, A.; Weigt, M., On the properties of small-world network models, Europhys. Lett., 13, 574 (2000)
[8] Newman, M. E.J.; Watts, D. J., Renormalization group analysis of the small-world network model, Phys. Lett. A, 263, 341 (1999) · Zbl 0940.82029
[9] Newman, M. E.J.; Watts, D. J., Scaling and percolation in the small-world network model, Phys. Rev. E, 60, 7332 (1999) · Zbl 0940.82029
[10] C. Moukarzel, M.A. de Menezes, 1999, Infinite Characteristic Length in Small-World Systems, cond-mat/9905131.; C. Moukarzel, M.A. de Menezes, 1999, Infinite Characteristic Length in Small-World Systems, cond-mat/9905131.
[11] Moukarzel, C., Spreading and shortest paths in systems with sparse long-range connections, Phys. Rev. E, 60, R6263 (1999) · Zbl 1062.82507
[12] de Menezes, M. A.; Moukarzel, C. F.; Penna, T. J.P., First-order transition in small-world networks, Europhys. Lett., 50, 5, 574 (2000)
[13] Papadimitriou, C. H.; Sleiglitz, K., Combinatorial Optimization: Algorithms and Complexity (1982), Prentice Hall: Prentice Hall Englewood Cliff, NJ · Zbl 0503.90060
[14] van Leeuwen (Ed.), J., Graph Algorithms - Handbook of Theoretical Computer Science (1990), Elsevier Science Publishers: Elsevier Science Publishers Amsterdam · Zbl 0712.68054
[15] Nienhuis, B.; Nauenberg, M., Phys. Rev. Lett., 35, 477 (1975)
[16] Fisher, M. E.; Berker, A. N., Phys. Rev. B, 26, 2507 (1982)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.