scientific article; zbMATH DE number 5957357

MaRDI QIDQ3093382zbMATH OpenFDO

Authors Alberto Roverato, Milan Studený

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v7/roverato06a.html

zbMATH Keywords

AMP Markov equivalencechain graphcomponent merging proceduredeflagging procedureessential graphlargest deflagged graphstrong equivalence

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graphical methods in statistics (62A09)

Recommendations

• On expressiveness of the AMP chain graph interpretation
• Characterizing Markov equivalence classes for AMP chain graph models
• A graph theoretical equivalence for Amitsur-Levitzki theorem
• The equivalence chain of a graph
• A characterization of chain graphs
• scientific article; zbMATH DE number 5291590
• On a class of amply regular graphs
• Marginal AMP chain graphs
• \(CNP\)-equivalent classes of graphs
• scientific article; zbMATH DE number 1086495

Cited in

(10)

• Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs
• Sequences of regressions and their independences
• Chain graph interpretations and their relations revisited
• Learning AMP chain graphs and some marginal models thereof under faithfulness
• Marginal AMP chain graphs
• Characterizing Markov equivalence classes for AMP chain graph models
• Two operations of merging and splitting components in a chain graph
• Multiple testing and error control in Gaussian graphical model selection
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
• On expressiveness of the chain graph interpretations

This page was built for publication:

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