Related papers: Diameters, distortion and eigenvalues

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…

Let $(M,g)$ be a compact connected orientable Riemannian manifold of dimension $n\ge4$ and let $\lambda_{k,p} (g)$ be the $k$-th positive eigenvalue of the Laplacian $\Delta_{g,p}=dd^*+d^*d$ acting on differential forms of degree $p$ on…

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…

We propose an approach to graph sparsification based on the idea of preserving the smallest $k$ eigenvalues and eigenvectors of the Graph Laplacian. This is motivated by the fact that small eigenvalues and their associated eigenvectors tend…

To construct dispersion relations for diffusion or oscillation processes on random networks, it is necessary to obtain effective length scales for the eigenvectors of a graph Laplacian matrix, whose eigenvalues represent inverse time…

We investigate the asymptotic behavior of the eigenvalues of the Laplacian with homogeneous Robin boundary conditions, when the (positive) Robin parameter is diverging. In this framework, since the convergence of the Robin eigenvalues to…

We study a shape optimization problem associated with the first eigenvalue of a nonlinear spectral problem involving a mixed operator ($p-$Laplacian and Laplacian) with a constraint on the volume. First, we prove the existence of a…

In this work we prove general bounds for the diameter of random graphs generated by a preferential attachment model whose parameter is a function $f:\mathbb{N}\to[0,1]$ that drives the asymptotic proportion between the numbers of vertices…

We are interested in the spectrum of the Dirichlet Laplacian in thin broken strips with angle $\alpha$. Playing with symmetries, this leads us to investigate spectral problems for the Laplace operator with mixed boundary conditions in…

A generalized Fourier analysis on arbitrary graphs calls for a detailed knowledge of the eigenvectors of the graph Laplacian. Using the symmetries of the Cayley tree, we recursively construct the family of eigenvectors with exponentially…

In this paper, we give a spectral approximation result for the Laplacian on submanifolds of Euclidean spaces with singularities by the $\epsilon$-neighborhood graph constructed from random points on the submanifold. Our convergence rate for…

In this paper we study optimal lower and upper bounds for functionals involving the first Dirichlet eigenvalue $\lambda_{F}(p,\Omega)$ of the anisotropic $p$-Laplacian, $1<p<+\infty$. Our aim is to enhance how, by means of the $\mathcal…

Amply regular graphs are graphs with local distance-regularity constraints. In this paper, we prove a weaker version of a conjecture proposed by Qiao, Park, and Koolen on diameter bounds of amply regular graphs and make new progress on…

We prove diameter bounds for graphs having positive Ricci-curvature bound in Bakry-Emery sense. One result using only curvature and maximal vertex degree is sharp in case of hypercubes. The other result depends on an additional dimension…

We study the properties of eigenvalues and corresponding eigenfunctions generated by a defect in the gaps of the spectrum of a high-contrast random operator. We consider a family of elliptic operators $\mathcal{A}^\varepsilon$ in divergence…

Our goal in this paper is to find an estimate for the spectral gap of the Laplacian on a 2-simplicial complex consisting on a triangulation of a complete graph. An upper estimate is given by generalizing the Cheeger constant. The lower…

In this paper we study variations of the first non-trivial eigenvalues of the two-dimensional $p$-Laplace operator, $p>2$, generated by measure preserving quasiconformal mappings $\varphi : \mathbb D\to\Omega$, $\Omega \subset\mathbb R^2$.…

A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…

In this note we study and compare three graph invariants related to the 'compactness' of graph drawing in the plane: the dilation coefficient, defined as the smallest possible quotient between the longest and the shortest edge length; the…

We prove that the diameter of any unweighted connected graph G is O(k log n/lambda_k), for any k>= 2. Here, lambda_k is the k smallest eigenvalue of the normalized laplacian of G. This solves a problem posed by Gil Kalai.