Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1901.10928

Exact Bootstrap and Permutation Distribution of Wins and Losses in a Hierarchical Trial

William N. Anderson·Johan Verbeeck
View original source ↗Read source document ↗Export metadata ↓

Abstract

Finkelstein-Schoenfeld, Buyse, Pocock, and other authors have developed generalizations of the Mann-Whitney test that allow for pairwise patient comparisons to include a hierarchy of measurements. Various authors present either asymptotic or randomized methods for analyzing the wins. We use graph theory concepts to derive exact means and variances for the number of wins, as a replacement for approximate values obtained from bootstrap analysis or random sampling from the permutation distribution. The time complexity of our algorithm is $O(N^2)$, where $N$ is the total number of patients. In any situation where the mean and variance of a bootstrap sample are used to draw conclusions, our methodology will be faster and more accurate than the randomized bootstrap or permutation test.

Explore related subjects

stat.COstat.ME

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

William N. Anderson, Johan Verbeeck. 2019-11-24. Exact Bootstrap and Permutation Distribution of Wins and Losses in a Hierarchical Trial. https://arxiv.org/abs/1901.10928

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

KEEP EXPLORING

Related papers

arXiv2026

glmSTARMA -- An R-Package for fitting autoregressive spatio-temporal models following generalized linear models

The R package glmSTARMA implements autoregressive models for spatio-temporal data at fixed locations, with time-invariant spatial dependency structure. We rely on generalized linear models methodology and unify several approaches for the analysis of spatial count time series. Such models allow the (conditional) mean of the response to depend on past observations, lagged (conditional) expectations, and covariates. The response can be a continuous or a discrete random variable. Additionally, the package develops inference for double generalized linear models, allowing the dispersion parameter(s) of the marginal distributions to be modeled similarly to the mean process. This is a new capability which introduces, for example, spatio-temporal volatility models, such as space-time GARCH processes, and count time series models with spatio-temporal overdispersion and underdispersion. We provide functions for model estimation, simulation, inference, and prediction. Its use is illustrated by data examples.

stat.CO↗
arXiv2026

Penguin data reanalyzed via Computational Taxonomy

We employ Computational Taxonomy (CT) to reanalyze the penguin data set penguins_lter by validating and addressing two biological issues: Sexual Size Dimorphism (SSD) and mate-selection criteria. Via Scientific Data Analysis (SDA) computing, CT constructs a Taxonomic Hierarchy by splitting Species first and then Sex, without involving Island, to achieve less complexity. This Taxonomic Hierarchy validates SSD as a branch comparison: (Species, Sex = Male)-vs-(Species, Sex = Female), upon which SDA explores all potential pieces of associative information from all covariate feature-sets, including interacting effects from order-2 to order-4, and then confirms them via their idiosyncratic reliability checks. The collective of confirmed information pieces are displayed on a heatmap platform to manifest underlying dynamics of SSD with explicit block-structured heterogeneity found within males and females. SSD dynamics is explained through mechanistic dependence pertaining to one chief factor consisting of up to 8 feature-sets: Body-Mass coupled by combinations of {Culmen-length,Culmen-depth, Flipper-length}, and two minor factors consisting of low-order combinations of {Culmen-length,Culmen-depth, Flipper-length}. Such Intra-Sex heterogeneity invalidates all Logistic regression modeling on SSD in the original paper. Further, we explore potential mate-selection criteria through the data-frame of Nest-ID within-species homogeneity.

stat.CO↗
arXiv2026

Fast inversion of the generalized Fisher transformation of correlation matrices

The generalized Fisher transformation maps a non-singular correlation matrix to an unconstrained real vector through the off-diagonal elements of its matrix logarithm. Evaluating its inverse is a computational bottleneck in dynamic correlation and multivariate volatility models. We develop a fast inversion algorithm by characterizing the unknown diagonal as the minimizer of a smooth, strictly convex, and coercive objective. An explicit Hessian and global spectral bounds identify the standard fixed-point iteration as a quasi-Newton method and explain why it can converge slowly near singularity. Every fixed-point step decreases the objective, and the iteration converges from every starting point. These results motivate GFT-FP+N, a hybrid of fixed-point and matrix-free Newton steps that never forms the Jacobian. In benchmarks with up to 1,000 replications per design and dimensions up to 800, GFT-FP+N reduces computation time by up to a factor of forty-five relative to the fixed-point iteration and converged in every replication, including on designs where Broyden's method almost always fails. Julia and R packages are provided.

stat.CO↗