English

An N Time-Slice Dynamic Chain Event Graph

Machine Learning 2018-11-30 v2 Machine Learning

Abstract

The Dynamic Chain Event Graph (DCEG) is able to depict many classes of discrete random processes exhibiting asymmetries in their developments and context-specific conditional probabilities structures. However, paradoxically, this very generality has so far frustrated its wide application. So in this paper we develop an object-oriented method to fully analyse a particularly useful and feasibly implementable new subclass of these graphical models called the N Time-Slice DCEG (NT-DCEG). After demonstrating a close relationship between an NT-DCEG and a specific class of Markov processes, we discuss how graphical modellers can exploit this connection to gain a deep understanding of their processes. We also show how to read from the topology of this graph context-specific independence statements that can then be checked by domain experts. Our methods are illustrated throughout using examples of dynamic multivariate processes describing inmate radicalisation in a prison.

Keywords

Cite

@article{arxiv.1808.05726,
  title  = {An N Time-Slice Dynamic Chain Event Graph},
  author = {Rodrigo A. Collazo and Jim Q. Smith},
  journal= {arXiv preprint arXiv:1808.05726},
  year   = {2018}
}

Comments

52 pages, 14 figures, revised Definition 10, added Lemmas 1 and 2, corrected typos

R2 v1 2026-06-23T03:36:26.904Z