IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v389y2010i15p2920-2929.html
   My bibliography  Save this article

Percolation on bipartite scale-free networks

Author

Listed:
  • Hooyberghs, H.
  • Van Schaeybroeck, B.
  • Indekeu, J.O.

Abstract

Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real-life systems. In this work, such process is applied to networks consisting of two types of nodes with edges running only between nodes of unlike type. Such bipartite graphs appear in many social networks, for instance in affiliation networks and in sexual-contact networks in which both types of nodes show the scale-free characteristic for the degree distribution. During the depreciation process, an edge between nodes with degrees k and q is retained with a probability proportional to (kq)−α, where α is positive so that links between hubs are more prone to failure. The removal process is studied analytically by introducing a generating functions theory. We deduce exact self-consistent equations describing the system at a macroscopic level and discuss the percolation transition. Critical exponents are obtained by exploiting the Fortuin–Kasteleyn construction which provides a link between our model and a limit of the Potts model.

Suggested Citation

  • Hooyberghs, H. & Van Schaeybroeck, B. & Indekeu, J.O., 2010. "Percolation on bipartite scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(15), pages 2920-2929.
    • Handle: RePEc:eee:phsmap:v:389:y:2010:i:15:p:2920-2929
    DOI: 10.1016/j.physa.2009.12.068
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437110000336
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2009.12.068?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li, Yang & Wu, Jialu & Xiao, Yunjiang & Hu, Hangqi & Wang, Wei & Chen, Jun, 2024. "Resilience analysis of highway network under rainfall using a data-driven percolation theory-based method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 638(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:389:y:2010:i:15:p:2920-2929. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.