Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2304.02440

CrossCarry: An R package for the analysis of data from a crossover design with GEE

N. A. Cruz·O. O. Melo·C. A. Martinez·R. Alberich
View original source ↗Read source document ↗Export metadata ↓

Abstract

Crossover designs are widely applied in medicine, agriculture, and other biological sciences, yet their analysis remains challenging due to longitudinal observations within each unit and the presence of carry-over effects. Despite their prevalence, there is no comprehensive R package dedicated to the statistical modeling of crossover data. The CrossCarry package addresses this gap by providing a flexible and open-source framework for analyzing any crossover design with response variables from the exponential family, with or without washout periods. It extends the generalized estimating equations (GEE) methodology by incorporating correlation structures specifically tailored to crossover data, capturing both within- and between-period dependencies. Moreover, CrossCarry integrates a parametric component for treatment effects and a nonparametric spline-based component for time and carry-over effects. This combination allows users to model complex correlation patterns and temporal structures with minimal coding effort. By offering a domain-independent implementation of advanced statistical methodology, CrossCarry facilitates reproducible research and promotes the reuse of robust analytical tools across disciplines. Its potential applications span medical trials, agricultural field experiments, and other areas where crossover designs are essential, thus contributing to broader scientific discovery and cross-domain methodological standardization.

Explore related subjects

stat.CO

Keep this discovery

BibTeXRIS

N. A. Cruz, O. O. Melo, C. A. Martinez, R. Alberich. 2023-04-05. CrossCarry: An R package for the analysis of data from a crossover design with GEE. https://doi.org/10.1016/j.softx.2025.102482

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

KEEP EXPLORING

Related papers

arXiv2026

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO↗
arXiv2026

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO↗