Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Sharpened localization of the trailing point of the Pareto record frontier (2402.17221v1)

Published 27 Feb 2024 in math.PR and cs.DS

Abstract: For $d\ge2$ and iid $d$-dimensional observations $X{(1)},X{(2)},\dots$ with independent Exponential$(1)$ coordinates, we revisit the study by Fill and Naiman (Electron. J. Probab., 2020) of the boundary (relative to the closed positive orthant), or "frontier", $F_n$ of the closed Pareto record-setting (RS) region [ \mbox{RS}n:={0\le x\in{\mathbb R}d:x\not\prec X{(i)}\mbox{\ for all $1\le i\le n$}} ] at time $n$, where $0\le x$ means that $0\le x_j$ for $1\le j\le d$ and $x\prec y$ means that $x_j<y_j$ for $1\le j\le d$. With $x+:=\sum_{j=1}d x_j$, let [ F_n-:=\min{x_+:x\in F_n}\quad\mbox{and}\quad F_n+:=\max{x_+:x\in F_n}. ] Almost surely, there are for each $n$ unique vectors $\lambda_n\in F_n$ and $\tau_n\in F_n$ such that $F_n+=(\lambda_n)_+$ and $F_n-=(\tau_n)_+$; we refer to $\lambda_n$ and $\tau_n$ as the leading and trailing points, respectively, of the frontier. Fill and Naiman provided rather sharp information about the typical and almost sure behavior of $F+$, but somewhat crude information about $F-$, namely, that for any $\varepsilon >0$ and $c_n\to\infty$ we have [ {\mathbb P}(F_n- -\ln n\in (-(2+\varepsilon)\ln\ln\ln n,c_n))\to 1 ] (describing typical behavior) and almost surely [ \limsup \frac{F_n- - \ln n}{\ln \ln n} \le 0 \quad \mbox{and} \quad \liminf \frac{F_n- - \ln n}{\ln \ln \ln n} \in [-2, -1]. ] In this paper we use the theory of generators (minima of $F_n$) together with the first- and second-moment methods to improve considerably the trailing-point location results to [ F_n- - (\ln n - \ln \ln \ln n) \overset{\mathrm{P}}{\longrightarrow} - \ln(d - 1) ] (describing typical behavior) and, for $d \ge 3$, almost surely \begin{align*} &\limsup [F_n- - (\ln n - \ln \ln \ln n)] \leq -\ln(d - 2) + \ln 2 \ \mbox{and }&\liminf [F_n- - (\ln n - \ln \ln \ln n)] \ge - \ln d - \ln 2. \end{align*}

Definition Search Book Streamline Icon: https://streamlinehq.com
References (10)
  1. Records. Wiley Series in Probability and Statistics: Probability and Statistics. John Wiley & Sons, Inc., New York, 1998. A Wiley-Interscience Publication.
  2. Maxima in hypercubes. Random Structures Algorithms, 27(3):290–309, 2005.
  3. Limit theorems for the number of maxima in random samples from planar regions. Electron. J. Probab., 6:no. 3, 41, 2001.
  4. Poisson Approximation. Oxford studies in Probability. Oxford University Press, New York, 1992.
  5. Generating Pareto records, 2019. arXiv:1901.05621.
  6. The Pareto record frontier. Electron. J. Probab., 25:Paper No. 92, 24, 2020.
  7. J. Kiefer. Iterated logarithm analogues for sample quantiles when pn↓0↓subscript𝑝𝑛0p_{n}\downarrow 0italic_p start_POSTSUBSCRIPT italic_n end_POSTSUBSCRIPT ↓ 0. Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability (Univ. California, Berkeley, Calif., 1970/1971), Vol. I: Theory of statistics, pages 227–244, 1972.
  8. Formal power series of logarithmic type. Adv. Math., 75(1):1–118, 1989.
  9. Steven Roman. The logarithmic binomial formula. Amer. Math. Monthly, 99(7):641–648, 1992.
  10. J. Sesma. The Roman harmonic numbers revisited. J. Number Theory, 180:544–565, 2017.
Citations (2)

Summary

We haven't generated a summary for this paper yet.