Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2208.14557

How much does it cost to complete a sticker collection? A simulation study using R

Edson Zangiacomi Martinez·Jorge Alberto Achcar·Marcos Vinicius de Oliveira Peres·Ricardo Puziol de Oliveira·Regina Albanese Pose
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper considers some computational issues related to the problem of the coupon collector behavior. In addition, we propose a simulation algorithm to find the solution to the problem, where we present as a numerical illustration an album of stickers related to the Qatar 2022 Official Football World Cup, which is being sold in Brazilian newsstands. In this case, the complete album has N = 670 stickers, which are sold in packages containing n = 5 stickers each. The simulation was based on a computational code written in R. For this application we obtained as a solution, an average number of 950 packages needed to complete the album, at an average cost of 3,800 reals (Brazilian currency), assuming that the collector does not exchange any of its repetitions with nobody. All computer code used in this article is provided on GitHub. The assumed simulation study could be useful for statistics teachers to motivate their students for lectures in computational statistics and fundamentals of probability.

Explore related subjects

stat.CO

Keep this discovery

BibTeXRIS

Edson Zangiacomi Martinez, Jorge Alberto Achcar, Marcos Vinicius de Oliveira Peres, Ricardo Puziol de Oliveira, Regina Albanese Pose. 2022-08-30. How much does it cost to complete a sticker collection? A simulation study using R. https://arxiv.org/abs/2208.14557

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↗