Measuring degree-dependent failure in scale-free networks of bipartite structure
by Yilun Shang
International Journal of Simulation and Process Modelling (IJSPM), Vol. 8, No. 1, 2013

Abstract: We study degree-dependent failure in networks consisting of two types of nodes with edges running only between nodes of unlike type. Both types of nodes are assumed to have scale-free degree distributions. These networks are called scale-free bipartite graphs, which appear in many real-life networks. In this article, we measure network robustness and fragility based on a recently proposed spectral measure, natural connectivity, which is an average eigenvalue obtained from the graph spectrum. During the edge removal process, an edge between nodes with degrees k and l is retained with a probability proportional to (kl), where α > 0 is a biased exponent, so that the most connected nodes are depreciated first. A clear division between robust regime and fragile regime can be extracted based on natural connectivity by tuning the exponent α. The theory is verified by the numerical simulations.

Online publication date: Fri, 13-Sep-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Simulation and Process Modelling (IJSPM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com