Description Usage Arguments Value Author(s) References
View source: R/fullMCMC_complexityPrior.R
This function computes the complexity prior distribution on the number of change-points, defined as f(\ell) = P(\ell_n = \ell)\propto e^{-α\ell\log(bT/\ell)}, a, b > 0; \ell = 0,1,2,…. Note that this distribution has exponential decrease (Castillo and van der Vaart, 2012) when b>1+e, so we set b=3.72.
1 | complexityPrior(Lmax = 20, gammaParameter, nTime)
|
Lmax |
maximum number of change-points (default = 20). |
gammaParameter |
positive real number, corresponding to α. |
nTime |
positive integer denoting the total number of time-points. |
logPrior |
Prior distribution values in the log-scale. |
Panagiotis Papastamoulis
Castillo I. and van der Vaart A (2012). Needles and Straw in a Haystack: Posterior concentration for possibly sparse sequences. The Annals of Statistics, 40(4), 2069–2101.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.