18 citations · 20 across the 5 of their papers we have counts for
5 papers
Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts
Madhav Jha, C. Seshadhri, Ali Pinar
Counting the frequency of small subgraphs is a fundamental technique in network analysis across various domains, most notably in bioinformatics and social networks. The special cas…
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties
Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha +1
The primary problem in property testing is to decide whether a given function satisfies a certain property, or is far from any function satisfying it. This crucially requires a not…
Counting Triangles in Real-World Graph Streams: Dealing with Repeated Edges and Time Windows
Madhav Jha, C. Seshadhri, Ali Pinar
Real-world graphs often manifest as a massive temporal stream of edges. The need for real-time analysis of such large graph streams has led to progress on low memory, one-pass stre…
A space efficient streaming algorithm for triangle counting using the birthday paradox
Madhav Jha, C. Seshadhri, Ali Pinar
We design a space efficient algorithm that approximates the transitivity (global clustering coefficient) and total triangle count with only a single pass through a graph given as a…
Testing Lipschitz Property over Product Distribution and its Applications to Statistical Data Privacy
Kashyap Dixit, Madhav Jha, Abhradeep Thakurta
In this work, we present a connection between Lipschitz property testing and a relaxed notion of differential privacy, where we assume that the datasets are being sampled from a do…