11K - views

Nearly-Linear Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs

Richard Peng. Georgia Tech. In collaboration with. Michael B. Cohen. Jon . Kelner. John Peebles. Aaron . Sidford. Adrian . Vladu. Anup. . B. Rao. Rasmus. . Kyng. Outline. Graphs and . Lx. = . b. G .

Embed :
Presentation Download Link

Download Presentation - The PPT/PDF document "Nearly-Linear Time Algorithms for Marko..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Nearly-Linear Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs






Presentation on theme: "Nearly-Linear Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs"— Presentation transcript: