Clustering coefficient

Measure of how connected and clustered a node is in its graph

In graph theory, a clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. Evidence suggests that in most real-world networks, and in particular social networks, nodes tend to create tightly knit groups characterised by a relatively high density of ties; this likelihood tends to be greater than the average probability of a tie randomly established between two nodes (Holland and Leinhardt, 1971;[1] Watts and Strogatz, 1998[2]).

Two versions of this measure exist: the global and the local. The global version was designed to give an overall indication of the clustering in the network, whereas the local gives an indication of the extent of "clustering" of a single node.

## Local clustering coefficient

[edit]

Example local clustering coefficient on an undirected graph. The local clustering coefficient of the blue node is computed as the proportion of connections among its neighbours which are actually realised compared with the number of all possible connections. In the figure, the blue node has three neighbours, which can have a maximum of 3 connections among them. In the top part of the figure all three possible connections are realised (thick black segments), giving a local clustering coefficient of 1. In the middle part of the figure only one connection is realised (thick black line) and 2 connections are missing (dotted red lines), giving a local cluster coefficient of 1/3. Finally, none of the possible connections among the neighbours of the blue node are realised, producing a local clustering coefficient value of 0.

The local clustering coefficient of a vertex (node) in a graph quantifies how close its neighbours are to being a clique (complete graph). Duncan J. Watts and Steven Strogatz introduced the measure in 1998 to determine whether a graph is a small-world network.

A graph  G = ( V , E ) {\displaystyle G=(V,E)} formally consists of a set of vertices  V {\displaystyle V} and a set of edges  E {\displaystyle E} between them. An edge  e i j {\displaystyle e_{ij}} connects vertex  v i {\displaystyle v_{i}} with vertex  v j {\displaystyle v_{j}} .

The neighborhood N i {\displaystyle N_{i}} for a vertex  v i {\displaystyle v_{i}} is defined as its immediately connected neighbours as follows:

N i = { v j : e i j ∈ E ∨ e j i ∈ E } . {\displaystyle N_{i}=\\{v_{j}:e_{ij}\in E\lor e_{ji}\in E\\}.}

We define  k i {\displaystyle k_{i}} as the number of vertices,  | N i | {\displaystyle |N_{i}|} , in the neighbourhood,  N i {\displaystyle N_{i}} , of vertex  v i {\displaystyle v_{i}} .

The local clustering coefficient  C i {\displaystyle C_{i}} for a vertex  v i {\displaystyle v_{i}} is then given by a proportion of the number of links between the vertices within its neighbourhood divided by the number of links that could possibly exist between them. For a directed graph,  e i j {\displaystyle e_{ij}} is distinct from  e j i {\displaystyle e_{ji}} , and therefore for each neighbourhood  N i {\displaystyle N_{i}} there are  k i ( k i − 1 ) {\displaystyle k_{i}(k_{i}-1)} links that could exist among the vertices within the neighbourhood ( k i {\displaystyle k_{i}} is the number of neighbours of a vertex). Thus, the local clustering coefficient for directed graphs is given as [2]

C i = | { e j k : v j , v k ∈ N i , e j k ∈ E } | k i ( k i − 1 ) . {\displaystyle C_{i}={\frac {|\\{e_{jk}:v_{j},v_{k}\in N_{i},e_{jk}\in E\\}|}{k_{i}(k_{i}-1)}}.}

An undirected graph has the property that  e i j {\displaystyle e_{ij}} and  e j i {\displaystyle e_{ji}} are considered identical. Therefore, if a vertex  v i {\displaystyle v_{i}} has  k i {\displaystyle k_{i}} neighbours,  k i ( k i − 1 ) 2 {\displaystyle {\frac {k_{i}(k_{i}-1)}{2}}} edges could exist among the vertices within the neighbourhood. Thus, the local clustering coefficient for undirected graphs can be defined as

C i = 2 | { e j k : v j , v k ∈ N i , e j k ∈ E } | k i ( k i − 1 ) . {\displaystyle C_{i}={\frac {2|\\{e_{jk}:v_{j},v_{k}\in N_{i},e_{jk}\in E\\}|}{k_{i}(k_{i}-1)}}.}

