Related papers: Approximating the identity of convolution with ran…

For an array $\left\{X_{n,j}, \, 1 \leqslant j \leqslant k_{n}, n \geqslant 1 \right\}$ of random variables and a sequence $\{c_{n} \}$ of positive numbers, sufficient conditions are given under which, for all $\varepsilon > 0$,…

For $p\ge 1$ let $\varphi_p(x)=x^2/2$ if $|x|\le 1$ and $\varphi_p(x)=1/p|x|^p-1/p+1/2$ if $|x|>1$. For a random variable $\xi$ let $\tau_{\varphi_p}(\xi)$ denote $\inf\{a\ge 0:\;\forall_{\lambda\in\mathbb{R}}\;…

This paper deals with the problem of quantifying the approximation a probability measure by means of an empirical (in a wide sense) random probability measure, depending on the first n terms of a sequence of random elements. In Section 2,…

For appropriate orthonormal wavelet basis $\{\psi_{j\,k}^e \}_{j\in\mathbb{Z}\,k\in\mathbb{Z}^d\,e\in\{0,1\}^d}$, constants $p$ and $\gamma$, if $\mathcal{I}_{\gamma}$ denotes the Riesz fractional integral operator of order $\gamma$ and…

In this paper we improve Bernoulli comparison. The result works for independent Rademacher random variables $(\varepsilon_i)_{i\geq1}$ and states that we can compare $\mathbb{E}\sup_{t\in T}\sum_{i\geq1}\varphi_{i}(t)\varepsilon_i$ with…

Improving Importance Sampling estimators for rare event probabilities requires sharp approximations of conditional densities. This is achieved for events E_{n}:=(f(X_{1})+...+f(X_{n}))\inA_{n} where the summands are i.i.d. and E_{n} is a…

Consider a family of random ordinary differential equations on a manifold driven by vector fields of the form $\sum_kY_k\alpha_k(z_t^\epsilon(\omega))$ where $Y_k$ are vector fields, $\epsilon$ is a positive number, $z_t^\epsilon$ is a…

Let ${\bf X}$ and ${\bf X}$ be two $n$-dimensional elliptical random vectors, we establish an identity for $E[f({\bf Y})]-E[f({\bf X})]$, where $f: \Bbb{R}^n \rightarrow \Bbb{R}$ fulfilling some regularity conditions. Using this identity we…

We consider a number $\nu_n$ of components in a random graph $G(n,p)$ with $n$ vertices, where the probability of an edge is equal to $p$. By operating with special generating functions we shows the next asymptotic relation for factorial…

The classical zero-one law for first-order logic on random graphs says that for any first-order sentence $\phi$ in the theory of graphs, as n approaches infinity, the probability that the random graph G(n, p) satisfies $\phi$ approaches…

We consider a random process as a solution of stochastic differential equations with dependence of the coefficients on small parameter $\varepsilon$ and we suppose that the drift coefficients of these equations are unbounded on the…

Given an Orlicz function $M$, we show which random variables $\xi_i$, $i=1,...,n$ generate the associated Orlicz norm, i.e., which random variables yield $\mathbb{E} \max\limits_{1\leq i \leq n}|x_i\xi_i| \sim \norm{(x_i)_{i=1}^n}_M$. As a…

The interest in orthogonal polynomials and random Fourier series in numerous branches of science and a few studies on random Fourier series in orthogonal polynomials inspired us to focus on random Fourier series in Jacobi polynomials. In…

Let $\{Y_i,-\infty<i<\infty\}$ be a doubly infinite sequence of identically distributed, negatively dependent random variables under sub-linear expectations, $\{a_i,-\infty<i<\infty\}$ be an absolutely summable sequence of real numbers. In…

We investigate random Bernoulli convolutions, namely, probability measures given by the infinite convolution \[ \mu_\omega = \mathop{\circledast}_{k=1}^{\infty} \left( \frac{\delta_0 + \delta_{\lambda_1 \lambda_2 \ldots \lambda_{k-1}…

A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…

We analyze the asymptotic behavior of random variables $x(n,x\_0)$ defined by $x(0,x\_0)=x\_0$ and $x(n+1,x\_0)=A(n)x(n,x\_0)$, where $\sAn$ is a stationary and ergodic sequence of random matrices with entries in the semi-ring…

Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…

We investigate the almost everywhere convergence of sequences of convolution operators given by probability measures $\mu_n$ on $\mathbb R$. If this sequence of operators constitutes an approximate identity on a particular class of…

Let $(X_1,\ldots,X_n)$ be an i.i.d. sequence of random variables in $\mathbb{R}^d$, $d\geq 1$. We show that, for any function $\varphi :\mathbb{R}^d\rightarrow\mathbb{R}$, under regularity conditions, \[n^…