Propagation for Dynamic Continuous Time Chain Event Graphs

• URL: http://arxiv.org/abs/2006.15865v1
• Date: Mon, 29 Jun 2020 08:24:57 GMT
• Title: Propagation for Dynamic Continuous Time Chain Event Graphs
• Authors: Aditi Shenvi and Jim Q. Smith
• Abstract summary: We present a tractable exact inferential scheme analogous to the scheme in Kjaerulff (1992) for discrete Dynamic Bayesian Networks (DBNs) We show that the CT-DCEG is preferred to DBNs and continuous time BNs under contexts involving significant asymmetry and a natural total ordering of the process evolution.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Chain Event Graphs (CEGs) are a family of event-based graphical models that represent context-specific conditional independences typically exhibited by asymmetric state space problems. The class of continuous time dynamic CEGs (CT-DCEGs) provides a factored representation of longitudinally evolving trajectories of a process in continuous time. Temporal evidence in a CT-DCEG introduces dependence between its transition and holding time distributions. We present a tractable exact inferential scheme analogous to the scheme in Kj{\ae}rulff (1992) for discrete Dynamic Bayesian Networks (DBNs) which employs standard junction tree inference by "unrolling" the DBN. To enable this scheme, we present an extension of the standard CEG propagation algorithm (Thwaites et al., 2008). Interestingly, the CT-DCEG benefits from simplification of its graph on observing compatible evidence while preserving the still relevant symmetries within the asymmetric network. Our results indicate that the CT-DCEG is preferred to DBNs and continuous time BNs under contexts involving significant asymmetry and a natural total ordering of the process evolution.

Related papers

• Clustering Time-Evolving Networks Using the Spatio-Temporal Graph Laplacian [0.8643517734716606]
  We generalize existing spectral algorithms to identify and analyze communities in time-varying graph structures. We show that thetemporal-directed graph Laplacian allows for a clear interpretation of cluster structure evolution over time for directed and undirected clusters.
  arXiv  Detail & Related papers  (2024-07-12T14:31:54Z)
• Gaussian Embedding of Temporal Networks [12.09704836128003]
  TGNE (textbfTemporal textbfGaussian textbfNetwork textbfEmbedding) bridges statistical analysis of networks via Latent Space Models (LSM)citeHoff2002 and temporal graph machine learning. We evaluate TGNE's effectiveness in reconstructing the original graph and modelling uncertainty.
  arXiv  Detail & Related papers  (2024-05-27T15:07:57Z)
• A Poisson-Gamma Dynamic Factor Model with Time-Varying Transition Dynamics [51.147876395589925]
  A non-stationary PGDS is proposed to allow the underlying transition matrices to evolve over time. A fully-conjugate and efficient Gibbs sampler is developed to perform posterior simulation. Experiments show that, in comparison with related models, the proposed non-stationary PGDS achieves improved predictive performance.
  arXiv  Detail & Related papers  (2024-02-26T04:39:01Z)
• Attractor Memory for Long-Term Time Series Forecasting: A Chaos Perspective [63.60312929416228]
  textbftextitAttraos incorporates chaos theory into long-term time series forecasting. We show that Attraos outperforms various LTSF methods on mainstream datasets and chaotic datasets with only one-twelfth of the parameters compared to PatchTST.
  arXiv  Detail & Related papers  (2024-02-18T05:35:01Z)
• DD-GCN: Directed Diffusion Graph Convolutional Network for Skeleton-based Human Action Recognition [10.115283931959855]
  Graphal Networks (GCNs) have been widely used in skeleton-based human action recognition. In this paper, we construct directed diffusion for action modeling and introduce the activity partition strategy. We also present to embed synchronized-temporal-temporal semantics.
  arXiv  Detail & Related papers  (2023-08-24T01:53:59Z)
• Space-Time Graph Neural Networks with Stochastic Graph Perturbations [100.31591011966603]
  Space-time graph neural networks (ST-GNNs) learn efficient graph representations of time-varying data. In this paper we revisit the properties of ST-GNNs and prove that they are stable to graph stabilitys. Our analysis suggests that ST-GNNs are suitable for transfer learning on time-varying graphs.
  arXiv  Detail & Related papers  (2022-10-28T16:59:51Z)
• Persistent Homology of Coarse Grained State Space Networks [1.7434507809930746]
  We use persistent homology from topological data analysis to study the structure of complex transitional networks. We show that the CGSSN captures rich information about the dynamic state of the underlying dynamical system.
  arXiv  Detail & Related papers  (2022-05-20T15:29:29Z)
• Deep Explicit Duration Switching Models for Time Series [84.33678003781908]
  We propose a flexible model that is capable of identifying both state- and time-dependent switching dynamics. State-dependent switching is enabled by a recurrent state-to-switch connection. An explicit duration count variable is used to improve the time-dependent switching behavior.
  arXiv  Detail & Related papers  (2021-10-26T17:35:21Z)
• Space-Time Graph Neural Networks [104.55175325870195]
  We introduce space-time graph neural network (ST-GNN) to jointly process the underlying space-time topology of time-varying network data. Our analysis shows that small variations in the network topology and time evolution of a system does not significantly affect the performance of ST-GNNs.
  arXiv  Detail & Related papers  (2021-10-06T16:08:44Z)
• Out-of-time-order correlations and the fine structure of eigenstate thermalisation [58.720142291102135]
  Out-of-time-orderors (OTOCs) have become established as a tool to characterise quantum information dynamics and thermalisation. We show explicitly that the OTOC is indeed a precise tool to explore the fine details of the Eigenstate Thermalisation Hypothesis (ETH) We provide an estimation of the finite-size scaling of $omega_textrmGOE$ for the general class of observables composed of sums of local operators in the infinite-temperature regime.
  arXiv  Detail & Related papers  (2021-03-01T17:51:46Z)
• Continuous-Time Bayesian Networks with Clocks [33.774970857450086]
  We introduce a set of node-wise clocks to construct a collection of graph-coupled semi-Markov chains. We provide algorithms for parameter and structure inference, which make use of local dependencies.
  arXiv  Detail & Related papers  (2020-07-01T09:33:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.