Revision history of "Estimating High-Dimensional Directed Acyclic Graphs with the PC-Algorithm" (Q6482960)

From MaRDI portal

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

16 April 2025

4 February 2025

  • curprev 18:0618:06, 4 February 2025 Tconrad talk contribs 8,840 bytes +919 Created claim: description (P1459): We consider the PC-algorithm for estimating the skeleton of a very high-dimensional acyclic directed graph (DAG) with corresponding Gaussian distribution. The PC-algorithm is computationally feasible for sparse problems with many nodes, i.e. variables, and it has the attractive property to automatically achieve high computational efficiency as a function of sparseness of the true underlying DAG. We prove consistency of the algorithm for very hi...

5 September 2024

30 August 2024