Relative Clustering Coefficient
Computational Geometry
2021-06-10 v1 Social and Information Networks
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.
Keywords
Cite
@article{arxiv.2106.05145,
title = {Relative Clustering Coefficient},
author = {Elena Farahbakhsh Touli and Oscar Lindberg},
journal= {arXiv preprint arXiv:2106.05145},
year = {2021}
}