Comparing mixing times on sparse random graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Anna Ben-Hamou, Eyal Lubetzky, Yuval Peres. Comparing mixing times on sparse random graphs. In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018. pages 1734-1740, SIAM, 2018. [doi]

This author has not been identified. Look up 'Anna Ben-Hamou' in GoogleThis author has not been identified. Look up 'Eyal Lubetzky' in GoogleThis author has not been identified. Look up 'Yuval Peres' in Google

runs on WebDSL