Let  λ G ( v ) {\displaystyle \lambda _{G}(v)} be the number of triangles on  v ∈ V ( G ) {\displaystyle v\in V(G)} for undirected graph  G {\displaystyle G} . That is,  λ G ( v ) {\displaystyle \lambda _{G}(v)} is the number of subgraphs of  G {\displaystyle G} with 3 edges and 3 vertices, one of which is  v {\displaystyle v} . Let  τ G ( v ) {\displaystyle \tau _{G}(v)} be the number of triples on  v ∈ G {\displaystyle v\in G} . That is,  τ G ( v ) {\displaystyle \tau _{G}(v)} is the number of subgraphs (not necessarily induced) with 2 edges and 3 vertices, one of which is  v {\displaystyle v} and such that  v {\displaystyle v} is incident to both edges. Then we can also define the clustering coefficient as

C i = λ G ( v ) τ G ( v ) . {\displaystyle C_{i}={\frac {\lambda _{G}(v)}{\tau _{G}(v)}}.}

It is simple to show that the two preceding definitions are the same, since

τ G ( v ) = C ( k i , 2 ) = 1 2 k i ( k i − 1 ) . {\displaystyle \tau _{G}(v)=C({k_{i}},2)={\frac {1}{2}}k_{i}(k_{i}-1).}

These measures are 1 if every neighbour connected to  v i {\displaystyle v_{i}} is also connected to every other vertex within the neighbourhood, and 0 if no vertex that is connected to  v i {\displaystyle v_{i}} connects to any other vertex that is connected to  v i {\displaystyle v_{i}} .

Since any graph is fully specified by its adjacency matrix A, the local clustering coefficient for a simple undirected graph can be expressed in terms of A as:[3]

C i = 1 k i ( k i − 1 ) ∑ j , k A i j A j k A k i {\displaystyle C_{i}={\frac {1}{k_{i}(k_{i}-1)}}\sum _{j,k}A_{ij}A_{jk}A_{ki}}

where:

k i = ∑ j A i j {\displaystyle k_{i}=\sum _{j}A_{ij}}

and Ci=0 when ki is zero or one. In the above expression, the numerator counts twice the number of complete triangles that vertex i is involved in. In the denominator, ki2 counts the number of edge pairs that vertex i is involved in plus the number of single edges traversed twice. ki is the number of edges connected to vertex i, and subtracting ki then removes the latter, leaving only a set of edge pairs that could conceivably be connected into triangles. For every such edge pair, there will be another edge pair which could form the same triangle, so the denominator counts twice the number of conceivable triangles that vertex i could be involved in.

## Global clustering coefficient

[edit]

The global clustering coefficient is based on triplets of nodes. A triplet is three nodes that are connected by either two (open triplet) or three (closed triplet) undirected ties. A triangle graph therefore includes three closed triplets, one centred on each of the nodes (n.b. this means the three triplets in a triangle come from overlapping selections of nodes). The global clustering coefficient is the number of closed triplets (or 3 x triangles) over the total number of triplets (both open and closed). The first attempt to measure it was made by Luce and Perry (1949).[4] This measure gives an indication of the clustering in the whole network (global), and can be applied to both undirected and directed networks (often called transitivity, see Wasserman and Faust, 1994, page 243[5]).

The global clustering coefficient is defined as:

C = number of closed triplets number of all triplets (open and closed) {\displaystyle C={\frac {\mbox{number of closed triplets}}{\mbox{number of all triplets (open and closed)}}}} .

The number of closed triplets has also been referred to as 3 × triangles in the literature, so:

C = 3 × number of triangles number of all triplets {\displaystyle C={\frac {3\times {\mbox{number of triangles}}}{\mbox{number of all triplets}}}} .

A generalisation to weighted networks was proposed by Opsahl and Panzarasa (2009),[6] and a redefinition to two-mode networks (both binary and weighted) by Opsahl (2009).[7]

Since any simple graph is fully specified by its adjacency matrix A, the global clustering coefficient for an undirected graph can be expressed in terms of A as:

