English
Related papers

Related papers: Singularity of random Bernoulli matrices

200 papers

Let $A_n$ be a random symmetric matrix with Bernoulli $\{\pm 1\}$ entries. For any $\kappa>0$ and two real numbers $\lambda_1,\lambda_2$ with a separation $|\lambda_1-\lambda_2|\geq \kappa n^{1/2}$ and both lying in the bulk…

Probability · Mathematics 2025-04-23 Yi Han

We prove the conjecture about the probability that Pn of Bernulli +- 1 square matrix to be singular and asymptotic expansion of Pn.

Probability · Mathematics 2025-10-28 Vladimir Blinovsky

Let $M_{n}$ denote a random symmetric $n\times n$ matrix, whose entries on and above the diagonal are i.i.d. Rademacher random variables (taking values $\pm 1$ with probability $1/2$ each). Resolving a conjecture of Vu, we prove that the…

Probability · Mathematics 2021-10-29 Matthew Kwan , Lisa Sauermann

A complete characterization of the asymptotic singularity probability of random circulant Bernoulli matrices is given for all values of the probability parameter.

Combinatorics · Mathematics 2024-11-27 Niklas Miller

In this paper, we investigate the following question: How often is a random matrix normal? We consider a random $n\times n$ matrix, $M_n$, whose entries are i.i.d. Rademacher random variables (taking values $\{ \pm1 \}$ with probability…

Probability · Mathematics 2019-02-06 Andrei Deneanu , Van Vu

It is shown that a random $(0,1)$ matrix whose rows are independent random vectors of exactly $n/2$ zero components is non-singular with probability $1-O(n^{-C})$ for any $C>0$. The proof uses a non-standard inverse-type Littlewood-Offord…

Combinatorics · Mathematics 2011-12-06 Hoi H. Nguyen

Let $A$ be drawn uniformly at random from the set of all $n\times n$ symmetric matrices with entries in $\{-1,1\}$. We show that \[ \mathbb{P}( \det(A) = 0 ) \leq e^{-cn},\] where $c>0$ is an absolute constant, thereby resolving a…

Probability · Mathematics 2021-06-09 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe

It is shown by Karp reduction that deciding the singularity of $(2^n - 1) \times (2^n - 1)$ sparse circulant matrices (SC problem) is NP-complete. We can write them only implicitly, by indicating values of the $2 + n(n + 1)/2$ eventually…

Computational Complexity · Computer Science 2009-09-16 Ilia Toli

We prove a lower bound expansion on the probability that a random $\pm 1$ matrix is singular, and conjecture that such expansions govern the actual probability of singularity. These expansions are based on naming the most likely, second…

Probability · Mathematics 2012-05-24 Richard Arratia , Stephen DeSalvo

Let $A$ be an $n \times n$ random matrix with iid entries over a finite field of order $q$. Suppose that the entries do not take values in any additive coset of the field with probability greater than $1 - \alpha$ for some fixed $0 < \alpha…

Combinatorics · Mathematics 2013-07-24 Kenneth Maples

For a fixed $n\ge2$, consider an $n\times n$ matrix $M$ whose entries are random integers bounded by $k$ in absolute value. In this paper, we examine the probability that $M$ is singular (hence has eigenvalue 0), and the probability that…

Number Theory · Mathematics 2007-12-20 Greg Martin , Erick B. Wong

We study the distribution of the least singular value associated to an ensemble of sparse random matrices. Our motivating example is the ensemble of $N\times N$ matrices whose entries are chosen independently from a Bernoulli distribution…

Probability · Mathematics 2019-01-25 Ziliang Che , Patrick Lopatto

Let $F_n$ be an $n$ by $n$ symmetric matrix whose entries are bounded by $n^{\gamma}$ for some $\gamma>0$. Consider a randomly perturbed matrix $M_n=F_n+X_n$, where $X_n$ is a random symmetric matrix whose upper diagonal entries $x_{ij}$…

Combinatorics · Mathematics 2011-03-18 Hoi H. Nguyen

Let $M$ be an arbitrary $n$ by $n$ matrix. We study the condition number a random perturbation $M+N_n$ of $M$, where $N_n$ is a random matrix. It is shown that, under very general conditions on $M$ and $M_n$, the condition number of $M+N_n$…

Probability · Mathematics 2007-05-23 Terence Tao , Van Vu

Let A be a matrix whose entries are real i.i.d. centered random variables with unit variance and suitable moment assumptions. Then the smallest singular value of A is of order n^{-1/2} with high probability. The lower estimate of this type…

Probability · Mathematics 2016-12-23 Mark Rudelson , Roman Vershynin

A well-known conjecture states that a random symmetric $n \times n$ matrix with entries in $\{-1,1\}$ is singular with probability $\Theta\big( n^2 2^{-n} \big)$. In this paper we prove that the probability of this event is at most…

Combinatorics · Mathematics 2020-10-20 Marcelo Campos , Letícia Mattos , Robert Morris , Natasha Morrison

Let $ A_n $ be an $n \times n$ random matrix with i.i.d Bernoulli($p$) entries. For a fixed positive integer $\beta$, suppose $p$ satisfies $$ \frac{ \log(n) }{ n } \le p \le c_\beta $$ where $c_\beta \in ( 0, 1/2 )$ is a…

Probability · Mathematics 2025-05-20 Han Huang

Let $A$ be an $n\times n$ random matrix with independent, identically distributed mean 0, variance 1 subgaussian entries. We prove that $$ \mathbb{P}(A\text{ has distinct singular values})\geq 1-e^{-cn} $$ for some $c>0$, confirming a…

Probability · Mathematics 2025-03-04 Yi Han

For certain negative rational numbers k0, called singular values, and associated with the symmetric group S_N on N objects, there exist homogeneous polynomials annihilated by each Dunkl operator when the parameter k = k0. It was shown by de…

Representation Theory · Mathematics 2009-09-04 Charles F. Dunkl

Singular Mueller matrices play an important role in polarization algebra and have peculiar properties that stem from the fact that either the medium exhibits maximum diattenuation and/or polarizance, or because its associated canonical…

Optics · Physics 2016-04-06 Jose J. Gil , Razvigor Ossikovski , Ignacio San Jose