252 citations · 1.1k across the 38 of their papers we have counts for
7 papers · 1 filter
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…
Wedge Sampling for Computing Clustering Coefficients and Triangle Counts on Large Graphs
C. Seshadhri, Ali Pinar, Tamara G. Kolda
Graphs are used to model interactions in a variety of contexts, and there is a growing need to quickly assess the structure of such graphs. Some of the most useful graph metrics ar…
Contingency-Risk Informed Power System Design
Richard Li-Yang Chen, Amy Cohn, Neng Fan +1
We consider the problem of designing (or augmenting) an electric power system at a minimum cost such that it satisfies the N-k-e survivability criterion. This survivability criteri…
Dynamics of Trust Reciprocation in Heterogenous MMOG Networks
Ayush Singhal, Karthik Subbian, Jaideep Srivastava +2
Understanding the dynamics of reciprocation is of great interest in sociology and computational social science. The recent growth of Massively Multi-player Online Games (MMOGs) has…
A Scalable Generative Graph Model with Community Structure
Tamara G. Kolda, Ali Pinar, Todd Plantenga +1
Network data is ubiquitous and growing, yet we lack realistic generative network models that can be calibrated to match real-world data. The recently proposed Block Two-Level Erdss…
Directed closure measures for networks with reciprocity
C. Seshadhri, Ali Pinar, Nurcan Durak +1
The study of triangles in graphs is a standard tool in network analysis, leading to measures such as the \emph{transitivity}, i.e., the fraction of paths of length that partici…