相关论文: Localization of eigenvalues of Doubly Cyclic Matri…

The perfect matching association scheme is a set of relations on the perfect matchings of the complete graph on $2n$ vertices. The relations between perfect matchings are defined by the cycle structure of the union of any two perfect…

There has been much recent interest, initiated by work of the physicists Hatano and Nelson, in the eigenvalues of certain random non-Hermitian periodic tridiagonal matrices and their bidiagonal limits. These eigenvalues cluster along a…

The theory of random matrices with eigenvalues distributed in the complex plane and more general "beta-ensembles" (logarithmic gases in 2D) is reviewed. The distribution and correlations of the eigenvalues are investigated in the large N…

In this paper, we show that the largest signless Laplacian H-eigenvalue of a connected $k$-uniform hypergraph $G$, where $k \ge 3$, reaches its upper bound $2\Delta(G)$, where $\Delta(G)$ is the largest degree of $G$, if and only if $G$ is…

We show that the multiplicity of the second normalized adjacency matrix eigenvalue of any connected graph of maximum degree $\Delta$ is bounded by $O(n \Delta^{7/5}/\log^{1/5-o(1)}n)$ for any $\Delta$, and by…

The properties of the first (largest) eigenvalue and its eigenvector (first eigenvector) are investigated for large sparse random symmetric matrices that are characterized by bimodal degree distributions. In principle, one should be able to…

In the current work, we study the eigenvalue distribution results of a class of non-normal matrix-sequences which may be viewed as a low rank perturbation, depending on a parameter $\beta>1$, of the basic Toeplitz matrix-sequence…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For any real $\alpha\in [0,1]$, Nikiforov \cite{VN1} defined the matrix $A_{\alpha}(G)$ as $$A_{\alpha}(G)=\alpha…

We consider infinite quasi-periodic Jacobi self-adjoint matrices for which the three main diagonals are given via values of real analytic functions on the trajectory of the shift $x\rightarrow x+\omega$. We assume that the Lyapunov exponent…

Let G be a random subgraph of the n-cube where each edge appears randomly and independently with probability p. We prove that the largest eigenvalue of the adjacency matrix of G is almost surely \lambda_1(G)= (1+o(1))…

Let $\Gamma=(K_n,H)$ be a signed complete graph whose negative edges induce a subgraph $H$. Let $A(\Gamma)$ be the adjacency matrix of the signed graph $\Gamma$. The largest eigenvalue of $A(\Gamma)$ is called the index of $\Gamma$. In this…

It is conjectured that a class of n-fold integral transformations {I(alpha)|alpha in {C}} forms a mutually commutative family, namely, we have I(alpha) I(beta)=I(beta) I(alpha) for all alpha, beta in {C}. The commutativity of I(alpha) for…

Let $\boldsymbol{\Sigma}_N$ be a $M \times N$ random matrix defined by $\boldsymbol{\Sigma}_N = \mathbf{B}_N + \sigma \mathbf{W}_N$ where $\mathbf{B}_N$ is a uniformly bounded deterministic matrix and where $\mathbf{W}_N$ is an independent…

Given a large, high-dimensional sample from a spiked population, the top sample covariance eigenvalue is known to exhibit a phase transition. We show that the largest eigenvalues have asymptotic distributions near the phase transition in…

Given $2n \times 2n$ real symmetric positive semidefinite matrix $A$ with symplectic kernel, there exists a real $2n \times 2n$ \emph{symplectic matrix} $M$ such that $M^TAM= D \oplus D$, where $D$ is an $n \times n$ non-negative diagonal…

We consider matrices containing two diagonal bands of positive entries. We show that all eigenvalues of such matrices are of the form $r \zeta$, where $r$ is a nonnegative real number and $\zeta$ is a $p$th root of unity, where $p$ is the…

We use a randomised embedding method to prove that for all \alpha>0 any sufficiently large oriented graph G with minimum in-degree and out-degree \delta^+(G),\delta^-(G)\geq (3/8+\alpha)|G| contains every possible orientation of a Hamilton…

Two-term asymptotic formulae for the probability distribution functions for the smallest eigenvalue of the Jacobi $ \beta $-Ensembles are derived for matrices of large size in the r\'egime where $ \beta > 0 $ is arbitrary and one of the…

The limiting behavior of the eigenvalues of the Toeplitz matrices $T_{n}[\sigma]=(\hat{\sigma}(i-j))$, where $0\leq i,j \leq n$, as $n \to \infty$, is investigated in the case of complex valued functions $\sigma$ defined on the unit circle…

A matrix is said to be {\it cyclic} if its characteristic polynomial is equal to its minimal polynomial. Cyclic matrices play an important role in some algorithms for matrix group computation, such as the Cyclic Meataxe developed by P. M.…