Efficient Parameter Sampling for Markov Jump Processes

References

• Andrieu, C., Doucet, A., and Holenstein., R. (2010), “Particle Markov Chain Monte Carlo Methods,” Journal of the Royal Statistical Society, Series B, 72, 269–342. DOI: 10.1111/j.1467-9868.2009.00736.x.
   Google Scholar
• Andrieu, C., and Roberts, G. O. (2009), “The Pseudo-Marginal Approach for Efficient Monte Carlo Computations,” The Annals of Statistics, 37, 697–725. DOI: 10.1214/07-AOS574.
   Web of Science ®Google Scholar
• Breuer, L. (2003), From Markov Jump Processes to Spatial Queues, Dordrecht: Springer.
   Google Scholar
• Carter, C. K., and Kohn, R. (1996), “Markov Chain Monte Carlo in Conditionally Gaussian State Space Models,” Biometrika, 83, 589–601. DOI: 10.1093/biomet/83.3.589.
   Web of Science ®Google Scholar
• Çinlar, E. (1975), Introduction to Stochastic Processes, Englewood Cliffs, NJ: Prentice Hall.
   Google Scholar
• El-Hay, T., Friedman, N., and Kupferman, R. (2008), “Gibbs Sampling in Factorized Continuous-Time Markov Processes,” in Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, pp. 169–178.
   Google Scholar
• Elliott, R., and Osakwe, C. J. (2006), “Option Pricing for Pure Jump Processes With Markov Switching Compensators,” Finance and Stochastics, 10, 250–275. DOI: 10.1007/s00780-006-0004-6.
   Web of Science ®Google Scholar
• Fearnhead, P., and Sherlock, C. (2006), “An Exact Gibbs Sampler for the Markov-Modulated Poisson Process,” Journal of the Royal Statistical Society, Series B, 68, 767–784. DOI: 10.1111/j.1467-9868.2006.00566.x.
   Google Scholar
• Fill, J. A. (1991), “Eigenvalue Bounds on Convergence to Stationarity for Nonreversible Markov Chains, With an Application to the Exclusion Process,” The Annals of Applied Probability, 1, 62–87. DOI: 10.1214/aoap/1177005981.
   Google Scholar
• Frühwirth-Schnatter, S. (1994), “Data Augmentation and Dynamic Linear Models,” Journal of Time Series Analysis, 15, 183–202. DOI: 10.1111/j.1467-9892.1994.tb00184.x.
   Google Scholar
• Gelman, A., Stern, H. S., Carlin, J. B., Dunson, D. B., Vehtari, A. and Rubin, D. B. (2013), Bayesian Data Analysis, London: Chapman and Hall/CRC.
   Google Scholar
• Gillespie, D. T. (1977), “Exact Stochastic Simulation of Coupled Chemical Reactions,” The Journal of Physical Chemistry, 81, 2340–2361. DOI: 10.1021/j100540a008.
   Web of Science ®Google Scholar
• Goldman, N., and Yang, Z. (1994), “A Codon-Based Model of Nucleotide Substitution for Protein-Coding DNA Sequences,” Molecular Biology and Evolution, 11, 725–736. DOI: 10.1093/oxfordjournals.molbev.a040153.
   PubMed Web of Science ®Google Scholar
• Gross, D., Shortle, J., Thompson, J., and Harris, C. (2011), Fundamentals of Queueing Theory, Wiley Series in Probability and Statistics, New York: Wiley.
   Google Scholar
• Hobolth, A., and Stone, E. (2009), “Simulation From Endpoint-Conditioned, Continuous-Time Markov Chains on a Finite State Space, With Applications to Molecular Evolution,” The Annals of Applied Statistics, 3, 1204. DOI: 10.1214/09-AOAS247.
   PubMed Web of Science ®Google Scholar
• Jensen, A. (1953), “Markoff Chains as an Aid in the Study of Markoff Processes,” Scandinavian Actuarial Journal, 36, 87–91. DOI: 10.1080/03461238.1953.10419459.
   Web of Science ®Google Scholar
• Jukes, T. H., and Cantor, C. R. (1969), Evolution of Protein Molecules, New York: Academy Press.
   Google Scholar
• Liu, J. S. (1994), “The Fraction of Missing Information and Convergence Rate for Data Augmentation,” in Computing Science and Statistics, pp. 490–490.
   Google Scholar
