Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
稀疏高维有向无环图估计的惩罚似然方法
Directed acyclic graphs are commonly used to represent causal relationships among random variables in graphical models. Applications of these models arise in the study of physical and biological systems where directed edges between nodes represent the influence of components of the system on each other. Estimation of directed graphs from observational data is computationally NP-hard. In addition, directed graphs with the same structure may be indistinguishable based on…