Related papers: Non-localization of eigenfunctions on large regula…
In this paper, we characterize all graphs with eigenvectors of the signless Laplacian and adjacency matrices with components equal to $\{- 1, 0, 1\}.$ We extend the graph parameter max $k$-cut to square matrices and prove a general sharp…
Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…
We introduce the the fractional Laplacian on a subgraph of a graph with Dirichlet boundary condition. For a lattice graph, we prove the upper and lower estimates for the sum of the first $k$ Dirichlet eigenvalues of the fractional…
Let $G$ be a unicyclic graph. In this paper, we provide an upper bound for the number of Laplacian eigenvalues of $G$ within the interval $[0,1)$ in terms of the diameter and the girth of $G$.
We show in a unified manner that the factorization method describes completely the $L^2$-eigenspaces associated to the discrete part of the spectrum of the twisted Laplacian on constant curvature Riemann surfaces. Subclasses of two variable…
To characterize the location (mean, median) of a set of graphs, one needs a notion of centrality that is adapted to metric spaces, since graph sets are not Euclidean spaces. A standard approach is to consider the Frechet mean. In this work,…
In this paper we continue our study of the Laplacian on manifolds with axial analytic asymptotically cylindrical ends initiated in~arXiv:1003.2538. By using the complex scaling method and the Phragm\'{e}n-Lindel\"{o}f principle we prove…
We consider a metric graph consisting of two edges, one of which has length $\varepsilon$ which we send to zero. On this graph we study the resolvent and spectrum of the Laplacian subject to a general vertex condition at the connecting…
Let $(M,g)$ be a two-dimensional compact boundaryless Riemannian manifold with nonpostive curvature, then we shall give improved estimates for the $L^2$-norms of the restrictions of eigenfunctions to unit-length geodesics, compared to the…
We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.
The main result of this paper is a bound on the distance between the distribution of an eigenfunction of the Laplacian on a compact Riemannian manifold and the Gaussian distribution. If $X$ is a random point on a manifold $M$ and $f$ is an…
In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characterize all extremal graphs. Moreover, we prove a similar result…
In this work we present a survey of results on the problem of finding the minimum cardinality of the support of eigenfunctions of graphs.
We prove that every 3-regular, n-vertex simple graph with sufficiently large girth contains an independent set of size at least 0.4361n. (The best known bound is 0.4352n.) In fact, computer simulation suggests that the bound our method…
We are interested in the effect of Dirichlet boundary conditions on the nodal length of Laplace eigenfunctions. We study random Gaussian Laplace eigenfunctions on the two dimensional square and find a two terms asymptotic expansion for the…
We consider Laplacians on $\Z^2$-periodic discrete graphs. The following results are obtained: 1) The Floquet-Bloch decomposition is constructed and basic properties are derived. 2) The estimates of the Lebesgue measure of the spectrum in…
We study the small scale distribution of the $L^2$ mass of eigenfunctions of the Laplacian on the flat torus $\mathbb T^d$. Given an orthonormal basis of eigenfunctions, we show the existence of a density one subsequence whose $L^2$ mass…
It is conjectured that the Laplacian spectrum of a graph is majorized by its conjugate degree sequence. In this paper, we prove that this majorization holds for a class of graphs including trees. We also show that a generalization of this…
The nodal set of a Laplacian eigenfunction forms a partition of the underlying manifold or graph. Another natural partition is based on the gradient vector field of the eigenfunction (on a manifold) or on the extremal points of the…
We prove (i) a simple sufficient geometric condition for localisation of a sequence of first Dirichlet eigenfunctions provided the corresponding Dirichlet Laplacians satisfy a uniform Hardy inequality, and (ii) localisation of a sequence of…