%0 Journal Article
%T Relative Clustering Coefficient
%J Journal of Algorithms and Computation
%I University of Tehran
%Z 2476-2776
%A Touli, Elena
%A Lindberg, Oscar
%D 2022
%\ 06/01/2022
%V 54
%N 1
%P 99-108
%! Relative Clustering Coefficient
%K The global clustering coefficient
%K local clustering coefficient
%K relative clustering coefficient
%K Networks
%K and graphs
%R 10.22059/jac.2022.88373
%X 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.
%U https://jac.ut.ac.ir/article_88373_3d678c3dff380dbd41d09aa352638319.pdf