Causal Directed Acyclic Graphs [PDF]
Ari M, Lipsky, Sander, Greenland
openaire +4 more sources
Smoothed Nested Testing on Directed Acyclic Graphs. [PDF]
SummaryWe consider the problem of multiple hypothesis testing when there is a logical nested structure to the hypotheses. When one hypothesis is nested inside another, the outer hypothesis must be false if the inner hypothesis is false. We model the nested structure as a directed acyclic graph, including chain and tree graphs as special cases.
Loper JH, Lei L, Fithian W, Tansey W.
europepmc +5 more sources
Persistent Homology Over Directed Acyclic Graphs [PDF]
We define persistent homology groups over any set of spaces which have inclusions defined so that the corresponding directed graph between the spaces is acyclic, as well as along any subgraph of this directed graph. This method simultaneously generalizes
A Chistov +20 more
core +2 more sources
Constructing causal pathways for premature cardiovascular disease mortality using directed acyclic graphs with integrating evidence synthesis and expert knowledge [PDF]
Cardiovascular disease (CVD) is a major global cause of premature mortality. While multiple studies propose CVD mortality prediction models based on regression frameworks, incorporating causal understanding through causal inference approaches can enhance
Wan Shakira Rodzlan Hasani +3 more
doaj +2 more sources
In reference to ‘Directed acyclic graphs for clinical research: a tutorial’ [PDF]
Anjali Rajkumar, Vishak MS
doaj +2 more sources
The dawn of directed acyclic graphs in primary care research and education [PDF]
Hiroyoshi Iwata +2 more
doaj +2 more sources
Copula Directed Acyclic Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pircalabelu, Eugen +2 more
openaire +5 more sources
Evaluating topological ordering in directed acyclic graphs
Directed acyclic graphs are often used to model situations and problems in real life. If we consider the topological ordering of the graph as a process of arranging the vertices in the best possible way considering the constraints caused by the direction
Suzana Antunović, Damir Vukičević
doaj +1 more source
Acyclic Partitioning of Large Directed Acyclic Graphs [PDF]
Finding a good partition of a computational directed acyclic graph associated with an algorithm can help find an execution pattern improving data locality, conduct an analysis of data movement, and expose parallel steps. The partition is required to be acyclic, i.e., the inter-part edges between the vertices from different parts should preserve an ...
Herrmann, Julien +4 more
openaire +3 more sources
Reflection on modern methods: constructing directed acyclic graphs (DAGs) with domain experts for health services research. [PDF]
Rodrigues D +4 more
europepmc +2 more sources

