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

Detectability constraints on meso-scale structure in complex networks

Author

Listed:
  • Rudy Arthur

Abstract

Community, core-periphery, disassortative and other node partitions allow us to understand the organisation and function of large networks. In this work we study common meso-scale structures using the idea of block modularity. We find that the configuration model imposes strong restrictions on core-periphery and related structures in directed and undirected networks. We derive inequalities expressing when such structures can be detected under the configuration model which are closely related to the resolution limit. Nestedness is closely related to core-periphery and is similarly restricted to only be detectable under certain conditions. We then derive a general equivalence between optimising block modularity and maximum likelihood estimation of the parameters of the degree corrected Stochastic Block Model. This allows us to contrast the two approaches, how they formalise the structure detection problem and understand these constraints in inferential versus descriptive approaches to meso-scale structure detection.

Suggested Citation

  • Rudy Arthur, 2025. "Detectability constraints on meso-scale structure in complex networks," PLOS ONE, Public Library of Science, vol. 20(1), pages 1-25, January.
  • Handle: RePEc:plo:pone00:0317670
    DOI: 10.1371/journal.pone.0317670
    as

    Download full text from publisher

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

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

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

    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:0317670. 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.