Theory of Cricket: Target Scores and Predictability

Robin de Regt; Ravinder Kumar

Home/Archive/arXiv

arXiv · 1804.02229

Theory of Cricket: Target Scores and Predictability

Robin de Regt·Ravinder Kumar

View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose a model for recalculating the target score in rain affected matches based on empirical data. During the development of the current stage of the Cricket, different methods have been introduced to recalculate the target scores in interpreted games. Currently, the International Cricket Council (ICC) uses the Duckworth-Lewis method and have in the past strongly considered changing to the VJD method. Here, we introduce a simple approach to calculate target scores in interrupted games by considering the area under a run rate curve. To calculate the target we have analysed over a decades worth of empirical data using various statistical methods. As in the case of Duckworth- Lewis method, we also have two parameters in our model, that is overs and wickets in combination. We also found that in the one day international cricket (ODI) wickets play a crucial role whereas in T20 cricket they do not effect the run rate of the games to the same degree. Using empirical and mathematical arguments we show that the run scoring distributions are independent of the innings.

Explore related subjects

stat.OT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Robin de Regt, Ravinder Kumar. 2018-04-06. Theory of Cricket: Target Scores and Predictability. https://arxiv.org/abs/1804.02229

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