Related papers: Diameters, distortion and eigenvalues
In this paper, we propose an adaptive finite element method for computing the first eigenpair of the $p$-Laplacian problem. We prove that starting from a fine initial mesh our proposed adaptive algorithm produces a sequence of discrete…
We analyze various formulations of the $\infty$-Laplacian eigenvalue problem on graphs, comparing their properties and highlighting their respective advantages and limitations. First, we investigate the graph $\infty$-eigenpairs arising as…
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…
We study the spectral gap of the Erd\H{o}s--R\'enyi random graph through the connectivity threshold. In particular, we show that for any fixed $\delta > 0$ if $$p \ge \frac{(1/2 + \delta) \log n}{n},$$ then the normalized graph Laplacian of…
We present monotonicity inequalities for certain functions involving eigenvalues of $p$-Laplacians on signed graphs with respect to $p$. Inspired by such monotonicity, we propose new spectrum-based graph invariants, called (variational)…
Eigenmaps are important in analysis, geometry, and machine learning, especially in nonlinear dimension reduction. Approximation of the eigenmaps of a Laplace operator depends crucially on the scaling parameter $\epsilon$. If $\epsilon$ is…
For a regular polyhedron (or polygon) centered at the origin, the coordinates of the vertices are eigenvectors of the graph Laplacian for the skeleton of that polyhedron (or polygon) associated with the first (non-trivial) eigenvalue. In…
The first non-zero Laplacian eigenvalue $\lambda_1$ of a finite graph is bounded below by its minimum Lin--Lu--Yau curvature $\kappa$. This is a discrete analogue of the classical Lichnerowicz Theorem. A graph with $\lambda_1=\kappa$ is…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
We study the limit of first eigenfunctions of (discrete) $p$-Laplacian on a finite subset of a graph with Dirichlet boundary condition, as $p\to 1.$ We prove that up to a subsequence, they converge to a summation of characteristic functions…
We prove that the Dirichlet eigenvalues of the Laplace-Beltrami operator on a compact Riemannian manifold with cylindrical boundary can be approximated by the spectrum of truncated graph Laplacians constructed from…
We discuss optimal lower bounds for eigenvalues of Laplacians on weighted graphs. These bounds are formulated in terms of the geometry and, more specifically, the inradius of subsets of the graph. In particular, we study the first non-zero…
We approximate the first Dirichlet eigenpair of the $p$-Laplace operator for $2 \leq p < \infty$ on both Euclidean and surface domains. We emphasize large $p$ values and discuss how the $p \to \infty$ limit connects to the underlying…
Given an elliptic diffusion operator $L$ defined on a compact and connected manifold (possibly with a convex boundary in a suitable sense) with an $L$-invariant measure $m$, we introduce the non-linear $p-$operator $L_p$, generalizing the…
In this paper, we study a first Dirichlet eigenfunction of the weighted $p$-Laplacian on a bounded domain in a complete weighted Riemannian manifold. By constructing gradient estimates for a first eigenfunction, we obtain some relationships…
We discuss the behavior of $(\lambda_{1. p}(M))^{1/p}$ with respect to the Gromov-Hausdorff topology and the variable $p$, where $\lambda_{1, p}(M)$ is the first positive eigenvalue of the $p$-Laplacian on a compact Riemannian manifold $M$.…
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.
Inside a fixed bounded domain $\Omega$ of the plane, we look for the best compact connected set $K$, of given perimeter, in order to maximize the first Dirichlet eigenvalue $\lambda_1(\Omega\setminus K)$. We discuss some of the qualitative…
We consider the problem of minimising the $k$-th eigenvalue of the Laplacian with some prescribed boundary condition over collections of convex domains of prescribed perimeter or diameter. It is known that these minimisation problems are…
Computing the diameter of a graph, i.e. the largest distance, is a fundamental problem that is central in fine-grained complexity. In undirected graphs, the Strong Exponential Time Hypothesis (SETH) yields a lower bound on the time vs.…