Rank of Sparse Bernoulli Matrices

Abstract

Let An be an n × n random matrix with i.i.d Bernoulli(p) entries. For a fixed positive integer β, suppose p satisfies (n) n p cβ where cβ ∈ ( 0, 1/2 ) is a β-dependentvalue. For t 0, P \ s n - β + 1(A) t n-2β + n(1) (pn)-7 \ = t + ( 1 + on(1) ) P \ either β rows or β columns of An equal 0 \.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…