Sharpened localization of the trailing point of the Pareto record frontier

Abstract

For d2 and iid d-dimensional observations X(1),X(2),… 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", Fn of the closed Pareto record-setting (RS) region \[ RSn:=\0 x∈ Rd:x X(i)\ for all 1 i n\ \] at time n, where 0 x means that 0 xj for 1 j d and x y means that xj<yj for 1 j d. With x+:=Σj=1d xj, let \[ Fn-:=\x+:x∈ Fn\and Fn+:=\x+:x∈ Fn\. \] Almost surely, there are for each n unique vectors λn∈ Fn and τn∈ Fn such that Fn+=(λn)+ and Fn-=(τn)+; we refer to λn and τ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 >0 and cn∞ we have \[ P(Fn- - n∈ (-(2+) n,cn)) 1 \] (describing typical behavior) and almost surely \[ Fn- - n n 0 and Fn- - n n ∈ [-2, -1]. \] In this paper we use the theory of generators (minima of Fn) together with the first- and second-moment methods to improve considerably the trailing-point location results to \[ Fn- - ( n - n) P - (d - 1) \] (describing typical behavior) and, for d 3, almost surely align* & [Fn- - ( n - n)] ≤ -(d - 2) + 2 \\ and & [Fn- - ( n - n)] - d - 2. align*

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…