Let $X_{1:n}\leqslant X_{2:n}\leqslant \dots \leqslant X_{n:n}$ be the $n$ (independent) order statistics of a known distribution with CDF $F(x)$. Consider the expectation of the $k$-th largest order statistics, i.e., $\mathbb{E}(X_{n-k+1:n})$, is it always concave in $n$? Formally, is the following relationship always true? $$\mathbb{E}(X_{(n+1)-k+1:(n+1)})-\mathbb{E}(X_{n-k+1:n})>\mathbb{E}(X_{(n+2)-k+1:(n+2)})-\mathbb{E}(X_{(n+1)-k+1:(n+1)})$$ where $n$ is finite. Thanks!
2026-03-29 16:55:57.1774803357
Are expected order statistics always concave in sample size?
350 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 EXPECTATION
- Prove or disprove the following inequality
- Show that $\mathbb{E}[Xg(Y)|Y] = g(Y) \mathbb{E}[X|Y]$
- Need to find Conditions to get a (sub-)martingale
- Expected Value of drawing 10 tickets
- Martingale conditional expectation
- Variance of the integral of a stochastic process multiplied by a weighting function
- Sum of two martingales
- Discrete martingale stopping time
- Finding statistical data for repeated surveys in a population
- A universal bound on expectation $E[X^ke^{-X}]$
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?
After some literature search, I realized that this claim is true for the largest expected order statistics. The following illustration uses results from David (1997). To be consistent, I use their notation. Denote $\mu_{r:n}$ as the $r$-th smallest expected order statistics out of $n$ order statistics (or equivalently, the $(n-r+1)$-th largest one), where $r\in\{1,2,...,n-1\}$, David (1997) shows that $$\mu_{r+1:n}-\mu_{r:n-1}=\binom{n-1}{r}\int_{-\infty}^{+\infty}F^r(x)[1-F(x)]^{n-r}dx$$
Let $r=n-1$, i.e., consider the largest expected order statistics, then the above relationship becomes $$\mu_{n:n}-\mu_{n-1:n-1}=\int_{-\infty}^{+\infty}F^{n-1}(x)[1-F(x)]dx$$
Similarly, increase both $r$ and $n$ by 1, we get $$\mu_{n+1:n+1}-\mu_{n:n}=\int_{-\infty}^{+\infty}F^n(x)[1-F(x)]dx$$
Because $F(x)$, as the CDF of a distribution, is always between 0 and 1, we get $$\mu_{n+1:n+1}-\mu_{n:n}<\mu_{n:n}-\mu_{n-1:n-1}$$ indicating concavity.
However, this argument does not seem to easily generalize to other expected order statistics, because of the binomial coefficients. Or maybe I'm missing something obvious. Hope this can help people obtain a more generalized result.
(Update 09/22/2017) This claim is not always true for expected order statistics that are not the largest. Here is an (numeric) counter-example:
Consider a Weibull distribution of shape parameter 0.4 and scale parameter 1. The second largest expected order statistics out of samples of 3, 4, and 5 (i.e., $n=3,4,5$) are 1.336, 2.131, and 2.931 respectively, which is convex with respect to $n$. Even more evidently, the third largest expected order statistics are 0.213, 0.541, 0.931 respectively, also convex in $n$. These numbers were calculated based on results in Lieblein (1955).
In summary, the largest expected order statistics always increase concavely with respect to sample size, irrespective of distribution. However, the same cannot be said for other expected order statistics.