252 citations · 1.1k across the 38 of their papers we have counts for
23 papers · 1 filter
Provable and practical approximations for the degree distribution using sublinear graph samples
Talya Eden, Shweta Jain, Ali Pinar +2
The degree distribution is one of the most fundamental properties used in the analysis of massive graphs. There is a large literature on graph sampling, where the goal is to estima…
Local Algorithms for Hierarchical Dense Subgraph Discovery
Ahmet Erdem Sariyuce, C. Seshadhri, Ali Pinar
Finding the dense regions of a graph and relations among them is a fundamental problem in network analysis. Core and truss decompositions reveal dense subgraphs with hierarchical r…
Peeling Bipartite Networks for Dense Subgraph Discovery
A. Erdem Sariyuce, Ali Pinar
Finding dense bipartite subgraphs and detecting the relations among them is an important problem for affiliation networks that arise in a range of domains, such as social network a…
ESCAPE: Efficiently Counting All 5-Vertex Subgraphs
Ali Pinar, C. Seshadhri, V. Vishal
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…
Fast Hierarchy Construction for Dense Subgraphs
A. Erdem Sariyuce, Ali Pinar
Discovering dense subgraphs and understanding the relations among them is a fundamental problem in graph mining. We want to not only identify dense subgraphs, but also build a hier…
Measuring and Modeling Bipartite Graphs with Community Structure
Sinan Aksoy, Tamara G. Kolda, Ali Pinar
Network science is a powerful tool for analyzing complex systems in fields ranging from sociology to engineering to biology. This paper is focused on generative models of large-sca…