Optimization and Scale-freeness for Complex Networks
arXiv:0712.2349 · doi:10.1063/1.2720101
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.
8 pages, 4 figures
References in corpus (10)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The large-scale organization of metabolic networks
- Scale-free Networks from Optimal Design
- Statistical ensemble of scale-free random graphs
- Nonextensive aspects of self-organized scale-free gas-like networks
- Self Organized Scale-Free Networks from Merging and Regeneration
- Finite size scaling of the balls in boxes model
- Models and average properties of scale-free directed networks
- Scale-freeness for networks as a degenerate ground state: A Hamiltonian formulation