SearcharxivSearch

arXiv · 1803.05857

On some random variables involving Bernoulli random variable

Abstract

Motivated by the recent investigations given in [25] and the fact that Bernoulli probability-type models were often used in the study on some problems in theory of compressive sensing, here we define and study the complex-valued discrete random variables $\widetilde{X}_l(m,N)$ ($0\le l\le N-1$, $1\le m\le N$). Each of these random variables is defined as a linear combination of $N$ independent identically distributed $0-1$ Bernoulli random variables. We prove that for $l\not=0$, $\widetilde{X}_l(m,N)$ is the zero-mean random variable, and we also determine the variance of $\widetilde{X}_l(m,N)$ and its real and imaginary parts. Notice that $\widetilde{X}_l(m,N)$ belongs to the class of sub-Gaussian random variables that are significant in some areas of theory of compressive sensing. In particular, we prove some probability estimates for the mentioned random variables. These estimates are used to establish the upper bounds of the sub-Gaussian norm of their real and imaginary parts. We believe that our results should be implemented in certain applications of sub-Gaussian random variables for solving some problems in compressive sensing of sparse signals.

Explore related subjects

Keep this discovery

BibTeXRIS

Romeo Meštrović. 2018-03-14. On some random variables involving Bernoulli random variable. https://arxiv.org/abs/1803.05857

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR