Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
0 answers
130 views

The probability that the dominant eigenvalue of a random real matrix is real

Let $X_n$ be an $n\times n$ real matrix where the entries in $X_n$ are independent, normally distributed, have mean $0$, and variance $1$. Suppose that $\lambda_1,\dots,\lambda_n$ are the eigenvalues ...
Joseph Van Name's user avatar
2 votes
1 answer
68 views

Generating a random matrix with large spark (i.e., each $k$-tuple of columns is linearly independent)

Let $F$ be a field, and let $m, n, k$ be positive integers. Is there an efficient algorithm to compute a uniformly random $m \times n$ matrix $A$ over $k$ such that each $k$-tuple of columns of $A$ is ...
hulk's user avatar
  • 21
4 votes
0 answers
989 views

Lower bound minimum eigenvalue of a positive semi-definite Hermitian matrix with bounded entries

Let $M \in \mathbb{C}^{n \times n}$ be a matrix with the following properties: $M$ is Hermitian and positive semi-definite (all the eigenvalues are real and nonnegative). The diagonal entries of $M$ ...
getraparth's user avatar
2 votes
1 answer
244 views

Expected minimal distance of eigenvalues

Let $A$ be an arbitrary symmetric matrix and $B$ be a random GUE matrix. I would like to know. Are there any results on the minimal eigenvalue distance between two distinct eigenvalues of $A+B$? I ...
Guido Li's user avatar
16 votes
3 answers
2k views

Why is the set of Hermitian matrices with repeated eigenvalue of measure zero?

The Hermitian matrices form a real vector space where we have a Lebesgue measure. In the set of Hermitian matrices with Lebesgue measure, how does it follow that the set of Hermitian matrices with ...
Guido Li's user avatar
1 vote
0 answers
90 views

How to prove that $\|A^tv\|_2 \leq \|Av\|_2^t$ for every $0<t<1$? [closed]

Consider a unit norm $\|V\|_2=1$ and a symmetric matrix $A$. I wish to prove that $\|A^tv\|_2 \leq \|Av\|_2^t$ for every $0<t<1$. My belief is that this is true is motivated by empirical ...
Msc Splinter's user avatar
2 votes
1 answer
236 views

How can I prove a randomly generated matrix has distinct non-zero eigenvalues?

Consider the following $M×M$ matrix $$ \mathbf A=\sum_{k=1}^K =a_k \mathbf h_k \mathbf h_k^H,(M≥K) $$ where $a_k$'s are real values and $h_k$'s are $M×1$ randomly generated vectors, e.g., complex ...
WPCN's user avatar
  • 31
0 votes
0 answers
45 views

On full rank submatrices of a construction

