University of TehranJournal of Algorithms and Computation2476-277654120220601Relative Clustering Coefficient991088837310.22059/jac.2022.88373ENElenaTouliDepartment of Mathematics, Stockholm UniversityOscarLindbergDepartment of Mathematics, Stockholm universityJournal Article20220802In 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.https://jac.ut.ac.ir/article_88373_3d678c3dff380dbd41d09aa352638319.pdf