Spectral Perturbation and Reconstructability of Complex Networks

Details Spectral Perturbation and Reconstructability of Complex Networks Spectral Perturbation and Reconstructability of Complex Networks

2010-10-22

arxiv.org/abs/1010.4702v1

Physical Review E, 81, 016101(2010)

Physics

Condensed Matter

Statistical Mechanics

9 pages, 10 figures

Scientific paper

10.1103/PhysRevE.81.016101

In recent years, many network perturbation techniques, such as topological perturbations and service perturbations, were employed to study and improve the robustness of complex networks. However, there is no general way to evaluate the network robustness. In this paper, we propose a new global measure for a network, the reconstructability coefficient {\theta}, defined as the maximum number of eigenvalues that can be removed, subject to the condition that the adjacency matrix can be reconstructed exactly. Our main finding is that a linear scaling law, E[{\theta}]=aN, seems universal, in that it holds for all networks that we have studied.

Affiliated with

Also associated with

No associations

Rating

Spectral Perturbation and Reconstructability of 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 Spectral Perturbation and Reconstructability of Complex Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spectral Perturbation and Reconstructability of Complex Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-660003