Optimization and Scale-freeness for Complex Networks

Details Optimization and Scale-freeness for Complex Networks Optimization and Scale-freeness for Complex Networks

2007-12-14

arxiv.org/abs/0712.2349v1

Chaos 17, 2 (2007)

Physics

Condensed Matter

Statistical Mechanics

8 pages, 4 figures

Scientific paper

10.1063/1.2720101

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.

Affiliated with

Also associated with

No associations

Rating

Optimization and Scale-freeness for Complex Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimization and Scale-freeness for Complex Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimization and Scale-freeness for Complex Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-662618