C = ∑ i , j , k A i j A j k A k i 1 2 ∑ i k i ( k i − 1 ) {\displaystyle C={\frac {\sum _{i,j,k}A_{ij}A_{jk}A_{ki}}{{\frac {1}{2}}\sum _{i}k_{i}(k_{i}-1)}}}

where:

k i = ∑ j A i j {\displaystyle k_{i}=\sum _{j}A_{ij}}

and C=0 when the denominator is zero.

### Network average clustering coefficient

[edit]

As an alternative to the global clustering coefficient, the overall level of clustering in a network is measured by Watts and Strogatz[2] as the average of the local clustering coefficients of all the vertices  n {\displaystyle n} :[8]

C ¯ = 1 n ∑ i = 1 n C i . {\displaystyle {\bar {C}}={\frac {1}{n}}\sum _{i=1}^{n}C_{i}.}

This metric places more weight on the low degree nodes, while the transitivity ratio places more weight on the high degree nodes.

A generalisation to weighted networks was proposed by Barrat et al. (2004),[9] and a redefinition to bipartite graphs (also called two-mode networks) by Latapy et al. (2008)[10] and Opsahl (2009).[7]

Alternative generalisations to weighted and directed graphs have been provided by Fagiolo (2007)[11] and Clemente and Grassi (2018).[12]

This formula is not, by default, defined for graphs with isolated vertices; see Kaiser (2008)[13] and Barmpoutis et al.[14] The networks with the largest possible average clustering coefficient are found to have a modular structure, and at the same time, they have the smallest possible average distance among the different nodes.[14]

## Percolation of clustered networks

[edit]

