Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More
暂无分享,去创建一个
Richard Peng | Michael B. Cohen | John Peebles | Aaron Sidford | Adrian Vladu | Jonathan A. Kelner | Michael B. Cohen | Aaron Sidford | Adrian Vladu | Richard Peng | John Peebles
[1] Daniel A. Spielman,et al. A Note on Preconditioning by Low-Stretch Spanning Trees , 2009, ArXiv.
[2] Yin Tat Lee,et al. Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[3] Fan Chung Graham,et al. Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[4] Satish Rao,et al. A new approach to computing maximum flows using electrical flows , 2013, STOC '13.
[5] Martin E. Dyer,et al. A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.
[6] Rajeev Motwani,et al. The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.
[7] Nicholas J. Higham,et al. INVERSE PROBLEMS NEWSLETTER , 1991 .
[8] Ashish Goel,et al. FAST-PPR: scaling personalized pagerank estimation for large graphs , 2014, KDD.
[9] Nima Anari,et al. Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP , 2014, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[10] Bojan Mohar,et al. Hermitian Adjacency Matrix of Digraphs and Mixed Graphs , 2015, J. Graph Theory.
[11] Richard Peng,et al. Algorithm Design Using Spectral Graph Theory , 2013 .
[12] Jakub W. Pachocki,et al. Solving SDD linear systems in nearly mlog1/2n time , 2014, STOC.
[13] Joan Feigenbaum,et al. Proceedings of the forty-fifth annual ACM symposium on Theory of computing , 2013, STOC 2013.
[14] J. Delvenne,et al. Random walks on graphs , 2004 .
[15] Shang-Hua Teng,et al. The Laplacian Paradigm: Emerging Algorithms for Massive Graphs , 2010, TAMC.
[16] Gary L. Miller,et al. A Nearly-m log n Time Solver for SDD Linear Systems , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[17] Santosh S. Vempala,et al. On clusterings-good, bad and spectral , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[18] Jonah Sherman,et al. Nearly Maximum Flows in Nearly Linear Time , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[19] Shang-Hua Teng,et al. Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems , 2006, SIAM J. Matrix Anal. Appl..
[20] Mark Jerrum,et al. Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, WG.
[21] F. Chung. Laplacians and the Cheeger Inequality for Directed Graphs , 2005 .
[22] Omer Reingold,et al. Undirected connectivity in log-space , 2008, JACM.
[23] Aleksander Madry,et al. Fast Generation of Random Spanning Trees and the Effective Resistance Metric , 2015, SODA.
[24] Santosh S. Vempala,et al. Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[25] N. Alon,et al. il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .
[26] Nikhil Srivastava,et al. Graph sparsification by effective resistances , 2008, SIAM J. Comput..
[27] Zeyuan Allen Zhu,et al. Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates , 2015, STOC.
[28] Virginia Vassilevska Williams,et al. Multiplying matrices faster than coppersmith-winograd , 2012, STOC '12.
[29] Richard Peng,et al. Sparsified Cholesky and multigrid solvers for connection laplacians , 2015, STOC.
[30] Aleksander Madry,et al. Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[31] Andrei Z. Broder,et al. Workshop on Algorithms and Models for the Web Graph , 2007, WAW.
[32] Dániel Fogaras,et al. Towards Scaling Fully Personalized PageRank , 2004, WAW.
[33] Nisheeth K. Vishnoi,et al. Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator , 2011, STOC '12.
[34] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[35] Yin Tat Lee,et al. Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[36] Zeyuan Allen Zhu,et al. A simple, combinatorial algorithm for solving SDD systems in nearly-linear time , 2013, STOC '13.
[37] Richard M. Karp,et al. Monte-Carlo Approximation Algorithms for Enumeration Problems , 1989, J. Algorithms.
[38] Amin Saberi,et al. An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem , 2010, SODA '10.
[39] Santosh S. Vempala,et al. Hit-and-run from a corner , 2004, STOC '04.
[40] Omer Reingold,et al. S-T Connectivity on Digraphs with a Known Stationary Distribution , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[41] Shang-Hua Teng,et al. Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs , 2010, STOC '11.
[42] A. Madry,et al. Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m 10/7 log W) Time. , 2016 .
[43] Gary L. Miller,et al. Approaching Optimality for Solving SDD Linear Systems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[44] Toniann Pitassi,et al. Proceedings of the forty-fourth annual ACM symposium on Theory of computing , 2012, STOC 2012.
[45] S. Vempala. Geometric Random Walks: a Survey , 2007 .
[46] Gary L. Miller,et al. Faster approximate multicommodity flow using quadratically coupled flows , 2012, STOC '12.
[47] Daniel A. Spielman,et al. Faster approximate lossy generalized flow via interior point algorithms , 2008, STOC.
[48] Richard Peng,et al. Sparsified Cholesky Solvers for SDD linear systems , 2015, ArXiv.
[49] Eric Vigoda,et al. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.
[50] Richard Peng,et al. An efficient parallel solver for SDD linear systems , 2013, STOC.
[51] S. Vempala,et al. Hit-and-Run from a Corner , 2006 .
[52] Aleksander Madry,et al. Faster Generation of Random Spanning Trees , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[53] Piotr Sankowski,et al. Negative-Weight shortest paths and unit capacity minimum cost flow in Õ(m[superscript 10/7] log W) Time , 2017 .
[54] DyerMartin,et al. A random polynomial-time algorithm for approximating the volume of convex bodies , 1991 .
[55] Piotr Sankowski,et al. Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time (Extended Abstract) , 2016, SODA.
[56] F. Göbel,et al. Random walks on graphs , 1974 .
[57] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[58] Daniel A. Spielman,et al. Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[59] Omer Reingold,et al. S-T Connectivity on Digraphs with a Known Stationary Distribution , 2007, Computational Complexity Conference.
[60] Daniel A. Spielman,et al. Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.
[61] Vahab S. Mirrokni,et al. Local Computation of PageRank Contributions , 2007, Internet Math..
[62] Jennifer Widom,et al. Scaling personalized web search , 2003, WWW '03.
[63] Yin Tat Lee,et al. Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum Flow , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[64] Miklós Simonovits,et al. The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[65] Daniel A. Spielman. Linear-time encodable and decodable error-correcting codes , 1996, IEEE Trans. Inf. Theory.
[66] Richard Peng,et al. Approximate Undirected Maximum Flows in O(mpolylog(n)) Time , 2014, SODA.
[67] Santosh S. Vempala,et al. Geodesic walks in polytopes , 2016, STOC.
[68] Yin Tat Lee,et al. An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations , 2013, SODA.