All Questions
8 questions
12
votes
3
answers
738
views
How to find Suleimanova's work on the Nonnegative Inverse Eigenvalue Problem?
Many papers cite the work of Suleimanova when studying inverse eigenvalue problems - in particular, the nonnegative inverse eigenvalue problem (NIEP). However, I cannot seem to find her work anywhere....
- 121
4
votes
1
answer
545
views
No arbitrary product of matrices has eigenvalue 1?
Consider the matrix $D$, adjacency matrix of an undirected graph $G$ on $n$ vertices, with the notation that $d_{i,i}=0,\forall i$.
The matrices $A_i$ are constructed from Identity matrices, $I_{n*n}$...
- 143
4
votes
1
answer
3k
views
Non symmetric matrices with real eigenvalues
Consider the following block matrix
$A=\pmatrix{A_1 & A_2\cr kA_2^\top & A_3}$
where $A_1$ is a symmetric matrix, $A_3$ is diagonal matrix and all entries of $A$ are real and non-negative.
...
- 69
3
votes
2
answers
1k
views
Eigenvectors and eigenvalues of Tridiagonal matrix with varying diagonal elements
is it possible to analytically evaluate the eigenvectors and the eigenvalues of a tridiagonal $n\times n$ matrix of the form :
\begin{pmatrix}
1 & b & 0 & ... & 0 \\\
b & 2 &...
- 31
3
votes
1
answer
1k
views
The largest eigenvalue of a binary matrix with specific density
I would like to find the largest eigenvalue of an $n \times n$ binary matrix of density $p$, i.e., with $p n^{2}$ ones and $(1-p) n^{2}$ zeros. Any idea or reference is welcome.
- 159
2
votes
1
answer
8k
views
Properties of eigenvalues of general nonnegative matrices
I am aware, that an answer to this question can be found via Perron-Frobenius theory or something very similar, but unfortunately I am far from being an expert in the field and I am unable to find the ...
- 83
1
vote
1
answer
223
views
Growth rates of ‘sub-traces’ of matrices
Consider an aperiodic, non-negative and non-zero $m\times m$ matrix $A$. Here aperiodic means that there exists an integer $n$ such that every entry of $A^n$ is strictly positive. By the Perron–...
- 89
1
vote
0
answers
86
views
Solution of a manipulated equation vs the maximum eigenvalue and eigenvector of a non-negative matrix
Lets assume we have the following equation:
$AU=\lambda U \Rightarrow\left[
\begin{array}{c|c|c}
0 &A_{12}&A_{13}\\
\hline
A_{21}& 0& A_{23}\\
\hline
A_{31}&A_{32}&0
\end{...
- 21