Phase transitions in optimized network models
Authors:
- An-Liang ChengACAn-Liang Cheng
- Pik-Yin LaiPLPik-Yin Lai
- 1 September 2020
- journal article
- research article
- Published by IOP Publishing in Journal of Statistical Mechanics: Theory and Experiment
- Vol. 2020 (9) , 093404
Abstract
We consider network connection growing models that aim at minimizing the wiring cost while at the same time maximizing the network connections. By mapping the system to an Ising spin model, we obtain analytic results for two such models, both of them show interesting, but different phase transition behaviors for general wiring cost distributions. The phase diagrams for these transitions are also obtained. These results are also extended for networks optimized with weighted node degree for connections. Depending on the properties of the edge and node weight distributions, the system can exhibit a variety of phase transitions, including first-order, second-order and hybrid ones, from no connection to a network of finite fraction of connections. Furthermore, mean-field theory leads to an effective algorithm for finding the fully optimized network configurations in these models. All these results are also verified by numerical simulations.Keywords
This publication has 36 references indexed in Scilit:
- Reconstructing networks from dynamics with correlated noisePhysica A: Statistical Mechanics and its Applications, 2018
- Robustness and adaptation reveal plausible cell cycle controlling subnetwork in Saccharomyces cerevisiaeGene, 2013
- The economy of brain network organizationNature Reviews Neuroscience, 2012
- Order-N cluster Monte Carlo method for spin systems with long-range interactionsJournal of Computational Physics, 2009
- Introduction: Optimization in networksChaos: An Interdisciplinary Journal of Nonlinear Science, 2007
- Order Statistics2003
- Exploring complex networksNature, 2001
- The large-scale organization of metabolic networksNature, 2000
- Collective dynamics of ‘small-world’ networksNature, 1998
- Application of statistical mechanics to combinatorial optimization problems: The chromatic number problem andq-partitioning of a graphJournal of Statistical Physics, 1987