Research codes

A dynamical system for PageRank with evolving teleportation

• codes/dynsyspr-im (Revised codes for the journal paper)
• codes/dynsyspr-waw (Original conference paper codes)
• The goal of these codes is to work with a dynamical system version of PageRank for the case of a static-graph but with fluctuating interest over time.

Multi-core network alignment

• codes/netalignmc
• Solve a network alignment problem using a multi-core belief propagation algorithm. This scales up to 40-cores on a modern Intel system.

Neighborhood clusters

• codes/neighborhoods
• Evaluate the full set of neighboorhood communities in a graph

Overlapping clusters

• codes/overlapping
• Find a set of overlapping clusters or partitions of a graph to minimize the communication of a distributed computation

Stochastic Kronecker fitting

• codes/kgmoments
• Given a symmetric, loop-less graph, find the parameters of a stochastic Kronecker model by matching the moments of the distributions.

Skew-symmetric matrix completion

• https://dgleich.com/gitweb/?p=skew-nuclear;a=tree These codes are for our KDD2011 paper on

MRTSQR

• https://github.com/dgleich/mrtsqr

Fast-katz and commuters

• http://www.cs.purdue.edu/homes/dgleich/codes/fast-katz-2011
• http://www.cs.purdue.edu/homes/dgleich/codes/fast-katz

Circulant algebra matrices

• codes/camat

Galerkin methods for parameterized systems

• http://www.cs.purdue.edu/homes/dgleich/codes/pmpack-sisc

Network alignment

• codes/netalign

Random alpha pagerank

• codes/rapr

Inner-outer pagerank

• codes/innout