English
Related papers

Related papers: The mixing advantage is less than 2

200 papers

We establish a lower bound on the entropy of weighted sums of (possibly dependent) random variables $(X_1, X_2, \dots, X_n)$ possessing a symmetric joint distribution. Our lower bound is in terms of the joint entropy of $(X_1, X_2, \dots,…

Information Theory · Computer Science 2018-01-16 Jing Hao , Varun Jog

A well-known discovery of Feige's is the following: Let $X_1, \ldots, X_n$ be nonnegative independent random variables, with $\mathbb{E}[X_i] \leq 1 \;\forall i$, and let $X = \sum_{i=1}^n X_i$. Then for any $n$, \[\Pr[X < \mathbb{E}[X] +…

Probability · Mathematics 2018-04-06 Brian Garnett

We investigate the accuracy of the two most common estimators for the maximum expected value of a general set of random variables: a generalization of the maximum sample average, and cross validation. No unbiased estimator exists and we…

Machine Learning · Statistics 2013-03-04 Hado van Hasselt

Let $X_1, X_2,\ldots, X_n$ be $n$ independent and identically distributed random variables, here $n \geq 2.$ Let $X_{(1)}, X_{(2)}, \ldots, X_{(n)}$ be the order statistics of $X_1, X_2,..., X_n.$ In this note we proved that: (I) If $X_1,…

Statistics Theory · Mathematics 2015-03-04 Robert W. Chen

In this paper we study the problem of estimating the alpha-, beta- and phi-mixing coefficients between two random variables, that can either assume values in a finite set or the set of real numbers. In either case, explicit closed-form…

Computation · Statistics 2013-07-04 Mehmet Eren Ahsen , Mathukumalli Vidyasagar

Fix a positive integer $N$. Select an additive composition $\xi$ of $N$ uniformly out of $2^{N-1}$ possibilities. The interplay between the number of parts in $\xi$ and the maximum part in $\xi$ is our focus. It is not surprising that…

Combinatorics · Mathematics 2020-10-21 Steven Finch

We prove the following exponential inequality: Let $n\geq 1$ and let $X_1,...,X_n$ be $n$ independent identically distributed symmetric real-valued random variables. For any $x,y>0$, we have \[\mathbb{P}\big({X_1+...+X_n}\geq x,\,…

Probability · Mathematics 2014-10-21 Raphaël Cerf , Matthias Gorny

We find a nontrivial upper bound on the average value of the function M(n) which associates to every positive integer n the minimal Hamming weight of a multiple of n. Some new results about the equation M(n)=M(n') are given.

Number Theory · Mathematics 2024-12-17 Eugen J. Ionascu , Florian Luca , Thomas Merino

This article is a survey of results concerning an inequality, which may be seen as a versatile tool to solve problems in the domain of Applied Probability. The inequality, which we call BRS-inequality, gives a convenient upper bound for the…

Probability · Mathematics 2020-07-13 F. Thomas Bruss

Known Bernstein-type upper bounds on the tail probabilities for sums of independent zero-mean sub-exponential random variables are improved in several ways at once. The new upper bounds have a certain optimality property.

Probability · Mathematics 2022-08-15 Iosif Pinelis

Let $\Omega$ be a countable infinite product $\Omega^\N$ of copies of the same probability space $\Omega_1$, and let ${\Xi_n}$ be the sequence of the coordinate projection functions from $\Omega$ to $\Omega_1$. Let $\Psi$ be a possibly…

Probability · Mathematics 2014-08-22 Alexander R. Pruss

The data for many classification problems, such as pattern and speech recognition, follow mixture distributions. To quantify the optimum performance for classification tasks, the Shannon mutual information is a natural information-theoretic…

Signal Processing · Electrical Eng. & Systems 2022-06-22 Yijun Ding , Amit Ashok

We prove upper bounds on the rate, called "mixing rate", at which the von Neumann entropy of the expected density operator of a given ensemble of states changes under non-local unitary evolution. For an ensemble consisting of two states,…

Quantum Physics · Physics 2013-11-06 Elliott H. Lieb , Anna Vershynina

We study fair resource allocation when the resources contain a mixture of divisible and indivisible goods, focusing on the well-studied fairness notion of maximin share fairness (MMS). With only indivisible goods, a full MMS allocation may…

Computer Science and Game Theory · Computer Science 2021-07-02 Xiaohui Bei , Shengxin Liu , Xinhang Lu , Hongao Wang

Given a sequence \xi_1, \xi_2,... of X-valued, exchangeable random elements, let q(\xi^(n)) and p_m(\xi^(n)) stand for posterior and predictive distribution, respectively, given \xi^(n) = (\xi_1,..., \xi_n). We provide an upper bound for…

Statistics Theory · Mathematics 2016-02-04 Donato Michele Cifarelli , Emanuele Dolera , Eugenio Regazzini

Let $x_{i,j}$, $1 \le i \le m$, $1 \le j \le n_i$, be observations from a doubly-indexed sequence $\{X_{i,j}\}$ of independent random variables (all of them discrete, or all of them absolutely continuous). Suppose that each $X_{i,j}$ has…

Statistics Theory · Mathematics 2011-07-07 Laurence Thomas Ramsey

A tight upper bound is given on the distribution of the maximum of a supermartingale. Specifically, it is shown that if $Y$ is a semimartingale with initial value zero and quadratic variation process $[Y,Y]$ such that $Y + [Y,Y]$ is a…

Probability · Mathematics 2014-08-15 Bruce Hajek

The mutual information between two jointly distributed random variables $X$ and $Y$ is a functional of the joint distribution $P_{XY},$ which is sometimes difficult to handle or estimate. A coarser description of the statistical behavior of…

Information Theory · Computer Science 2016-11-17 Yanjun Han , Or Ordentlich , Ofer Shayevitz

We consider the revenue maximization problem with sharp multi-demand, in which $m$ indivisible items have to be sold to $n$ potential buyers. Each buyer $i$ is interested in getting exactly $d_i$ items, and each item $j$ gives a benefit…

Computer Science and Game Theory · Computer Science 2013-12-16 Vittorio Bilò , Michele Flammini , Gianpiero Monaco

We propose some new results on the comparison of the minimum or maximum order statistic from a random number of non-identical random variables. Under the non-identical set-up, with certain conditions, we prove that random minimum (maximum)…

Statistics Theory · Mathematics 2024-03-08 Amarjit Kundu , Shovan Chowdhury , Bidhan Modok