An Equal-Probability Partition of the Sample Space: A Non-parametric Inference from Finite Samples

Urban Eriksson
7/29/2025
stat.MLcs.LGstat.ME

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

This paper investigates what can be inferred about an arbitrary continuous probability distribution from a finite sample of $N$ observations drawn from it. The central finding is that the $N$ sorted sample points partition the real line into $N+1$ segments, each carrying an expected probability mass of exactly $1/(N+1)$. This non-parametric result, which follows from fundamental properties of order statistics, holds regardless of the underlying distribution's shape. This equal-probability partition yields a discrete entropy of $\log_2(N+1)$ bits, which quantifies the information gained from the sample and contrasts with Shannon's results for continuous variables. I compare this partition-based framework to the conventional ECDF and discuss its implications for robust non-parametric inference, particularly in density and tail estimation.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{eriksson2025equalprobability,
  title  = {An Equal-Probability Partition of the Sample Space: A Non-parametric Inference from Finite Samples},
  author = {Urban Eriksson},
  year   = {2025},
  eprint = {2507.21712},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.21712v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.21712.svg)](https://codeofpaper.com/paper/2507.21712)

Discussion