Evidence map›Paper›PMID 41291009›Full record

ArticleScientific reports2025

Accurate and efficient P-values for rank-based independence tests with clustered data using a saddlepoint approximation.

Haidy A Newer

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

1 author.

Haidy A NewerDepartment of Mathematics, Faculty of Education, Ain Shams University, Cairo, 11511, Egypt. haidynewer@edu.asu.edu.eg.ORCID http://orcid.org/0000-0001-7265-2882

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Accurate statistical inference for clustered data-common in multi-center clinical trials and longitudinal studies-poses significant challenges due to within-cluster correlation. Rank-based tests like the logrank, Wilcoxon, and Datta-Satten are valued for robustness but often suffer inflated Type I error rates under standard asymptotic approximations. While exact permutation tests offer theoretical accuracy, they are computationally impractical for large datasets, highlighting a methodological gap. This paper proposes a double saddlepoint approximation framework to deliver accurate p-values and confidence intervals for a wide class of rank-based tests. The method is built on a novel permutation distribution reformulation via block urn design, which preserves cluster integrity. This reformulation enables the test statistic's distribution to be represented as a sum of independent conditional random variables, from which a joint cumulant generating function can be derived for saddlepoint computation. The approach supports analyses with right-censored survival data and tied ranks. Extensive simulations confirm that the saddlepoint method accurately controls Type I error rates, performing identically to permutation-based benchmarks but with a vast reduction in computational cost. A case study on clinical trial data demonstrates the practical importance of this accuracy, showing how our approach avoids a potential false-positive conclusion reported by the standard asymptotic method. Ultimately, this research provides biostatisticians with a tool that is at once practical, efficient, and statistically rigorous for analyzing clustered data.

Indexed as

Block urn designClustered dataIndependence testingNon-parametric statisticsPermutation testsRank-based testsSaddlepoint approximationTied ranks

Identifiers

PMID41291009
PMCPMC12647824

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.