IDEAS home Printed from https://ideas.repec.org/a/cup/netsci/v2y2014i03p387-402_00.html
   My bibliography  Save this article

Mid size cliques are more common in real world networks than triangles

Author

Listed:
  • SLATER, NOA
  • ITZCHACK, ROYI
  • LOUZOUN, YORAM

Abstract

Real world networks typically have large clustering coefficients. The clustering coefficient can be interpreted to be the result of a triangle closing mechanism. We have here enumerated cliques and maximal cliques in multiple networks to show that real world networks have a high number of large cliques. While triangles are more frequent than expected, large cliques are much more over-expressed, and the largest difference between real world networks and their random counterpart occurs in many networks at clique sizes of 5–7, and not at a size of 3. This does not result from the existence of few very large cliques, since a similar feature is observed when studying only maximal cliques (cliques that are not contained in other larger cliques). Moreover, when the large cliques are removed, triangles are often under-expressed. In all networks studied but one, all node members of large cliques produce a single connected component, which represent the central “core†of the network. The observed clique distribution can be explained by multiple models, mainly hidden variables model, such as the gravitation model, or the collapse of bipartite networks. These models can explain other properties of these networks, including the sub-graph distribution and the distance distribution of the networks. This suggests that node connectivity in real world networks may be determined by the similarity between the contents of the networks' nodes. This is in contrast with models of network formation that incorporate only the properties of the network, and not the internal properties of the nodes.

Suggested Citation

  • Slater, Noa & Itzchack, Royi & Louzoun, Yoram, 2014. "Mid size cliques are more common in real world networks than triangles," Network Science, Cambridge University Press, vol. 2(3), pages 387-402, December.
  • Handle: RePEc:cup:netsci:v:2:y:2014:i:03:p:387-402_00
    as

    Download full text from publisher

    File URL: https://www.cambridge.org/core/product/identifier/S2050124214000228/type/journal_article
    File Function: link to article abstract page
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Li, Jin-Yue & Li, Xiang & Li, Cong, 2021. "The Kronecker-clique model for higher-order clustering coefficients," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 582(C).

    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:cup:netsci:v:2:y:2014:i:03:p:387-402_00. 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: Kirk Stebbing (email available below). General contact details of provider: https://www.cambridge.org/nws .

    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.