Related papers: Flexibility of eigenvalues for graph Laplacians ar…
We consider a Laplacian on periodic discrete graphs. Its spectrum consists of a finite number of bands. In a class of periodic 1-forms, i.e., functions defined on edges of the periodic graph, we introduce a subclass of minimal forms with a…
We deal with eigenvalue problems for the Laplacian on noncompact Riemannian manifolds $M$ of finite volume. Sharp conditions ensuring $L^q(M)$ and $L^\infty (M)$ bounds for eigenfunctions are exhibited in terms of either the isoperimetric…
By introducing a weight function to the Laplace operator, Bakry and \'Emery defined the "drift Laplacian" to study diffusion processes. Our first main result is that, given a Bakry-\'Emery manifold, there is a naturally associated family of…
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…
This is a survey on eigenfunctions of the Laplacian on Riemannian manifolds (mainly compact and without boundary). We discuss both local results obtained by analyzing eigenfunctions on small balls, and global results obtained by wave…
We show that the Laplacian of a Riemannian metric on a closed surface S with Euler characteristic \chi(S) < 0 has at most -\chi(S) small eigenvalues.
Let $p \geqslant 5$ be a prime number. In this article we provide a complete and explicit description of the locus formed by the compact Riemann surfaces of genus $2(p-1)$ that are endowed with a group of automorphisms of order $4p$. In…
We calculate the spectrum of the diagram for each finite $3$-transposition group. Such graphs with a given minimal eigenvalue have occurred in the context of compact Griess subalgebras of vertex operator algebras.
This is a survey of recent results on eigenfunctions of the Laplacian on compact Riemannian manifolds and their nodal sets. It is the write-up of my talk at JDG 2011.
We consider the Dirichlet and Neumann eigenvalues of the Laplacian for a planar, simply connected domain. The eigenvalues admit a characterization in terms of a layer potential of the Helmholtz equation. Using the exterior conformal mapping…
We investigate the asymptotic spectral distribution of the twisted Laplacian associated with a real harmonic 1-form on a compact hyperbolic surface. In particular, we establish a sublinear lower bound on the number of eigenvalues in a…
We present the spectrum of the (normalized) graph Laplacian as a systematic tool for the investigation of networks, and we describe basic properties of eigenvalues and eigenfunctions. Processes of graph formation like motif joining or…
We study flat bands of periodic graphs in a Euclidean space. These are infinitely degenerate eigenvalues of the corresponding adjacency matrix, with eigenvectors of compact support. We provide some optimal recipes to generate desired bands,…
The eigenmodes of resonating structures, e.g., electromagnetic cavities, are sensitive to deformations of their shape. In order to compute the sensitivities of the eigenpair with respect to a scalar parameter, we state the Laplacian and…
We define a weighted multiplicity function for closed geodesics of given length on a finite area Riemann surface. These weighted multiplicities appear naturally in the Selberg trace formula, and in particular their mean square plays an…
We define the distance between edges of graphs and study the coarse Ricci curvature on edges. We consider the Laplacian on edges based on the Jost-Horak's definition of the Laplacian on simplicial complexes. As one of our main results, we…
For a regular polyhedron (or polygon) centered at the origin, the coordinates of the vertices are eigenvectors of the graph Laplacian for the skeleton of that polyhedron (or polygon) associated with the first (non-trivial) eigenvalue. In…
The second eigenvalue of the Laplacian matrix and its associated eigenvector are fundamental features of an undirected graph, and as such they have found widespread use in scientific computing, machine learning, and data analysis. In many…
Graph disaggregation is a technique used to address the high cost of computation for power law graphs on parallel processors. The few high-degree vertices are broken into multiple small-degree vertices, in order to allow for more efficient…
We study eigenvalues and eigenfunctions of the Laplacian on the surfaces of four of the regular polyhedrons: tetrahedron, octahedron, icosahedron and cube. We show two types of eigenfunctions: nonsingular ones that are smooth at vertices,…