Stars and mentions
Last 30 days, Oct 5 – Nov 3
Package downloads
Top repositories
AllenDowney’s repositories ranked by new stars, as on trending.
Contributes to
Repositories outside AllenDowney’s account where AllenDowney opened or reviewed pull requests in the past 365 days.
Who noticed AllenDowney
Everyone who starred or forked AllenDowney’s repositories since the archive began in 2011.
Notable accounts
Ordered by the stars their own repositories have received.
Biggest fans
Accounts that starred the most of these repositories.
Breakout weeks
Each repository’s best week of new stars, with the release published around it.
- Gold
- 01st place finishes
- Silver
- 02nd place finishes
- Bronze
- 03rd place finishes
- Awarded repositories
- 0Owned by AllenDowney now
No trending awards yet
None of the repositories AllenDowney owns has finished in the top three of a completed trending day or week, by stars, forks or PR authors. See who is trending now.
A repository earns an award for finishing first, second or third in a completed trending day or week, ranked by new stars, new forks or pull request authors. Awards follow a repository through renames and transfers and count toward its current owner. Weeks run Monday to Sunday, UTC.
Mentions
A novel changepoint detection algorithm Note added in version 2 (2026): this paper has been superseded. The probability it computes, that each index is the most recent changepoint, is the run-length posterior of Bayesian online changepoint detection (R. P. Adams and D. J. C. MacKay, arXiv:0710.3742, 2007), which computes it exactly and efficiently; see also P. Fearnhead, Statistics and Computing 16:203-213, 2006. The implementation used for the results in this paper contained errors, so those results should not be relied on. A corrected implementation, tests, and a description of the errors are at AllenDowney/ChangePoint. The rest of the paper is unchanged from version 1. We propose an algorithm for simultaneously detecting and locating changepoints in a time series, and a framework for predicting the distribution of the next point in the series. The kernel of the algorithm is a system of equations that computes, for each index i, the probability that the last (most recent) change point occurred at i. We evaluate this algorithm by applying it to the change point detection problem and comparing it to the generalized likelihood ratio (GLR) algorithm. We find that our algorithm is as good as GLR, or better, over a wide range of scenarios, and that the advantage increases as the signal-to-noise ratio decreases. Comments: 11 pages