| Publication | Date of Publication | Type |
|---|
| A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings | 2024-12-06 | Paper |
| Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple | 2023-08-16 | Paper |
| Dynamic Competition Networks: Detecting Alliances and Leaders | 2023-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091036 | 2022-07-21 | Paper |
| Graph Clustering in All Parameter Regimes | 2022-07-18 | Paper |
| Metric-Constrained Optimization for Graph Clustering Algorithms | 2022-02-03 | Paper |
| Scalable algorithms for multiple network alignment | 2021-08-09 | Paper |
| Classes of preferential attachment and triangle preferential attachment models with power-law spectra | 2021-06-04 | Paper |
| Sublinear column-wise actions of the matrix exponential on social networks | 2021-04-26 | Paper |
| A Dynamical System for PageRank with Time-Dependent Teleportation | 2021-04-23 | Paper |
| Computing tensor \(Z\)-eigenvectors with dynamical systems | 2019-12-09 | Paper |
| Multiway Monte Carlo method for linear systems | 2019-11-18 | Paper |
| Coin-flipping, Ball-dropping, and Grass-hopping for generating random graphs from matrices of edge probabilities | 2019-09-02 | Paper |
| Seeded PageRank solution paths | 2017-11-24 | Paper |
| The Spacey Random Walk: A Stochastic Process for Higher-Order Data | 2017-05-31 | Paper |
| Erasure coding for fault-oblivious linear system solvers | 2017-02-27 | Paper |
| PageRank beyond the web | 2016-05-20 | Paper |
| A randomized algorithm for enumerating zonotope vertices | 2016-02-21 | Paper |
| Strong localization in personalized PageRank vectors | 2016-01-08 | Paper |
| Multilinear PageRank | 2015-12-09 | Paper |
| Parallel maximum clique algorithms with applications to network analysis | 2015-10-27 | Paper |
| Model reduction with MapReduce-enabled tall and skinny singular value decomposition | 2015-01-23 | Paper |
| A nearly-sublinear method for approximating a column of the matrix exponential for matrices from large, sparse networks | 2015-01-13 | Paper |
| The power and Arnoldi methods in an algebra of circulants. | 2014-11-25 | Paper |
| Computing active subspaces with Monte Carlo | 2014-08-03 | Paper |
| Moment-Based Estimation of Stochastic Kronecker Graph Parameters | 2013-02-15 | Paper |
| Fast matrix computations for pairwise and columnwise commute times and Katz scores | 2012-08-29 | Paper |
| Dynamic PageRank using evolving teleportation | 2012-07-23 | Paper |
| A factorization of the spectral Galerkin system for parameterized matrix equations: derivation and applications | 2012-02-23 | Paper |
| Some computational tools for digital archive and metadata maintenance | 2011-05-04 | Paper |
| Spectral Methods for Parameterized Matrix Equations | 2011-03-02 | Paper |
| An inner-outer iteration for computing PageRank | 2011-03-02 | Paper |
| Random alpha PageRank | 2011-01-31 | Paper |
| Fast Katz and commuters: efficient estimation of social relatedness in large networks | 2011-01-21 | Paper |
| Message Passing Algorithms for Sparse Network Alignment | 2009-07-20 | Paper |
| A Monte Carlo method for solving unsteady adjoint equations | 2008-08-22 | Paper |
| Approximating Personalized PageRank with Minimal Use of Web Graph Data | 2008-04-29 | Paper |
| Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model | 2008-04-11 | Paper |
| A Projection Method for Metric-Constrained Optimization | N/A | Paper |
| Better than best low-rank approximation with the singular value decomposition | N/A | Paper |
