62 citations · 315 across the 28 of their papers we have counts for
11 papers · 1 filter
Parameter-Free Triangle Counting
Asaf Etgar, Anna Gilbert, Quanquan Liu +1
Given an undirected, unweighted graph with vertices and edges, the triangle counting problem seeks the number of three-cycles in it. Triangle and subgraph count…
Scalable Triangle Counting: The Threshold Algorithm
Asaf Etgar, Anna Gilbert, Quanquan C. Liu +1
We study one-pass triangle counting on random-order edge streams. We present a remarkably simple algorithm---read edges from the stream until triangles are observed in the pref…
Metric repair is two problems: Which edges, and what weights
Asaf Etgar, Anna Gilbert
Real distance data rarely cooperate: measurements are noisy, observations are missing, and the numbers that result seldom satisfy the triangle inequality. A family of methods exist…
Structural Tractability Frontiers for Metric Repair
Asaf Etgar, Anna C. Gilbert, Jamie Tucker-Foltz
Given a graph labeled with positive distances on each edge, what is the fewest number of edge distances that must be modified for to become a metric? It is known that this…
Generalized Metric Repair on Graphs
Chenglin Fan, Anna C. Gilbert, Benjamin Raichel +2
Many modern data analysis algorithms either assume or are considerably more efficient if the distances between the data points satisfy a metric. These algorithms include metric lea…
Sparse Recovery for Orthogonal Polynomial Transforms
Anna Gilbert, Albert Gu, Christopher Re +2
In this paper we consider the following sparse recovery problem. We have query access to a vector $\vx \in \R^N$ such that $\vhx = \vF \vx$ is -sparse (or nearly -sparse) for…