Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2501.12718

TimeDepFrail: Time-Dependent Shared Frailty Cox Models in R

Alessandra Ragni·Giulia Romani·Chiara Masci
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper introduces TimeDepFrail, an R package designed to implement time-varying shared frailty models by extending the traditional shared frailty Cox model to allow the frailty term to evolve across time intervals. These models are particularly suited for survival analysis in clustered data where unobserved heterogeneity changes over time, providing greater flexibility in modeling time-to-event data. The package builds on the piecewise gamma frailty model originally proposed by Paik (1994) and refined by Wintrebert et al. (2004). Our key contributions include the integration of posterior frailty estimation, a reduction in computational complexity, the definition of a prediction framework and the efficient implementation of these models within an R package. As a practical application, we use TimeDepFrail to analyze dropout rates within a university, where high dropout rates are a known issue. By allowing frailty to vary over time, the package uncovers new insights into the unobserved factors influencing dropout. TimeDepFrail simplifies access to advanced time-varying frailty models, providing a practical and scalable alternative to more computationally demanding methods, making it highly applicable for large-scale datasets.

Explore related subjects

stat.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alessandra Ragni, Giulia Romani, Chiara Masci. 2025-01-22. TimeDepFrail: Time-Dependent Shared Frailty Cox Models in R. https://arxiv.org/abs/2501.12718

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↗