Geometric Bounds on the Fastest Mixing Markov Chain

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=Sfk9A0bNmC0


Duration: 23:02
170 views
4

13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
http://itcs-conf.org/

Geometric Bounds on the Fastest Mixing Markov Chain

Sam Olesker-Taylor (University of Bath)
Luca Zanetti (University of Bath)

https://doi.org/10.4230/LIPIcs.ITCS.2022.109



Other Videos By Simons Institute for the Theory of Computing


2022-01-28On polynomially many queries to NP or QMA oracles
2022-01-28Explicit Abelian Lifts and Quantum LDPC Codes
2022-01-28The importance of the spectral gap in estimating ground-state energies
2022-01-28Polynomial Identity Testing via Evaluation of Rational Functions
2022-01-28Almost-Orthogonal Bases for Inner Product Polynomials
2022-01-28More Dominantly Truthful Multi-task Peer Prediction with a Finite Number of Tasks
2022-01-28Classical algorithms and quantum limitations for maximum cut on high-girth graphs
2022-01-28Budget-Smoothed Analysis for Submodular Maximization
2022-01-28Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions
2022-01-28Lower Bounds on Stabilizer Rank
2022-01-28Geometric Bounds on the Fastest Mixing Markov Chain
2022-01-28A variant of the VC-dimension with applications to depth-3 circuits
2022-01-28Reduction From Non-Unique Games To Boolean Unique Games
2022-01-28Double Coverage with Machine-Learned Advice
2022-01-28Vertex Fault-Tolerant Emulators
2022-01-28Convex Influences
2022-01-28A Gaussian Fixed Point Random Walk
2022-01-28Maximizing revenue in the presence of intermediaries
2022-01-28Mixing in non-quasirandom groups
2022-01-28Sample-based Proofs of Proximity
2022-01-28Nonlinear Repair Schemes of Reed-Solomon Codes