Related papers: Eigenvectors of random graphs: Nodal domains

Given a Laplace eigenfunction on a surface, we study the distribution of its extrema on the nodal domains. It is classically known that the absolute value of the eigenfunction is asymptotically bounded by the 4-th root of the eigenvalue. It…

It has been suggested that the distribution of the suitably normalized number of zeros of Laplacian eigenfunctions contains information about the geometry of the underlying domain. We study this distribution (more precisely, the…

Backhausz and Szegedy (2019) demonstrated that the almost eigenvectors of random regular graphs converge to Gaussian waves with variance $0\leq \sigma^2\leq 1$. In this paper, we present an alternative proof of this result for the edge…

We study the minimum number of distinct eigenvalues over a collection of matrices associated with a graph. Lower bounds are derived based on the existence or non-existence of certain cycle(s) in a graph. A key result proves that every…

Let $G$ be a connected undirected graph with $n$, $n\ge 3$, vertices and $m$ edges. Denote by $\rho_1 \ge \rho_2 \ge \cdots > \rho_n =0$ the normalized Laplacian eigenvalues of $G$. Upper and lower bounds of $\rho_i$, $i=1,2,\ldots , n-1$,…

We prove that every metric graph which is a tree has an orthonormal sequence of Laplace-eigenfunctions of full support. This implies that the number of nodal domains $\nu_n$ of the $n$-th eigenfunction of the Laplacian with standard…

We develop a nonlinear spectral graph theory, in which the Laplace operator is replaced by the 1-Laplacian ?$\Delta_1$. The eigenvalue problem is to solve a nonlinear system involving a set valued function. In the study, we investigate the…

We study the eigenvectors and eigenvalues of random matrices with iid entries. Let $N$ be a random matrix with iid entries which have symmetric distribution. For each unit eigenvector $\mathbf{v}$ of $N$ our main results provide a small…

An eigenvalue $\lambda$ of a signed graph $S$ of order $n$ is called a main eigenvalue if its eigenspace is not orthogonal to the all-ones vector $j$. Characterizing signed graphs with exactly $k$ $(1\le k\le n)$ distinct main eigenvalues…

Let M be a closed Riemannian manifold. We consider the inner radius of a nodal domain for a large eigenvalue \lambda. We give upper and lower bounds on the inner radius of the type C/\lambda^k. Our proof is based on a local behavior of…

We characterize all graphs for which there are eigenvectors of the graph Laplacian having all their components in {-1,+1} or {-1,0,+ 1}. Graphs having eigenvectors with components in {-1,+1} are called bivalent and are shown to be the…

We study the effects of a domain deformation to the nodal set of Laplacian eigenfunctions when the eigenvalue is degenerate. In particular, we study deformations of a rectangle that perturb one side and how they change the nodal sets…

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…

A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, all connected bicyclic graphs with exactly two main…

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…

In recent work on equiangular lines, Jiang, Tidor, Yuan, Zhang, and Zhao showed that a connected bounded degree graph has sublinear second eigenvalue multiplicity. More generally they show that there cannot be too many eigenvalues near the…

This paper investigates the asymptotic nature of graph spectra when some edges of a graph are subdivided sufficiently many times. In the special case where all edges of a graph are subdivided, we find the exact limits of the $k$-th largest…

The smallest nonzero eigenvalue of the normalized Laplacian matrix of a graph has been extensively studied and shown to have many connections to properties of the graph. We here study a generalization of this eigenvalue, denoted $\lambda(G,…

Many variants of join operations of graphs have been introduced and their spectral properties have been studied extensively by many researchers. This paper mainly focuses on the Laplacian spectra of some double join operations of graphs. We…

Dom de Caen posed the question whether connected graphs with three distinct eigenvalues have at most three distinct valencies. We do not answer this question, but instead construct connected graphs with four and five distinct eigenvalues…