中文
相关论文

相关论文: On random $\pm 1$ matrices: Singularity and Determ…

200 篇论文

We calculate analytically the probability of large deviations from its mean of the largest (smallest) eigenvalue of random matrices belonging to the Gaussian orthogonal, unitary and symplectic ensembles. In particular, we show that the…

统计力学 · 物理学 2009-11-11 David S. Dean , Satya N. Majumdar

Let $\a$ be a complex random variable with mean zero and bounded variance $\sigma^{2}$. Let $N_{n}$ be a random matrix of order $n$ with entries being i.i.d. copies of $\a$. Let $\lambda_{1}, ..., \lambda_{n}$ be the eigenvalues of…

概率论 · 数学 2008-02-29 Terence Tao , Van Vu

We consider the ensemble of $N\times N$ ($N\gg 1$) symmetric random matrices with the bimodal independent distribution of matrix elements: each element could be either "1" with the probability $p$, or "0" otherwise. We pay attention to the…

统计力学 · 物理学 2014-09-29 S. K. Nechaev

We prove that $\det A\leq 6^\frac{n}{6}$ whenever $A\in\{0,1\}^{n\times n}$ contains at most $2n$ ones. We also prove an upper bound on the determinant of matrices with the $k$-consecutive ones property, a generalisation of the consecutive…

组合数学 · 数学 2017-11-29 Henning Bruhn , Dieter Rautenbach

Given some binary matrix $M$, suppose we are presented with the collection of its rows and columns in independent arbitrary orderings. From this information, are we able to recover the unique original orderings and matrix? We present an…

概率论 · 数学 2024-04-24 Caelan Atamanchuk , Luc Devroye , Massimo Vicenzo

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…

概率论 · 数学 2021-06-09 Asaf Ferber , Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

We study the large-$n$ limit of the probability $p_{2n,2k}$ that a random $2n\times 2n$ matrix sampled from the real Ginibre ensemble has $2k$ real eigenvalues. We prove that, $$\lim_{n\rightarrow \infty}\frac {1}{\sqrt{2n}} \log…

Motivated by the Koml\'os conjecture in combinatorial discrepancy, we study the discrepancy of random matrices with $m$ rows and $n$ independent columns drawn from a bounded lattice random variable. It is known that for $n$ tending to…

组合数学 · 数学 2018-10-19 Cole Franks , Michael Saks

Large H-selfadjoint random matrices are considered. The matrix $H$ is assumed to have one negative eigenvalue, hence the matrix in question has precisely one eigenvalue of nonpositive type. It is showed that this eigenvalue converges in…

泛函分析 · 数学 2012-06-29 Michal Wojtylak

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

The sharpest known high probability generalization bounds for uniformly stable algorithms (Feldman, Vondr\'{a}k, 2018, 2019), (Bousquet, Klochkov, Zhivotovskiy, 2020) contain a generally inevitable sampling error term of order…

机器学习 · 计算机科学 2021-11-19 Yegor Klochkov , Nikita Zhivotovskiy

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

Let $A = (a_{ij})$ be a square $n\times n$ matrix with i.i.d. zero mean and unit variance entries. Rudelson and Vershynin showed that the upper bound for a smallest singular value $s_n(A)$ is of order $n^{-\frac12}$ with probability close…

概率论 · 数学 2018-11-21 Kateryna Tatarko

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 $M$ be an $n\times n$ random matrix with entries in $\{0, 1\}$, where each row is independently and uniformly sampled from the set of all vectors in $\{0, 1\}^n$ containing exactly $d$ ones, with $d=pn$ for some fixed constant $p\in…

概率论 · 数学 2026-04-15 Dongbin Li , Alexander E. Litvak , Tingzhou Yu

Consider the empirical spectral distribution of complex random $n\times n$ matrix whose entries are independent and identically distributed random variables with mean zero and variance $1/n$. In this paper, via applying potential theory in…

概率论 · 数学 2007-06-13 Guangming Pan , Wang Zhou

In this article we consider products of real random matrices with fixed size. Let $A_1,A_2, \dots $ be i.i.d $k \times k$ real matrices, whose entries are independent and identically distributed from probability measure $\mu$. Let $X_n =…

概率论 · 数学 2017-01-19 Tulasi Ram Reddy

We prove an estimate on the smallest singular value of a multiplicatively and additively deformed random rectangular matrix. Suppose $n\le N \le M \le \Lambda N$ for some constant $\Lambda \ge 1$. Let $X$ be an $M\times n$ random matrix…

概率论 · 数学 2018-10-17 Fan Yang

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 study the spectral norm of matrices M that can be factored as M=BA, where A is a random matrix with independent mean zero entries, and B is a fixed matrix. Under the (4+epsilon)-th moment assumption on the entries of A, we show that the…

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