English
Related papers

Related papers: Higher Dimensional Discrete Cheeger Inequalities

200 papers

This paper introduces the notion of local spectral expansion of a simplicial complex as a possible analogue of spectral expansion defined for graphs. We then show that the condition of local spectral expansion for a complex yields various…

Combinatorics · Mathematics 2017-09-14 Izhar Oppenheim

We show that for convex domains in Euclidean space, Cheeger's isoperimetric inequality, spectral gap of the Neumann Laplacian, exponential concentration of Lipschitz functions, and the a-priori weakest requirement that Lipschitz functions…

Metric Geometry · Mathematics 2008-12-24 Emanuel Milman

We introduce a generalization of the celebrated Lov\'asz theta number of a graph to simplicial complexes of arbitrary dimension. Our generalization takes advantage of real simplicial cohomology theory, in particular combinatorial…

Combinatorics · Mathematics 2017-04-07 Christine Bachoc , Anna Gundert , Alberto Passuello

Let G=(V,E) be an undirected graph, lambda_k be the k-th smallest eigenvalue of the normalized laplacian matrix of G. There is a basic fact in algebraic graph theory that lambda_k > 0 if and only if G has at most k-1 connected components.…

Data Structures and Algorithms · Computer Science 2013-12-09 Shayan Oveis Gharan , Luca Trevisan

We perform quantitative spectral analysis of the self-adjoint Dirichlet Laplacian $\mathsf{H}$ on an unbounded, radially symmetric (generalized) parabolic layer $\mathcal{P}\subset\mathbb{R}^3$. It was known before that $\mathsf{H}$ has an…

Spectral Theory · Mathematics 2018-06-01 Pavel Exner , Vladimir Lotoreichik

We introduce submodular hypergraphs, a family of hypergraphs that have different submodular weights associated with different cuts of hyperedges. Submodular hypergraphs arise in clustering applications in which higher-order structures carry…

Machine Learning · Computer Science 2018-10-12 Pan Li , Olgica Milenkovic

Let M be a bounded domain of a Euclidian space with smooth boundary. We relate the Cheeger constant of M and the conductance of a neighborhood graph defined on a random sample from M. By restricting the minimization defining the latter over…

Statistics Theory · Mathematics 2013-03-05 Ery Arias-Castro , Bruno Pelletier , Pierre Pudlo

Let $d \geq 2$. The Cheeger constant of a graph is the minimum surface-to-volume ratio of all subsets of the vertex set with relative volume at most 1/2. There are several ways to define surface and volume here: the simplest method is to…

Probability · Mathematics 2018-05-23 Tobias Müller , Mathew D. Penrose

Higher order random walks (HD-walks) on high dimensional expanders (HDX) have seen an incredible amount of study and application since their introduction by Kaufman and Mass [KM16], yet their broader combinatorial and spectral properties…

Computational Complexity · Computer Science 2021-07-20 Mitali Bafna , Max Hopkins , Tali Kaufman , Shachar Lovett

Let $\mathbb{Q}_{k,n}$ be the set of the connected $k$-uniform weighted hypergraphs with $n$ vertices, where $k,n\geq 3$. For a hypergraph $G\in \mathbb{Q}_{k,n}$, let $\mathcal{A}(G)$, $\mathcal{L} (G)$ and $\mathcal{Q} (G)$ be its…

Combinatorics · Mathematics 2022-03-01 Rui Sun , Wen-Huan Wang

The property of exponential dichotomy can be seen as a generalization of the hyperbolicity condition for non autonomous linear finite dimensional systems of ordinary differential equations. In 1978 W.A. Coppel proved that the exponential…

Classical Analysis and ODEs · Mathematics 2024-11-11 Heli Elorreaga , Juan Peña , Gonzalo Robledo

We study the interplay between spectrum, geometry and boundary conditions for two distinguished self-adjoint realisations of the Laplacian on infinite metric graphs, the so-called riedrichs and Neumann extensions. We introduce a new…

Spectral Theory · Mathematics 2025-10-03 Marco Düfel , James B. Kennedy , Delio Mugnolo , Marvin Plümer , Matthias Täufer

In this article we study the top of the spectrum of the normalized Laplace operator on infinite graphs. We introduce the dual Cheeger constant and show that it controls the top of the spectrum from above and below in a similar way as the…

Spectral Theory · Mathematics 2012-07-17 Frank Bauer , Bobo Hua , Juergen Jost

Expander graphs have been intensively studied in the last four decades. In recent years a high dimensional theory of expanders has emerged, and several variants have been studied. Among them stand out coboundary expansion and topological…

Combinatorics · Mathematics 2014-10-28 Tali Kaufman , David Kazhdan , Alexander Lubotzky

Let $(M,g)$ be a non-compact riemannian $n$-manifold with bounded geometry at order $k\geq\frac{n}{2}$. We show that if the spectrum of the Laplacian starts with $q+1$ discrete eigenvalues isolated from the essential spectrum, and if the…

Differential Geometry · Mathematics 2010-01-15 Samuel Tapie

In this paper, we study the higher Steklov eigenvalues of graphs on surfaces. We obtain the upper bound of higher Steklov eigenvalues of a finite graph $G$ with boundary $B$ and genus $g$ by using metrical deformation via probability flows.…

Combinatorics · Mathematics 2026-02-03 Xiongfeng Zhan , Zhe You

The size of the smallest $k$-regular graph of girth at least $g$ is denoted by the well-studied function $n(k,g)$. We introduce an analogous function $n(H,g)$, defined as the smallest size graph of girth at least $g$ that is a lift (or…

Combinatorics · Mathematics 2025-12-25 Shlomo Hoory

This is the first article of a series of our recent works, addressing an open question of Bonk-Heinonen-Koskela [5], to study the relationship between (inner) uniformality and Gromov hyperbolicity in infinite dimensional spaces. Our main…

Complex Variables · Mathematics 2026-03-05 Chang-Yu Guo , Manzi Huang , Xiantao Wang

Let $G$ be a connected uniform hypergraphs with maximum degree $\Delta$, spectral radius $\lambda$ and minimum H-eigenvalue $\mu$. In this paper, we give some lower bounds for $\Delta-\lambda$, which extend the result of [S.M. Cioab\u{a},…

Combinatorics · Mathematics 2015-12-01 Jiang Zhou , Lizhu Sun , Changjiang Bu

The collapsibility number of simplicial complexes was introduced by Wegner in order to understand the intersection patterns of convex sets. This number also plays an important role in a variety of Helly type results. We show that the…

Combinatorics · Mathematics 2024-04-26 Rekha Santhanam , Samir Shukla , Anurag Singh
‹ Prev 1 8 9 10 Next ›