Graphical Markov models for infinitely many variables

DOI10.1090/TRAN/7048MaRDI QIDQ4586322zbMATH OpenOpenAlexFDO

Authors David Montague, Bala Rajaratnam

Publication date 13 September 2018

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1501.07878

zbMATH Keywords

general intersection propertyglobal Markov propertygraph separationgraphical discrete processesgraphical Gaussian processesMarkov random fields

Mathematics Subject Classification ID

Foundations of stochastic processes (60G05) Gaussian processes (60G15) Random fields (60G60) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: Representing the conditional independences present in a multivariate random vector via graphs has found widespread use in applications, and such representations are popularly known as graphical models or Markov random fields. These models have many useful properties, but their fundamental attractive feature is their ability to reflect conditional independences between blocks of variables through graph separation, a consequence of the equivalence of the pairwise, local and global Markov properties demonstrated by Pearl and Paz (1985). Modern day applications often necessitate working with either an infinite collection of variables (such as in a spatial-temporal field) or approximating a large high-dimensional finite stochastic system with an infinite-dimensional system. However, it is unclear whether the conditional independences present in an infinite-dimensional random vector or stochastic process can still be represented by separation criteria in an infinite graph. In light of the advantages of using graphs as tools to represent stochastic relationships, we undertake in this paper a general study of infinite graphical models. First, we demonstrate that naive extensions of the assumptions required for the finite case results do not yield equivalence of the Markov properties in the infinite-dimensional setting, thus calling for a more in-depth analysis. To this end, we proceed to derive general conditions which do allow representing the conditional independence in an infinite-dimensional random system by means of graphs, and our results render the result of Pearl and Paz as a special case of a more general phenomenon. We conclude by demonstrating the applicability of our theory through concrete examples of infinite-dimensional graphical models.

Recommendations

• Markov properties for mixed graphs
• CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
• Graphical models for multivariate Markov chains
• Independence properties of directed markov fields
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs

Cites work

• Conditional independence for statistical operations
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Correlation theory of stationary and related random functions. Volume II: Supplementary notes and references
• Gibbs measures and phase transitions
• scientific article; zbMATH DE number 3635280 (Why is no real title available?)
• scientific article; zbMATH DE number 1249686 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 1889799 (Why is no real title available?)
• scientific article; zbMATH DE number 3223983 (Why is no real title available?)
• scientific article; zbMATH DE number 3294019 (Why is no real title available?)
• scientific article; zbMATH DE number 3085434 (Why is no real title available?)
• Hub Discovery in Partial Correlation Graphs
• Large-Scale Correlation Screening
• Limits of dense graph sequences
• Markov Random Fields and Gibbs Ensembles
• Markov random fields and their applications
• Measure theory. Vol. I and II
• Probability theory. A comprehensive course
• The Schur complement and its applications

Cited in

(1)

• Continuously indexed graphical models

This page was built for publication: Graphical Markov models for infinitely many variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4586322)