相关论文: Buser's inequality on infinite graphs

In this paper, we derive Li-Yau inequality for unbounded Laplacian on complete weighted graphs with the assumption of the curvature-dimension inequality $CDE'(n,K)$, which can be regarded as a notion of curvature on graphs. Furthermore, we…

In this paper, we study some functional inequalities (such as Poincar\'e inequalities, logarithmic Sobolev inequalities, generalized Cheeger isoperimetric inequalities, transportation-information inequalities and transportation-entropy…

We prove a lower bound for the Cheeger constant of a cylinder $\Omega\times (0,L)$, where $\Omega$ is an open and bounded set. As a consequence, we obtain existence of minimizers for the shape functional defined as the ratio between the…

We prove that for manifolds with negative curvature bounded away from $0$ of infinite volume and bounded geometry, the bounded fundamental class, defined via integration of the volume form over straight top-dimensional simplices, vanishes…

We establish some important inequalities under the condition that the weighted Ricci curvature $\mathrm{Ric}_{\infty}\geq K$ for some constant $K >0$ by using improved Bochner inequality and its integrated form. Firstly, we obtain a sharp…

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…

We prove the sharp inequality \[ J(\Omega) := \frac{\lambda_1(\Omega)}{h_1(\Omega)^2} < \frac{\pi^2}{4},\] where $\Omega$ is any planar, convex set, $\lambda_1(\Omega)$ is the first eigenvalue of the Laplacian under Dirichlet boundary…

In this note we study the eigenvalue growth of infinite graphs with discrete spectrum. We assume that the corresponding Dirichlet forms satisfy certain Sobolev-type inequalities and that the total measure is finite. In this sense, the…

We review the theory of Cheeger constants for graphs and quantum graphs and their present and envisaged applications.

We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…

We discuss optimal lower bounds for eigenvalues of Laplacians on weighted graphs. These bounds are formulated in terms of the geometry and, more specifically, the inradius of subsets of the graph. In particular, we study the first non-zero…

We investigate the distribution of eigenvalues of the weighted Laplacian on closed weighted Riemannian manifolds of nonnegative Bakry-\'Emery Ricci curvature. We derive some universal inequalities among eigenvalues of the weighted Laplacian…

We show a connection between the $CDE'$ inequality and the $CD\psi$ inequality. In particular, we introduce a $CD_\psi^\varphi$ inequality as a slight generalization of $CD\psi$ which turns out to be equivalent to $CDE'$ with appropriate…

Let $G$ be a graph, and let $\lambda(G)$ denote the smallest eigenvalue of $G$. First, we provide an upper bound for $\lambda(G)$ based on induced bipartite subgraphs of $G$. Consequently, we extract two other upper bounds, one relying on…

We study some versions of the statement of Hadwiger's conjecture for finite as well as infinite graphs.

We prove a general result characterizing a specific class of Serrin domains as supports of unbounded and periodic constant mean curvature graphs. We apply this result to prove the existence of a family of unbounded periodic constant mean…

We show that if a planar graph $G$ with minimum degree at least $3$ has positive Lin-Lu-Yau Ricci curvature on every edge, then $\Delta(G)\leq 17$, which then implies that $G$ is finite. This is an analogue of a result of DeVos and Mohar…

Consider a Riemannian manifold with bounded Ricci curvature $|\Ric|\leq n-1$ and the noncollapsing lower volume bound $\Vol(B_1(p))>\rv>0$. The first main result of this paper is to prove that we have the $L^2$ curvature bound…

A basic fact in algebraic graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue 1 in the normalized adjacency matrix of the graph. In particular, the graph is…

We apply Cauchy's interlacing theorem to derive some eigenvalue bounds to the chromatic number using the normalized Laplacian matrix, including a combinatorial characterization of when equality occurs. Further, we introduce some new…