Graphs

FEASTPACK is back!

FEASTPACK is MATLAB software for creating large-scale artificial graphs that match a given degree distribution (i.e., the same distribution of edges) and a given clustering coefficient distribution (i.e., the same distribution of 3-cycles).

An Improved Hyperbolic Embedding Algorithm

K. Chowdhary and T. G. Kolda, Journal of Complex Networks, 2017

Measuring and Modeling Bipartite Graphs with Community Structure

S. Aksoy, T. G. Kolda and A. Pinar, Journal of Complex Networks, 2017

Directed Closure Measures for Networks with Reciprocity

C. Seshadhri, A. Pinar, N. Durak and T. G. Kolda, Journal of Complex Networks, 2016

Diamond Sampling for Approximate Maximum All-pairs Dot-product (MAD) Search

G. Ballard, A. Pinar, T. G. Kolda and C. Seshadri, In ICDM 2015: Proceedings of the 2015 IEEE International Conference on Data Mining, 2015

Counting Triangles in Massive Graphs with MapReduce

T. G. Kolda, A. Pinar, T. Plantenga, C. Seshadhri and C. Task, SIAM Journal on Scientific Computing, 2014

A Scalable Generative Graph Model with Community Structure

T. G. Kolda, A. Pinar, T. Plantenga and C. Seshadhri, SIAM Journal on Scientific Computing, 2014

Wedge Sampling for Computing Clustering Coefficients and Triangle Counts on Large Graphs

C. Seshadhri, A. Pinar and T. G. Kolda, Statistical Analysis and Data Mining, 2014

Using Triangles to Improve Community Detection in Directed Networks

C. Klymko, D. F. Gleich and T. G. Kolda, In The Second ASE International Conference on Big Data Science and Computing, BigDataScience, 2014

Accelerating Community Detection by Using K-core Subgraphs

C. Peng, T. G. Kolda and A. Pinar, arXiv, 2014