Related papers: Spectral computations for birth and death chains
We consider perturbations of a large Jordan matrix, either random and small in norm or of small rank. In both cases we show that most of the eigenvalues of the perturbed matrix are very close to a circle with centre at the origin. In the…
The flow of the low energy eigenstates of a $U_q[sl(2|1)]$ superspin chain with alternating fundamental ($3$) and dual ($\bar{3}$) representations is studied as function of a twist angle determining the boundary conditions. The finite size…
The distance of a binary operation from being associative can be "measured" by its associative spectrum, an appropriate sequence of positive integers. Particular instances and general properties of associative spectra are studied.
M.Levitin and E.Shargorodsky purposed in a recent article, [math.SP/0212087], the use of the so called ``second order relative spectrum'', to find eigenvalues of self-adjoint operators in gaps of the essential spectrum. Let $M$ be a…
The spectrum of the Laplace-Beltrami operator, computed on the spatial slices of Causal Dynamical Triangulations, is a powerful probe of the geometrical properties of the configurations sampled in the various phases of the lattice theory.…
A large variety of dynamical processes that take place on networks can be expressed in terms of the spectral properties of some linear operator which reflects how the dynamical rules depend on the network topology. Often such spectral…
Spectral methods include a family of algorithms related to the eigenvectors of certain data-generated matrices. In this work, we are interested in studying the geometric landscape of the eigendecomposition problem in various spectral…
Spectral clustering algorithms typically require a priori selection of input parameters such as the number of clusters, a scaling parameter for the affinity measure, or ranges of these values for parameter tuning. Despite efforts for…
Quantifying the eigenvalue spectra of large random matrices allows one to understand the factors that contribute to the stability of dynamical systems with many interacting components. This work explores the effect that the interaction…
The notion of spectrum of first-order properties introduced by J. Spencer for Erdos-Renyi random graph is considered in relation to random uniform hypergraphs. We study properties of spectrum for first-order formulae with bounded quantifier…
The interior transmission eigenvalue problem (ITP) plays a central role in inverse scattering theory and in the spectral analysis of inhomogeneous media. Despite its smooth dependence on the refractive index at the PDE level, the…
We investigate a descent on simple graphs, starting with the complete graph on $n$ vertices and ending up with the cycle graph by removing one edge after another. We obtain quantitative results showing that graphs with large diameter must…
We present a spectrum of trace-based, testing, and bisimulation equivalences for nondeterministic and probabilistic processes whose activities are all observable. For every equivalence under study, we examine the discriminating power of…
Markov chains are a class of probabilistic models that have achieved widespread application in the quantitative sciences. This is in part due to their versatility, but is compounded by the ease with which they can be probed analytically.…
Perturbation theory of large-scale structures of the Universe at next-to-leading order and next-to-next-to-leading order provides us with predictions of cosmological statistics at sub-percent level in the mildly non-linear regime. Its use…
Spectral methods have emerged as a simple yet surprisingly effective approach for extracting information from massive, noisy and incomplete data. In a nutshell, spectral methods refer to a collection of algorithms built upon the eigenvalues…
Let $A$ be a $n\times n$ complex Hermitian matrix and let $\lambda(A)=(\lambda_1,\ldots,\lambda_n)\in \mathbb{R}^n$ denote the eigenvalues of $A$, counting multiplicities and arranged in non-increasing order. Motivated by problems arising…
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenvectors of matrices associated with graphs to study them. In this paper, we present a collection of $20$ topics in spectral graph theory,…
Inspired by the classical spectral analysis of birth-death chains using orthogonal polynomials, we study an analogous set of constructions in the context of open quantum dynamics and related walks. In such setting, block tridiagonal…
We introduce the boundary length and point spectrum, as a joint generalization of the boundary length spectrum and boundary point spectrum in arXiv:1307.0967. We establish by cut-and-join methods that the number of partial chord diagrams…