Related papers: A maximal inequality for dependent random variable…

Consider two random variables contaminated by two unknown transformations. The aim of this paper is to test the equality of those transformations. Two cases are distinguished: first, the two random variables have known distributions.…

We give a general proof of the strong consistency of the Maximum Likelihood Estimator for the case of independent non-identically distributed (i.n.i.d) data, assuming that the density functions of the random variables follow a particular…

The idea of the restricted mean has been used to establish a significantly improved version of Markov's inequality that does not require any new assumptions. The result immediately extends on Chebyshev's inequalities and Chernoff's bound.…

We provide an inequality which is a useful tool in studying both large deviation results and limit theorems for sums of random fields with "negligible" small values. In particular, the inequality covers cases of stable limits for random…

We study the maximum of the random assignment process on rectangular matrices. We derive first-order asymptotics for the expected maximum, prove a law of large numbers under mild tail assumptions, and obtain exponential upper bounds for the…

Given a bounded class of functions G and independent random variables X1, . . . , Xn, we provide an upper bound for the expectation of the supremum of the empirical process over elements of G having a small variance. Our bound applies in…

In this brief note, we study the strong law of large numbers for random walks in random scenery. Under the assumptions that the random scenery is non-stationary and satisfies weakly dependent condition with an appropriate rate, we establish…

Let $ X_1, \ldots, X_n $ be independent random variables taking values in the alphabet $ \{0, 1, \ldots, r\} $, and $ S_n = \sum_{i = 1}^n X_i $. The Shepp--Olkin theorem states that, in the binary case ($ r = 1 $), the Shannon entropy of $…

Let m_j denote the jth moment of a random variable X. One of the results is the inequality m_3 \leq c m_4^{3/4} with the best possible factor c over all random variables X with a non-positive mean.

Let $X$, $X_1$, $X_2$, $...$ be i.i.d. random variables, and let $S_n=X_1+... + X_n$ be the partial sums and $M_n=\max_{k\le n}|S_k|$ be the maximum partial sums. We give the sufficient and necessary conditions for a kind of limit theorems…

Both complete decoupling and tangent decoupling are classical tools aiming to compare two random processes where one has a weaker dependence structure. We give a new proof for the complete decoupling inequality, which provides a lower bound…

We prove that if $f:I\subset \Bbb R\to \Bbb R$ is of bounded variation, then the noncentered maximal function $Mf$ is absolutely continuous, and its derivative satisfies the sharp inequality $\|DMf\|_1\le |Df|(I)$. This allows us obtain,…

The problem of convergence in law of normed sums of exchangeable random variables is examined. First, the problem is studied w.r.t. arrays of exchangeable random variables, and the special role played by mixtures of products of stable laws…

We give the distribution of $M_n$, the maximum of a sequence of $n$ observations from a moving average of order 1. Solutions are first given in terms of repeated integrals and then for the case where the underlying independent random…

An application of Levy's continuity theorem and Hankel transform allow us to establish a law limit theorem for the sequence $V_n=f(U)\sin(n U)$, where $U$ is uniformly distributed in $(0,1)$ and $f$ a given function. Further, we investigate…

For a bivariate random vector (X,Y), symmetry conditions are presented that yield stochastic orderings among |X|, |Y|, |max(X,Y)|, and | min(X, Y)|. Partial extensions of these results for multivariate random vectors (X1,...,Xn) are also…

In this paper, we establish some general forms of the law of the iterated logarithm for independent random variables in a sub-linear expectation space, where the random variables are not necessarily identically distributed. Exponential…

A measure of dependence is said to be equitable if it gives similar scores to equally noisy relationships of different types. Equitability is important in data exploration when the goal is to identify a relatively small set of strongest…

We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…

We develop and generalize the theory of extreme value for non-stationary stochastic processes, mostly by weakening the uniform mixing condition that was previously used in this setting. We apply our results to non-autonomous dynamical…