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