Let $X_1,\ldots,X_n$ be i.i.d random variables taking values in $\mathbb{R}$. Suppose that $n$ is odd and the $X_i$ follow a continuous distribution. I am interested in the probability that the mean of these random variables is larger than their median, i.e. $$ \mathbb{P}\left[ \frac{1}{n}\sum_{i=1}^nX_i>X_{\left(\frac{n+1}{2}\right)} \right] $$ My guess is that in general, there is no nice formula for this probability. But I wonder: Are there (easy or known) special cases, where there is a (nice) formula?
2026-03-27 19:31:54.1774639914
Probability that mean is larger than median
249 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in PROBABILITY
- How to prove $\lim_{n \rightarrow\infty} e^{-n}\sum_{k=0}^{n}\frac{n^k}{k!} = \frac{1}{2}$?
- Is this a commonly known paradox?
- What's $P(A_1\cap A_2\cap A_3\cap A_4) $?
- Prove or disprove the following inequality
- Another application of the Central Limit Theorem
- Given is $2$ dimensional random variable $(X,Y)$ with table. Determine the correlation between $X$ and $Y$
- A random point $(a,b)$ is uniformly distributed in a unit square $K=[(u,v):0<u<1,0<v<1]$
- proving Kochen-Stone lemma...
- Solution Check. (Probability)
- Interpreting stationary distribution $P_{\infty}(X,V)$ of a random process
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in STATISTICS
- Given is $2$ dimensional random variable $(X,Y)$ with table. Determine the correlation between $X$ and $Y$
- Statistics based on empirical distribution
- Given $U,V \sim R(0,1)$. Determine covariance between $X = UV$ and $V$
- Fisher information of sufficient statistic
- Solving Equation with Euler's Number
- derive the expectation of exponential function $e^{-\left\Vert \mathbf{x} - V\mathbf{x}+\mathbf{a}\right\Vert^2}$ or its upper bound
- Determine the marginal distributions of $(T_1, T_2)$
- KL divergence between two multivariate Bernoulli distribution
- Given random variables $(T_1,T_2)$. Show that $T_1$ and $T_2$ are independent and exponentially distributed if..
- Probability of tossing marbles,covariance
Related Questions in ORDER-STATISTICS
- What does it mean to say that one random variable is "greater" than another?
- Fermi/Bose gases
- Calculating integral using pdf's $\int_0^1x^r(1-x)^{n-r}dx$
- Expectation of sample median, general uniform case
- Distribution of the maximum of independent RV
- Order statistics, unclear derivation of the distribution function, uniform df
- find joint distribution $\min (X,Y)$ and $W$, where W is a discrete distribution
- Prove that regression beta of order statistics converges to 1?
- Probability based on position
- Understanding functional equation for order statistics
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The probability can be calculated whenever the distribution of $X_1,\dots,X_n$ is absolutely continuous (we have a PDF).
Note that we can rewrite the probability as $$ \mathbb{P}\left[\frac{1}{n}\sum_{i=1}^nX_i>X_{\left(\frac{n+1}{2}\right)}\right]= \mathbb{P}\left[Z_n:=\sum_{i=1}^nX_{(i)}-nX_{\left(\frac{n+1}{2}\right)}>0\right]. $$ $Z_n$ is a linear combination of order statistics, where the weights differ for even and odd $n$ considering the definition of $X_{\left(\frac{n+1}{2}\right)}$. For absolutely continuous distribution, the joint distribution of all order statics is explicitly known, so the distribution of $Z_n$ can be determined. The probability can be computed by integration.
Symmetric distributions
For the uniform distribution on [0,1], a closed-form formula for the CDF of an arbitrary linear combination of ordered statistics is provided in 1. For odd $n$, we have $$-Z_n=-X_{(1)}-X_{(2)} \dots +(n-1) X_{(\frac{n+1}{2})}+\dots-X_{(n)}, $$ and using (2.2) in 1, the probability is
$$\mathbb{P}\left[-Z_n\le 0\right]=1-\sum_{j=1 }^{\frac{n+1}{2}} \frac{c_j^{n-1}}{ \prod_{i \neq j}(c_j-c_i)) } $$
with
$$ c_j= j-1 \text{ for } j\in \left\{1, \dots, \frac{n+1}{2} \right\}$$
$$ c_j= j-(n+1)\text{ for }j\in \left\{\frac{n+1}{2} +1, \dots, n\right\}.$$
I computed the above for $n=3,5 \text{ and } 7$ and realized that it was always 1/2. For the uniform distribution I can prove that $-Z_n$ has a symmetric distribution. In 1, a representation of $-Z_n$ is given by
$$-Z_n \sim c_1X_1+c_2X_2+\dots+c_nX_n$$
with $c_1,\dots,c_n$ defined above. As all $X_1,\dots,X_n$ are independent and have symmetric distributions, then $-Z_n$ has a symmetric distribution. Furthermore, considering $\sum_{j=1}^{n}c_j=0$, the mean of $-Z_n$ is zero, and hence, the probability is always $\frac{1}{2}$.
I am not sure whether this can be generalized to all symmetric densities or not. Indeed, we can simply see that the sample mean and the sample median (for odd $n$) both have symmetric distributions, but it does not imply that their difference $-Z_n$ also has a symmetric distribution because they are dependent.
For any symmetric distributions, by the method presented by @Henry in a comment above, without using the distributional symmetry of $-Z_n$, it can be shown that the probability is $\frac{1}{2}$.
Large samples
Moreover, under some conditions, $Z_n$ converges to a normal distribution. In fact, for a density with finite variance, the asymptotic joint distribution of sample mean and a sample quantile follows a bivariate normal distribution (see 2 for more details).
Hence, as $n \rightarrow \infty$ the probability converges to
$$ \Phi \left(\frac{\mu-m}{\sqrt{\frac{1}{n} \left(\sigma^2+\frac{1}{4f(m)^2}-\frac{\mathbb{E} \left(|X-m| \right)}{f(m)} \right)}} \right) $$
where $\Phi$ is the CDF of standard normal and where $f$, $\mu$, $m$, and $\sigma^2$ are the density, mean, median, and variance of the distribution of $X$, respectively.