Take two matrices $T_1$ and $T_2$ in $\mathbb Z^{n\times n}$ with entries uniformly in $[-b,b]\cap\mathbb Z$ at some $b>0$. The matrices will be of rank $n$ each with probability at least $1-\frac1{...
VS.'s user avatar
  • 1,826
0 votes
0 answers
47 views

"Probability" for a partitioned matrix to be singular

Let $A,B\in\mathbb{R}^{n\times n}$ be two nonsingular matrices with $A\ne B$, and consider the following partitioned matrix $$ M:=\begin{bmatrix}AA^\top + BB^\top & A^\top \Delta_1 A + B^\top \...
Ludwig's user avatar
  • 2,712
2 votes
0 answers
172 views

Minimum of $\mathrm{rank}\left( \boldsymbol{W} \boldsymbol{H} \right)$, with $\boldsymbol{W}$ block diagonal

Let us assume that we have a full-rank $(n\cdot l)\times k$ matrix, $\boldsymbol{H}$, with no specific structure (e.g., a realization of a Gaussian i.i.d. random matrix), and an $m\times (n\cdot l)$ ...
Juan's user avatar
  • 61
1 vote
1 answer
218 views

Is there a bound on the norm of the product of second moment matrix with random vector?

Let $X_1,\dots,X_n$ be vectors in $\mathbb{R^d}$. Assume all of the vectors are inside the unite $\ell_2$ ball, but outside the ball of radius $r$ for some $r \in (0,1)$, i.e. $r \leq \|X_i\| \leq 1$ ....
good bandit's user avatar
6 votes
1 answer
299 views

Phase transition in matrix

Playing around with Matlab I noticed something very peculiar: Take the symmetric matrix $A \in \mathbb R^{n \times n}$ defined by $$A_{ij}= i \delta_{ij} - \frac{\varepsilon}{\sqrt{i}\sqrt{j}}\,.$$ ...
Sascha's user avatar
  • 536
13 votes
0 answers
809 views

Can one Gershgorin circle (only) contain all eigenvalues, when the other circles are not contained in it

In short, following a question from my students, I am trying to find a special case where all the eigenvalues of a matrix lie within only one circle, but not in the others, and the other circles are ...
Itay's user avatar
  • 673
2 votes
1 answer
280 views

Properties of eigenvalues and eigenvectors of a particular random matrix

Let $\mathbf{A}$ be a given $n \times m$ matrix with positive entries, and $\mathbf{B}_{n\times m}$ be a random i.i.d complex Gaussian matrix with unit variance. Assume that $\mathbf{C}$ is the ...
Math_Y's user avatar
  • 287
5 votes
1 answer
368 views

$(AB)^+\approx B^+A^+$ for $B$ "fat" enough?

Let $A\in\mathbb{R}^{r\times m}$ be a matrix of full row rank, and let $\cdot^+$ denote the Moore-Penrose inverse. Consider a sequence of matrices $\{B_n\}_{n>1}$, $B_n\in\mathbb{R}^{m\times n}$, ...
Ludwig's user avatar
  • 2,712
6 votes
2 answers
738 views

Probability of a large random integer Matrix to have zero determinant

Suppose we have a matrix $A \in \{0,1\}^{n \times n}$ where $$A_{ij} = \begin{cases} 1 & \text{with probability} \quad p\\ 0 &\text{with probability} \quad 1-p\end{cases}$$ I would like to ...
Hipstpaka's user avatar
  • 355
1 vote
0 answers
19 views

Empirical approaches to validate observational bounds on minimum gap between least eigenvalues of $n \times n$ correlation matrix and its submatrices

Let $\Sigma$ be an $n \times n$ correlation matrix whose least eigenvalue is denoted by $\lambda$. $\Sigma_i'$ be an $(n-1) \times (n-1)$ submatrix of $\Sigma$ obtained by eliminating the $i$-th row ...
Saurabh Agrawal's user avatar
2 votes
0 answers
102 views

Eigenvalue distribution for a real-valued random matrix with correlated Gaussian entries

I'm working on an application where I would greatly benefit from knowing the distributions of the eigenvalues of a real-valued random matrix whose elements can be assumed to be Gaussian, but where I ...
Ian Cero's user avatar
  • 121
3 votes
1 answer
655 views

Upper bounds on the condition number of the eigenvector matrix

Let $A$ be an $n\times n$ real matrix with entries in a fixed interval $[a_\min,a_\max]$, with $a_\min$, $a_\max>0$. Question: Are there any upper bounds on the condition number of the ...
Ludwig's user avatar
  • 2,712
1 vote
1 answer
394 views

On rank of random $0/1$ matrices

It is known that a $0/1$ matrix picked from uniform distribution from $\{0,1\}^{n\times n}$ is non-singular with probability $1-o(1)$. Fix an integer $t$. Consider a random matrix formed the ...
user avatar
1 vote
0 answers
167 views

Expected amount of linearly dependent random vectors? [closed]

Given a random Matrix $A\in \mathbb{F}_2^{n\times n}$ what is the expectation value of the amount of linearly dependent row-vectors of $A$? EDIT: As said in the comments, I'm looking for the ...
Memphisd's user avatar
  • 123
-1 votes
1 answer
173 views

finding a unitary submatrix inside a random matrix

Let $\mathbf{R} \in \mathbb{C}^{~m \times n} $ with $m \leq n $ be a random matrix, whose entries are i.i.d zero mean random variables with circularly symmetric Normal distribution. Let where $r$ be ...
Jeff's user avatar
  • 482
1 vote
2 answers
477 views

Worst case difference in rank by column-row swapping

Given a matrix $m\in\{-1,+1\}^{n\times n}$. Consider $m^\sigma$ to be collection of all matrices obtained from $m$ by permuting rows and columns. Consider $\mathscr{M}[m^\sigma]$ to be collection of ...
Turbo's user avatar
  • 13.9k
11 votes
1 answer
570 views

Expected size of determinant of $AA^T$ for random circulant and Toeplitz matrices

If $A$ is chosen uniformly at random over all possible $n$ by $n$ Toeplitz (or circulant) (0,1)-matrices, can we give any bounds for the expected size of the determinant of $AA^T$? All arithmetic is ...
Simd's user avatar
  • 3,377
1 vote
0 answers
112 views

Tools to bound the singular values of a finite sum of random matrices from below?

Matrix Chernoff bounds (see also this arXiv paper) are usually used to give upper bounds on the largest eigenvalue of a finite sum of random matrices. Sometimes it can also be used to give a lower ...
olivia's user avatar
  • 111
-2 votes
3 answers
447 views

Determinant of matrix from set {-1, 1} [closed]

Let $A \in \mathbb{R}^{11 \times 11}$ and it's elements are form set $\{ -1,1 \}$. $\mathbb{P}(-1) = \mathbb{P}(1) = 0.5$. What is a probability to get such a matrix, that $\det A > 4000$? I have ...
noone's user avatar
  • 45
27 votes
3 answers
13k views

What is known about the distribution of eigenvectors of random matrices?

Let $A$ be a real asymmetric $n \times n$ matrix with i.i.d. random, zero-mean elements. What results, if any, are there for the eigenvectors of $A$? In particular: How are individual eigenvectors ...
Andrew's user avatar
  • 433
1 vote
0 answers
46 views

the 3th and 4th order statistics of Circularly Symmetric Complex Normal random vector?

Assume that ${\bf{z}} \in {\mathbb{C}}^{n \times 1}$ is a CSCG random vector denoted with $\mathcal{C} ~ (\bf{\mu} _0,\bf \Sigma _0)$ where $\mu _0$ and $\bf \Sigma _0$ are mean and contrivance matrix,...
user51780's user avatar
  • 275
0 votes
0 answers
704 views

expected matrix inverse of circulant plus diagonal matrix with chi-square variables

Let $R$ be a semi-definite $N\times N$ circulant Toeplitz matrix and let $N\to \infty$. Let $D$ be an $N\times N$ diagonal matrix where the elements on the main diagonal are independent chi-square ...
john stark's user avatar
42 votes
3 answers
5k views

The probability for a symmetric matrix to be positive definite

Let me give a reasonable model for the question in the title. In ${\rm Sym}_n({\mathbb R})$, the positive definite matrices form a convex cone $S_n^+$. The probability I have in mind is the ratio $p_n=...
Denis Serre's user avatar
  • 52.3k
11 votes
3 answers
1k views

Maximum singular value of a random $\pm 1$ matrix

Define a matrix $\mathbf{A} \in \mathbb{R}^{m \times n}$ such that each element is independently and randomly chosen with probability $\frac 12$ to be either $+1$, or $-1$. Do you know any result in ...
Kostas's user avatar
  • 199
1 vote
2 answers
747 views

Existence of polynomial equation system solution

For $1 \leq i \leq n$, let $A=\begin{bmatrix} a_{11} & \cdots & a_{1n} \\ \vdots & \ddots & \vdots \\ a_{n1} & \cdots & a_{nn} \\ \end{bmatrix}$, $B_i=\begin{bmatrix} b_{i1} \...
Seyong's user avatar
  • 57
1 vote
3 answers
640 views

Eigenvalues of Krylov matrices

Let an $n\times n$ matrix ${\bf A}$, the all ones vector ${\bf w}$, and the $n\times n$ Krylov matrix $${\bf K}_n = \left[ {\bf w}\;\;{\bf A}{\bf w}\;\;\ldots \;\; {\bf A}^{n-1}{\bf w}\right].$$ Is ...
Anadim's user avatar
  • 449
12 votes
1 answer
3k views

Matrix inversion lemma with pseudoinverses

The utility of the Matrix Inversion Lemma has been well-exploited for several questions on MO. Thus, with some positive hope, I'd like to field a question of my own. Suppose we pick $n$ values $x_1,\...
Suvrit's user avatar
  • 28.6k
14 votes
1 answer
1k views

A Question on Random Matrices

Consider the following $n\times n$ random matrix $V_{n}$ where the $(p,q)$ entry is given by $$ V_{n}(p,q):= \frac{1}{\sqrt{n}}\exp(2\pi i(p-1) x_{q}) $$ where $x_{1},x_{2},\ldots,x_{n}$ are iid ...
ght's user avatar
  • 3,626
4 votes
4 answers
703 views

efficient way to compute the inversion of the following matrix

Hi, there I have looked it up in the current textbook. The conventional numerical method to compute the inversion of an $n \times n$ matrix requires $O(n^3)$. However, for the following special ...
Nancy's user avatar
  • 41
19 votes
1 answer
2k views

Smallest eigenvalue of a tricky random matrix

While experimenting with positive-definite functions, I was led to the following: Let $n$ be a positive integer, and let $x_1,\ldots,x_n$ be sampled from a zero-mean, unit variance gaussian. Consider ...
Suvrit's user avatar
  • 28.6k