arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.17221math.PRcs.DS
收藏

Pareto记录边界的尾点的锐化定位

Sharpened localization of the trailing point of the Pareto record frontier

James Allen Fill, Daniel Naiman, Ao Sun

AI总结:

本文针对多维Pareto记录前沿的尾点定位问题,利用生成元理论及一阶、二阶矩方法,将尾点相对 $\ln n-\ln\ln\ln n$ 的典型波动和几乎必然上下界显著改进为依赖维数 $d$ 的精确常数。

摘要:

对于 $d\ge2$ 以及独立同分布的 $d$ 维观测 $X^{(1)},X^{(2)},\dots$(各坐标独立且服从 Exponential$(1)$ 分布),我们重新研究 Fill 和 Naiman(Electron. J. Probab., 2020)关于闭 Pareto 记录集(RS)区域 \\[ \mbox{RS}_n:=\{0\le x\in{\mathbb R}^d:x\not\prec X^{(i)}\mbox{\\ 对所有 $1\le i\le n$}\} \\] 在时刻 $n$ 的边界(相对于闭正象限),即“前沿” $F_n$ 的研究,其中 $0\le x$ 表示对 $1\le j\le d$ 有 $0\le x_j$,$x\prec y$ 表示对 $1\le j\le d$ 有 $x_j<y_j$。令 $x_+:=\sum_{j=1}^d x_j$,定义 \\[ F_n^-:=\min\{x_+:x\in F_n\}\quad\mbox{和}\quad F_n^+:=\max\{x_+:x\in F_n\}. \\] 几乎必然地,对每个 $n$ 存在唯一的向量 $λ_n\in F_n$ 和 $τ_n\in F_n$,使得 $F_n^+=(λ_n)_+$ 且 $F_n^-=(τ_n)_+$;我们分别称 $λ_n$ 和 $τ_n$ 为前沿的领先点和尾点。Fill 和 Naiman 对 $F^+$ 的典型行为和几乎必然行为给出了相当精确的信息,但对 $F^-$ 只给出了较为粗略的信息,即对任意 $\varepsilon >0$ 和 $c_n\to\infty$,有 \\[ {\mathbb P}(F_n^- -\ln n\in (-(2+\varepsilon)\ln\ln\ln n,c_n))\to 1 \\] (描述典型行为),并且几乎必然地 \\[ \limsup \frac{F_n^- - \ln n}{\ln \ln n} \le 0 \quad \mbox{和} \quad \liminf \frac{F_n^- - \ln n}{\ln \ln \ln n} \in [-2, -1]. \\] 在本文中,我们利用生成元理论($F_n$ 的极小值)结合一阶矩和二阶矩方法,将尾点定位结果显著改进为 \\[ F_n^- - (\ln n - \ln \ln \ln n) \overset{\mathrm{P}}{\longrightarrow} - \ln(d - 1) \\] (描述典型行为),并且对 $d \ge 3$,几乎必然地 \begin{align*} &\limsup [F_n^- - (\ln n - \ln \ln \ln n)] \leq -\ln(d - 2) + \ln 2 \\\\ \mbox{且 }&\liminf [F_n^- - (\ln n - \ln \ln \ln n)] \ge - \ln d - \ln 2. \end{align*}

英文摘要:

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 $λ_n\in F_n$ and $τ_n\in F_n$ such that $F_n^+=(λ_n)_+$ and $F_n^-=(τ_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 $\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*}

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