no code implementations • 10 Jul 2022 • Zhuangyan Fang, Ruiqi Zhao, Yue Liu, Yangbo He
Causal background knowledge about the existence or the absence of causal edges and paths is frequently encountered in observational studies.
no code implementations • 25 Feb 2021 • Zhuangyan Fang, Yue Liu, Zhi Geng, Shengyu Zhu, Yangbo He
We propose a local approach to identify whether a variable is a cause of a given target under the framework of causal graphical models of directed acyclic graphs (DAGs).
no code implementations • 10 Jun 2020 • Zhuangyan Fang, Shengyu Zhu, Jiji Zhang, Yue Liu, Zhitang Chen, Yangbo He
Despite several advances in recent years, learning causal structures represented by directed acyclic graphs (DAGs) remains a challenging task in high dimensional settings when the graphs to be learned are not sparse.
no code implementations • 23 Oct 2016 • Yangbo He, Bin Yu
A Markov equivalence class can be represented by an essential graph and its undirected subgraphs determine the size of the class.
no code implementations • 4 Mar 2013 • Yangbo He, Jinzhu Jia, Bin Yu
This supplementary material includes three parts: some preliminary results, four examples, an experiment, three new algorithms, and all proofs of the results in the paper "Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs".
no code implementations • 26 Sep 2012 • Yangbo He, Jinzhu Jia, Bin Yu
In this paper, we design reversible irreducible Markov chains on the space of Markov equivalent classes by proposing a perfect set of operators that determine the transitions of the Markov chain.