• Meyn, S., and Tweedie, R. L. (2009), Markov Chains and Stochastic Stability (2nd ed.), Cambridge: Cambridge University Press.
   Google Scholar
• Miasojedow, B., and Niemiro, W. (2017), “Geometric Ergodicity of Rao and Teh’s Algorithm for Markov Jump Processes and CTBNs,” Electronic Journal of Statistics, 11, 4629–4648. DOI: 10.1214/17-EJS1348.
   Web of Science ®Google Scholar
• Møller, J., Pettitt, A. N., Reeves, R., and Berthelsen, K. K. (2006), “An Efficient Markov Chain Monte Carlo Method for Distributions With Intractable Normalising Constants,” Biometrika, 93, 451–458. DOI: 10.1093/biomet/93.2.451.
   Web of Science ®Google Scholar
• Murray, I., Ghahramani, Z., and MacKay, D. J. C. (2006), “MCMC for Doubly-Intractable Distributions,” in Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence, pp. 359–366.
   Google Scholar
• Neal, R. M. (2004), “Taking Bigger Metropolis Steps by Dragging Fast Variables,” Technical Report, Department of Statistics, University of Toronto.
   Google Scholar
• Neal, R. M. (2010), “MCMC Using Hamiltonian Dynamics,” Handbook of Markov Chain Monte Carlo, 54, 113–162.
   Google Scholar
• Nodelman, U., Shelton, C., and Koller, D. (2002), “Continuous Time Bayesian Networks,” in Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence, pp. 378–387.
   Google Scholar
• Opper, M., and Sanguinetti, G. (2007), “Variational Inference for Markov Jump Processes,” in Advances in Neural Information Processing Systems (Vol. 20), pp. 1105–1112.
   Google Scholar
• Pan, J., Rao, V., Agarwal, P. K., and Gelfand, A. E. (2016), “Markov-Modulated Marked Poisson Processes for Check-In Data,” in Proceedings of the 33rd International Conference on Machine Learning, PMLR (Vol. 48), pp. 2244–2253.
   Google Scholar
• Pan, J., Zhang, B., and Rao, V. (2017), “Collapsed Variational Bayes for Markov Jump Processes,” in Advances in Neural Information Processing Systems (Vol. 30), pp. 3749–3757.
   Google Scholar
• Papaspiliopoulos, O., Roberts, G. O., and Sköld, M. (2007), “A General Framework for the Parametrization of Hierarchical Models,” Statistical Science, 22, 59–73. DOI: 10.1214/088342307000000014.
   Web of Science ®Google Scholar
• Plummer, M., Best, N., Cowles, K., and Vines, K. (2006), “CODA: Convergence Diagnosis and Output Analysis for MCMC,” R News, 6, 7–11.
   Google Scholar
• Rao, V., and Teh, Y. W. (2011), “Gaussian Process Modulated Renewal Processes,” in Advances in Neural Information Processing Systems (Vol. 24), pp. 2474–2482.
   Google Scholar
• Rao, V., and Teh, Y. W. (2012), “MCMC for Continuous-Time Discrete-State Systems,” in Advances in Neural Information Processing Systems (Vol. 25), pp. 701–709.
   Google Scholar
• Rao, V., and Teh, Y. W. (2013), “Fast MCMC Sampling for Markov Jump Processes and Extensions,” Journal of Machine Learning Research, 14, 3295–3320.
   Web of Science ®Google Scholar
• Scott, S. L., and Smyth, P. (2003), “The Markov Modulated Poisson Process and Markov Poisson Cascade With Applications to Web Traffic Modeling,” Bayesian Statistics, 7, 1–10.
   Google Scholar
• Xu, J., and Shelton, C. R. (2010), “Intrusion Detection Using Continuous Time Bayesian Networks,” Journal of Artificial Intelligence Research, 39, 745–774. DOI: 10.1613/jair.3050.
   Web of Science ®Google Scholar
• Yu, Y., and Meng, X.-L. (2011), “To Center or Not to Center: That Is Not the Question—An Ancillarity–Sufficiency Interweaving Strategy (ASIS) for Boosting MCMC Efficiency,” Journal of Computational and Graphical Statistics, 20, 531–570. DOI: 10.1198/jcgs.2011.203main.
   Web of Science ®Google Scholar