Related papers: Spectral computations for birth and death chains
We study the spectral measure of large Euclidean random matrices. The entries of these matrices are determined by the relative position of $n$ random points in a compact set $\Omega_n$ of $\R^d$. Under various assumptions we establish the…
Spectral correlations in unitary invariant, non-Gaussian ensembles of large random matrices possessing an eigenvalue gap are studied within the framework of the orthogonal polynomial technique. Both local and global characteristics of…
For a large class of linear neutral type systems the problem of eigenvalues and eigenvectors assignment is investigated, i.e. finding the system which has the given spectrum and almost all, in some sense, eigenvectors.
We give a bound on the spectral radius of subgraphs of regular graphs with given order and diameter. We give a lower bound on the smallest eigenvalue of a nonbipartite regular graph of given order and diameter.
We give a new and elementary computation of the spectral gap of the Kac walk on the N-sphere. The result is obtained as a by-product of a more general observation which allows to reduce the analysis of the spectral gap of an N-component…
The nonparametric estimation of the volatility and the drift coefficient of a scalar diffusion is studied when the process is observed at random time points. The constructed estimator generalizes the spectral method by Gobet, Hoffmann and…
The spectral properties of a class of band matrices are investigated. The reconstruction of matrices of this special class from given spectral data is also studied. Necessary and sufficient conditions for that reconstruction are found. The…
Using spectral embedding based on the signless Laplacian, we obtain bounds on the spectrum of transition matrices on graphs. As a consequence, we bound return probabilities and the uniform mixing time of simple random walk on graphs. In…
The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…
We study the spectral statistics of quantum (metric) graphs whose vertices are equipped with preferred orientation vertex conditions. When comparing their spectral statistics to those predicted by suitable random matrix theory ensembles,…
In this article, the existence of the spectrum (the eigenvalues) for the nonlinear continuous operators acting in the Banach spaces is investigated. For the study, this question is used a different approach that allows the studying of all…
A method for encoding and decoding spectrum shaped binary run-length constrained sequences is described. The binary sequences with predefined range of exponential sums are introduced. On the base of Cover's enumerative scheme, recurrence…
The explicit solution to the spectral problem of quantum graphs is used to obtain the exact distributions of several spectral statistics, such as the oscillations of the quantum momentum eigenvalues around the average, $\delta…
We consider the problem of how to compute eigenvalues of a self-adjoint operator when a direct application of the Galerkin (finite-section) method is unreliable. The last two decades have seen the development of the so-called quadratic…
Some arithmetic properties of spectral curves are discussed: the spectral curve, for example, of a charge $n\ge2$ Euclidean BPS monopole is not defined over $\overline{\mathbb{Q}}$ if smooth.
We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the…
The spectrum of critical exponents of the $N$--vector model in $4-\eps$~dimensions is investigated to the second order in~$\eps$. A generic class of one--loop degeneracies that has been reported in a previous work is lifted in two--loop…
For any distribution $\pi$ with support equal to $[n] = \{1, 2,..., n \}$, we study the set $\mathcal{A}_{\pi}$ of tridiagonal stochastic matrices $K$ satisfying $\pi(i) K[i,j] = \pi(j) K[j,i]$ for all $i, j \in [n]$. These matrices…
Beginning with a historical account of the spectral classification, its refinement through additional criteria is presented. The line strengths and ratios used in two dimensional classifications of each spectral class are described. A…
We study the asymptotic distribution of the eigenvalues of random Hermitian periodic band matrices, focusing on the spectral edges. The eigenvalues close to the edges converge in distribution to the Airy point process if (and only if) the…