On the isoperimetric spectrum of graphs and its approximations
From MaRDI portal
(Redirected from Publication:974467)
Abstract: In this paper we consider higher isoperimetric numbers of a (finite directed) graph. In this regard we focus on the th mean isoperimetric constant of a directed graph as the minimum of the mean outgoing normalized flows from a given set of disjoint subsets of the vertex set of the graph. We show that the second mean isoperimetric constant in this general setting, coincides with (the mean version of) the classical Cheeger constant of the graph, while for the rest of the spectrum we show that there is a fundamental difference between the th isoperimetric constant and the number obtained by taking the minimum over all -partitions. In this direction, we show that our definition is the correct one in the sense that it satisfies a Federer-Fleming-type theorem, and we also define and present examples for the concept of a supergeometric graph as a graph whose mean isoperimetric constants are attained on partitions at all levels. Moreover, considering the -completeness of the isoperimetric problem on graphs, we address ourselves to the approximation problem where we prove general spectral inequalities that give rise to a general Cheeger-type inequality as well. On the other hand, we also consider some algorithmic aspects of the problem where we show connections to orthogonal representations of graphs and following J.~Malik and J.~Shi () we study the close relationships to the well-known -means algorithm and normalized cuts method.
Recommendations
Cites work
- scientific article; zbMATH DE number 3877889 (Why is no real title available?)
- scientific article; zbMATH DE number 3680356 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 18980 (Why is no real title available?)
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- scientific article; zbMATH DE number 1219775 (Why is no real title available?)
- scientific article; zbMATH DE number 1069282 (Why is no real title available?)
- scientific article; zbMATH DE number 2042290 (Why is no real title available?)
- scientific article; zbMATH DE number 2060183 (Why is no real title available?)
- scientific article; zbMATH DE number 2151249 (Why is no real title available?)
- scientific article; zbMATH DE number 2105641 (Why is no real title available?)
- A discrete nodal domain theorem for trees
- Analytic inequalities, isoperimetric inequalities and logarithmic Sobolev inequalities
- Chromatic number and the 2-rank of a graph
- Circular colouring and algebraic no-homomorphism theorems
- Clustering large graphs via the singular value decomposition
- Courant's Nodal Line Theorem and Its Discrete Counterparts
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- Discrete nodal domain theorems
- Eigenspaces of graphs
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- Geometry and spectra of compact Riemann surfaces
- Graph homomorphisms and nodal domains
- Graph homomorphisms through random walks
- Higher eigenvalues and isoperimetric inequalities on Riemannian manifolds and graphs
- Isoperimetric invariants for product Markov chains and graph products
- Isoperimetric numbers of graphs
- Isoperimetric properties of higher eigenvalues of elliptic operators
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- Laplacians and the Cheeger inequality for directed graphs
- On eigenfunctions of Markov processes on trees
- On the Shannon capacity of a graph
- Open problems of Paul Erd�s in graph theory
- Patterns in eigenvalues: the 70th Josiah Willard Gibbs lecture
- Perron-Frobenius type results and discrete versions of nodal domain theorems
- Potential theory on infinite networks
- Sensitivity analysis of all eigenvalues of a symmetric matrix
- Some geometric aspects of graphs and their eigenfunctions
- \(\lambda_{\infty}\), vertex isoperimetry and concentration
Cited in
(17)- The isoperimetric and Kazhdan constants associated to a Paley graph
- Multi-way sparsest cut problem on trees with a control on the number of parts and outliers
- Nodal domain theorems for \(p\)-Laplacians on signed graphs
- On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes
- Isospectral graph reductions and improved estimates of matrices' spectra
- Computing the isoperimetric number of a graph
- A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization
- Approximating the isoperimetric number of strongly regular graphs
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- On the complexity of isoperimetric problems on trees
- Mean isoperimetry with control on outliers: exact and approximation algorithms
- Higher Cheeger ratios of features in Laplace-Beltrami eigenfunctions
- Isoperimetric inequalities, growth, and the spectrum of graphs
- The isospectral problem in graph theory
- Nonconvex weak sharp minima on Riemannian manifolds
- An isoperimetric constant for signed graphs
- Clustering and outlier detection using isoperimetric number of trees
This page was built for publication: On the isoperimetric spectrum of graphs and its approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974467)
