相关论文: Trace Formulae and Spectral Statistics for Discret…
The Gutzwiller trace formula is extended to include diffraction effects. The new trace formula involves periodic rays which have non-geometrical segments as a result of diffraction on the surfaces and edges of the scatter.
We compute spectra of large stochastic matrices $W$, defined on sparse random graphs, where edges $(i,j)$ of the graph are given positive random weights $W_{ij}>0$ in such a fashion that column sums are normalized to one. We compute spectra…
The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and…
A detailed discussion of semiclassical trace formulae is presented and it is demonstrated how a regularized trace formula can be derived while dealing only with finite and convergent expressions. Furthermore, several applications of trace…
The diffraction trace formula ({\em Phys. Rev. Lett.} {\bf 73}, 2304 (1994)) and spectral determinant are tested on the open three disk scattering system. The system contains a generic and exponentially growing number of diffraction…
Periodic orbit expressions for the density of states lead to spurious results when directly used to calculate quantities of thermodynamic interest. This is because the trace formula is usually valid only for large energies while the…
McKay proved that the limiting spectral measures of the ensembles of $d$-regular graphs with $N$ vertices converge to Kesten's measure as $N\to\infty$. In this paper we explore the case of weighted graphs. More precisely, given a large…
In this paper, we investigate various algebraic and graph theoretic properties of the distance matrix of a graph. Two graphs are $D$-cospectral if their distance matrices have the same spectrum. We construct infinite pairs of $D$-cospectral…
The main goal of this note is to illustrate the advantage of analyzing the non-backtracking spectrum of a regular graph rather than the ordinary spectrum. We show that by switching to non-backtracking spectrum, the method of proof used in…
We provide an introductory review of some topics in spectral theory of Laplacians on metric graphs. We focus on three different aspects: the trace formula, the self-adjointness problem and connections between Laplacians on metric graphs and…
The trace formula is a versatile tool for computing sums of spectral data across families of automorphic forms. Using specialized test functions, one can treat small families with refined spectral properties. This has proven fruitful in…
The construction of the trace formula for open dielectric cavities is examined in detail. Using the Krein formula it is shown that the sum over cavity resonances can be written as a sum over classical periodic orbits for the motion inside…
For random matrices with tree-like structure there exists a recursive relation for the local Green functions whose solution permits to find directly many important quantities in the limit of infinite matrix dimensions. The purpose of this…
Diffractive systems are quantum-mechanical models with point-like singularities where usual semiclassical approximation breaks down. An overview of recent investigations of such systems is presented. The following examples are considered in…
Spectral characterization of graphs is an important topic in spectral graph theory, which has received a lot of attention from researchers in recent years. It is generally very hard to show a given graph to be determined by its spectrum.…
We derive exact equations that determine the spectra of undirected and directed sparsely connected regular graphs containing loops of arbitrary length. The implications of our results to the structural and dynamical properties of networks…
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…
The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total…
Design of filters for graph signal processing benefits from knowledge of the spectral decomposition of matrices that encode graphs, such as the adjacency matrix and the Laplacian matrix, used to define the shift operator. For shift matrices…