Relative Clustering Coefficient

06/09/2021
by   Elena Farahbakhsh Touli, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/01/2019

Measuring the Clustering Strength of a Network via the Normalized Clustering Coefficient

In this paper, we propose a novel statistic of networks, the normalized ...
research
11/12/2021

Histograms lie about distribution shapes and Pearson's coefficient of variation lies about variability

Background and Objective: Histograms and Pearson's coefficient of variat...
research
09/27/2017

Random Overlapping Communities: Approximating Motif Densities of Large Graphs

A wide variety of complex networks (social, biological, information etc....
research
08/04/2023

Revisiting small-world network models: Exploring technical realizations and the equivalence of the Newman-Watts and Harary models

We address the relatively less known facts on the equivalence and techni...
research
08/18/2019

A New Approach to Determine the Coefficient of Skewness and An Alternative Form of Boxplot

To solve the problems in measuring coefficient of skewness related to ex...
research
07/29/2022

Learning idempotent representation for subspace clustering

The critical point for the successes of spectral-type subspace clusterin...
research
01/28/2022

Two more ways of spelling Gini Coefficient with Applications

In this paper, we draw attention to a promising yet slightly underestima...

Please sign up or login with your details

Forgot password? Click here to reset