1.3k citations · 2.2k across the 67 of their papers we have counts for
8 papers · 1 filter
Erasure coding for fault oblivious linear system solvers
David F. Gleich, Ananth Grama, Yao Zhu
Dealing with hardware and software faults is an important problem as parallel and distributed systems scale to millions of processing cores and wide area networks. Traditional meth…
Multilinear PageRank
David F. Gleich, Lek-Heng Lim, Yongyang Yu
In this paper, we first extend the celebrated PageRank modification to a higher-order Markov chain. Although this system has attractive theoretical properties, it is computationall…
Computing active subspaces with Monte Carlo
Paul Constantine, David Gleich
Active subspaces can effectively reduce the dimension of high-dimensional parameter studies enabling otherwise infeasible experiments with expensive simulations. The key components…
PageRank beyond the Web
David F. Gleich
Google's PageRank method was developed to evaluate the importance of web-pages via their link structure. The mathematics of PageRank, however, are entirely general and apply to any…
Dimensionality of social networks using motifs and eigenvalues
Anthony Bonato, David F. Gleich, Myunghwan Kim +4
We consider the dimensionality of social networks, and develop experiments aimed at predicting that dimension. We find that a social network model with nodes and links sampled from…
Using Triangles to Improve Community Detection in Directed Networks
Christine Klymko, David Gleich, Tamara G. Kolda
In a graph, a community may be loosely defined as a group of nodes that are more closely connected to one another than to the rest of the graph. While there are a variety of metric…