Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 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

Cut-off phenomenon for the maximum of a sampling of Ornstein-Uhlenbeck processes (1907.07618v3)

Published 17 Jul 2019 in math.PR, math.ST, and stat.TH

Abstract: In this article we study the so-called cut-off phenomenon in the total variation distance when $n\to \infty$ for the family of continuous-time stochastic processes indexed by $n\in \mathbb{N}$, [ \left( \mathcal{Z}{(n)}_t= \max\limits_{j\in {1,\ldots,n}}{X{(j)}_t}:t\geq 0\right), ] where $X{(1)},\ldots,X{(n)}$ is a sampling of $n$ ergodic Ornstein-Uhlenbeck processes driven by stable processes of index $\alpha$. It is not hard to see that for each $n\in \mathbb{N}$, $\mathcal{Z}{(n)}_t$ converges in the total variation distance to a limiting distribution $\mathcal{Z}{(n)}_\infty$ as $t$ goes by. Using the asymptotic theory of extremes; in the Gaussian case we prove that the total variation distance between the distribution of $\mathcal{Z}{(n)}_t$ and its limiting distribution $\mathcal{Z}{(n)}_\infty$ converges to a universal function in a constant time window around the cut-off time, a fact known as profile cut-off in the context of stochastic processes. On the other hand, in the heavy-tailed case we prove that there is not cut-off.

Summary

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