| dc.creator | Bacallado, Sergio | |
| dc.creator | Pande, Vijay | |
| dc.creator | Favaro, Stefano | |
| dc.creator | Trippa, Lorenzo | |
| dc.date.accessioned | 2018-11-24T23:26:44Z | |
| dc.date.available | 2016-04-20T15:50:04Z | |
| dc.date.available | 2018-11-24T23:26:44Z | |
| dc.date.issued | 2015-10-16 | |
| dc.identifier | https://www.repository.cam.ac.uk/handle/1810/255089 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/123456789/3873 | |
| dc.description.abstract | Variable order Markov chains have been used to model discrete sequential data in a variety of fields. A host of methods exist to estimate the history-dependent lengths of memory which characterize these models and to predict new sequences. In several applications, the data-generating mechanism is known to be reversible, but combining this information with the procedures mentioned is far from trivial. We introduce a Bayesian analysis for reversible dynamics, which takes into account uncertainty in the lengths of memory. The model proposed is applied to the analysis of molecular dynamics simulations and compared with several popular algorithms. | |
| dc.language | en | |
| dc.publisher | Wiley | |
| dc.publisher | Journal of the Royal Statistical Society: Series B (Statistical Methodology) | |
| dc.subject | Bayesian analysis | |
| dc.subject | reinforced random walk | |
| dc.subject | reversibility | |
| dc.subject | variable order Markov model | |
| dc.title | Bayesian regularization of the length of memory in reversible sequences | |
| dc.type | Article | |
