Related papers: Spectral Properties of a Binomial Matrix
Network representations are useful for describing the structure of a large variety of complex systems. Although most studies of real-world networks suppose that nodes are connected by only a single type of edge, most natural and engineered…
This paper investigates spectral properties of the deformed Laplacian matrix, which merges the Laplacian and signless Laplacian matrices of a graph through a one-parameter family of matrices. We present general results on the eigenvalues of…
The single-particle spectral functions $A({\bf k},\omega)$ and self-energies $\Sigma({\bf k},\omega)$ are calculated within the $t-J$ model using the finite-temperature Lanczos method for small systems. A remarkable asymmetry between the…
We realize many sharp spectral bounds of the spectral radius of a nonnegative square matrix $C$ by using the largest real eigenvalues of suitable matrices of smaller sizes related to $C$ that are very easy to find. As applications, we give…
We perform the spectral analysis of a family of Jacobi operators $J(\alpha)$ depending on a complex parameter $\alpha$. If $|\alpha|\neq1$ the spectrum of $J(\alpha)$ is discrete and formulas for eigenvalues and eigenvectors are established…
Consider two types of products of independent random matrices, including products of Ginibre matrices and inverse Ginibre matrices and products of truncated Haar unitary matrices and inverse truncated Haar matrices. Each product matrix has…
The $J$-matrix method is extended to difference and $q$-difference operators and is applied to several explicit differential, difference, $q$-difference and second order Askey-Wilson type operators. The spectrum and the spectral measures…
We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…
The spectral decomposition for an explicit second-order differential operator $T$ is determined. The spectrum consists of a continuous part with multiplicity two, a continuous part with multiplicity one, and a finite discrete part with…
Each degree $n$ polynomial in one variable of the form $(x+1)(x^{n-1}+c_1x^{n-2}+\cdots +c_{n-1})$ is representable in a unique way as a Schur-Szeg\H{o} composition of $n-1$ polynomials of the form $(x+1)^{n-1}(x+a_i)$, see \cite{Ko1},…
We consider positive Jacobi matrices $J$ with compact inverses and consequently with purely discrete spectra. A number of properties of the corresponding sequence of orthogonal polynomials is studied including the convergence of their…
Several examples of Jacobi matrices with an explicitly solvable spectral problem are worked out in detail. In all discussed cases the spectrum is discrete and coincides with the set of zeros of a special function. Moreover, the components…
Eigenvalues of stochastic matrices have been studied from two complementary perspectives. The individual eigenvalues are characterised through the well-established Karpelevich regions. The spectrum as a whole has also been analysed,…
This paper considers $N\times N$ matrices of the form $A_\gamma =A+ \gamma B$, where $A$ is self-adjoint, $\gamma \in C$ and $B$ is a non-self-adjoint perturbation of $A$. We obtain some monodromy-type results relating the spectral…
Given an operator L acting on a function space, the J-matrix method consists of finding a sequence y_n of functions such that the operator L acts tridiagonally on y_n with respect to n. Once such a tridiagonalization is obtained, a number…
In a recent paper a class of infinite Jacobi matrices with discrete character of spectra has been introduced. With each Jacobi matrix from this class an analytic function is associated, called the characteristic function, whose zero set…
When $0\lt \rho \lt 1$, the Kac-Murdock-Szeg\"o matrix $K_n(\rho)=\left[\rho^{\lvert j-k \rvert}\right]_{j,k=1}^n$ is a Toeplitz correlation matrix with many applications and very well known spectral properties. We study the eigenvalues and…
Isospectral reduction is an important tool for network/matrix analysis as it reduces the dimension of a matrix/network while preserving its eigenvalues and eigenvectors. The main contribution of this manuscript is a proposed algorithmic…
We construct spectral triples on a class of particular inductive limits of matrix-valued function algebras. In the special case of the Jiang-Su algebra we employ a particular $AF$-embedding.
In this paper we use Euler-Seidel matrices method to find out some properties of exponential and geometric polynomials and numbers. Some known results are reproved and some new results are obtained.