Related papers: A Cheeger inequality for graphs based on a reflect…

In this paper, we prove a variant of the Burger-Brooks transfer principle which, combined with recent eigenvalue bounds for surfaces, allows to obtain upper bounds on the eigenvalues of graphs as a function of their genus. More precisely,…

We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph…

In \cite{Elek} we proved that the limit of a weakly convergent sequence of finite graphs can be viewed as a graphing or a continuous field of infinite graphs. Thus one can associate a type $II_1$-von Neumann algebra to such graph sequences.…

Inequalities for the eigenvalues of the (negative) Laplacian subject to mixed boundary conditions on polyhedral and more general bounded domains are established. The eigenvalues subject to a Dirichlet boundary condition on a part of the…

We prove a Cheeger inequality for the first positive Steklov eigenvalue. It involves two isoperimetric constants.

We introduce a family of multi-way Cheeger-type constants $\{h_k^{\sigma}, k=1,2,\ldots, n\}$ on a signed graph $\Gamma=(G,\sigma)$ such that $h_k^{\sigma}=0$ if and only if $\Gamma$ has $k$ balanced connected components. These constants…

The first nontrivial eigenfunction of the Neumann eigenvalue problem for the $p$-Laplacian, suitable normalized, converges as $p$ goes to $\infty$ to a viscosity solution of an eigenvalue problem for the $\infty$-Laplacian. We show among…

We derive an optimal eigenvalue ratio estimate for finite weighted graphs satisfying the curvature-dimension inequality $CD(0,\infty)$. This estimate is independent of the size of the graph and provides a general method to obtain higher…

In this note we prove a version of the classical Schwarz lemma for the first eigenvalues of the Laplacian with Dirichlet boundary data. A key ingredient in our proof is an isoperimetric inequality for the first eigenfunction, due to Payne…

We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…

Let \phi(G) be the minimum conductance of an undirected graph G, and let 0=\lambda_1 <= \lambda_2 <=... <= \lambda_n <= 2 be the eigenvalues of the normalized Laplacian matrix of G. We prove that for any graph G and any k >= 2, \phi(G) =…

Let $G$ be a simple graph with adjacency matrix $A(G)$, signless Laplacian matrix $Q(G)$, degree diagonal matrix $D(G)$ and let $l(G)$ be the line graph of $G$. In 2017, Nikiforov defined the $A_\alpha$-matrix of $G$, $A_\alpha(G)$, as a…

Formal Laplace operators are analyzed for a large class of resistance networks with vertex weights. The graphs are completed with respect to the minimal resistance path metric. Compactness and a novel connectivity hypothesis for the…

In this paper, we obtain sharp Faber-Krahn inequalities for the first Dirichlet eigenvalue of the combinatorial $p$-Laplacian on connected graphs with a fixed number of vertices or with a fixed number of edges. More precisely, we show that…

We establish the existence of analytic curves of eigenvalues for the Laplace-Neumann operator through an analytic variation of the metric of a compact Riemannian manifold $M$ with boundary by means of a new approach rather than Kato's…

We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…

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…

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…

Consider a quantum graph consisting of a ring with two attached edges, and assume Kirchhoff-Neumann conditions hold at the internal vertices. Associated to this graph is a Schr\"{o}dinger type operator $L=-\Delta +q(x)$ with Dirichlet…

We generalize the notion of Lagrangian subspaces to self-orthogonal subspaces with respect to a (skew-)symmetric form, thus characterizing (skew-)self-adjoint and unitary operators by means of self-ortho-gonal subspaces. By orthogonality…