相关论文: On the eigenvalue estimates for the weighted Lapla…

We provide upper and lower bounds on the smallest eigenvalue of grounded Laplacian matrices (which are matrices obtained by removing certain rows and columns of the Laplacian matrix of a given graph). The gap between the upper and lower…

A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…

From a graph $G$ with constant valency $v$ and a (non-compact) manifold $C$ with $v$ boundary components, we build a $G$-periodic manifold $M$. This process gives a class of topologically infinite manifolds which generalizes periodic…

We prove explicit and sharp eigenvalue estimates for Neumann $p$-Laplace eigenvalues in domains that admit a representation in Fermi coordinates. More precisely, if $\gamma$ denotes a non-closed curve in $\mathbb{R}^2$ symmetric with…

We derive various eigenvalue estimates for the Hodge Laplacian acting on differential forms on weighted Riemannian manifolds. Our estimates unify and extend various results from the literature and we provide a number of geometric…

Given a simple graph $G$, its $A_\alpha$ matrix is a convex combination with parameter $\alpha\in [0,1]$ of its adjacency matrix and its degree diagonal matrices. Here we compare two lower bounds presented in [J. D. G. Silva Jr., C. S.…

Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…

Let $G=(V,E)$ be an $n$-vertex graph, $L(G)\in \mathbb{R}^{n\times n}$ its Laplacian matrix, and let $\lambda_1(L(G))\ge \lambda_2(L(G))\ge \cdots\ge \lambda_n(L(G))=0$ denote its eigenvalues. For $1\le k\le n$, let $\varepsilon_k(G)=…

We study the non-existence, existence and multiplicity of positive solutions to the following nonlinear Kirchhoff equation:% \begin{equation*} \left\{ \begin{array}{l} -M\left( \int_{\mathbb{R}^{3}}\left\vert \nabla u\right\vert…

We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…

Under mild assumptions, we show that a connected weighted graph $G$ with lower Ricci curvature bound $K>0$ in the sense of Bakry-\'Emery and the $d$-th non-zero Laplacian eigenvalue $\lambda_d$ close to $K$, with $d$ being the maximal…

Consider a compact Riemannian manifold with boundary. In this short note we prove that under certain positive curvature assumptions on the manifold and its boundary the Steklov eigenvalues of the manifold are controlled by the Laplace…

The Krein-von Neumann extension is studied for Schr\"odinger operators on metric graphs. Among other things, its vertex conditions are expressed explicitly, and its relation to other self-adjoint vertex conditions (e.g.…

We examine diagonal combs, a recently identified class of infinite metric graphs whose properties depend on one parameter. These graphs exhibit a fascinating regime where they possess infinite volume while maintaining purely discrete…

Inspired by a recent result of Davies and Pushnitski, we study resonance asymptotics of quantum graphs with general coupling conditions at the vertices. We derive a criterion for the asymptotics to be of a non-Weyl character. We show that…

Consider two quantum graphs with the standard Laplace operator and non-Robin type boundary conditions at all vertices. We show that if their eigenvalue-spectra agree everywhere aside from a sufficiently sparse set, then the…

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…

We study the consistency of Lipschitz learning on graphs in the limit of infinite unlabeled data and finite labeled data. Previous work has conjectured that Lipschitz learning is well-posed in this limit, but is insensitive to the…

We consider the Laplacian eigenvalues for smooth planar domains with strongly attractive Robin conditions imposed on a part of the boundary and Neumann condition on the remaining boundary. The asymptotics of individual eigenvalues is…

Let F(G) be a fixed linear combination of the k extremal eigenvalues of a graph G and of its complement. The problem of finding max{F(G):v(G)=n} generalizes a number of problems raised previously in the literature. We show that the limit…