270 citations · 805 across the 13 of their papers we have counts for
3 papers · 1 filter
ASYMP: Fault-tolerant Mining of Massive Graphs
Eduardo Fleury, Silvio Lattanzi, Vahab Mirrokni +1
We present ASYMP, a distributed graph processing system developed for the timely analysis of graphs with trillions of edges. ASYMP has several distinguishing features including a r…
HARP: Hierarchical Representation Learning for Networks
Haochen Chen, Bryan Perozzi, Yifan Hu +1
We present HARP, a novel method for learning low dimensional embeddings of a graph's nodes which preserves higher-order structural features. Our proposed method achieves this by co…
Ties That Bind - Characterizing Classes by Attributes and Social Ties
Aria Rezaei, Bryan Perozzi, Leman Akoglu
Given a set of attributed subgraphs known to be from different classes, how can we discover their differences? There are many cases where collections of subgraphs may be contrasted…