Research Codes



Parallel Maximum Clique (PMC) Library

In short, a parameterized high performance library for computing maximum cliques in large sparse graphs.



DOWNLOAD




Ryan A. Rossi, David F. Gleich, Assefaw H. Gebremedhin, Md. Mostofa Ali Patwary, A Fast Parallel Maximum Clique Algorithm for Large Sparse Graphs and Temporal Strong Components, (In Submission).   [ ] 

@article{rossi2013parallel-cliques,
  title={A Fast Parallel Maximum Clique Algorithm for Large Sparse Graphs and Temporal Strong Components},
  author={Ryan A. Rossi and David F. Gleich and Assefaw H. Gebremedhin and Mostofa A. Patwary},
  journal={arXiv preprint arXiv:1302.6256},
  pages={1--9},
  year={2013}
}




Dynamic PageRank

We propose a dynamical system that captures changes to the network centrality of nodes as external interest in those nodes vary. We derive this system by adding timedependent teleportation to the PageRank score. The result is not a single set of importance scores, but rather a time-dependent set. These can be converted into ranked lists in a variety of ways, for instance, by taking the largest change in the importance score. For an interesting class of the dynamic teleportation functions, we derive closed form solutions for the dynamic PageRank vector. The magnitude of the deviation from a static PageRank vector is given by a PageRank problem with complex-valued teleportation parameters. Moreover, these dynamical systems are easy to evaluate. We demonstrate the utility of dynamic teleportation on both the article graph of Wikipedia, where the external interest information is given by the number of hourly visitors to each page, and the Twitter social network, where external interest is the number of tweets per month. For these problems, we show that using information from the dynamical system helps improve a prediction task and identify trends in the data.

DOWNLOAD
GITHUB



Ryan Rossi and David Gleich: Dynamic PageRank using Evolving Teleportation, Algorithms and Models for the Web Graph, volume 7323 of Lecture Notes in Computer Science, pages 126-137. Springer, 2012.   [ ] 

@article{rossi2012dynamic,
  author = {Ryan A. Rossi and David F. Gleich},
  title = {Dynamic {PageRank} using Evolving Teleportation},
  booktitle = {Algorithms and Models for the Web Graph},
  year = {2012},
  editor = {Anthony Bonato and Jeannette Janssen},
  volume = {7323},
  series = {Lecture Notes in Computer Science},
  pages = {126--137},
  publisher = {Springer}
}
David F. Gleich, Ryan A. Rossi, A Dynamical System for PageRank with Time-Dependent Teleportation, (In Submission). [ ] 

@article{gleich2012dynamical,
  title={A Dynamical System for PageRank with Time-Dependent Teleportation},
  author={David F. Gleich and Ryan A. Rossi},
  journal={arXiv preprint arXiv:1211.4266},
  pages={1--30},
  year={2012}
}




Graphlet Decomposition (PGD) Library for Large Networks

A parallel parameterized graphlet decomposition library for computing the number of small k-vertex induced subgraphs.

PGD CODES





Other software

The Existence of a Universal Coding Frame
Photobase - Peer Production System