@article{Newer2026, 
author = {Haidy A. Newer and Bader S. Alanazi},
title = {Accurate saddlepoint approximations for clustered rank tests under randomized block urn design},
year = {2026},
journal = {AIMS Mathematics},
volume = {11},
number = {3},
pages = {5340-5364},
keywords = {saddlepoint approximation, clustered data, linear rank tests, randomized block urn design, log-rank test, Gehan–Wilcoxon test, Mann–Whitney test, Prentice–Wilcoxon test, confidence intervals},
url = {https://www.sciopen.com/article/10.3934/math.2026220},
doi = {10.3934/math.2026220},
abstract = {Randomized block urn design is a clinical trial design that is increasingly being used as a means of treatment allocation to balance the treatment allocation. With repeated measures or multi-centre trials though, the corresponding complex structures of dependency invalidate the standard asymptotic approximations, even in small to moderate samples. In this paper, a high-accuracy saddlepoint approximation model of a linear rank test is established with the dual conditions of cluster sampling and adaptive urn randomization. We obtained the joint cumulant generating function of the test statistic conditional in the realized block allocation counts, and the accurate calculation of mid-   p-values that takes into consideration the discreteness of rank scores. We have a wide variety of classes of score functions, such as the log-rank, GehanWilcoxon and MannWhitney statistics. Wide-scale simulation experiments showed that the suggested saddlepoint algorithm is much more effective at controlling Type-Ⅰ error rates and preserving nominal coverage probabilities of confidence intervals, and is comparable to computationally-intensive permutation benchmarks even with strong intra-cluster correlation. Its approach was demonstrated by applying it to oncology and ophthalmology trial data demonstrating its soundness in finite-sample cases.}
}