English
Related papers

Related papers: Mean and Minimum of Independent Random Variables

200 papers

We show that a lower bound for covariance of $\min(X_1,X_2)$ and $\max(X_1,X_2)$ is $\cov{X_1}{X_2}$ and an upper bound for variance of \\ $\min(X_2,\max(X,X_1))$ is $\var{X} + \var{X_1} +\var{X_2}$ generalizing previous results. We also…

Probability · Mathematics 2007-05-23 N. Hemachandra , V. Cheriyan

In this paper, we investigate the distributions of random couples $(X,Y)$ with $X$ real-valued such that any non-negative integrable random variable $f(X)$ can be represented as a conditional expectation, $f(X)=\mathbb{E}[g(Y)|X]$, for some…

Probability · Mathematics 2025-08-08 Julien Guyon , Thibault Jeannin , Benjamin Jourdain

Corresponding to $n$ independent non-negative random variables $X_1,...,X_n$, are values $M_1,...,M_n$, where each $M_i$ is the expected value of the maximum of $n$ independent copies of $X_i$. We obtain an upper bound to the expected value…

Probability · Mathematics 2008-05-06 Kais Hamza , Peter Jagers , Aidan Sudbury , Daniel Tokarev

Given an integer $m\geq2$, the Hardy--Littlewood inequality (for real scalars) says that for all $2m\leq p\leq\infty$, there exists a constant $C_{m,p}% ^{\mathbb{R}}\geq1$ such that, for all continuous $m$--linear forms…

Functional Analysis · Mathematics 2015-10-06 Gustavo Araujo , Daniel Pellegrino

We correct claims about lower bounds on mutual information (MI) between real-valued random variables made in A. Kraskov {\it et al.}, Phys. Rev. E {\bf 69}, 066138 (2004). We show that non-trivial lower bounds on MI in terms of linear…

Data Analysis, Statistics and Probability · Physics 2013-05-29 David V. Foster , Peter Grassberger

We introduce a test for the conditional independence of random variables $X$ and $Y$ given a random variable $Z$, specifically by sampling from the joint distribution $(X,Y,Z)$, binning the support of the distribution of $Z$, and conducting…

Statistics Theory · Mathematics 2024-02-05 Andrew Warren

In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…

Discrete Mathematics · Computer Science 2010-07-29 Zan Pan

Given two discrete random variables $X$ and $Y,$ with probability distributions ${\bf p}=(p_1, \ldots , p_n)$ and ${\bf q}=(q_1, \ldots , q_m)$, respectively, denote by ${\cal C}({\bf p}, {\bf q})$ the set of all couplings of ${\bf p}$ and…

Information Theory · Computer Science 2019-01-24 Ferdinando Cicalese , Luisa Gargano , Ugo Vaccaro

Here is one of the results obtained in this paper: Let $X, Y$ be two convex sets each in a real vector space, let $J:X\times Y\to {\bf R}$ be convex and without global minima in $X$ and concave in $Y$, and let $\Phi:X\to {\bf R}$ be…

Optimization and Control · Mathematics 2019-09-19 Biagio Ricceri

A fundamental task in statistical learning is quantifying the joint dependence or association between two continuous random variables. We introduce a novel, fully non-parametric measure that assesses the degree of association between…

We present an algorithm that takes a discrete random variable $X$ and a number $m$ and computes a random variable whose support (set of possible outcomes) is of size at most $m$ and whose Kolmogorov distance from $X$ is minimal. In addition…

Data Structures and Algorithms · Computer Science 2018-05-22 Liat Cohen , Dror Fried , Gera Weiss

Let $L_N = L_{MBM}(X_1,..., X_N; Y_1,..., Y_N)$ be the minimum length of a bipartite matching between two sets of points in $\mathbf{R}^d$, where $X_1,..., X_N,...$ and $Y_1,..., Y_N,...$ are random points independently and uniformly…

Combinatorics · Mathematics 2007-05-23 J. H. Boutet de Monvel , O. C. Martin

The Ingleton inequality is a classical linear information inequality that holds for representable matroids but fails to be universally valid for entropic vectors. Understanding the extent to which this inequality can be violated has been a…

Information Theory · Computer Science 2026-05-19 Rostislav Matveev , Andrei Romashchenko

The Littlewood Conjecture states that liminf_{q\to \infty} q . ||qx|| . ||qy|| = 0 for all pairs (x,y) of real numbers. We show that with the additional factor of log q . loglog q the statement is false. Indeed, our main result implies that…

Number Theory · Mathematics 2014-01-14 Dzmitry Badziahin

Sums of of 1-dependent integer-valued random variables are approximated by compound Poisson, negative binomial and Binomial distributions and signed compound Poisson measures. Estimates are obtained for total variation and local metrics.…

Statistics Theory · Mathematics 2015-11-05 V. Čekanavičius , P. Vellaisamy

In this paper, we introduce the notion of a ``pairwise independent correlation gap'' for set functions with random elements. The pairwise independent correlation gap is defined as the ratio of the maximum expected value of a set function…

Optimization and Control · Mathematics 2025-02-27 Arjun Ramachandra , Karthik Natarajan

In this paper, we mainly study the relation between regularity, independence and mean sensitivity for minimal systems. In the first part, we show that if a minimal system is incontractible, or local Bronstein with an invariant Borel…

Dynamical Systems · Mathematics 2025-04-17 Chunlin Liu , Leiye Xu , Shuhao Zhang

In this paper, we prove a conditional limit theorem for independent not necessarily identically distributed random variables. Namely, we obtain the asymptotic distribution of a large number of them given the sum.

Statistics Theory · Mathematics 2020-11-12 Dimbihery Rabenoro

Let $\varepsilon_1,\ldots,\varepsilon_n$ be independent identically distributed Rademacher random variables, that is $\mathbb{P}\{\varepsilon_i=\pm1\}=1/2$. Let $S_n=a_1\varepsilon_1+\cdots+a_n\varepsilon_n$, where…

Probability · Mathematics 2015-06-02 Vidmantas Kastytis Bentkus , Dainius Dzindzalieta

Consider the uniform random graph $G(n,M)$ with $n$ vertices and $M$ edges. Erd\H{o}s and R\'enyi (1960) conjectured that the limit $$ \lim_{n \to \infty} \Pr\{G(n,\textstyle{n\over 2}) is planar}} $$ exists and is a constant strictly…

Combinatorics · Mathematics 2012-05-01 Marc Noy , Vlady Ravelomanana , Juanjo Rué