Related papers: Spectral computations for birth and death chains
We give a short and completely elementary method to find the full spectrum of the exclusion process and a nicely limited superset of the spectrum of the interchange process (a.k.a.\ random transpositions) on the complete graph. In the case…
Using the notion of spectral flow, we suggest a simple approach to various asymptotic problems involving eigenvalues in the gaps of the essential spectrum of self-adjoint operators. Our approach uses some elements of the spectral shift…
In this paper, we consider a spectral analysis of discrete time quantum walks on the path. For isospectral coin cases, we show that the time averaged distribution and stationary distributions of the quantum walks are described by the pair…
We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit…
We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…
We study Babai numbers and Babai $k$-spectra of paths and cycles. We completely determine the Babai numbers of paths $P_n$ for $n>1$ and $1 \leq k \leq n-1$, and the Babai $k$-spectra for $P_n$ when $1 \leq k \leq n/2$. We also completely…
Much effort has been spent on characterizing the spectrum of the non-backtracking matrix of certain classes of graphs, with special emphasis on the leading eigenvalue or the second eigenvector. Much less attention has been paid to the…
These notes offer a unified introduction to spectral methods for the study of complex systems. They are intended as an operative manual rather than a theorem-proof textbook: the emphasis is on tools, identities, and perspectives that can be…
We obtain an integral formula for the distribution of the first hitting time of the origin for one-dimensional $\alpha$-stable processes $X_t$, where $\alpha\in(1,2)$. We also find a spectral-type integral formula for the transition…
We apply the spectral method, recently developed by the authors, to calculate the statistics of a reaction-limited multi-step birth-death process, or chemical reaction, that includes as elementary steps branching A->2A and annihilation…
We analyze two theoretical approaches to ensemble averaging for integrable systems in quantum chaos - spectral averaging and parametric averaging. For spectral averaging, we introduce a new procedure - rescaled spectral averaging. Unlike…
We discuss a new neural network-based direction of arrival estimation scheme that tackles the estimation task as a multidimensional classification problem. The proposed estimator uses a classification chain with as many stages as the number…
We address the problem of ordering trees with the same degree sequence by their spectral radii. To achieve that, we consider 2-switch transformations which preserve the degree sequence and establish when the index decreases. Our main…
The main purpose of these lectures is to discuss briefly recent methods of calculation of statistical properties of quantum eigenvalues for chaotic systems based on semi-classical trace formulas. Under the assumption that periodic orbit…
Training of neural networks can be reformulated in spectral space, by allowing eigenvalues and eigenvectors of the network to act as target of the optimization instead of the individual weights. Working in this setting, we show that the…
We revisit the theoretical performances of Spectral Clustering, a classical algorithm for graph partitioning that relies on the eigenvectors of a matrix representation of the graph. Informally, we show that Spectral Clustering works well as…
This is a review paper outlining recent progress in the spectral analysis of first order systems. We work on a closed manifold and study an elliptic self-adjoint first order system of linear partial differential equations. The aim is to…
Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical…
The study of complex networks has been one of the most active fields in science in recent decades. Spectral properties of networks (or graphs that represent them) are of fundamental importance. Researchers have been investigating these…
In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…