Entropy Optimization of Scale-Free Networks Robustness to Random Failures

Details Entropy Optimization of Scale-Free Networks Robustness to Random Failures Entropy Optimization of Scale-Free Networks Robustness to Random Failures

2005-06-28

arxiv.org/abs/cond-mat/0506725v5

Physics

Condensed Matter

Disordered Systems and Neural Networks

9 pages, 5 figures, accepted by Physica A

Scientific paper

10.1016/j.physa.2005.08.025

Many networks are characterized by highly heterogeneous distributions of links, which are called scale-free networks and the degree distributions follow $p(k)\sim ck^{-\alpha}$. We study the robustness of scale-free networks to random failures from the character of their heterogeneity. Entropy of the degree distribution can be an average measure of a network's heterogeneity. Optimization of scale-free network robustness to random failures with average connectivity constant is equivalent to maximize the entropy of the degree distribution. By examining the relationship of entropy of the degree distribution, scaling exponent and the minimal connectivity, we get the optimal design of scale-free network to random failures. We conclude that entropy of the degree distribution is an effective measure of network's resilience to random failures.

Affiliated with

Also associated with

No associations

Rating

Entropy Optimization of Scale-Free Networks Robustness to Random Failures 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 Entropy Optimization of Scale-Free Networks Robustness to Random Failures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Entropy Optimization of Scale-Free Networks Robustness to Random Failures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-434191