Export citation

Export citation

Choose format for download:

Download Citation

    Degree correlations in graphs with clique clustering

    Peter Mann*, V. Anne Smith, John B. O. Mitchell, and Simon Dobson

    • School of Computer Science, University of St Andrews, St Andrews, Fife KY16 9SX, United Kingdom; School of Chemistry, University of St Andrews, St Andrews, Fife KY16 9ST, United Kingdom; and School of Biology, University of St Andrews, St Andrews, Fife KY16 9TH, United Kingdom

    • *pm78@st-andrews.ac.uk

    Phys. Rev. E 105, 044314 – Published 20 April, 2022

    DOI: https://doi.org/10.1103/PhysRevE.105.044314

    Abstract

    Correlations among the degrees of vertices in random graphs often occur when clustering is present. In this paper we define a joint-degree correlation function for vertices in the giant component of clustered configuration model networks which are composed of clique subgraphs. We use this model to investigate, in detail, the organization among nearest-neighbor subgraphs for random graphs as a function of subgraph topology as well as clustering. We find an expression for the average joint degree of a neighbor in the giant component at the critical point for these networks. Finally, we introduce a novel edge-disjoint clique decomposition algorithm and investigate the correlations between the subgraphs of empirical networks.

    Physics Subject Headings (PhySH)

    Authorization Required

    We need you to provide your credentials before accessing this content.

    References (Subscription Required)

    Outline

    Information

    Sign In to Your Journals Account

    Filter

    Filter

    Article Lookup

    Enter a citation