Menu
I know the definition of a DAG, which is a directed graph without any cycle. My question is: Can I consider 2 separate DAGs as one DAG? If not, what is the technical name for a set of DAGs?
730
asked Nov 03 '13 21:11
In computer science and mathematics, a directed acyclic graph (DAG) is a graph that is directed and without cycles connecting the other edges. This means that it is impossible to traverse the entire graph starting at one edge. The edges of the directed graph only go one way.
DAGs are used to encode researchers' a priori assumptions about the relationships between and among variables in causal structures. DAGs contain directed edges (arrows), linking nodes (variables), and their paths.
A directed acyclic graph (or DAG) is a digraph that has no cycles. Example of a DAG: Theorem Every finite DAG has at least one source, and at least one sink. In fact, given any vertex v, there is a path from some source to v, and a path from v to some sink.
They provide a simple visual representation of causal relationships among a set of variables. If these causal relationships are know to be true, then great. But if not, then they make it explicit what assumptions are being made. They can be used to determining if a given pair of variables are independent.
A DAG can have disconnected parts, since the only requirements are being a directed, acyclic graph.
If you want to specify that it is connected, you could say "connected DAG".
176
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
