Related papers: The graph $\infty$-Laplacian eigenvalue problem

Combined with our previous work \cite{LW19eigenvalue}, we prove sharp lower bound estimates for the first nonzero eigenvalue of the weighted $p$-Laplacian with $1< p< \infty$ on a compact Bakry-\'Emery manifold $(M^n,g,f)$, without boundary…

Given a finite simple graph $\cG$ with $n$ vertices, we can construct the Cayley graph on the symmetric group $S_n$ generated by the edges of $\cG$, interpreted as transpositions. We show that, if $\cG$ is complete multipartite, the…

We provide explicit upper bounds for the eigenvalues of the Laplacian on a finite metric tree subject to standard vertex conditions. The results include estimates depending on the average length of the edges or the diameter. In particular,…

We consider the spectral structure of indefinite second order boundary-value problems on graphs. A variational formulation for such boundary-value problems on graphs is given and we obtain both full and half-range completeness results. This…

Inspired by the linear Schr\"odinger operator, we consider a generalized $p$-Laplacian operator on discrete graphs and present new results that characterize several spectral properties of this operator with particular attention to the nodal…

We consider an eigenvalue problem of the form \begin{equation*} \left\{\begin{array}{rclll} -\Delta_{p} u -\Delta_{q} u&=& \lambda K(x)|u|^{p-2}u & \mbox{ in } \Omega^e u&=&0\qquad \quad &\mbox{ on } \partial \Omega u(x) &\to& 0 &\mbox{ as…

The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…

The purpose of this paper is to prove the uniqueness theorem of solutions of eigenvalue equations on one end of Riemannian manifolds for drift Laplacians, including the standard Laplacian as a special case; we shall impose "a sort of…

In this paper, two interesting eigenvalue comparison theorems for the first non-zero Steklov eigenvalue of the Laplacian have been established for manifolds with radial sectional curvature bounded from above. Besides, sharper bounds for the…

We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…

Grosjean proved that the $(1/p)$-th power of the first eigenvalue of the $p$-Laplacian on a closed Riemannian manifold converges to the twice of the inverse of the diameter of the space, as $p \to \infty$. Before this, a corresponding…

The purpose of this paper is to develop a "calculus" on graphs that allows graph theory to have new connections to analysis. For example, our framework gives rise to many new partial differential equations on graphs, most notably a new…

We provide an algorithm, running in polynomial time in the number of vertices, computing the unique solution to the biased infinity Laplacian Boundary Problem on finite graphs. The algorithm is based on the general outline and approach…

We consider the problem of partitioning the node set of a graph into $k$ sets of given sizes in order to \emph{minimize the cut} obtained using (removing) the $k$-th set. If the resulting cut has value $0$, then we have obtained a vertex…

Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume that the minimum expected degree is omega(ln n). We prove that the adjacency matrix and the Laplacian of that…

In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…

We consider the eigenvalues of the Laplacian on an open, bounded, connected set in $\mathbb{R}^n$ with $C^2$ boundary, with a Neumann boundary condition or a Robin boundary condition. We obtain upper bounds for those eigenvalues that have a…

In this paper, we establish a sharp lower bound for the first Dirichlet eigenvalue of the $p$-Laplacian on bounded domains of a complete, non-compact Riemannian manifold with non-negative Ricci curvature.

The largest eigenvalue of a matrix is always larger or equal than its largest diagonal entry. We show that for a large class of random Laplacian matrices, this bound is essentially tight: the largest eigenvalue is, up to lower order terms,…

We develop a formalism to compute the statistics of the top eigenpair of weighted sparse graphs with finite mean connectivity and bounded maximal degree. Framing the problem in terms of optimisation of a quadratic form on the sphere and…