Cargando…
A simple interpretation of undirected edges in essential graphs is wrong
Artificial intelligence for causal discovery frequently uses Markov equivalence classes of directed acyclic graphs, graphically represented as essential graphs, as a way of representing uncertainty in causal directionality. There has been confusion regarding how to interpret undirected edges in esse...
Autor principal: | Kummerfeld, Erich |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8031147/ https://www.ncbi.nlm.nih.gov/pubmed/33831048 http://dx.doi.org/10.1371/journal.pone.0249415 |
Ejemplares similares
-
On the Solvability of the Discrete s(x,·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs
por: Pietrusiak, Filip, et al.
Publicado: (2022) -
Efficient solution for finding Hamilton cycles in undirected graphs
por: Alhalabi, Wadee, et al.
Publicado: (2016) -
Infinite Ergodic Walks in Finite Connected Undirected Graphs †
por: Volchenkov, Dimitri
Publicado: (2021) -
Efficient orbit-aware triad and quad census in directed and undirected graphs
por: Ortmann, Mark, et al.
Publicado: (2017) -
On the asymptotic behavior of the average geodesic distance L and the compactness C(B) of simple connected undirected graphs whose order approaches infinity
por: Lokot, Tatiana, et al.
Publicado: (2021)