Related papers: The sparse parity matrix

We consider $N\times N$ self-adjoint Gaussian random matrices defined by an arbitrary deterministic sparsity pattern with $d$ nonzero entries per row. We show that such random matrices exhibit a canonical localization-delocalization…

Let $W_1,\ldots,W_N$ be a sample of $\mathrm{Pareto}(\alpha)$ random variables normalized by their sum, such that $\sum_i W_i=1$. The $W_i$ may represent the weights of valleys in a spin glass (if $0<\alpha<1$), or the frequency of…

Consider the random bipartite Erd\H{o}s-R\'{e}nyi graph $\mathbb{G}(n, m, p)$, where each edge with one vertex in $V_{1}=[n]$ and the other vertex in $V_{2} =[m]$ is connected with probability $p$, and $n=\lfloor \gamma m\rfloor$ for a…

Counting the number of perfect matchings in bipartite graphs, or equivalently computing the permanent of 0-1 matrices, is an important combinatorial problem that has been extensively studied by theoreticians and practitioners alike. The…

We consider n by n real matrices whose entries are non-degenerate random variables that are independent but non necessarily identically distributed, and show that the probability that such a matrix is singular is O(1/sqrt{n}). The purpose…

Choice models, which capture popular preferences over objects of interest, play a key role in making decisions whose eventual outcome is impacted by human choice behavior. In most scenarios, the choice model, which can effectively be viewed…

Recently, Pagh presented a randomized approximation algorithm for the multiplication of real-valued matrices building upon work for detecting the most frequent items in data streams. We continue this line of research and present new {\em…

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…

For a family of interpolation norms $\| \cdot \|_{1,2,s}$ on $\mathbb{R}^n$, we provide a distribution over random matrices $\Phi_s \in \mathbb{R}^{m \times n}$ parametrized by sparsity level $s$ such that for a fixed set $X$ of $K$ points…

We provide fast algorithms for overconstrained $\ell_p$ regression and related problems: for an $n\times d$ input matrix $A$ and vector $b\in\mathbb{R}^n$, in $O(nd\log n)$ time we reduce the problem $\min_{x\in\mathbb{R}^d} \|Ax-b\|_p$ to…

The independence number of a sparse random graph G(n,m) of average degree d=2m/n is well-known to be \alpha(G(n,m))~2n ln(d)/d with high probability. Moreover, a trivial greedy algorithm w.h.p. finds an independent set of size (1+o(1)) n…

The problem of multivariate exponential analysis or sparse interpolation has received a lot of attention, especially with respect to the number of samples required to solve it unambiguously. In this paper we show how to bring the number of…

In the asymmetric simple exclusion process on the integers each particle waits exponential time, then with probability p it moves one step to the right if the site is unoccupied, otherwise it stays put; and with probability q=1-p it moves…

We revisit the probabilistic construction of sparse random matrices where each column has a fixed number of nonzeros whose row indices are drawn uniformly at random with replacement. These matrices have a one-to-one correspondence with the…

We present a simple proof to a fact recently established in [5]: let $\xi$ be a symmetric random variable that has variance $1$, let $\Gamma=(\xi_{ij})$ be an $N \times n$ random matrix whose entries are independent copies of $\xi$, and set…

We investigate the distribution of eigenvalues of weighted adjacency matrices from a specific ensemble of random graphs. We distribute $N$ vertices across a fixed number $\kappa$ of components, with asymptotically $\alpha_j \dot N$ vertices…

Consider some convex body $K\subset\mathbb R^d$. Let $X_1,\dots, X_k$, where $k\leq d$, be random points independently and uniformly chosen in $K$, and let $\xi_k$ be a uniformly distributed random linear $k$-plane. We show that for…

Results regarding probable bifurcations from fixed points are presented in the context of general dynamical systems (real, random matrices), time-delay dynamical systems (companion matrices), and a set of mappings known for their properties…

Let $\log^{2+\varepsilon} n \le d \le n/2$ for some fixed $\varepsilon \in (0,1)$, and let $M_n$ 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…

Be d_{m,n} a generic element in the infinite matrix D, with d_{1, n} defined as the n-th prime number and, for any m>1, d_{m, n} = | d_{m-1, n} - d_{m-1, n+1} | When n>1, after the first few terms the columns in the matrix appear to be…