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

Analysis of non-compact manifolds almost always requires some controlled behavior at infinity. Without such, one neither can show, nor expect, strong properties. On the other hand, such assumptions restrict the possible applications and…

We establish a connection between the stability of an eigenvalue under a magnetic perturbation and the number of zeros of the corresponding eigenfunction. Namely, we consider an eigenfunction of discrete Laplacian on a graph and count the…

This paper studies the Laplacian spectrum and the average effective resistance of (large) graphs that are sampled from graphons. Broadly speaking, our main finding is that the Laplacian eigenvalues of a large dense graph can be effectively…

In this paper, we analyze the eigenfunctions of the edge-based Laplacian on a graph and the relationship of these functions to random walks on the graph. We commence by discussing the set of eigenfunctions supported at the vertices, and…

In the continuous setting, we expect the product of two oscillating functions to oscillate even more (generically). On a graph $G=(V,E)$, there are only $|V|$ eigenvectors of the Laplacian $L=D-A$, so one oscillates `the most'. The purpose…

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…

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…

We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…

In this paper, we study the restrictions of both the harmonic functions and the eigenfunctions of the symmetric Laplacian to edges of pre-gaskets contained in the Sierpinski gasket. For a harmonic function, its restriction to any edge is…

We show that, with very high probability, the random graph Laplacian has simple spectrum. Our method provides a quantitatively effective estimate of the spectral gaps. Along the way, we establish results on affine no-gaps delocalization,…

For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…

Let $(M,g)$ be a smooth, compact Riemannian manifold and $\{\phi_h\}$ an $L^2$-normalized sequence of Laplace eigenfunctions, $-h^2\Delta_g\phi_h=\phi_h$. Given a smooth submanifold $H \subset M$ of codimension $k\geq 1$, we find conditions…

It is known that the small eigenvalues of the Laplacian of a Riemann surface close to the boundary of the modular space can be well approximated by the eigenvalues of the discrete Laplacian on a certain graph coming from the pair of pants…

Here we have investigated a few properties of the eigenvalues of normalized (geometric) graph Laplacian in different graphs. Preservation of eigenvalue 1 from a particular subgraph to the entire graph, the spectrum of the graph constructed…

We introduce and study Laplacians on a finite metric graph endowed with generalized densities, that is, measures of finite mass. One important motivation is that this setting provides a common framework for several interesting classes of…

Uncertainty principles present an important theoretical tool in signal processing, as they provide limits on the time-frequency concentration of a signal. In many real-world applications the signal domain has a complicated irregular…

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 study phenomena where some eigenvectors of a graph Laplacian are largely confined in small subsets of the graph. These localization phenomena are similar to those generally termed Anderson Localization in the Physics literature, and are…

Let $G$ be a connected graph on $n$ vertices with diameter $d$. It is known that if $2\le d\le n-2$, there are at most $n-d$ Laplacian eigenvalues in the interval $[n-d+2, n]$. In this paper, we show that if $1\le d\le n-3$, there are at…

We study Laplacians associated to a graph and single out a class of such operators with special regularity properties. In the case of locally finite graphs, this class consists of all selfadjoint, non-negative restrictions of the standard…