A note on the Poincar\'e and Cheeger inequalities for simple random walk on a connected graph
From MaRDI portal
Publication:6236540
arXiv1210.5777MaRDI QIDQ6236540FDOQ6236540
Publication date: 21 October 2012
Abstract: In 1991, Persi Diaconis and Daniel Stroock obtained two canonical path bounds on the second largest eigenvalue for simple random walk on a connected graph, the Poincar'e and Cheeger bounds, and they raised the question as to whether the Poincar'e bound is always superior. In this paper, we present some background on these issues, provide an example where Cheeger beats Poincar'e, establish some sufficient conditions on the canonical paths for the Poincar'e bound to triumph, and show that there is always a choice of paths for which this happens.
This page was built for publication: A note on the Poincar\'e and Cheeger inequalities for simple random walk on a connected graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6236540)
