Weighted directed clustering: interpretations and requirements for heterogeneous, inferred, and measured networks
Tanguy Fardet, Anna Levina

TL;DR
This paper reviews and proposes a fully-weighted, continuous local clustering coefficient for complex networks, emphasizing its advantages over hybrid methods especially in noisy, inferred, or heterogeneous networks.
Contribution
It introduces a new fully-weighted continuous clustering coefficient that meets all necessary criteria and outperforms existing methods in various network conditions.
Findings
Fully-weighted clustering coefficient outperforms hybrid methods.
The new measure is continuous with respect to small weight changes.
It is especially effective for noisy or inferred networks.
Abstract
Weights and directionality of the edges carry a large part of the information we can extract from a complex network. However, many network measures were formulated initially for undirected binary networks. The necessity to incorporate information about the weights led to the conception of the multiple extensions, particularly for definitions of the local clustering coefficient discussed here. We uncover that not all of these extensions are fully-weighted; some depend on the degree and thus change a lot when an infinitely small weight edge is exchanged for the absence of an edge, a feature that is not always desirable. We call these methods ``hybrid'' and argue that, in many situations, one should prefer fully-weighted definitions. After listing the necessary requirements for a method to analyze many various weighted networks properly, we propose a fully-weighted continuous clustering…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
