The Long-Run Behavior of Continuous Time Bayesian Networks

Abstract

The continuous time Bayesian network (CTBN) is a temporal model consisting of interdependent continuous time Markov chains (Markov processes). One common analysis performed on Markov processes is determining their long-run behavior, such as their stationary distributions. While the CTBN can be transformed into a single Markov process of all nodes' state combinations, the size is exponential in the number of nodes, making traditional long-run analysis intractable. To address this, we show how to perform "long-run" node marginalization that removes a node's conditional dependence while preserving its long-run behavior. This allows long-run analysis of CTBNs to be performed in a top-down process without dealing with the entire network all at once.

Cite

Text

Sturlaugson and Sheppard. "The Long-Run Behavior of Continuous Time Bayesian Networks." Conference on Uncertainty in Artificial Intelligence, 2015.

Markdown

[Sturlaugson and Sheppard. "The Long-Run Behavior of Continuous Time Bayesian Networks." Conference on Uncertainty in Artificial Intelligence, 2015.](https://mlanthology.org/uai/2015/sturlaugson2015uai-long/)

BibTeX

@inproceedings{sturlaugson2015uai-long,
  title     = {{The Long-Run Behavior of Continuous Time Bayesian Networks}},
  author    = {Sturlaugson, Liessman and Sheppard, John W.},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {2015},
  pages     = {842-851},
  url       = {https://mlanthology.org/uai/2015/sturlaugson2015uai-long/}
}