252 citations · 1.1k across the 38 of their papers we have counts for
7 papers · 1 filter
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…
A stopping criterion for Markov chains when generating independent random graphs
J. Ray, A. Pinar, C. Seshadhri
Markov chains are convenient means of generating realizations of networks with a given (joint or otherwise) degree distribution, since they simply require a procedure for rewiring…
A Scalable Null Model for Directed Graphs Matching All Degree Distributions: In, Out, and Reciprocal
Nurcan Durak, Tamara G. Kolda, Ali Pinar +1
Degree distributions are arguably the most important property of real world networks. The classic edge configuration model or Chung-Lu model can generate an undirected graph with a…
Degree Relations of Triangles in Real-world Networks and Models
Nurcan Durak, Ali Pinar, Tamara G. Kolda +1
Triangles are an important building block and distinguishing feature of real-world networks, but their structure is still poorly understood. Despite numerous reports on the abundan…
Are we there yet? When to stop a Markov chain while generating random graphs
Jaideep Ray, Ali Pinar, C. Seshadhri
Markov chains are a convenient means of generating realizations of networks, since they require little more than a procedure for rewiring edges. If a rewiring procedure exists for…
Triadic Measures on Graphs: The Power of Wedge Sampling
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 a graph. Some of the most useful graph metrics, espec…