Pith. sign in

REVIEW 1 cited by

Inequalities and bounds for expected order statistics from transform-ordered families

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.03802 v2 pith:DNQ2U2YT submitted 2024-03-06 stat.ME

classification stat.ME
keywords orderdistributionfamiliesorderstransformboundsexpectedmethod
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We introduce a comprehensive method for establishing stochastic orders among order statistics in the i.i.d. case. This approach relies on the assumption that the underlying distribution is linked to a reference distribution through a transform order. Notably, this method exhibits broad applicability, particularly since several well-known nonparametric distribution families can be defined using relevant transform orders, including the convex and the star transform orders. In the context of convex-ordered families, we demonstrate that applying Jensen's inequality enables the derivation of bounds for the probability that a random variable exceeds the expected value of its corresponding order statistic.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Convex combinations of random variables stochastically dominate the parent for a new class of heavy-tailed distributions

    math.PR 2024-11 conditional novelty 6.0 of 10

    Subadditivity of the distribution of 1/X is sufficient for X to be stochastically dominated by any convex combination of its independent copies.

Pith tools