28 citations · 110 across the 12 of their papers we have counts for
5 papers · 1 filter
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…
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions
Ahmet Erdem Sariyuce, C. Seshadhri, Ali Pinar +1
Finding dense substructures in a graph is a fundamental graph mining operation, with applications in bioinformatics, social networks, and visualization to name a few. Yet most stan…
Why do simple algorithms for triangle enumeration work in the real world?
Jonathan W. Berry, Luke A. Fostvedt, Daniel J. Nordman +3
Listing all triangles is a fundamental graph operation. Triangles can have important interpretations in real-world graphs, especially social and other interaction networks. Despite…
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…
FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs
Peter Lofgren, Siddhartha Banerjee, Ashish Goel +1
We propose a new algorithm, FAST-PPR, for estimating personalized PageRank: given start node and target node in a directed graph, and given a threshold , FAST-PPR estima…