![Bridging Continuous and Discrete Optimization_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Bridging%20Continuous%20and%20Discrete%20Optimization_hi-res.png.jpg?itok=b7fmT0eV)
Abstract
A sequence of recent works has led to the development of nearly-linear time solvers for linear equations in Directed Laplacians. Among other things, this gives the first nearly-linear time algorithm for computing the stable distribution of directed random walks. I'll talk about the overall approach to solving these equations, developed by Michael and his co-authors, and I'll outline how we combined it with approximate Gaussian elimination to get the first nearly-linear time solver for Directed Laplacians.