Fetching the paper…
Reading the bibliography…
We consider graphs that represent pairwise marginal independencies amongst a set of variables (for instance, the zero entries of a covariance matrix for normal data).
A note on the comparability graph of a tree
E. S. Wolk · 1965
Earlier work this paper cites.
Reducibility among combinatorial problems
R. M. Karp · 1972
Earlier work this paper cites.
Bound graphs of a partially ordered set
F. McMorris and T. Zaslavsky · 1982
Earlier work this paper cites.
An algorithm to recognize a middle graph
M. Skowrońska and M. M. Sysło · 1984
Earlier work this paper cites.
The logic of representing dependencies by directed graphs
J. Pearl and T. Verma · 1987
Earlier work this paper cites.
Linear dependencies represented by chain graphs
D. R. Cox and N. Wermuth · 1993
Earlier work this paper cites.
Deciding morality of graphs is NP-complete
T. Verma and J. Pearl · 1993
Earlier work this paper cites.
When Can Association Graphs Admit A Causal Interpretation? , volume 89 of Lecture Notes in Statistics , pages 205–214
J. Pearl and N. Wermuth · 1994
Earlier work this paper cites.
Graph classes: a survey , volume 3
A. Brandstädt, J. P. Spinrad, et al · 1999
Earlier work this paper cites.
Finding and counting small induced subgraphs efficiently
T. Kloks, D. Kratsch, and H. Müller · 2000
Cited alongside, same era.
Causation, prediction, and search
P. Spirtes, C. N. Glymour, and R. Scheines · 2000
Cited alongside, same era.
Posets on up to 16 points
G. Brinkmann and B. D. McKay · 2002
Cited alongside, same era.
Optimal structure identification with greedy search
D. M. Chickering · 2003
Cited alongside, same era.
A new algorithm for maximum likelihood estimation in gaussian graphical models for marginal independence
M. Drton and T. S. Richardson · 2003
Cited alongside, same era.
Markov properties for acyclic directed mixed graphs
T. S. Richardson · 2003
Cited alongside, same era.
Adjustment criteria in causal diagrams: An algorithmic perspective
J. Textor and M. Liśkiewicz · 2011
Later among the works it cites.
Kernel-based conditional independence test and application in causal discovery
K. Zhang, J. Peters, D. Janzing, and B. Schölkopf · 2011
Later among the works it cites.
Learning high-dimensional directed acyclic graphs with latent and selection variables
D. Colombo, M. H. Maathuis, M. Kalisch, and T. S. Richardson · 2012
Later among the works it cites.
Reading dependencies from covariance graphs
J. M. Peña · 2013
Later among the works it cites.
A permutation-based kernel conditional independence test
G. Doran, K. Muandet, K. Zhang, and B. Schölkopf · 2014
Later among the works it cites.
Generating causal diagrams from stochastic dependencies (in German)
A. Idelberger · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Testing conditional independence for continuous random variables
W. P. Bergsma · 2004
Cited alongside, same era.
A survey of the algorithmic properties of simplicial, upper bound and middle graphs
G. A. Cheston and T. Jap · 2006
Cited alongside, same era.
Estimating high-dimensional directed acyclic graphs with the PC-algorithm
M. Kalisch and P. Bühlmann · 2007
Cited alongside, same era.
Graphical methods for efficient likelihood inference in gaussian covariance models
M. Drton and T. S. Richardson
Cited in the paper.
Binary models for marginal independence
M. Drton and T. S. Richardson
Cited in the paper.
Learning Graphical Models With Hubs
K. M. Tan, P. London, K. Mohan, S.-I. Lee, M. Fazel, and D. Witten · 2014
Later among the works it cites.
Constructing separators and adjustment sets in ancestral graphs
B. van der Zander, M. Liśkiewicz, and J. Textor · 2014
Later among the works it cites.
The On-Line Encyclopedia of Integer Sequences
G. Wambach · 2015
Closest in time.