Related papers: The graph $\infty$-Laplacian eigenvalue problem
From the recent developing of nonlocal gradients with finite horizon $\delta>0$ based on general kernels, we introduce a new nonlocal $p$-Laplacian and study the eigenvalue problem associated with it. Furthermore, by virtue of…
In this paper, we characterize all graphs with eigenvectors of the signless Laplacian and adjacency matrices with components equal to $\{- 1, 0, 1\}.$ We extend the graph parameter max $k$-cut to square matrices and prove a general sharp…
Given a length function on the edge set of a finite graph, we define a vertex-weight and an edge-weight in terms of it and consider the corresponding graph Laplacian. In this paper, we consider the problem of maximizing the first nonzero…
Let $\Omega\subset\mathbb{R}^{n}$ be a smooth bounded domain and $m\in C(\overline{\Omega})$ be a sign-changing weight function. For $1<p<\infty$, consider the eigenvalue problem $$ \left\{ \begin{array} [c]{ll} -\Delta_{p}u=\lambda…
In this paper we study eigenvalues of the closed eigenvalue problem of the Witten-Laplacian on an $n$-dimensional compact Riemannian manifold. Estimates for eigenvalues are given. As applications, we give a sharp upper bound for the…
We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…
A number of recent papers have considered signed graph Laplacians, a generalization of the classical graph Laplacian, where the edge weights are allowed to take either sign. In the classical case, where the edge weights are all positive,…
We consider the Cauchy problem for the evolutive discrete p-Laplacian in infinite graphs, with initial data decaying at infinity. We prove optimal sup and gradient bounds for nonnegative solutions, when the initial data has finite mass, and…
We consider the problem of minimising the $L^\infty$ norm of a function of the hessian over a class of maps, subject to a mass constraint involving the $L^\infty$ norm of a function of the gradient and the map itself. We assume zeroth and…
We prove the existence of a principal eigenvalue associated to the $\infty$-Laplacian plus lower order terms and the Neumann boundary condition in a bounded smooth domain. As an application we get uniqueness and existence results for the…
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…
On a compact metric graph, we consider the spectrum of the Laplacian defined with a mix of standard and Dirichlet vertex conditions. A Cheeger-type lower bound on the gap $\lambda_2 - \lambda_1$ is established, with a constant that depends…
We offer a new method for proving that the maximal eigenvalue of the normalized graph Laplacian of a graph with $n$ vertices is at least $\frac{n+1}{n-1}$ provided the graph is not complete and that equality is attained if and only if the…
The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…
We prove several results for the Dirichlet, Neumann and Regularity problems for the Laplace equation in graph Lipschitz domains in the plane, considering $A_{\infty}$-measures on the boundary. More specifically, we study the…
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…
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilience, and synchronizability of networks, and are related to…
We consider the nonlinear graph $p$-Laplacian and its set of eigenvalues and associated eigenfunctions of this operator defined by a variational principle. We prove a nodal domain theorem for the graph $p$-Laplacian for any $p\geq 1$. While…
We study the sets of inertias achieved by Laplacian matrices of weighted signed graphs. First we characterize signed graphs with a unique Laplacian inertia. Then we show that there is a sufficiently small perturbation of the nonzero weights…
We investigate the following eigenvalue problem \begin{align*} \begin{cases} -\operatorname{div}\left( L(x) |\nabla u| ^{p-2}\nabla u\right)=\lambda K(x)|u|^{p-2}u \quad \text{in } A_{R_1}^{R_2} , u=0\quad \text{on } \partial A_{R_1}^{R_2}…