Optimization and scale-freeness for complex networks

DOI10.1063/1.2720101MaRDI QIDQ3624830zbMATH OpenOpenAlexWikidataFDO

Authors Petter Minnhagen, S. Bernhardsson

Publication date 30 April 2009

Published in Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0712.2349

Mathematics Subject Classification ID

Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45)

Abstract: Complex networks are mapped to a model of boxes and balls where the balls are distinguishable. It is shown that the scale-free size distribution of boxes maximizes the information associated with the boxes provided configurations including boxes containing a finite fraction of the total amount of balls are excluded. It is conjectured that for a connected network with only links between different nodes, the nodes with a finite fraction of links are effectively suppressed. It is hence suggested that for such networks the scale-free node-size distribution maximizes the information encoded on the nodes. The noise associated with the size distributions is also obtained from a maximum entropy principle. Finally explicit predictions from our least bias approach are found to be born out by metabolic networks.

Cites work

• Complex networks: structure and dynamics
• Emergence of Scaling in Random Networks
• Information Theory and Statistical Mechanics
• Scale-freeness for networks as a degenerate ground state: a Hamiltonian formulation
• Statistical mechanics of complex networks

Cited in

(7)

• The asymptotic optimality of spider-web networks
• Introduction: Optimization in networks
• Optimization, Learning, and Control for Interdependent Complex Networks
• Generating Massive Scale-Free Networks under Resource Constraints
• scientific article; zbMATH DE number 5070368 (Why is no real title available?)
• Scaling: a canonical design problem for networks
• The structure entropy of social networks

This page was built for publication: Optimization and scale-freeness for complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624830)