Introduction to the Theory of Computation
Introduction to the Theory of Computation
Power-Law Distributions in Empirical Data
SIAM Review
Complexity
A quantitative measure, mechanism and attractor for self-organization in networked complex systems
IWSOS'12 Proceedings of the 6th IFIP TC 6 international conference on Self-Organizing Systems
Hi-index | 0.00 |
Natural networks are considered as thermodynamic systems that evolve from one state to another by consuming free energy. The least-time consumption of free energy is found to result in ubiquitous scale-free characteristics. The network evolution will yield the scale-independent qualities because the least-time imperative will prefer attachment of nodes that contribute most to the free-energy consumption. The analysis of evolutionary equation of motion, derived from statistical physics of open systems, reveals that evolution of natural networks is a path-dependent and nondeterministic process. Despite the noncomputability of evolution, many mathematical models of networks can be recognized as approximations of the least-time process as well as many measures of networks can be appreciated as practical assessments of the system's thermodynamic status. © 2012 Wiley Periodicals, Inc. Complexity, 2012 © 2012 Wiley Periodicals, Inc.