Relative Clustering Coefficient

2021/06/09 by Elena Farahbakhsh Touli, Touli, Elena Farahbakhsh, Oscar Lindberg +1
Computer Science · Physics and Astronomy · #Advanced Clustering Algorithms Research #Complex Network Analysis Techniques #Computational Geometry (cs.CG) #FOS: Computer and information sciences #Face and Expression Recognition #Social and Information Networks (cs.SI)

paper · pdf · doi:10.48550/arxiv.2106.05145

openalex publication_date 2021/06/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we relatively extend the definition of global clustering coefficient to another clustering, which we call it relative clustering coefficient. The idea of this definition is to ignore the edges in the network that the probability of having an edge is 0. Here, we also consider a model as an example that using relative clustering coefficient is better than global clustering coefficient for comparing networks and also checking the properties of the networks.

Related

• On Clustering Coefficients in Complex Networks
• Clustering coefficient without degree correlations biases
• Measuring the Clustering Strength of a Network via the Normalized Clustering Coefficient
• Global clustering coefficient in scale-free networks
• Clustering function: a measure of social influence