Interest Clustering Coefficient: a New Metric for Directed Networks like Twitter
Thibaud Trolliet, Nathann Cohen, Fr\'ed\'eric Giroire, Luc Hogie,, St\'ephane P\'erennes

TL;DR
This paper introduces the interest clustering coefficient, a new metric for directed social graphs like Twitter, capturing informational clustering better than existing metrics, demonstrated on a large-scale Twitter dataset.
Contribution
The paper proposes a novel interest clustering coefficient for directed graphs and applies it to a massive Twitter snapshot, revealing its effectiveness over traditional metrics.
Findings
Interest clustering coefficient exceeds traditional directed clustering metrics.
The new metric better captures informational clustering in directed social graphs.
Large-scale analysis on Twitter shows the metric's practical relevance.
Abstract
We study here the clustering of directed social graphs. The clustering coefficient has been introduced to capture the social phenomena that a friend of a friend tends to be my friend. This metric has been widely studied and has shown to be of great interest to describe the characteristics of a social graph. In fact, the clustering coefficient is adapted for a graph in which the links are undirected, such as friendship links (Facebook) or professional links (LinkedIn). For a graph in which links are directed from a source of information to a consumer of information, it is no more adequate. We show that former studies have missed much of the information contained in the directed part of such graphs. We thus introduce a new metric to measure the clustering of a directed social graph with interest links, namely the interest clustering coefficient. We compute it (exactly and using sampling…
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.
