activity
20112022
most citedCommunity structure and scale-free collections of Erdös-Rényi graphs

252 citations · 1.1k across the 38 of their papers we have counts for

collaborators
Showing 2011Show all

9 papers · 1 filter

cs.SI2011★ 252 cited

Community structure and scale-free collections of Erdös-Rényi graphs

C. Seshadhri, Tamara G. Kolda, Ali Pinar

Community structure plays a significant role in the analysis of social networks and similar graphs, yet this structure is little understood and not well captured by most models. We…

cs.SI2011

The Similarity between Stochastic Kronecker and Chung-Lu Graph Models

Ali Pinar, C. Seshadhri, Tamara G. Kolda

The analysis of massive graphs is now becoming a very important part of science and industrial research. This has led to the construction of a large variety of graph models, each w…

math.OC2011★ 2 cited

An Implicit Optimization Approach for Survivable Network Design

Richard Chen, Amy Cohn, Ali Pinar

We consider the problem of designing a network of minimum cost while satisfying a prescribed survivability criterion. The survivability criterion requires that a feasible flow must…

cs.SI2011

On Clustering on Graphs with Multiple Edge Types

Matthew Rocklin, Ali Pinar

We study clustering on graphs with multiple edge types. Our main motivation is that similarities between objects can be measured in many different metrics. For instance similarity…

cs.SI2011

Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types

Matthew Rocklin, Ali Pinar

We investigate the community detection problem on graphs in the existence of multiple edge types. Our main motivation is that similarity between objects can be defined by many diff…

cs.DS2011

Constructing and Sampling Graphs with a Prescribed Joint Degree Distribution

Isabelle Stanton, Ali Pinar

One of the most influential recent results in network analysis is that many natural networks exhibit a power-law or log-normal degree distribution. This has inspired numerous gener…