English
Related papers

Related papers: Cheeger Inequalities for Vertex Expansion and Rewe…

200 papers

In this paper, we discuss various connections between the smallest eigenvalue of the adjacency matrix of a graph and its structure. There are several techniques for obtaining upper bounds on the smallest eigenvalue, and some of them are…

Combinatorics · Mathematics 2019-12-10 Sebastian M. Cioabă , Randall J. Elzinga , David A. Gregory

Let $G_{\infty}=(C_m^d)_{\infty}$ denote the graph whose set of vertices is $\{1,..., m\}^d$, where two distinct vertices are adjacent iff they are either equal or adjacent in $C_m$ in each coordinate. Let $G_{1}=(C_m^d)_1$ denote the graph…

Combinatorics · Mathematics 2008-09-19 Noga Alon , Bo'az Klartag

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…

Analysis of PDEs · Mathematics 2024-10-08 Antonio Corbo Esposito , Gianpaolo Piscitelli

In this paper, some new forms of the Cheeger's inequalities are established for general (maybe unbounded) symmetric forms, the resulting estimates improve and extend the ones obtained by Lawler and Sokal (1988) for bounded jump processes.…

Probability · Mathematics 2009-09-25 Mu-Fa Chen , Feng-Yu Wang

We consider inhomogeneous Erd\H{o}s-R\'enyi graphs. We suppose that the maximal mean degree $d$ satisfies $d \ll \log n$. We characterize the asymptotic behavior of the $n^{1 - o(1)}$ largest eigenvalues of the adjacency matrix and its…

Probability · Mathematics 2017-04-11 Florent Benaych-Georges , Charles Bordenave , Antti Knowles

We introduce and develop equivalent spectral graph theory for several fundamental graph cut problems including maxcut, mincut, Cheeger cut, anti-Cheeger cut, dual Cheeger problem and their useful variants. A specified strategy for achieving…

Combinatorics · Mathematics 2026-01-21 Sihong Shao , Chuan Yang , Dong Zhang , Weixi Zhang

We consider gravity compactifications whose internal space consists of small bridges connecting larger manifolds, possibly noncompact. We prove that, under rather general assumptions, this leads to a massive spin-two field with very small…

High Energy Physics - Theory · Physics 2023-09-27 G. Bruno De Luca , Nicolò De Ponti , Andrea Mondino , Alessandro Tomasiello

In this paper, we define the volume entropy and the second Cheeger constant and prove a sharp isoperimetric inequality involving the volume entropy on Finsler metric measure manifolds with non-negative weighted Ricci curvature ${\rm…

Differential Geometry · Mathematics 2025-07-14 Xinyue Cheng , Yalu Feng , Liulin Liu

Here we study the spectral properties of an underlying weighted graph of a non-uniform hypergraph by introducing different connectivity matrices, such as adjacency, Laplacian and normalized Laplacian matrices. We show that different…

Combinatorics · Mathematics 2019-03-28 Anirban Banerjee

Several new spectral properties of the normalized Laplacian defined for oriented hypergraphs are shown. The eigenvalue $1$ and the case of duplicate vertices are discussed; two Courant nodal domain theorems are established; new quantities…

Combinatorics · Mathematics 2021-03-23 Raffaella Mulas , Dong Zhang

We conjecture that finite graphs with positive Cheeger constant admit a spanning subgraph with positive Cheeger constant and girth proportional to the diameter. We prove this conjecture for regular expander graphs with large expansion. Our…

Combinatorics · Mathematics 2021-12-04 Itai Benjamini , Mikolaj Fraczyk , Gabor Kun

In this article, we derive bounds for values of the global geometry of locally tessellating planar graphs, namely, the Cheeger constant and exponential growth, in terms of combinatorial curvatures. We also discuss spectral implications for…

Spectral Theory · Mathematics 2008-05-13 Matthias Keller , Norbert Peyerimhoff

We consider eigenvectors of adjacency matrices of Erd\H{o}s-R\'{e}nyi graphs and study the variation of their directions by resampling the entries randomly. Let $\mathbf{v}$ be the eigenvector associated with the second-largest eigenvalue…

Probability · Mathematics 2021-06-21 Jaehun Lee

We develop a spectral approach to Sidorenko-type inequalities and apply it to establish sharp edge-spectral supersaturation results. Let $H$ be a bipartite graph with $v$ vertices and $e$ edges, where $v\le e$, and write $M(G)=2e(G)$. We…

Combinatorics · Mathematics 2026-05-27 Yongtao Li , Wilson Lin , Hong Liu , Shengtong Zhang

We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.

Combinatorics · Mathematics 2007-05-23 Vladimir Nikiforov

Many inequality relations between real vector quantities can be succinctly expressed as "weak (sub)majorization" relations. We explain these ideas and apply them in several areas: angles between subspaces, Ritz values, and graph Laplacian…

Numerical Analysis · Mathematics 2013-03-26 A. V. Knyazev , M. E. Argentati

In this paper we consider the expansion properties and the spectrum of the combinatorial Laplace operator of a $d$-dimensional Linial-Meshulam random simplicial complex, above the cohomological connectivity threshold. We consider the…

Combinatorics · Mathematics 2020-06-18 Nikolaos Fountoulakis , Michał Przykucki

Let $(\bar{M},<,>,e^\psi)$ be a Riemannian manifold with a density, and let $M$ be a closed $n$-dimensional submanifold of $\bar{M}$ with the induced metric and density. We give an upper bound on the first eigenvalue $\lambda_1$ of the…

Differential Geometry · Mathematics 2020-05-06 M. Carmen Domingo-Juan , Vicente Miquel , Jonathan J. Zhu

We prove lower bounds for the first non-trivial eigenvalue of the drift Laplacian on manifolds with Wentzell-type boundary condition in terms of some Cheeger-type constants for bulk-boundary interactions. Our results are in the spirit of…

Probability · Mathematics 2025-03-25 Marie Bormann

We consider the problem of perfectly recovering the vertex correspondence between two correlated Erd\H{o}s-R\'enyi (ER) graphs. For a pair of correlated graphs on the same vertex set, the correspondence between the vertices can be obscured…

Information Theory · Computer Science 2016-02-03 Daniel Cullina , Negar Kiyavash