activity
20092026
most citedHigher-order organization of complex networks

1.3k citations · 2.2k across the 67 of their papers we have counts for

collaborators
Showing 2015Show all

5 papers · 1 filter

cs.CE2015★ 40 cited

Triangular Alignment (TAME): A Tensor-based Approach for Higher-order Network Alignment

Shahin Mohammadi, David Gleich, Tamara Kolda +1

Network alignment has extensive applications in comparative interactomics. Traditional approaches aim to simultaneously maximize the number of conserved edges and the underlying si…

cs.SI2015★ 1 cited

Localization in Seeded PageRank

David F. Gleich, Kyle Kloster, Huda Nassar

Seeded PageRank is an important network analysis tool for identifying and studying regions nearby a given set of nodes, which are called seeds. The seeded PageRank vector is the st…

cs.SI2015★ 12 cited

Seeded PageRank Solution Paths

Kyle Kloster, David F. Gleich

We study the behavior of network diffusions based on the PageRank random walk from a set of seed nodes. These diffusions are known to reveal small, localized clusters (or communiti…

cs.SI2015★ 103 cited

Tensor Spectral Clustering for Partitioning Higher-order Network Structures

Austin R. Benson, David F. Gleich, Jure Leskovec

Spectral graph theory-based methods represent an important class of tools for studying the structure of networks. Spectral methods are based on a first-order Markov chain derived f…

cs.DC2015

A Parallel Min-Cut Algorithm using Iteratively Reweighted Least Squares

Yao Zhu, David F. Gleich

We present a parallel algorithm for the undirected -mincut problem with floating-point valued weights. Our overarching algorithm uses an iteratively reweighted least squares f…