25 citations · 44 across the 17 of their papers we have counts for
3 papers · 1 filter
Almost Optimal Bounds for Sublinear-Time Sampling of -Cliques: Sampling Cliques is Harder Than Counting
Talya Eden, Dana Ron, Will Rosenbaum
In this work, we consider the problem of sampling a -clique in a graph from an almost uniform distribution in sublinear time in the general graph query model. Specifically the a…
Sampling Multiple Edges Efficiently
Talya Eden, Saleet Mossel, Ronitt Rubinfeld
We present a sublinear time algorithm that allows one to sample multiple edges from a distribution that is pointwise -close to the uniform distribution, in an \emph{amortized-ef…
Massively Parallel Algorithms for Small Subgraph Counting
Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu +2
Over the last two decades, frameworks for distributed-memory parallel computation, such as MapReduce, Hadoop, Spark and Dryad, have gained significant popularity with the growing p…