Symmetrization of Binary Random Variables
نویسندگان
چکیده
A random variable Y is called an independent symmetrizer of a given random variable X if (a) it is independent of X and (b) the distribution of X + Y is symmetric about 0. In cases where the distribution of X is symmetric about its mean, it is easy to see that the constant random variable Y = −EX is a minimum-variance independent symmetrizer. Taking Y to have the same distribution as −X clearly produces a symmetric sum but it may not be of minimum variance. We say that a random variable X is symmetry resistant if the variance of any symmetrizer, Y , is never smaller than the variance of X . Let X be a binary random variable: P{X = a} = p and P{X = b} = q where a 6= b, 0 < p < 1, and q = 1 − p. We prove that such a binary random variable is symmetry resistant if (and only if) p 6= 1/2. Note that the minimum variance as a function of p is discontinuous at p = 1/2. Dropping the independence assumption, we show that the minimum-variance reduces to pq − min(p,q)/2, which is a continuous function of p.
منابع مشابه
Symmetrization of Binary Random Variables 2
A random variable Y is called an independent symmetrizer of a given random variable X if (a) it is independent of X and (b) the distribution of X + Y is symmetric about 0. In cases where the distribution of X is symmetric about its mean, it is easy to see that the constant random variable Y = EX is a minimum-variance independent symmetrizer. Taking Y to have the same distribution as X clearly p...
متن کاملExtending Robustness and Randomization from Consensus to Symmetrization Algorithms
This work interprets and generalizes consensus-type algorithms as switching dynamics leading to symmetrization of some vector variables with respect to the actions of a finite group. We show how the symmetrization framework we develop covers applications as diverse as consensus on probability distributions (either classical or quantum), uniform random state generation, and open-loop disturbance...
متن کاملExtending robustness & randomization from Consensus to Symmetrization Algorithms
This work interprets and generalizes consensus-type algorithms as switching dynamics leading to symmetrization of some vector variables with respect to the actions of a finite group. We show how the symmetrization framework we develop covers applications as diverse as consensus on probability distributions (either classical or quantum), uniform random state generation, and open-loop disturbance...
متن کاملThe Symmetric Operation in a Free Pre-lie Algebra Is Magmatic
A pre-Lie product is a binary operation whose associator is symmetric in the last two variables. As a consequence its antisymmetrization is a Lie bracket. In this paper we study the symmetrization of the pre-Lie product. We show that it does not satisfy any other universal relation than commutativity. This means that the map from the free commutative-magmatic algebra to the free pre-Lie algebra...
متن کاملImproved Vapnik Cervonenkis Bounds
We give a new proof of VC bounds where we avoid the use of symmetrization and use a shadow sample of arbitrary size. We also improve on the variance term. This results in better constants, as shown on numerical examples. Moreover our bounds still hold for non identically distributed independent random variables. 2000 Mathematics Subject Classification: 62H30, 68T05, 62B10.
متن کامل