10 citations · 20 across the 3 of their papers we have counts for
3 papers
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…
Order Optimal Information Spreading Using Algebraic Gossip
Chen Avin, Michael Borokhovich, Keren Censor-Hillel +1
In this paper we study gossip based information spreading with bounded message sizes. We use algebraic gossip to disseminate distinct messages to all nodes in a network. Fo…