Related papers: Non-localization of eigenfunctions on large regula…

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 establish metric graph counterparts of Pleijel's theorem on the asymptotics of the number of nodal domains $\nu_n$ of the $n$-th eigenfunction(s) of a broad class of operators on compact metric graphs, including Schr\"odinger operators…

We construct examples of p-adic L-functions over universal deformation spaces for GL(2). We formulate a conjecture predicting that the natural parameter spaces for p-adic L-functions are not the usual eigenvarieties (parametrising…

We propose a method by which to recover an underlying graph from a set of multivariate wave signals that is discretely sampled from a solution of the graph wave equation. Herein, the graph wave equation is defined with the graph Laplacian,…

In this paper, we study eigenvalues and eigenfunctions of $p$-Laplacians with Dirichlet boundary condition on graphs. We characterize the first eigenfunction (and the maximum eigenfunction for a bipartite graph) via the sign condition. By…

We show that every regular graph with good local expansion has a spanning Lipschitz subgraph with large girth and minimum degree. In particular, this gives a finite analogue of the dynamical solution to the von Neumann problem by Gaboriau…

The parameter $\sigma(G)$ of a graph $G$ stands for the number of Laplacian eigenvalues greater than or equal to the average degree of $G$. In this work, we address the problem of characterizing those graphs $G$ having $\sigma(G)=1$. Our…

Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq3$. We prove that, with probability $1-N^{-1+{\varepsilon}}$ for any ${\varepsilon} >0$, the following two properties hold as $N…

A graph G is said to be 2-distinguishable if there is a 2-labeling of its vertices which is not preserved by any nontrivial automorphism of G. We show that every locally finite graph with infinite motion and growth at most…

In this paper we consider the problem of prescribing the nodal set of low-energy eigenfunctions of the Laplacian. Our main result is that, given any separating closed hypersurface \Sigma in a compact n-manifold M, there is a Riemannian…

The eigenvalues of the Laplacian matrix for a class of directed graphs with both positive and negative weights are studied. First, a class of directed signed graphs is investigated in which one pair of nodes (either connected or not) is…

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…

Consider the problem of determining the maximal induced subgraph in a random $d$-regular graph such that its components remain bounded as the size of the graph becomes arbitrarily large. We show, for asymptotically large $d$, that any such…

Let $(M,g)$ be a compact Riemannian surface. Consider a family of $L^2$ normalized Laplace-Beltrami eigenfunctions, written in the semiclassical form $-h_j^2\Delta_g \phi_{h_j} = \phi_{h_j}$, whose eigenvalues satisfy $h h_j^{-1} \in (1, 1…

We study the convergence of the graph Laplacian of a random geometric graph generated by an i.i.d. sample from a $m$-dimensional submanifold $M$ in $R^d$ as the sample size $n$ increases and the neighborhood size $h$ tends to zero. We show…

We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…

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.

We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relatively little is known about the corresponding eigenvectors. Our…

In this paper, we derive the sharp lower and upper bounds of nodal lengths of Laplacian eigenfunctions in the disc. Furthermore, we observe a geometric property of the eigenfunctions whose nodal curves maximize the nodal length.

This note introduces a result on the location of eigenvalues, i.e., the spectrum, of the Laplacian for a family of undirected graphs with self-loops. We extend on the known results for the spectrum of undirected graphs without self-loops or…