中文
相关论文

相关论文: Random symmetric matrices are almost surely non-si…

200 篇论文

Let $Q_n$ be a random $n\times n$ matrix with entries in $\{0,1\}$ whose rows are independent vectors of exactly $n/2$ zero components. We show that the smallest singular value $s_n(Q_n)$ of $Q_n$ satisfies \[ \mathbb{P}\Big\{s_n(Q_n)\le…

概率论 · 数学 2020-11-02 Tuan Tran

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

组合数学 · 数学 2024-11-27 Niklas Miller

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…

概率论 · 数学 2025-05-20 Han Huang

We consider the asymptotic behavior as $n\to\infty$ of the spectra of random matrices of the form \[\frac{1}{\sqrt{n-1}}\sum_{k=1}^{n-1}Z_{nk}\rho_n ((k,k+1)),\] where for each $n$ the random variables $Z_{nk}$ are i.i.d. standard Gaussian…

概率论 · 数学 2009-06-11 Steven N. Evans

If $M$ is a set of nonsingular $k\times k$ matrices then for many pairs of matrices, $A,B\in M,$ the sum is nonsingular, $\det(A+B)\neq 0.$ We prove a more general statement on nonsingular sums with an application.

组合数学 · 数学 2018-02-22 Jozsef Solymosi

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…

概率论 · 数学 2019-02-06 Andrei Deneanu , Van Vu

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…

概率论 · 数学 2012-05-24 Richard Arratia , Stephen DeSalvo

This paper considers random (non-Hermitian) circulant matrices, and proves several results analogous to recent theorems on non-Hermitian random matrices with independent entries. In particular, the limiting spectral distribution of a random…

概率论 · 数学 2011-02-01 Mark W. Meckes

Consider a random sum $\eta_1 v_1 + ... + \eta_n v_n$, where $\eta_1,...,\eta_n$ are i.i.d. random signs and $v_1,...,v_n$ are integers. The Littlewood-Offord problem asks to maximize concentration probabilities such as $\P(\eta_1 v_1 + ...…

概率论 · 数学 2007-05-23 Terence Tao , Van Vu

Let $T$ be an $n\times n$ random matrix, such that each diagonal entry $T_{i,i}$ is a continuous random variable, independent from all the other entries of $T$. Then for every $n\times n$ matrix $A$ and every $t\ge0$ $$…

概率论 · 数学 2013-02-21 Omer Friedland , Ohad Giladi

Let $\{x_{\alpha}\}_{\alpha \in \mathbb{Z}}$ and $\{y_{\alpha}\}_{\alpha \in \mathbb{Z}}$ be two independent collections of zero mean, unit variance random variables with uniformly bounded moments of all orders. Consider a nonsymmetric…

概率论 · 数学 2022-09-07 Soumendu Sundar Mukherjee

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…

概率论 · 数学 2021-03-18 Arup Bose , Koushik Saha , Arusharka Sen , Priyanka Sen

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…

概率论 · 数学 2019-01-25 Ziliang Che , Patrick Lopatto

Let $A$ be an $n\times n$ random matrix whose entries are i.i.d. with mean $0$ and variance $1$. We present a deterministic polynomial time algorithm which, with probability at least $1-2\exp(-\Omega(\epsilon n))$ in the choice of $A$,…

概率论 · 数学 2020-12-02 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

We study the singularity probability of random integer matrices. Concretely, the probability that a random $n \times n$ matrix, with integer entries chosen uniformly from $\{-m,\ldots,m\}$, is singular. This problem has been well studied in…

计算复杂性 · 计算机科学 2021-09-01 Sankeerth Rao Karingula , Shachar Lovett

In this article the statistical properties of symmetrical random matrices whose elements are drawn from a q-parametrized non-extensive statistics power-law distribution are investigated. In the limit as q->1 the well known Gaussian…

统计力学 · 物理学 2007-05-23 John Evans , Fredrick Michael

Let $A$ be an $n\times n$ random symmetric matrix with independent identically distributed subgaussian entries of unit variance. We prove the following large deviation inequality for the rank of $A$: for all $1\leq k\leq c\sqrt{n}$,…

概率论 · 数学 2026-05-08 Yi Han

A central question in random matrix theory is universality. When an emergent phenomena is observed from a large collection of chosen random variables it is natural to ask if this behavior is specific to the chosen random variable or if the…

概率论 · 数学 2021-01-13 Jake Koenig , Hoi Nguyen

We study largest singular values of large random matrices, each with mean of a fixed rank $K$. Our main result is a limit theorem as the number of rows and columns approach infinity, while their ratio approaches a positive constant. It…

概率论 · 数学 2021-03-02 Wlodek Bryc , Jack W. Silverstein

Let $\a$ be a real-valued random variable of mean zero and variance 1. Let $M_n(\a)$ denote the $n \times n$ random matrix whose entries are iid copies of $\a$ and $\sigma_n(M_n(\a))$ denote the least singular value of $M_n(\a)$.…

概率论 · 数学 2009-03-04 Terence Tao , Van Vu