Abstract: Bayesian Blocks is a time-domain algorithm for detecting localized structures (bursts), revealing pulse shapes within bursts, and generally characterizing intensity variations. The input is raw time series data, in almost any form. Three data modes are elaborated: (1) time-tagged events, (2) binned counts, and (3) measurements at arbitrary times with normal errors. The output is the most probable segmentation of the observation interval into sub-intervals during which the signal is perceptibly constant, i.e. has no statistically significant variations. The idea is not that the source is deemed to actually have this discontinuous, piecewise constant form, rather that such an approximate and generic model is often useful. Treatment of data gaps, variable exposure, extension to piecewise linear and piecewise exponential representations, multi-variate time series data, analysis of variance, data on the circle, other data modes, and dispersed data are included.
This implementation is exact and replaces the greedy, approximate, and outdated algorithm implemented in BLOCK.
Credit: Scargle, Jeffrey D.; Norris, Jay P.; Jackson, Brad; Chiang, James
Preferred citation method: https://ui.adsabs.harvard.edu/abs/2013ApJ...764..167S