Causal effect identification using causal graphs is a fundamental challenge in causal inference. While extensive research has been conducted in this area, most existing methods assume the availability of fully specified directed acyclic graphs or acyclic directed mixed graphs. However, in complex domains such as medicine and epidemiology, complete causal knowledge is often unavailable, and only partial information about the system is accessible. This paper focuses on causal effect identification within partially specified causal graphs, with particular emphasis on cluster-directed mixed graphs (C-DMGs) which can represent many different acyclic directed mixed graphs (ADMGs). These graphs provide a higher-level representation of causal relationships by grouping variables into clusters, offering a more practical approach for handling complex systems. Unlike fully specified ADMGs, C-DMGs can contain cycles, which complicate their analysis and interpretation. Furthermore, their cluster-based nature introduces new challenges, as it gives rise to two distinct types of causal effects: macro causal effects and micro causal effects, each with different properties. In this work, we focus on macro causal effects, which describe the effects of entire clusters on other clusters. We establish that the do-calculus is both sound and complete for identifying these effects in C-DMGs over ADMGs when the cluster sizes are either unknown or of size greater than one. Additionally, we provide a graphical characterization of non-identifiability for macro causal effects in these graphs.
Figures & tables
Figure 1: Two ADMGs and with their compatible C-DMG. Red vertices represent the exposures of interest in and blue vertices represent the outcome of interest.
Figure 2: C-DMGs with identifiable macro causal effects. Each pair of red and blue vertices represents the causal effect we are interested in.
Figure 3: C-DMGs with not identifiable macro causal effects. Each pair of red and blue vertices represents the total effect we are interested in.
Figure 4: SC-projections of the C-DMGs in Figures 1 , 2 , and Figures 3 . Each pair of red and blue vertices represents the total effect we are interested in, and the red edges indicate those added through the SC-projection.
Figure 5: A C-DMG with the knowledge of the clusters’ size and its only two compatible ADMGs that illustrates that knowing cluster sizes affects the completeness of d-separation and the do-calculus. The C-DMG in (a) contains two clusters of size 1 and it contains an SC-Hedge. However, even in the presence of an SC-Hedge the causal effect can be identifiable since in all its compatible ADMGs ( i.e. , (b) and (c)) the causal effect remains identifiable by only applying Rule 2 of the do-calculus.
Identifying causal effects from observational data typically requires a fully specified causal graph, an assumption that is often unrealistic in complex or high-dimensional settings. Causal abstractions address this limitation by retaining only partial causal information, thereby defining equivalence classes of compatible causal graphs. In this paper, we study causal effect identifiability directly at the level of these graph collections, rather than at the level of individual causal diagrams. We formalize several notions of identifiability in this setting and organize them into a hierarchy that clarifies their relationships and differences. In particular, we establish that a causal effect may be identified over a collection of graphs without admitting a single causal derivation that holds uniformly across all compatible graphs. These results help reveal gaps and clarify ambiguities in the existing literature.
Clustering variables in causal graphs reduces the size of the graph and simplifies causal inference. However, arbitrary clustering can alter crucial causal relations among variables and lead to erroneous conclusions. While the identifiability of a causal effect in the clustered graph implies the identifiability in the original graph under mild conditions, nonidentifiability in clustered graph does not imply nonidentifiability in the original graph without further assumptions. When both identifiability and nonidentifiability are preserved, the clustering operation is called identification invariant. We present a broad class of clustering operations that are identification invariant based on conditions related to the c-components of the original graph. Finally, we demonstrate use of the results in practical settings.
Jani Nykänen, Otto Tabell, Santtu Tikka +1
Department of Mathematics and Statistics FI-40014 University of Jyvaskyla, Finland
In complex multivariate systems, interactions among variables are defined by dependency structures, often encoded as directed acyclic graphs (DAGs). However, dependency structures can vary across subjects, and ignoring this structural heterogeneity introduces bias and obscures subpopulation-specific dependencies. To address this, we propose Directed Acyclic Graph-based Dependency Clustering via Alternating Direction Method of Multipliers (DAG-DC-ADMM), a unified framework built upon Structural Equation Modeling (SEM) that jointly learns cluster assignments and cluster-specific dependency structures. We encode acyclicity via a smooth constraint and integrate a groupwise truncated Lasso fusion penalty (gTLP) to cluster subjects based on their structural similarity. This yields a nonconvex optimization problem that incorporates sparsity, acyclicity, and structural consensus constraints. We address the nonconvexity by using the augmented Lagrangian method and solve it with an adapted version of the Alternating Direction Method of Multipliers (ADMM) for difference-of-convex programs. For certain graph structures, such as upper triangular adjacency matrices, our algorithm is guaranteed to converge to a Karush-Kuhn-Tucker (KKT) point. Experiments demonstrate that our method recovers cluster-specific causal dependency structures with a high true positive rate and a low false discovery rate. This capability enables the robust discovery of heterogeneous dependencies across subjects where the subpopulation label is unknown.
Honglin Du, Muxuan Liang, Xiang Zhong
Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA · Department of Biostatistics, MD Anderson Cancer Center, Houston, TX 77030, USA