Related papers: Rank of Sparse Bernoulli Matrices

Given a sequence of independent Bernoulli variables with unknown parameter $p$, and a function $f$ expressed as a power series with non-negative coefficients that sum to at most $1$, an algorithm is presented that produces a Bernoulli…

In this paper, we study the condition number of a random Toeplitz matrix. Since a Toeplitz matrix is a diagonal constant matrix, its rows or columns cannot be stochastically independent. This situation does not permit us to use the classic…

We show an algorithm for computing the permanent of a random matrix with vanishing mean in quasi-polynomial time. Among special cases are the Gaussian, and biased-Bernoulli random matrices with mean 1/lnln(n)^{1/8}. In addition, we can…

Consider the setting of sparse graphs on N vertices, where the vertices have distinct "names", which are strings of length O(log N) from a fixed finite alphabet. For many natural probability models, the entropy grows as cN log N for some…

Denote by $A_n$ the set of square $(0,1)$ matrices of order $n$. The set $A_n$, $n\le8$, is partitioned into row/column permutation equivalence classes enabling derivation of various facts by simple counting. For example, the number of…

We study long-range percolation on the hierarchical lattice of order $N$, where any edge of length $k$ is present with probability $p_k=1-\exp(-\beta^{-k} \alpha)$, independently of all other edges. For fixed $\beta$, we show that the…

We present an algorithm computing the determinant of an integer matrix A. The algorithm is introspective in the sense that it uses several distinct algorithms that run in a concurrent manner. During the course of the algorithm partial…

An $n\times n$ matrix $M$ is called a \textit{fooling-set matrix of size $n$} if its diagonal entries are nonzero and $M_{k,\ell} M_{\ell,k} = 0$ for every $k\ne \ell$. Dietzfelbinger, Hromkovi{\v{c}}, and Schnitger (1996) showed that $n…

This paper deals with the following question: Suppose that there exist an integer or a non-negative integer solution $x$ to a system $Ax = b$, where the number of non-zero components of $x$ is $n$. The target is, for a given natural number…

We show that the maximal number of equal entries in a totally positive (resp. totally nonsingular) $n\textrm{-by-}n$ matrix is $\Theta(n^{4/3})$ (resp. $\Theta(n^{3/2}$)). Relationships with point-line incidences in the plane, Bruhat order…

We consider the set Bp of parametric block correlation matrices with p blocks of various (and possibly different) sizes, whose diagonal blocks are compound symmetry (CS) correlation matrices and off-diagonal blocks are constant matrices.…

Let $M_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are iid Bernoulli random variables (which take value -1 and 1 with probability 1/2). Improving the earlier result by Costello, Tao and Vu, we show that…

A matrix is homogeneous if all of its entries are equal. Let $P$ be a $2\times 2$ zero-one matrix that is not homogeneous. We prove that if an $n\times n$ zero-one matrix $A$ does not contain $P$ as a submatrix, then $A$ has an $cn\times…

The almost-principal rank characteristic sequence (apr-sequence) of an $n\times n$ symmetric matrix is introduced, which is defined to be the string $a_1 a_2 \cdots a_{n-1}$, where $a_k$ is either $\tt A$, $\tt S$, or $\tt N$, according as…

We investigate matching for the family $T_\alpha(x) = \beta x + \alpha \pmod 1$, $\alpha \in [0,1]$, for fixed $\beta > 1$. Matching refers to the property that there is an $n \in \mathbb N$ such that $T_\alpha^n(0) = T_\alpha^n(1)$. We…

Permanents of random matrices with independent and identically distributed (i.i.d.) entries have extensively studied in literature and convergence and concentration properties are known under varying assumptions on the distributions. In…

A nonempty set $A\subset\mathbb{N}$ is $\ell$-strong Schreier if $\min A\geqslant \ell|A|-\ell+1$. We define a set of positive integers to be sparse if either the set has at most two numbers or the differences between consecutive numbers in…

For each 1 < p < infinity, there exists a positive constant c_p, depending only on p, such that the following holds. Let (d_k), (e_k) be real-valued martingale difference sequences. If for for all bounded nonnegative predictable sequences…

The Freud ensemble of random matrices is the unitary invariant ensemble corresponding to the weight $\exp(-n |x|^{\beta})$, $\beta>0$, on the real line. We consider the local behaviour of eigenvalues near zero, which exhibits a transition…

A positive definite matrix is called logarithmically sparse if its matrix logarithm has many zero entries. Such matrices play a significant role in high-dimensional statistics and semidefinite optimization. In this paper, logarithmically…