114 citations · 138 across the 5 of their papers we have counts for
5 papers
Randomized Graph Cluster Randomization
Johan Ugander, Hao Yin
The global average treatment effect (GATE) is a primary quantity of interest in the study of causal inference under network interference. With a correctly specified exposure model…
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…
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…
On the distance and algorithms of strong product digraphs
Haoran Yin, Feng Li
Strong product is an efficient way to construct a larger digraph through some specific small digraphs. The large digraph constructed by the strong product method contains the facto…
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…