Exact Nuisance-Free Testing at the Ewens Boundary of the Pitman–Yor Partition, with a Matching Efficiency Bound

The Ewens sampling formula sits at the boundary α=0 of the two-parameter Pitman–Yor partition, and deciding whether data lie on it is an inferential question in which the strength θ is unknown. We give tests of α=0 that need no knowledge of θ. Conditioning on the block count, which is sufficient for the strength, gives a randomized score test with exact level at every sample size, and its score agrees, to the order of the local experiment, with the efficient one. The local experiment is anisotropic: the discount and the strength are learned at the rates (logn)−3/2 and (logn)−1/2, and after each coordinate is rescaled by its own rate, the experiment is a Gaussian shift on a half-plane cone for α≥0 and on the whole plane once the Dirichlet–multinomial branch α<0 is admitted. Profiling out the strength divides the discount information by four. The asymptotic score test attains the one-sided and two-sided local power bounds; whether the exact test attains them is open. At each fixed alternative with 0<α<1 and θ>0, the type II errors of both tests decay like n−(θ+α), which is the fastest rate available to any test whose level is controlled over all strengths. Simulations and an analysis of Williams’ Rothamsted moth abundances illustrate the tests.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-09-29
DOI
https://doi.org/10.3390/math14193544
Primary Topic
Bayesian Methods and Mixture Models
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

Exact Nuisance-Free Testing at the Ewens Boundary of the Pitman–Yor Partition, with a Matching Efficiency Bound

Hongxuan Yan, luoyi sun
Mathematics
Bayesian Methods and Mixture Models
article

Exact Nuisance-Free Testing at the Ewens Boundary of the Pitman–Yor Partition, with a Matching Efficiency Bound

Hongxuan Yan, luoyi sun
article en

Abstract

The Ewens sampling formula sits at the boundary α=0 of the two-parameter Pitman–Yor partition, and deciding whether data lie on it is an inferential question in which the strength θ is unknown. We give tests of α=0 that need no knowledge of θ. Conditioning on the block count, which is sufficient for the strength, gives a randomized score test with exact level at every sample size, and its score agrees, to the order of the local experiment, with the efficient one. The local experiment is anisotropic: the discount and the strength are learned at the rates (logn)−3/2 and (logn)−1/2, and after each coordinate is rescaled by its own rate, the experiment is a Gaussian shift on a half-plane cone for α≥0 and on the whole plane once the Dirichlet–multinomial branch α<0 is admitted. Profiling out the strength divides the discount information by four. The asymptotic score test attains the one-sided and two-sided local power bounds; whether the exact test attains them is open. At each fixed alternative with 0<α<1 and θ>0, the type II errors of both tests decay like n−(θ+α), which is the fastest rate available to any test whose level is controlled over all strengths. Simulations and an analysis of Williams’ Rothamsted moth abundances illustrate the tests.

MathematicsVol. 14(19)
Beijing Institute of Technology (CN), University of Science and Technology Beijing (CN)
Openalex Percentile: Top 9%
Bayesian Methods and Mixture Models
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Exact Nuisance-Free Testing at the Ewens Boundary of the Pitman–Yor Partition, with a Matching Efficiency Bound — Hongxuan Yan, luoyi sun · Mathematics (2026) | TGRS Research Map | TGRS