English
Related papers

Related papers: Higher Dimensional Discrete Cheeger Inequalities

200 papers

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…

Spectral Theory · Mathematics 2018-12-17 Aleksey Kostenko , Noema Nicolussi

We present a new method for upper bounding the second eigenvalue of the Laplacian of graphs. Our approach uses multi-commodity flows to deform the geometry of the graph; we embed the resulting metric into Euclidean space to recover a bound…

Data Structures and Algorithms · Computer Science 2008-08-09 Punyashloka Biswal , James R. Lee , Satish Rao

Suppose that $(X,d,\mu)$ is a metric measure space of finite Hausdorff dimension and that, for every Lipschitz $f \colon X \to \mathbb R$, $\operatorname{Lip}(f,\cdot)$ is dominated by every upper gradient of $f$. We show that $X$ is a…

Metric Geometry · Mathematics 2023-03-20 David Bate , Ilmari Kangasniemi , Tuomas Orponen

A strong interaction is known to exist between edge-colored graphs (which encode PL pseudo-manifolds of arbitrary dimension) and random tensor models (as a possible approach to the study of Quantum Gravity). The key tool is the {\it…

Geometric Topology · Mathematics 2018-10-03 Maria Rita Casali , Luigi Grasselli

How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…

Combinatorics · Mathematics 2015-04-08 Éric Colin de Verdière , Alfredo Hubard , Arnaud de Mesmay

We prove generalized Cheeger inequalities for eigenvalues of Laplacians for reversible Markov chains. Then we apply Hassannezhad and Miclo's convergence result to obtain Jammes Cheeger inequalities for Steklov eigenvalues. In particular, we…

Differential Geometry · Mathematics 2025-09-09 Bobo Hua , Supanat Kamtue , Shiping Liu , Florentin Münch , Norbert Peyerimhoff

We discuss the behavior of $(\lambda_{1. p}(M))^{1/p}$ with respect to the Gromov-Hausdorff topology and the variable $p$, where $\lambda_{1, p}(M)$ is the first positive eigenvalue of the $p$-Laplacian on a compact Riemannian manifold $M$.…

Differential Geometry · Mathematics 2014-03-04 Shouhei Honda

We consider a family of non-compact manifolds $X_\eps$ (``graph-like manifolds'') approaching a metric graph $X_0$ and establish convergence results of the related natural operators, namely the (Neumann) Laplacian $\laplacian {X_\eps}$ and…

Mathematical Physics · Physics 2009-11-11 Olaf Post

We introduce and study a new combinatorial invariant the theta-number $\theta(X)$ of simplicial complexes, and prove that the inequality $\mathcal{C}(X)\leq \theta(X)$ holds for every simplicial complex $X$, where $\mathcal{C}(X)$ denotes…

Combinatorics · Mathematics 2023-02-24 Türker Bıyıkoğlu , Yusuf Civan

In this paper, we study eigenvalues and eigenfunctions of $p$-Laplacians with Dirichlet boundary condition on graphs. We characterize the first eigenfunction (and the maximum eigenfunction for a bipartite graph) via the sign condition. By…

Spectral Theory · Mathematics 2018-12-27 Bobo Hua , Lili Wang

Given a finite regular graph G=(V,E) and a metric space (X,d_X), let $gamma_+(G,X) denote the smallest constant $\gamma_+>0$ such that for all f,g:V\to X we have: \frac{1}{|V|^2}\sum_{x,y\in V} d_X(f(x),g(y))^2\le \frac{\gamma_+}{|E|}…

Metric Geometry · Mathematics 2010-03-02 Manor Mendel , Assaf Naor

In this paper, we use various versions of Lov\'asz extension to systematically derive continuous formulations of problems from discrete mathematics. This will take place in the following context: (1) For combinatorial optimization problems…

Combinatorics · Mathematics 2023-05-16 Jürgen Jost , Dong Zhang

The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest…

Combinatorics · Mathematics 2014-11-25 Fan-Hsuan Lin , Chih-wen Weng

We give new bounds on the cosystolic expansion constants of several families of high dimensional expanders, and the known coboundary expansion constants of order complexes of homogeneous geometric lattices, including the spherical building…

Combinatorics · Mathematics 2024-10-18 Yotam Dikstein , Irit Dinur

This paper extends the Bakry-\'{E}mery theorem connecting the Ricci curvature and log-Sobolev inequalities to the matrix-valued setting. Using tools from noncommuative geometry, it is shown that for a right invariant second order…

Mathematical Physics · Physics 2020-07-01 Haojian Li , Marius Junge , Nicholas LaRacuente

We investigate the spectral properties of the Dirichlet Laplacian on large finite metric balls within irregular infinite graphs of quadratic volume growth. We consider an exhaustion $G_n = B_{R_n}(x_0)$ and the spectral zeta value $Z_n(1) =…

Functional Analysis · Mathematics 2025-12-01 Da Xu

In this paper we extend the known results of analytic connectivity to non-uniform hypergraphs. We prove a modified Cheeger's inequality and also give a bound on analytic connectivity with respect to the degree sequence and diameter of a…

Discrete Mathematics · Computer Science 2017-01-18 Ashwin Guha , Muni Sreenivas Pydi , Biswajit Paria , Ambedkar Dukkipati

In this paper, we present a new construction of simplicial complexes of subpolynomial degree with arbitrarily good local spectral expansion. Previously, the only known high-dimensional expanders (HDXs) with arbitrarily good expansion and…

Combinatorics · Mathematics 2023-12-27 Louis Golowich

The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…

Combinatorics · Mathematics 2021-07-21 Bilal A. Rather

Let $G$ be a random graph on the vertex set $\{1,2,..., n\}$ such that edges in $G$ are determined by independent random indicator variables, while the probability $p_{ij}$ for $\{i,j\}$ being an edge in $G$ is not assumed to be equal.…

Combinatorics · Mathematics 2012-04-30 Linyuan Lu , Xing Peng