Related papers: Singularity of sparse random matrices: simple proo…
Composite likelihood has shown promise in settings where the number of parameters $p$ is large due to its ability to break down complex models into simpler components, thus enabling inference even when the full likelihood is not tractable.…
In this paper, we study Bernoulli random sequences, i.e., sequences that are Martin-L\"of random with respect to a Bernoulli measure $\mu_p$ for some $p\in[0,1]$, where we allow for the possibility that $p$ is noncomputable. We focus in…
We present the first efficient averaging sampler that achieves asymptotically optimal randomness complexity and near-optimal sample complexity. For any $\delta < \varepsilon$ and any constant $\alpha > 0$, our sampler uses $m + O(\log (1 /…
This paper presents a framework for binary autoregressive time series in which each observation is a Bernoulli variable whose success probability evolves with past outcomes and probabilities, in the spirit of GARCH-type dynamics,…
We study pairs and m--tuples of compositions of a positive integer n with parts restricted to a subset P of positive integers. We obtain some exact enumeration results for the number of tuples of such compositions having the same number of…
We study the rate of convergence to a normal random variable of the real and imaginary parts of Tr(AU), where U is an N x N random unitary matrix and A is a deterministic complex matrix. We show that the rate of convergence is O(N^{-2 +…
A given density matrix may be represented in many ways as a mixture of pure states. We show how any density matrix may be realized as a uniform ensemble. It has been conjectured that one may realize all probability distributions that are…
We propose a way to reconcile the Standard Model of leptons with a purely vectorial theory. The observed neutrino is predicted to be massless. The unobservability of its partner and the $V-A$ structure of the weak currents are given the…
We consider the probability $p(S_n)$ that a pair of random permutations generates either the alternating group $A_n$ or the symmetric group $S_n$. Dixon (1969) proved that $p(S_n)$ approaches $1$ as $n\to\infty$ and conjectured that…
In this paper we consider Wigner random matrices -- symmetric n by n random matrices whose entries are independent identically distributed real random variables. We prove that the probability distribution of one or several eigenvalues close…
Consider random matrices $A$, of dimension $m\times (m+n)$, drawn from an ensemble with probability density $f(\rmtr AA^\dagger)$, with $f(x)$ a given appropriate function. Break $A = (B,X)$ into an $m\times m$ block $B$ and the…
Let $M_n$ be drawn uniformly from all $\pm 1$ symmetric $n \times n$ matrices. We show that the probability that $M_n$ is singular is at most $\exp(-c(n\log n)^{1/2})$, which represents a natural barrier in recent approaches to this…
For a fixed $n\ge2$, consider an $n\times n$ matrix $M$ whose entries are random integers bounded by $k$ in absolute value. In this paper, we examine the probability that $M$ is singular (hence has eigenvalue 0), and the probability that…
Consider the discrete cube $\{-1,1\}^N$ and a random collection of half spaces which includes each half space $H(x) := \{y \in \{-1,1\}^N: x \cdot y \geq \kappa \sqrt{N}\}$ for $x \in \{-1,1\}^N$ independently with probability $p$. Is the…
The number of $n \times n$ matrices whose entries are either -1, 0, or 1, whose row- and column- sums are all 1, and such that in every row and every column the non-zero entries alternate in sign, is proved to be $[1!4! >...…
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question of Peter Winkler, we show that if the two 0-1-sequences are…
Fix a positive integer $d$ and let $(G_n)_{n\geq1}$ be a sequence of finite abelian groups with orders tending to infinity. For each $n \geq 1$, let $C_n$ be a uniformly random $G_n$-circulant matrix with entries in $\{0,1\}$ and exactly…
In this paper we demonstrate that the alternative form, derived by us in an earlier paper, of the $n$-level densities for eigenvalues of matrices from the classical compact group $USp(2N)$ is far better suited for comparison with…
An iterative randomness extraction algorithm which generalized the Von Neumann's extraction algorithm is detailed, analyzed and implemented in standard C++. Given a sequence of independently and identically distributed biased Bernoulli…
Understanding statistical inference under possibly non-sparse high-dimensional models has gained much interest recently. For a given component of the regression coefficient, we show that the difficulty of the problem depends on the sparsity…