For a random tree-like network without degree-degree correlation, it can be shown that such network can have a giant component, and the percolation threshold (transmission probability) is given by  p c = 1 g 1 ′ ( 1 ) {\displaystyle p_{c}={\frac {1}{g_{1}'(1)}}} , where  g 1 ( z ) {\displaystyle g_{1}(z)} is the generating function corresponding to the excess degree distribution.

In networks with low clustering,  0 < C ≪ 1 {\displaystyle 0<C\ll 1} , the critical point gets scaled by  ( 1 − C ) − 1 {\displaystyle (1-C)^{-1}} such that:

p c = 1 1 − C 1 g 1 ′ ( 1 ) . {\displaystyle p_{c}={\frac {1}{1-C}}{\frac {1}{g_{1}'(1)}}.} [15]

This indicates that for a given degree distribution, the clustering leads to a larger percolation threshold, mainly because for a fixed number of links, the clustering structure reinforces the core of the network with the price of diluting the global connections. For networks with high clustering, strong clustering could induce the core–periphery structure, in which the core and periphery might percolate at different critical points, and the above approximate treatment is not applicable.[16]

For studying the robustness of clustered networks a percolation approach is developed.[17][18]

## See also

[edit]

* Directed graph
* Graph theory
* Network theory
* Network science
* Percolation theory
* Scale free network
* Small world

## References

[edit]

1. ^ P. W. Holland & S. Leinhardt (1971). "Transitivity in structural models of small groups". Comparative Group Studies. 2 (2): 107–124\. doi:10.1177/104649647100200201. S2CID 145544488.
2. ^ a b c D. J. Watts & Steven Strogatz (June 1998). "Collective dynamics of 'small-world' networks". Nature. 393 (6684): 440–442\. Bibcode:1998Natur.393..440W. doi:10.1038/30918. PMID 9623998. S2CID 4429113.
3. ^ Wang, Yu; Ghumare, Eshwar; Vandenberghe, Rik; Dupont, Patrick (2017). "Comparison of Different Generalizations of Clustering Coefficient and Local Efficiency for Weighted Undirected Graphs". Neural Computation. 29 (2): 313–331\. doi:10.1162/NECO_a_00914. PMID 27870616. S2CID 11000115. Archived from the original on August 10, 2020. Retrieved August 8, 2020.
4. ^ R. D. Luce & A. D. Perry (1949). "A method of matrix analysis of group structure". Psychometrika. 14 (1): 95–116\. doi:10.1007/BF02289146. hdl:10.1007/BF02289146. PMID 18152948. S2CID 16186758.
5. ^ Stanley Wasserman, Katherine Faust, 1994. Social Network Analysis: Methods and Applications. Cambridge: Cambridge University Press.
6. ^ Tore Opsahl & Pietro Panzarasa (2009). "Clustering in Weighted Networks". Social Networks. 31 (2): 155–163\. doi:10.1016/j.socnet.2009.02.002. Archived from the original on 2019-07-01. Retrieved 2009-06-11.
7. ^ a b Tore Opsahl (2009). "Clustering in Two-mode Networks". Conference and Workshop on Two-Mode Social Analysis (Sept 30-Oct 2, 2009). Archived from the original on March 21, 2016. Retrieved September 11, 2009.
8. ^ Kemper, Andreas (2009). Valuation of Network Effects in Software Markets: A Complex Networks Approach. Springer. p. 142\. ISBN 9783790823660.
9. ^ Barrat, A.; Barthelemy, M.; Pastor-Satorras, R.; Vespignani, A. (2004). "The architecture of complex weighted networks". Proceedings of the National Academy of Sciences. 101 (11): 3747–3752\. arXiv:cond-mat/0311416. Bibcode:2004PNAS..101.3747B. doi:10.1073/pnas.0400087101. PMC 374315. PMID 15007165.
10. ^ Latapy, M.; Magnien, C.; Del Vecchio, N. (2008). "Basic Notions for the Analysis of Large Two-mode Networks" (PDF). Social Networks. 30 (1): 31–48\. doi:10.1016/j.socnet.2007.04.006.
11. ^ Fagiolo, G. (2007). "Clustering in complex directed networks". Physical Review E. 76 (2 Pt 2): 026107. arXiv:physics/0612169. CiteSeerX 10.1.1.262.1006. doi:10.1103/PhysRevE.76.026107. PMID 17930104. S2CID 2317676.
12. ^ Clemente, G.P.; Grassi, R. (2018). "Directed clustering in weighted networks: A new perspective". Chaos, Solitons & Fractals. 107: 26–38\. arXiv:1706.07322. Bibcode:2018CSF...107...26C. doi:10.1016/j.chaos.2017.12.007. S2CID 21919524.
13. ^ Kaiser, Marcus (2008). "Mean clustering coefficients: the role of isolated nodes and leafs on clustering measures for small-world networks". New Journal of Physics. 10 (8): 083042. arXiv:0802.2512. Bibcode:2008NJPh...10h3042K. doi:10.1088/1367-2630/10/8/083042. S2CID 16480565.
14. ^ a b Barmpoutis, D.; Murray, R. M. (2010). "Networks with the Smallest Average Distance and the Largest Average Clustering". arXiv:1007.4031 [q-bio.MN].
15. ^ Berchenko, Yakir; Artzy-Randrup, Yael; Teicher, Mina; Stone, Lewi (2009-03-30). "Emergence and Size of the Giant Component in Clustered Random Graphs with a Given Degree Distribution". Physical Review Letters. 102 (13): 138701. doi:10.1103/PhysRevLett.102.138701. ISSN 0031-9007. PMID 19392410. Archived from the original on 2023-02-04. Retrieved 2022-02-24.
16. ^ Berchenko, Yakir; Artzy-Randrup, Yael; Teicher, Mina; Stone, Lewi (2009-03-30). "Emergence and Size of the Giant Component in Clustered Random Graphs with a Given Degree Distribution". Physical Review Letters. 102 (13): 138701. doi:10.1103/PhysRevLett.102.138701. ISSN 0031-9007. PMID 19392410. Archived from the original on 2023-02-04. Retrieved 2022-02-24.
17. ^ M. E. J. Newman (2009). "Random Graphs with Clustering". Phys. Rev. Lett. 103 (5): 058701. arXiv:0903.4009. doi:10.1103/PhysRevLett.103.058701. PMID 19792540. S2CID 28214709.
18. ^ A. Hackett; S. Melnik & J. P. Gleeson (2011). "Cascades on a class of clustered random networks". Phys. Rev. E. 83 (5 Pt 2): 056107. arXiv:1012.3651. doi:10.1103/PhysRevE.83.056107. PMID 21728605. S2CID 18071422.

## External links

[edit]

* Media related to Clustering coefficient at Wikimedia Commons