114 citations · 138 across the 5 of their papers we have counts for
Showing cs.SIShow all
3 papers · 1 filter
cs.SI2020★ 4 cited
A simple bipartite graph projection model for clustering in networks
Austin R. Benson, Paul Liu, Hao Yin
Graph datasets are frequently constructed by a projection of a bipartite graph, where two nodes are connected in the projection if they share a common neighbor in the bipartite gra…
cs.SI2019★ 15 cited
Measuring Directed Triadic Closure with Closure Coefficients
Hao Yin, Austin R. Benson, Johan Ugander
Recent work studying triadic closure in undirected graphs has drawn attention to the distinction between measures that focus on the "center" node of a wedge (i.e., length-2 path) v…
cs.SI2017★ 114 cited
Higher-order clustering in networks
Hao Yin, Austin R. Benson, Jure Leskovec
A fundamental property of complex networks is the tendency for edges to cluster. The extent of the clustering is typically quantified by the clustering coefficient, which is the pr…