On the isoperimetric spectrum of graphs and its approximations
From MaRDI portal
Publication:974467
DOI10.1016/j.jctb.2010.01.002zbMath1203.05063arXiv0801.0278OpenAlexW2138300049MaRDI QIDQ974467
Hossein Hajiabolhassan, Ramin Javadi, Amir Daneshgar
Publication date: 3 June 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0801.0278
Related Items (9)
Mean isoperimetry with control on outliers: exact and approximation algorithms ⋮ A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization ⋮ Clustering and outlier detection using isoperimetric number of trees ⋮ Nodal domain theorems for \(p\)-Laplacians on signed graphs ⋮ On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes ⋮ Multi-way sparsest cut problem on trees with a control on the number of parts and outliers ⋮ An isoperimetric constant for signed graphs ⋮ Nonconvex weak sharp minima on Riemannian manifolds ⋮ On the complexity of isoperimetric problems on trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isoperimetric invariants for product Markov chains and graph products
- Clustering large graphs via the singular value decomposition
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- Graph homomorphisms and nodal domains
- On eigenfunctions of Markov processes on trees
- Analytic inequalities, isoperimetric inequalities and logarithmic Sobolev inequalities
- Perron-Frobenius type results and discrete versions of nodal domain theorems
- Some geometric aspects of graphs and their eigenfunctions
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- Potential theory on infinite networks
- Sensitivity analysis of all eigenvalues of a symmetric matrix
- Laplacians and the Cheeger inequality for directed graphs
- Chromatic number and the 2-rank of a graph
- A discrete nodal domain theorem for trees
- Circular colouring and algebraic no-homomorphism theorems
- Isoperimetric numbers of graphs
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- On the Shannon capacity of a graph
- Courant's Nodal Line Theorem and Its Discrete Counterparts
- [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
- Graph homomorphisms through random walks
- Isoperimetric properties of higher eigenvalues of elliptic operators
- Patterns in eigenvalues: the 70th Josiah Willard Gibbs lecture
- Geometry and spectra of compact Riemann surfaces
- \(\lambda_{\infty}\), vertex isoperimetry and concentration
- Higher eigenvalues and isoperimetric inequalities on Riemannian manifolds and graphs
- Discrete nodal domain theorems
This page was built for publication: On the isoperimetric spectrum of graphs and its approximations
