Edge isoperimetry and rapid mixing on matroids and geometric Markov chains

DOI10.1145/380752.380876zbMath1323.60093OpenAlexW2161120210MaRDI QIDQ5176029

Ravi Montenegro, Jung-Bae Son

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380876

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Evolving sets, mixing and heat kernel bounds

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: Edge isoperimetry and rapid mixing on matroids and geometric Markov chains