Upper bounds for the maximum deviation of the Pearcey process

Abstract

The Pearcey process is a universal point process in random matrix theory and depends on a parameter ∈ R. Let N(x) be the random variable that counts the number of points in this process that fall in the interval [-x,x]. In this note, we establish the following global rigidity upper bound: align* s ∞ P(x> s|N(x)-( 334πx43-32πx23 ) x| ≤ 423π + ε ) = 1, align* where ε > 0 is arbitrary. We also obtain a similar upper bound for the maximum deviation of the points, and a central limit theorem for the individual fluctuations. The proof is short and combines a recent result of Dai, Xu and Zhang with another result of Charlier and Claeys.

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…