Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1033.60008
Richardson, Thomas; Spirtes, Peter
Ancestral graph Markov models. (English)
[J] Ann. Stat. 30, No. 4, 962-1030 (2002). ISSN 0090-5364

Summary: 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.

MSC 2000:: *60C05 Combinatorial probability
05C20 Directed graphs (digraphs)
62M45 Neural nets and related approaches
68R10 Graph theory in connection with computer science
68T30 Knowledge representation

Cited in: Zbl 1092.05066

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Article Journal Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]