Search arXiv⌕ Search

arXiv · 2610.05328

Moderate Deviations for Random-Indexed Cluster Counts in Hierarchical Pitman-Yor Models

Abstract

Consider a sample of size $N$ from a two-layer hierarchical Pitman--Yor model, and let $ξ(N)$ denote the random number of clusters generated at the first layer of the hierarchy. We study moderate deviation principles for partition statistics evaluated at the random sample size $ξ(N)$. In particular, we establish moderate deviation principles for the total number of clusters $K_{ξ(N)}$ and for the frequency count $M_{l,ξ(N)}$, the number of upper-level clusters represented by exactly $l$ first-level clusters. Our analysis combines fixed-sample-size small-tilt asymptotics with a moderate deviation principle for the random index $ξ(N)$. A uniform small-tilt argument, together with exponentially weighted tail estimates, allows us to pass from deterministic sample sizes to the hierarchical random-index setting. We obtain explicit deviation speeds and good rate functions on a family of intermediate scales between the typical growth order $N^{α_1α_2}$ and the linear scale $N$. The resulting rate functions exhibit a common power-law structure governed by the product $α_1α_2$, revealing a multiplicative effect of the two levels of the hierarchy.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nian Yao. 2026-10-04. Moderate Deviations for Random-Indexed Cluster Counts in Hierarchical Pitman-Yor Models. https://arxiv.org/abs/2610.05328

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The scaling limit of fair Peano paths

We study random Peano paths on planar square grids that arise from fair random spanning trees. These are trees that are sampled in such a way as to have the same (if possible) edge probabilities. In particular, we are interested in identifying the scaling limit as the mesh-size of the grid tends to zero. It is known \cite{lawler-schramm-werner2002} that if the trees are sampled uniformly, then the scaling limit exists and equals ${\rm SLE}_8$. We show that if we simply follow the same steps as in \cite{lawler-schramm-werner2002}, then fair Peano paths have a deterministic scaling limit.

math.PR↗

Multiple SLE$_κ$ from CLE$_κ$

We introduce multichordal CLE$_κ$ which is a random collection of non-crossing loops together with additional chords connecting a set of marked boundary points. The chords have a random link pattern, and their law conditionally on the link pattern is a (global) multichordal SLE$_κ$. We show that multichordal CLE$_κ$ arises as the conditional law of the remainder of a partially explored CLE$_κ$. The multichordal CLE$_κ$ are the conjectural scaling limits of FK and loop $O(n)$ models with some wiring patterns of the boundary arcs. We further explain how CLE$_κ$ configurations can be locally resampled, and show that the partially explored strands can be relinked in any possible way with positive probability. Our results also establish a useful local independence property of CLE$_κ$. Altogether, the results and estimates in this paper serve to provide a toolbox for studying CLE$_κ$ and global multiple SLE$_κ$.

math.PR↗

Total progeny for spectrally negative branching L{é}vy processes with absorption

We consider a spectrally negative branching L{é}vy process in which particles are killed upon crossing below zero. It is known that such a process becomes extinct almost surely if the drift toward -$\infty$ is sufficiently strong to counterbalance the reproduction rate. In this note, we study the tail asymptotics of the number of particles absorbed at the boundary during the lifetime of the process, in both the subcritical and critical regimes.

math.PR↗