Search arXivSearch

arXiv · 2608.12732

A Copula-Based Framework for Multivariate Zero-Inflated Mixed Poisson Models

Abstract

Multivariate count data often contain overdispersion, excess zeros, and complex dependence. Existing multivariate zero-inflated count models usually use a single dependence structure to jointly model structural zeros and count outcomes. This makes the two sources of dependence difficult to interpret separately and often leads to slow computation or intractable likelihoods. This paper proposes a general framework for multivariate zero-inflated mixed Poisson models that explicitly separates these two sources of dependence within a unified likelihood-based formulation. The proposed hierarchical model combines zero-inflated mixed Poisson marginals with separate dependence models for the structural-zero and latent-intensity components. Dependence among structural zeros is modeled by standard parametric copulas, while dependence among latent mixing variables is modeled by checkerboard copulas. Likelihood-based inference is carried out using an inference-functions-for-margins procedure, and the proposed likelihood also supports full maximum likelihood estimation when computationally feasible. Simulation studies show accurate parameter estimation and good finite-sample performance under different dependence structures and latent mixing distributions. Applications to benchmark datasets from existing statistical software and a healthcare utilization dataset demonstrate the flexibility, computational efficiency, and practical usefulness of the proposed framework.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

N. Q. Huy, P. T. H. Tham, T. T. T. Hien. 2026-08-13. A Copula-Based Framework for Multivariate Zero-Inflated Mixed Poisson Models. https://arxiv.org/abs/2608.12732

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

KEEP EXPLORING

Related papers

See You at the Posterior Line: Learning Bayesian Modeling Through a Car Racing Game

We present an interactive classroom activity designed to address a central challenge in teaching introductory Bayesian statistics: how to formalize subjective knowledge and available information into prior distributions and then update them with empirical data. Role-playing as data analysts for a racing team, students evaluate candidate tires by converting qualitative engineering reports into prior distributions, collecting primary data via a virtual racing game, and using a Beta-Binomial model to inform team strategy. This discovery-based exercise allows small groups to observe directly how different prior choices and sample data jointly shape posterior inference. Student feedback ($n=32$) highlights high enjoyment, engagement and improved conceptual clarity. Open-access materials to implement the activity are provided, alongside recommendations for adapting it to other teaching contexts.

stat.OT

Why is Regularization Underused? An Empirical Study on Trust and Adoption of Statistical Methods

Statistical practice does not automatically follow methodological innovation. Regularization methods, widely advocated to reduce overfitting and stabilize inference, are readily available in modern software, but are not consistently used by data analysts. We investigate this implementation gap in a large-scale empirical study of trust in, and acceptance of, regularization techniques, based on $N = 606$ data analysts. Drawing on measurement frameworks from technology acceptance research, we survey practitioners and embed a randomized experiment to test whether written recommendation of regularization methods increases trust or intended use. We find no evidence of such an effect. Instead, adoption intentions are strongly associated with analysts' perceptions of ease of implementation and practical benefit, such as improved bias control or interpretability. Perceived social norms also emerge as a central driver. These results indicate that uptake of statistical methodology depends less on formal recommendations than on usability, perceived utility, and community practice.

stat.OT

Exact analysis of a split--merge queue with latent Erlang-factor dependent subtask times

This paper studies a two-server split--merge queue with positively dependent subtask service times modeled through a latent-factor bivariate Erlang construction. An exact characterization of the split--merge completion time is obtained, including explicit formulas for its first two moments and the resulting mean waiting time. Under fixed marginal service-time distributions, independence is shown to stochastically increase the completion time and hence overestimate mean waiting time. Numerical illustrations show that this benchmark gap can be substantial.

stat.OT