Related papers: Isoperimetric and Sobolev inequalities for magneti…
Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…
We consider a dual Cheeger constant $\overline h$ for finite graphs with edge weights from an arbitrary real-closed ordered field. We obtain estimates of $\overline h$ in terms of number of vertices in graph. Further, we estimate the…
We establish the validity of the isoperimetric inequality (or equivalently, an $L^1$ Euclidean-type Sobolev inequality) on manifolds with asymptotically non-negative sectional curvature. Unlike previous results in the literature, our…
We provide sharp bounds for the isoperimetric constants of infinite plane graphs (tessellations) with bounded vertex and face degrees. For example, if $G$ is a plane graph satisfying the inequalities $p_1 \leq \mbox{deg}\ v \leq p_2$ for $v…
As a non-trivial extension of the celebrated Cheeger inequality, the higher-order Cheeger inequalities for graphs due to Lee, Oveis Gharan and Trevisan provide for each $k$ an upper bound for the $k$-way Cheeger constant in forms of…
Given an undirected graph $G$, the classical Cheeger constant, $h_G$, measures the optimal partition of the vertices into 2 parts with relatively few edges between them based upon the sizes of the parts. The well-known Cheeger's inequality…
We study spectral properties of the standard (also called Kirchhoff) Laplacian and the anti-standard (or anti-Kirchhoff) Laplacian on a finite, compact metric graph. We show that the positive eigenvalues of these two operators coincide…
We consider the Grassmann graphs and dual polar graphs over the same finite field and show that, up to graph automorphism, for every dual polar graph there is the unique isometric embedding in the corresponding Grassmann graph.
We investigate the space of non-local Sobolev functions associated with an integral kernel. We prove an extension result, Sobolev and Poincar\'e inequalities and an isoperimetric inequality for the non-local perimeter restricted to a set.…
An old problem raised independently by Jacobson and Sch\"onheim asks to determine the maximum $s$ for which every graph with $m$ edges contains a pair of edge-disjoint isomorphic subgraphs with $s$ edges. In this paper we determine this…
We introduce notions of Cheeger constants for graphons and graphings. We prove Cheeger and Buser inequalities for these. On the way we prove co-area formulae for graphons and graphings.
Inspired by the notion of action convergence in graph limit theory, we introduce a measure-theoretic representation of matrices, and we use it to define a new notion of pseudo-metric on the space of matrices. Moreover, we show that such…
We derive Gaussian heat kernel bounds on graphs with respect to a fixed origin for large times under the assumption of a Sobolev inequality and volume doubling on large balls. The upper bound from our previous work [KR22] is affected by a…
We prove a version of Talagrand's concentration inequality for subordinated sub-Laplacian on a compact Riemannian manifold using tools from noncommutative geometry. As an application, motivated by quantum information theory, we show that on…
For any subgraph of a graph, the Laplacian with Neumann boundary condition was introduced by Chung and Yau [CY94]. In this paper, motivated by the Riemannian case, we introduce the Cheeger constants for Neumann problems and prove…
Let $B_2(p)$ be an $n$-dimensional smooth geodesic ball with Ricci curvature $\geq-(n-1)\kappa^2$ for some $\kappa\geq0$. We establish the Sobolev inequality and the uniform Neumann-Poincar\'e inequality on each minimal graph over $B_1(p)$…
New isoperimetric inequalities for lower order eigenvalues of the Laplacian on closed hypersurfaces, of the biharmonic Steklov problems and of the Wentzell-Laplace on bounded domains in a Euclidean space are proven. Some open questions for…
A basic fact in spectral graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of the graph. In particular, the graph is disconnected if…
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.
Combining the sharp isoperimetric inequality established by Z. Balogh and A. Krist\'aly [Math. Ann., in press, doi:10.1007/s00208-022-02380-1] with an anisotropic symmetrization argument, we establish sharp Morrey-Sobolev inequalities on…