23 citations · 52 across the 10 of their papers we have counts for
3 papers · 1 filter
Distributed Estimation of Graph 4-Profiles
Ethan R. Elenberg, Karthikeyan Shanmugam, Michael Borokhovich +1
We present a novel distributed algorithm for counting all four-node induced subgraphs in a big graph. These counts, called the -profile, describe a graph's connectivity properti…
Beyond Triangles: A Distributed Framework for Estimating 3-profiles of Large Graphs
Ethan R. Elenberg, Karthikeyan Shanmugam, Michael Borokhovich +1
We study the problem of approximating the -profile of a large graph. -profiles are generalizations of triangle counts that specify the number of times a small graph appears a…
FrogWild! -- Fast PageRank Approximations on Graph Engines
Ioannis Mitliagkas, Michael Borokhovich, Alexandros G. Dimakis +1
We propose FrogWild, a novel algorithm for fast approximation of high PageRank vertices, geared towards reducing network costs of running traditional PageRank algorithms. Our algor…