Related papers: Cheeger inequalities for graph limits
In this paper, we study the schrodinger equation and wave equation with the Dirichlet boundary condition on a connected finite graph. The explicit expressions for solutions are given and the energy conservations are derived. Applications to…
Cheeger's inequality shows that any undirected graph $G$ with minimum nonzero normalized Laplacian eigenvalue $\lambda_G$ has a cut with conductance at most $O(\sqrt{\lambda_G})$. Qualitatively, Cheeger's inequality says that if the…
The Cheeger constant of a graph is the smallest possible ratio between the size of a subgraph and the size of its boundary. It is well known that this constant must be at least $\frac{\lambda_1}{2}$, where $\lambda_1$ is the smallest…
We study topological Poincar\'e type inequalities on general graphs. We characterize graphs satisfying such inequalities and then turn to the best constants in these inequalities. Invoking suitable metrics we can interpret these constants…
We prove Cheeger-Gromov convergence for a subsequence of a given sequence of manifolds-with-boundary of bounded geometry. The method of the proof is to reduce, via height functions, the problem to the setting of Hamilton's compactnes…
We investigate the bottom of the spectra of infinite quantum graphs, i.e., Laplace operators on metric graphs having infinitely many edges and vertices. We introduce a new definition of the isoperimetric constant for quantum graphs and then…
We present lower and upper bounds for the geometric-arithmetic index of unicyclic graphs and provide extremal graphs for the corresponding bounds.
It is a well-known result due to Bollobas that the maximal Cheeger constant of large $d$-regular graphs cannot be close to the Cheeger constant of the $d$-regular tree. We prove analogously that the Cheeger constant of closed hyperbolic…
We prove a formula for the intersection R-torsion of a finite cone and use it to introduce a family of spectral invariants which is closely related to Cheeger's half torsion.
In this article it is shown that the equilateral triangle maximizes the Cheeger constant and minimizes the torsional rigidity among shapes having a fixed minimal width. The proof techniques use direct comparisons with simpler shapes,…
We provide a suitable axiomatic framework for differential cohomology in the relative case and we deduce the corresponding long exact sequences. We also construct the relative version of the generalized Cheeger-Simons characters and we…
We prove new lower and upper bounds on the higher gonalities of finite graphs. These bounds are generalizations of known upper and lower bounds for first gonality to higher gonalities, including upper bounds on gonality involving…
The data clustering problem consists in dividing a data set into prescribed groups of homogeneous data. This is a NP-hard problem that can be relaxed in the spectral graph theory, where the optimal cuts of a graph are related to the…
A celebrated theorem of Kanai states that quasi-isometries preserve isoperimetric inequalities between uniform Riemannian manifolds (with positive injectivity radius) and graphs. Our main result states that we can study the (Cheeger)…
We show that the Cheeger constant of compact surfaces is bounded by a function of the area. We apply this to isoperimetric profiles of bounded genus non-compact surfaces, to show that if their isoperimetric profile grows faster than $\sqrt…
We work out the graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function $W(x,y)$ on the unit square, with $x$ and $y$ uniform on the interval $(0,1)$.…
We obtain some new inequalities of Chebyshev Type.
We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.
Coboundary and cosystolic expansion are notions of expansion that generalize the Cheeger constant or edge expansion of a graph to higher dimensions. The classical Cheeger inequality implies that for graphs edge expansion is equivalent to…
We show how the evolving set methodology of Morris and Peres can be used to show Cheeger inequalities for bounding the spectral gap of a finite Markov kernel. This leads to sharp versions of several previous Cheeger inequalities, including…