On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes
AbstractLet L be a reversible Markovian generator on a finite set V. Relations between the spectral decomposition of L and subpartitions of the state space V into a given number of components which are optimal with respect to min–max or max–min Dirichlet connectivity criteria are investigated. Links are made with higher-order Cheeger inequalities and with a generic characterization of subpartitions given by the nodal domains of an eigenfunction. These considerations are applied to generators whose positive rates are supported by the edges of a discrete cycle ZN, to obtain a full description of their spectra and of the shapes of their eigenfunctions, as well as an interpretation of the spectrum through a double-covering construction. Also, we prove that for these generators, higher Cheeger inequalities hold, with a universal constant factor 48.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal Stochastic Processes and their Applications.
Volume (Year): 122 (2012)
Issue (Month): 4 ()
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.