DeepAI AI Chat
Log In Sign Up

Graphical modeling of stochastic processes driven by correlated errors

by   Søren Wengel Mogensen, et al.

We study a class of graphs that represent local independence structures in stochastic processes allowing for correlated error processes. Several graphs may encode the same local independences and we characterize such equivalence classes of graphs. The number of conditions in our characterizations grows superpolynomially as a function of the size of the node set in the graph. We show that deciding Markov equivalence is coNP-complete which suggests that our characterizations cannot be improved upon substantially. We prove a global Markov property in the case of a multivariate Ornstein-Uhlenbeck process which is driven by correlated Brownian motions.


page 1

page 2

page 3

page 4


Weak equivalence of local independence graphs

Classical graphical modeling of multivariate random vectors uses graphs ...

A convex approach to optimum design of experiments with correlated observations

Optimal design of experiments for correlated processes is an increasingl...

Markov equivalence of marginalized local independence graphs

Symmetric independence relations are often studied using graphical repre...

Towards Characterizing Markov Equivalence Classes for Directed Acyclic Graphs with Latent Variables

It is well known that there may be many causal explanations that are con...

Asymptotic equivalence for nonparametric regression with dependent errors: Gauss-Markov processes

For the class of Gauss-Markov processes we study the problem of asymptot...

Towards standard imsets for maximal ancestral graphs

The imsets of <cit.> are an algebraic method for representing conditiona...

Persistent Stochastic Non-Interference

In this paper we present an information flow security property for stoch...