In probability theory and statistics, the Rademacher distribution (which is named after Hans Rademacher) is a discrete probability distribution where a random variate X has a 50% chance of being +1 and a 50% chance of being -1. A series (that is, a sum) of Rademacher distributed variables can be regarded as a simple symmetrical random walk where the step size is 1. The probability mass function of this distribution is In terms of the Dirac delta function, as There are various results in probability theory around analyzing the sum of i.i.d. Rademacher variables, including concentration inequalities such as Bernstein inequalities as well as anti-concentration inequalities like Tomaszewski's conjecture. Let {xi} be a set of random variables with a Rademacher distribution. Let {ai} be a sequence of real numbers. Then where ||a||2 is the Euclidean norm of the sequence {ai}, t > 0 is a real number and Pr(Z) is the probability of event Z. Let Y = Σ xiai and let Y be an almost surely convergent series in a Banach space. The for t > 0 and s ≥ 1 we have for some constant c. Let p be a positive real number. Then the Khintchine inequality says that where c1 and c2 are constants dependent only on p. For p ≥ 1, In 1986, Bogusław Tomaszewski proposed a question about the distribution of the sum of independent Rademacher variables. A series of works on this question culminated into a proof in 2020 by Nathan Keller and Ohad Klein of the following conjecture. Conjecture. Let , where and the 's are independent Rademacher variables. Then For example, when , one gets the following bound, first shown by Van Zuijlen. The bound is sharp and better than that which can be derived from the normal distribution (approximately Pr > 0.31). The Rademacher distribution has been used in bootstrapping. The Rademacher distribution can be used to show that normally distributed and uncorrelated does not imply independent.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.