IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0051883.html
   My bibliography  Save this article

Dense Percolation in Large-Scale Mean-Field Random Networks Is Provably “Explosive”

Author

Listed:
  • Alexander Veremyev
  • Vladimir Boginski
  • Pavlo A Krokhmal
  • David E Jeffcoat

Abstract

Recent reports suggest that evolving large-scale networks exhibit “explosive percolation”: a large fraction of nodes suddenly becomes connected when sufficiently many links have formed in a network. This phase transition has been shown to be continuous (second-order) for most random network formation processes, including classical mean-field random networks and their modifications. We study a related yet different phenomenon referred to as dense percolation, which occurs when a network is already connected, but a large group of nodes must be dense enough, i.e., have at least a certain minimum required percentage of possible links, to form a “highly connected” cluster. Such clusters have been considered in various contexts, including the recently introduced network modularity principle in biological networks. We prove that, contrary to the traditionally defined percolation transition, dense percolation transition is discontinuous (first-order) under the classical mean-field network formation process (with no modifications); therefore, there is not only quantitative, but also qualitative difference between regular and dense percolation transitions. Moreover, the size of the largest dense (highly connected) cluster in a mean-field random network is explicitly characterized by rigorously proven tight asymptotic bounds, which turn out to naturally extend the previously derived formula for the size of the largest clique (a cluster with all possible links) in such a network. We also briefly discuss possible implications of the obtained mathematical results on studying first-order phase transitions in real-world linked systems.

Suggested Citation

  • Alexander Veremyev & Vladimir Boginski & Pavlo A Krokhmal & David E Jeffcoat, 2012. "Dense Percolation in Large-Scale Mean-Field Random Networks Is Provably “Explosive”," PLOS ONE, Public Library of Science, vol. 7(12), pages 1-14, December.
  • Handle: RePEc:plo:pone00:0051883
    DOI: 10.1371/journal.pone.0051883
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0051883
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0051883&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0051883?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
    ---><---

    Citations

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


    Cited by:

    1. Bastas, N. & Giazitzidis, P. & Maragakis, M. & Kosmidis, K., 2014. "Explosive percolation: Unusual transitions of a simple model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 407(C), pages 54-65.
    2. Alexander Veremyev & Oleg A. Prokopyev & Sergiy Butenko & Eduardo L. Pasiliao, 2016. "Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs," Computational Optimization and Applications, Springer, vol. 64(1), pages 177-214, May.

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0051883. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.