On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes
DOI10.1016/J.SPA.2012.02.009zbMATH Open1260.60153OpenAlexW2154656691MaRDI QIDQ424499FDOQ424499
Authors: Amir Daneshgar, Ramin Javadi, Laurent Miclo 
Publication date: 1 June 2012
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spa.2012.02.009
Recommendations
- Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
- Une variante de l'inégalité de Cheeger pour les chaînes de Markov finies
- Sharp edge, vertex, and mixed Cheeger inequalities for finite Markov kernels
- Geometric bounds for eigenvalues of Markov chains
- Multi-way dual Cheeger constants and spectral bounds of graphs
Random graphs (graph-theoretic aspects) (05C80) Inequalities; stochastic orderings (60E15) Paths and cycles (05C38) Continuous-time Markov processes on discrete state spaces (60J27) Transition functions, generators and resolvents (60J35) Discrete potential theory (31C20)
Cites Work
- Title not available (Why is that?)
- Perturbation theory for linear operators.
- Title not available (Why is that?)
- The number of nodal domains on quantum graphs as a stability index of graph partitions
- Nodal domains and spectral minimal partitions
- Title not available (Why is that?)
- On spectral minimal partitions: the case of the sphere
- Geometric bounds for eigenvalues of Markov chains
- On the isoperimetric spectrum of graphs and its approximations
- Eigenvalues, Inequalities, and Ergodic Theory
- Speed of stability for birth-death processes
- On eigenfunctions of Markov processes on trees
- Cheeger's inequalities for general symmetric forms and existence criteria for spectral gap.
- Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- A discrete nodal domain theorem for trees
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- Some geometric aspects of graphs and their eigenfunctions
- \(L_p\)-bounds on curvature, elliptic estimates and rectifiability of singular sets
- The inverse eigenvalue problem for Hermitian matrices whose graphs are cycles
Cited In (13)
- Multi-way sparsest cut problem on trees with a control on the number of parts and outliers
- EXPANSION CONSTANTS AND HYPERBOLIC EMBEDDINGS OF FINITE GRAPHS
- Upper bounds for higher-order Poincaré constants
- Sharp edge, vertex, and mixed Cheeger inequalities for finite Markov kernels
- On eigenfunctions of Markov processes on trees
- Multi-way spectral partitioning and higher-order cheeger inequalities
- Multi-way dual Cheeger constants and spectral bounds of graphs
- On the complexity of isoperimetric problems on trees
- Mean isoperimetry with control on outliers: exact and approximation algorithms
- Cheeger estimates of Dirichlet-to-Neumann operators on infinite subgraphs of graphs
- Nodal domain count for the generalized graph \(p\)-Laplacian
- On hyperboundedness and spectrum of Markov operators
- Cheeger's inequalities for general symmetric forms and existence criteria for spectral gap.
This page was built for publication: On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q424499)
