English

The Pareto Record Frontier

Probability 2019-01-28 v2 Data Structures and Algorithms

Abstract

For iid dd-dimensional observations X(1),X(2),X^{(1)}, X^{(2)}, \ldots with independent Exponential(1)(1) coordinates, consider the boundary (relative to the closed positive orthant), or "frontier", FnF_n of the closed Pareto record-setting (RS) region \mbox{RS}_n := \{0 \leq x \in {\mathbb R}^d: x \not\prec X^{(i)}\ \mbox{for all $1 \leq i \leq n$}\} at time nn, where 0x0 \leq x means that 0xj0 \leq x_j for 1jd1 \leq j \leq d and xyx \prec y means that xj<yjx_j < y_j for 1jd1 \leq j \leq d. With x+:=j=1dxjx_+ := \sum_{j = 1}^d x_j, let Fn:=min{x+:xFn}\mboxandFn+:=max{x+:xFn}, F_n^- := \min\{x_+: x \in F_n\} \quad \mbox{and} \quad F_n^+ := \max\{x_+: x \in F_n\}, and define the width of FnF_n as Wn:=Fn+Fn. W_n := F_n^+ - F_n^-. We describe typical and almost sure behavior of the processes F+F^+, FF^-, and WW. In particular, we show that Fn+lnnFnF^+_n \sim \ln n \sim F^-_n almost surely and that Wn/lnlnnW_n / \ln \ln n converges in probability to d1d - 1; and for d2d \geq 2 we show that, almost surely, the set of limit points of the sequence Wn/lnlnnW_n / \ln \ln n is the interval [d1,d][d - 1, d]. We also obtain modifications of our results that are important in connection with efficient simulation of Pareto records. Let TmT_m denote the time that the mmth record is set. We show that FTm+(d!m)1/dFTmF^+_{T_m} \sim (d! m)^{1/d} \sim F^-_{T_m} almost surely and that WTm/lnmW_{T_m} / \ln m converges in probability to 1d11 - d^{-1}; and for d2d \geq 2 we show that, almost surely, the sequence WTm/lnmW_{T_m} / \ln m has lim inf\liminf equal to 1d11 - d^{-1} and lim sup\limsup equal to 11.

Keywords

Cite

@article{arxiv.1901.05620,
  title  = {The Pareto Record Frontier},
  author = {James Allen Fill and Daniel Q. Naiman},
  journal= {arXiv preprint arXiv:1901.05620},
  year   = {2019}
}

Comments

3 figures; small change to abstract, and proof of Theorem 1.4 corrected

R2 v1 2026-06-23T07:14:12.858Z