Fetching the paper…
Reading the bibliography…
In this paper we introduce a notion of spectral approximation for directed graphs.
Random sampling in cut, flow, and network design problems
David R Karger · 1994
Earlier work this paper cites.
Introduction to the numerical solutions of Markov chains
Williams J Stewart · 1994
Earlier work this paper cites.
Approximating s-t minimum cuts in O ~ ( n 2 ) \tilde{O}(n^{2}) time
András A. Benczúr and David R. Karger · 1996
Earlier work this paper cites.
Minimum cuts in near-linear time
David R Karger · 2000
Earlier work this paper cites.
Random sampling in residual graphs
David R Karger and Matthew S Levine · 2002
Earlier work this paper cites.
Iterative Methods for Sparse Linear Systems
Yousef Saad · 2003
Earlier work this paper cites.
The life and work of aa markov
Gely P Basharin, Amy N Langville, and Valeriy A Naumov · 2004
Earlier work this paper cites.
Laplacians and the cheeger inequality for directed graphs
Fan Chung · 2005
Earlier work this paper cites.
Local partitioning for directed graphs using pagerank
Reid Andersen, Fan Chung, and Kevin Lang · 2007
Earlier work this paper cites.
A sharp pagerank algorithm with applications to edge ranking and graph sparsification
Fan Chung and Wenbo Zhao · 2010
Earlier work this paper cites.
Approaching optimality for solving SDD linear systems
Ioannis Koutis, Gary L. Miller, and Richard Peng · 2010
Earlier work this paper cites.
The Laplacian paradigm: Emerging algorithms for massive graphs
Shang-Hua Teng · 2010
Earlier work this paper cites.
A general framework for graph sparsification
Wai Shing Fung, Ramesh Hariharan, Nicholas J.A. Harvey, and Debmalya Panigrahi · 2011
Earlier work this paper cites.
A nearly-m log n time solver for SDD linear systems
Ioannis Koutis, Gary L. Miller, and Richard Peng · 2011
Earlier work this paper cites.
Towards an SDP-based approach to spectral methods: A nearly-linear-time algorithm for graph partitioning and decomposition
Lorenzo Orecchia and Nisheeth K. Vishnoi · 2011
Cited alongside, same era.
Graph sparsification by effective resistances
Daniel A. Spielman and Nikhil Srivastava · 2011
Cited alongside, same era.
Spectral sparsification of graphs
Daniel A. Spielman and Shang-Hua Teng · 2011
Cited alongside, same era.
Twice-Ramanujan sparsifiers
Joshua Batson, Daniel A. Spielman, and Nikhil Srivastava · 2012
Cited alongside, same era.
User-friendly tail bounds for sums of random matrices
Joel A Tropp · 2012
Cited alongside, same era.
Spectral sparsification of graphs: theory and algorithms
An efficient parallel solver for SDD linear systems
Richard Peng and Daniel A. Spielman · 2014
Later among the works it cites.
Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
Daniel A. Spielman and Shang-Hua Teng · 2014
Later among the works it cites.
Efficient sampling for Gaussian graphical models via spectral sparsification
Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, and Shang-Hua Teng · 2015
Later among the works it cites.
An efficient parallel algorithm for spectral sparsification of laplacian and sddm matrix polynomials
Gorav Jindal and Pavel Kolev · 2015
Later among the works it cites.
Constructing linear-sized spectral sparsification in almost-linear time
Yin Tat Lee and He Sun · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Joshua Batson, Daniel A. Spielman, Nikhil Srivastava, and Shang-Hua Teng · 2013
Cited alongside, same era.
Solving linear systems with boundary conditions using heat kernel pagerank
Fan Chung and Olivia Simpson · 2013
Cited alongside, same era.
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
Jonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, and Zeyuan Allen Zhu · 2013
Cited alongside, same era.
Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems
Yin Tat Lee and Aaron Sidford · 2013
Cited alongside, same era.
Navigating central path with electrical flows: From flows to matchings, and back
Aleksander Madry · 2013
Cited alongside, same era.
Computing heat kernel pagerank and a local clustering algorithm
Fan Chung and Olivia Simpson · 2014
Cited alongside, same era.
Solving SDD linear systems in nearly m log 1 / 2 n m\log^{1/2}n time
Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup Rao, and Shen Chen Xu · 2014
Cited alongside, same era.
Spectral sparsification and regret minimization beyond matrix multiplicative updates
Zeyuan Allen Zhu, Zhenyu Liao, and Lorenzo Orecchia · 2015
Later among the works it cites.
On fully dynamic graph sparsifiers
Ittai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger, and Richard Peng · 2016
Closest in time.
Faster algorithms for computing the stationary distribution, simulating random walks, and more
Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Aaron Sidford, and Adrian Vladu · 2016
Closest in time.
Michael B. Cohen, Aleksander Madry, Piotr Sankowski, and Adrian Vladu · 2016
Closest in time.
Alina Ene, Gary L. Miller, Jakub Pachocki, and Aaron Sidford · 2016
Closest in time.
Sparsified cholesky and multigrid solvers for connection laplacians
Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, and Daniel A Spielman · 2016
Closest in time.
Approximate gaussian elimination for laplacians: Fast, sparse, and simple
Rasmus Kyng and Sushant Sachdeva · 2016
Closest in time.
Computing maximum flow with augmenting electrical flows
Aleksander Madry · 2016
Closest in time.