David Gleich's repositories
jln2jupyter
Convert Julia notebook files into Jupyter notebooks
cs590-ncds
The course git repository for Purdue's CS59000-NCDS Numerical Computing for Data Science
nonlinear-process-vis
Visualizing nonlinear processes on graphs
TechnicalCompute.jl
A simple metapackage for Julia to be used for technical computing
NumbersFromText.jl
Read numeric data quickly in Julia
atom-julia-client
Juno a good IDE?
atom-default-language
Fallback language configuration for Atom
CS515-2017
Julia codes for CS515 in 2017
grass-hopping-graphs
A repository of our codes for grass-hopping in network models
DGFun.jl
A collection of useful julia codes in one personal package
motif-ssbm
Preliminary codes for studying symmetric-stochastic block models with motifs.
powerlaw-spectra
These programs generate and reproduce the key figures from our KDD2017 paper
pmc
Parallel Maximum Clique Library
mlpagerank
Multilinear PageRank
CS520-2017
Lecture and Homework Codes for CS520 at Purdue
RHOMP
Codes from the paper "Retrospective Higher-Order Markov Processes for User Trails"
plfit
Fitting power-law distributions to empirical data, according to the method of Clauset, Shalizi and Newman
erasure-coded-cg
A repository for our codes for erasure coding for the CG linear solver
graph_eigs
A scalapack code to compute graph eigenvalues
CS314-2016
Lecture and Homework Codes for CS314 at Purdue
GtensorSC
codes for the paper General Tensor Spectral Co-clustering for Higher-Order Data
higher-order-organization-julia
Jupyter notebooks for examples in the paper "Higher-order organization of complex networks".
find_densest_subgraph
Find the densest subgraph in an undirected graph through Andrew Goldberg's algorithm and based on Dan Spielman's Dinic Maxflow code
TAME
Triangular Alignment (TAME): A Tensor-based Approach for Higher-order Network Alignment