中文
相关论文

相关论文: On the singularity probability of random Bernoulli…

200 篇论文

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…

概率论 · 数学 2021-10-29 Matthew Kwan , Lisa Sauermann

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

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$…

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

In this note we show that the singular probability of the adjacency matrix of a random $d$-regular graph on $n$ vertices, where $d$ is fixed and $n \to \infty$, is bounded by $n^{-1/3+o(1)}$. This improves a recent bound by Huang. Our…

概率论 · 数学 2023-08-15 Hoi H. Nguyen , Amanda Pan

Let $M_n$ be an $n\times n$ random matrix with i.i.d. Bernoulli(p) entries. We show that there is a universal constant $C\geq 1$ such that, whenever $p$ and $n$ satisfy $C\log n/n\leq p\leq C^{-1}$, \begin{align*} {\mathbb…

概率论 · 数学 2020-04-08 Alexander E. Litvak , Konstantin E. Tikhomirov

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…

组合数学 · 数学 2013-07-24 Kenneth Maples

In this paper we give a simple, short, and self-contained proof for a non-trivial upper bound on the probability that a random $\pm 1$ symmetric matrix is singular.

概率论 · 数学 2020-06-16 Asaf Ferber

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…

概率论 · 数学 2025-04-23 Yi Han

Given positive integers $n$ and $m$, let $p_n(m)$ be the probability that a uniform random permutation of $[n]$ has order exactly $m$. We show that, as $n \to \infty$, the maximum of $p_n(m)$ over all $m$ is asymptotic to $1/n$, the…

组合数学 · 数学 2025-10-14 Adrian Beker

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

We study n by n symmetric random matrices H, possibly discrete, with iid above-diagonal entries. We show that H is singular with probability at most exp(-n^c), and the spectral norm of the inverse of H is O(sqrt{n}). Furthermore, the…

概率论 · 数学 2014-03-05 Roman Vershynin

Let $M_n$ be a random $n\times n$ matrix with i.i.d. $\text{Bernoulli}(1/2)$ entries. We show that for fixed $k\ge 1$, \[\lim_{n\to \infty}\frac{1}{n}\log_2\mathbb{P}[\text{corank }M_n\ge k] = -k.\]

概率论 · 数学 2021-03-04 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

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}$…

组合数学 · 数学 2011-03-18 Hoi H. Nguyen

In this brief paper the probability density of a random real, complex and quaternion determinant is rederived using singular values. The behaviour of suitably rescaled random determinants is studied in the limit of infinite order of the…

统计力学 · 物理学 2009-10-31 Giovanni M. Cicuta , Madan L. Mehta

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…

组合数学 · 数学 2011-12-06 Hoi H. Nguyen

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 $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…

概率论 · 数学 2021-06-09 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe

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

While useful probability bounds for $n$ pairwise independent Bernoulli random variables adding up to at least an integer $k$ have been proposed in the literature, none of these bounds are tight in general. In this paper, we provide several…

最优化与控制 · 数学 2022-11-24 Arjun Ramachandra , Karthik Natarajan

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…

概率论 · 数学 2016-12-23 Mark Rudelson , Roman Vershynin