/explore
|
You are here 
|
www.jeremykun.com | ||
| | | | |
nhigham.com
|
|
| | | | | In linear algebra terms, a correlation matrix is a symmetric positive semidefinite matrix with unit diagonal. In other words, it is a symmetric matrix with ones on the diagonal whose eigenvalues are all nonnegative. The term comes from statistics. If $latex x_1, x_2, \dots, x_n$ are column vectors with $latex m$ elements, each vector containing... | |
| | | | |
lucatrevisan.wordpress.com
|
|
| | | | | The spectral norm of the infinite $latex {d}&fg=000000$-regular tree is $latex {2 \sqrt {d-1}}&fg=000000$. We will see what this means and how to prove it. When talking about the expansion of random graphs, abobut the construction of Ramanujan expanders, as well as about sparsifiers, community detection, and several other problems, the number $latex {2 \sqrt{d-1}}&fg=000000$... | |
| | | | |
nhigham.com
|
|
| | | | | The spectral radius $latex \rho(A)$ of a square matrix $latex A\in\mathbb{C}^{n\times n}$ is the largest absolute value of any eigenvalue of $LATEX A$: $latex \notag \rho(A) = \max\{\, |\lambda|: \lambda~ \mbox{is an eigenvalue of}~ A\,\}. $ For Hermitian matrices (or more generally normal matrices, those satisfying $LATEX AA^* = A^*A$) the spectral radius is just... | |
| | | | |
fredrikj.net
|
|
| | | |||
