HackerPapers

arXiv:1109.2825physics.data-an

Random Walk Picture of Basketball Scoring

Alan Gabel, S. Redner

Abstract

We present evidence, based on play-by-play data from all 6087 games from the 2006/07--2009/10 seasons of the National Basketball Association (NBA), that basketball scoring is well described by a weakly-biased continuous-time random walk. The time between successive scoring events follows an exponential distribution, with little memory between different scoring intervals. Using this random-walk picture that is augmented by features idiosyncratic to basketball, we account for a wide variety of statistical properties of scoring, such as the distribution of the score difference between opponents and the fraction of game time that one team is in the lead. By further including the heterogeneity of team strengths, we build a computational model that accounts for essentially all statistical features of game scoring data and season win/loss records of each team.

arXiv comments
10 pages, 14 figures; version 2: 20 pages, 8 figures, for publication in Journal of Quantitative Analysis in Sports
Journal reference
Journal of Quantitative Analysis in Sports Vol 8, issue 1 (2012)
DOI
doi:10.1515/1559-0410.1416
Subjects
physics.data-anData Analysis, Statistics and Probability physics.soc-phPhysics and Society

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 2 threads, from Nov 2016 to Oct 2023.

Comments linking this paper, per year.

Discussed in comments2 threads

    • Fantastic comment! In fact, it seems that sports games, or at least NBA games, can be described accurately and consistently using (slightly modified) random walks. Put differently: Outcomes are indeed random and there's not much machine learning you can do here. Source…

      codethiefView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.