相关论文: Singular Continuous Spectrum for the Laplacian on …

We develop the complex scaling method for the Dirichlet Laplacian in a domain with asymptotically cylindrical end. We define resonances as discrete eigenvalues of non-selfadjoint operators, obtained as deformations of the selfadjoint…

We study spectral properties of bounded and unbounded complex Jacobi matrices. In particular, we formulate conditions assuring that the spectrum of the studied operators is continuous on some subsets of the complex plane and we provide…

A generalized Fourier analysis on arbitrary graphs calls for a detailed knowledge of the eigenvectors of the graph Laplacian. Using the symmetries of the Cayley tree, we recursively construct the family of eigenvectors with exponentially…

The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…

We introduce the study of isolated singularities for a semilinear equation involving the fractional Laplacian. In conformal geometry, it is equivalent to the study of singular metrics with constant fractional curvature. Our main ideas are:…

We introduce two exotic lattice models on a general spatial graph. The first one is a matter theory of a compact Lifshitz scalar field, while the second one is a certain rank-2 $U(1)$ gauge theory of fractons. Both lattice models are…

Spectral graph sparsification aims to find ultra-sparse subgraphs whose Laplacian matrix can well approximate the original Laplacian eigenvalues and eigenvectors. In recent years, spectral sparsification techniques have been extensively…

In this paper, we interpret the multiplicity of 1 in Laplacian spectra of trees and prove that Faria's inequality turns to an equality in the case of normal trees which yields that in any tree without a vertex of degree 2, Faria equality…

We study Jacobi matrices on star-like graphs, which are graphs that are given by the pasting of a finite number of half-lines to a compact graph. Specifically, we extend subordinacy theory to this type of graphs, that is, we find a…

The eigenvalues of the normalized Laplacian of a graph provide information on its topological and structural characteristics and also on some relevant dynamical aspects, specifically in relation to random walks. In this paper we determine…

Our goal in this paper is to find an estimate for the spectral gap of the Laplacian on a 2-simplicial complex consisting on a triangulation of a complete graph. An upper estimate is given by generalizing the Cheeger constant. The lower…

The paper is a brief survey of some recent new results and progress of the Laplacian spectra of graphs and complex networks (in particular, random graph and the small world network). The main contents contain the spectral radius of the…

We address the Laplacian on a perturbed periodic graph which might not be a periodic graph. We present a class of perturbed graphs for which the essential spectra of the Laplacians are stable even when the graphs are perturbed by adding and…

Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a $d$-dimensional…

For any Lipschitz domain we construct an arbitrarily small, localized perturbation which splits the spectrum of the Laplacian into simple eigenvalues. We use for this purpose a Hadamard's formula and spectral stability results.

In the following, we give an explicit construction of a Laplacian on the Minkowski curve, with energy forms that bear the geometric characteristic of the structure. The spectrum of the Laplacian is obtained by means of spectral decimation.

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…

A self-similar growth-fragmentation describes the evolution of particles that grow and split as time passes. Its genealogy yields a self-similar continuum tree endowed with an intrinsic measure. Extending results of Haas for pure…

Exact eigendecomposition of large matrices is very expensive, and it is practically impossible to compute exact eigenvalues. Instead, one may set a more modest goal of approaching the empirical distribution of the eigenvalues, recovering…

Many finite dimensional integrable systems qre expressed with the help of the Lax equation which highlights a spectral parameter and therefore a spectral curve. These spectral curves are the starting point of an algebro-geometric…