Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Network clustering coefficient without degree-correlation biases

Sara Nadiv Soffer and Alexei Vázquez
Phys. Rev. E 71, 057101 – Published 13 May 2005
PDFHTMLExport Citation
Abstract
Authors
Article Text
  • ACKNOWLEDGEMENTS
    • References

    Abstract

    The clustering coefficient quantifies how well connected are the neighbors of a vertex in a graph. In real networks it decreases with the vertex degree, which has been taken as a signature of the network hierarchical structure. Here we show that this signature of hierarchical structure is a consequence of degree-correlation biases in the clustering coefficient definition. We introduce a definition in which the degree-correlation biases are filtered out, and provide evidence that in real networks the clustering coefficient is constant or decays logarithmically with vertex degree.

    • Figure
    • Figure
    • Figure
    • Received 26 September 2004

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

    ©2005 American Physical Society

    Authors & Affiliations

    Sara Nadiv Soffer1 and Alexei Vázquez2

    • 1Department of Mathematics, Rutgers University Piscataway, New Jersey 08854, USA
    • 2Department of Physics and Center for Complex Network Research, University of Notre Dame, Notre Dame, Indiana 46556, USA

    Article Text (Subscription Required)

    Click to Expand

    References (Subscription Required)

    Click to Expand
    Issue

    Vol. 71, Iss. 5 — May 2005

    Reuse & Permissions
    Access Options
    Author publication services for translation and copyediting assistance advertisement

    Authorization Required

    Log In
    Other Options
    ×

    Images

    • Figure 1
      Figure 1
      Double star with two vertices, 1 and 2, connected to N−2 other vertices. The neighbors of vertex 1 (or 2) are connected as most as their degrees allow. Yet, with the usual definition of clustering coefficient we obtain c1=O(1∕N), approaching zero in the limit N⪢1.Reuse & Permissions
    • Figure 2
      Figure 2
      Algorithm to compute ωi. (a) A vertex i (open circle) is connected to five neighbors (filled circles) with degree sequence {8,7,2,2,2}. (b) Since each neighbor can be connected at most with four other neighbors, we replace the neighbors degree sequence (lowest row) by {4,4,1,1,1} (middle row). It is easy to see that after connecting the first neighbor to all others, we get four triangles and three extra edges that cannot be used anymore (upper row). Summarizing, for this example, ωi=4, Ωi=5 and (52)=10. (c) Subgraph with maximum number of edges among the neighbors, with ci=0.4 and c̃i=1.Reuse & Permissions
    • Figure 3
      Figure 3
      Average clustering as a function of the vertex degree, as computed using the usual definition (circles), our definition approximating ωi by Ωi (squares), and our definition using ωi (triangles). The graphs are shown in increasing order of their assortativity, with the most disassortative graph on the top, and the more assortative graph on the bottom.Reuse & Permissions
    ×

    Sign up to receive regular email alerts from Physical Review E

    Log In

    Cancel
    ×

    Search

    Article Lookup

    Paste a citation or DOI
    Enter a citation
    ×