Document Type : Research Paper

Authors

• Elena Touli ¹
• Oscar Lindberg ²

¹ Department of Mathematics, Stockholm University

² Department of Mathematics, Stockholm university

Abstract

In this paper, we relatively extend the definition of the global clustering coefficient to another clustering, which we call it \emph{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 the relative clustering coefficient is better than the global clustering coefficient for comparing networks and also checking the properties of the networks.

Keywords

• The global clustering coefficient
• local clustering coefficient
• relative clustering coefficient
• networks
• and graphs