Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Annals of Statistics 2002, Vol. 30, No. 4, 9621030
 

Summary: The Annals of Statistics
2002, Vol. 30, No. 4, 9621030
ANCESTRAL GRAPH MARKOV MODELS1
BY THOMAS RICHARDSON AND PETER SPIRTES
University of Washington and Carnegie Mellon University
This paper introduces a class of graphical independence models that
is closed under marginalization and conditioning but that contains all DAG
independence models. This class of graphs, called maximal ancestral graphs,
has two attractive features: there is at most one edge between each pair
of vertices; every missing edge corresponds to an independence relation.
These features lead to a simple parameterization of the corresponding set
of distributions in the Gaussian case.
Contents
1. Introduction
2. Basic definitions and concepts
2.1. Independence models
2.2. Mixed graphs
2.3. Paths and edge sequences
2.4. Ancestors and anterior vertices
3. Ancestral graphs

  

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University

 

Collections: Mathematics