Local Dependence Graphs for Discrete Time Processes
Abstract
Local dependence graphs for discrete time processes encapsulate information concerning the dependence relationships between the past of the multidimensional process and its present state and as such can represent feedback loops. Even in the discrete time setting some natural questions relating the conditional (in)dependence statements in the stochastic process to separation properties of the underlying local dependence graph are scattered throughout the literature. We provide an unifying view and fill in certain gaps. In this paper we examine graphical characteristics for two kinds of conditional independences: those occurring in Markov chains under the stationary regime and independences between the past of one subprocess and the future of another given the past of the third subprocess.
Cite
Text
Niemiro and Rajkowski. "Local Dependence Graphs for Discrete Time Processes." Proceedings of the Second Conference on Causal Learning and Reasoning, 2023.Markdown
[Niemiro and Rajkowski. "Local Dependence Graphs for Discrete Time Processes." Proceedings of the Second Conference on Causal Learning and Reasoning, 2023.](https://mlanthology.org/clear/2023/niemiro2023clear-local/)BibTeX
@inproceedings{niemiro2023clear-local,
title = {{Local Dependence Graphs for Discrete Time Processes}},
author = {Niemiro, Wojciech and Rajkowski, Łukasz},
booktitle = {Proceedings of the Second Conference on Causal Learning and Reasoning},
year = {2023},
pages = {772-790},
volume = {213},
url = {https://mlanthology.org/clear/2023/niemiro2023clear-local/}
}