Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 63 tok/s
Gemini 2.5 Pro 44 tok/s Pro
GPT-5 Medium 31 tok/s Pro
GPT-5 High 32 tok/s Pro
GPT-4o 86 tok/s Pro
Kimi K2 194 tok/s Pro
GPT OSS 120B 445 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Sharp invertibility of random Bernoulli matrices (2010.06553v2)

Published 13 Oct 2020 in math.PR and math.CO

Abstract: Let $p \in (0,1/2)$ be fixed, and let $B_n(p)$ be an $n\times n$ random matrix with i.i.d. Bernoulli random variables with mean $p$. We show that for all $t \ge 0$, [\mathbb{P}[s_n(B_n(p)) \le tn{-1/2}] \le C_p t + 2n(1-p){n} + C_p (1-p-\epsilon_p){n},] where $s_n(B_n(p))$ denotes the least singular value of $B_n(p)$ and $C_p, \epsilon_p > 0$ are constants depending only on $p$. In particular, [\mathbb{P}[B_{n}(p) \text{ is singular}] = 2n(1-p){n} + C_{p}(1-p-\epsilon_p){n},] which confirms a conjecture of Litvak and Tikhomirov. We also confirm a conjecture of Nguyen by showing that if $Q_{n}$ is an $n\times n$ random matrix with independent rows that are uniformly distributed on the central slice of ${0,1}{n}$, then [\mathbb{P}[Q_{n} \text{ is singular}] = (1/2 + o_n(1)){n}.] This provides, for the first time, a sharp determination of the logarithm of the probability of singularity in any natural model of random discrete matrices with dependent entries.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.