-
Notifications
You must be signed in to change notification settings - Fork 37
/
CausalModel.py
630 lines (446 loc) · 16.4 KB
/
CausalModel.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
### −∗− mode : python ; −∗−
# @file CausalModel.py
# @author Bruno Goncalves
######################################################
import networkx as nx
from networkx.drawing.nx_pydot import graphviz_layout
from itertools import combinations
import numpy as np
import pandas as pd
import matplotlib as mpl
import matplotlib.pyplot as plt
import re
import base64
import requests
import warnings
warnings.filterwarnings("ignore")
from tqdm import tqdm
tqdm.pandas()
plt.style.use('./d4sci.mplstyle')
class CausalModel(object):
"""Simple Causal Model Implementation
Provides a way to represent causal DAGs
"""
def __init__(self, filename=None):
self.pos = None
if filename is not None:
self.load_model(filename)
else:
self.dag = nx.DiGraph()
self.colors = plt.rcParams['axes.prop_cycle'].by_key()['color']
def copy(self):
G = CausalModel()
G.dag = self.dag.copy()
G.pos = dict(self.pos)
G.colors = [color for color in self.colors]
return G
def add_causation(self, source, target, label=None):
"""Add a causal link between source and target with an optional label.
Parameters
----------
source : node-like
The source node
target : node-like
The target node
label : string-like or None
The label for the causal link
Returns
-------
None
Examples
--------
>>> G = CausalModel()
>>> G.add_causation('X', 'Y')
"""
if label is None:
self.dag.add_edge(source, target)
else:
self.dag.add_edge(source, target, label=label)
def load_model(self, path):
"""Initialize the CausalModel object by reading the information from the dot file with the passed path.
The file should be a `dot` file and if it contains multiple graphs, only the first such graph is returned. All graphs _except_ the first are silently ignored.
Parameters
----------
path : str or file
Filename or file handle.
Returns
-------
None
Examples
--------
>>> G = CausalModel()
>>> G.load_model('temp.dot')
Notes
-----
The heavy lifting is done by `networkx.drawing.nx_pydot.read_dot`
"""
G = nx.drawing.nx_pydot.read_dot(path)
pos = {}
for key, values in G.nodes(data=True):
if 'x' not in values:
pos = None
break
x = values['x']
y = values['y']
if x[0] == '"':
x = x[1:-1]
if y[0] == '"':
y = y[1:-1]
pos[key] = (float(x), float(y))
self.dag = nx.DiGraph(G)
self.pos = pos
def save_model(self, path):
"""Save the causal model as a `dot` file.
Parameters
----------
path : str or file
Filename or file handle.
Returns
-------
None
Examples
--------
>>> G = CausalModel()
>>> G.add_causation('X', 'Y')
>>> G.add_causation('Y', 'Z')
>>> G.pos = {'X':(-1, 0), 'Y': (0, 0), 'Z': (1, 0)}
>>> G.save_model('temp.dot')
Notes
-----
The heavy lifting is done by `networkx.drawing.nx_pydot.write_dot`
"""
G = self.dag.copy()
if self.pos is not None:
nodes = list(G.nodes())
for node in nodes:
G.nodes[node]['x'] = str(self.pos[node][0])
G.nodes[node]['y'] = str(self.pos[node][1])
nx.drawing.nx_pydot.write_dot(G, path)
def layout(self):
"""Initialize the CausalModel object by reading the information from the dot file with the passed path.
The file should be a `dot` file and if it contains multiple graphs, only the first such graph is returned. All graphs _except_ the first are silently ignored.
Parameters
----------
path : str or file
Filename or file handle.
Returns
-------
None
Examples
--------
>>> G = CausalModel()
>>> G.load_model('temp.dot')
Notes
-----
The heavy lifting is done by `networkx.drawing.nx_pydot.read_dot`
"""
pos = graphviz_layout(self.dag, 'dot')
keys = list(pos.keys())
coords = np.array([pos[key] for key in keys])
coords = nx.rescale_layout(coords, 1)
pos = dict(zip(keys, coords))
xs = []
ys = []
for key, value in pos.items():
xs.append(value[0])
ys.append(value[1])
# All xx coordinates are the same, switch x and y
# To make it horizontal instead of vertical
if len(set(xs)) == 1:
pos = {key: [-value[1], value[0]] for key, value in pos.items()}
return pos
def parents(self, node):
"""Initialize the CausalModel object by reading the information from the dot file with the passed path.
The file should be a `dot` file and if it contains multiple graphs, only the first such graph is returned. All graphs _except_ the first are silently ignored.
Parameters
----------
path : str or file
Filename or file handle.
Returns
-------
None
Examples
--------
>>> G = CausalModel()
>>> G.load_model('temp.dot')
Notes
-----
The heavy lifting is done by `networkx.drawing.nx_pydot.read_dot`
"""
return list(self.dag.predecessors(node))
def ancestors(self, node):
"""Initialize the CausalModel object by reading the information from the dot file with the passed path.
The file should be a `dot` file and if it contains multiple graphs, only the first such graph is returned. All graphs _except_ the first are silently ignored.
Parameters
----------
path : str or file
Filename or file handle.
Returns
-------
None
Examples
--------
>>> G = CausalModel()
>>> G.load_model('temp.dot')
Notes
-----
The heavy lifting is done by `networkx.drawing.nx_pydot.read_dot`
"""
return list(nx.ancestors(self.dag, node))
def children(self, source):
"""Obtain the children of a node.
Children are the nodes at the other end of outgoing edges.
Parameters
----------
source : node in `G`
The parent node
Returns
-------
list()
List of the children of `source` in `G`
Examples
--------
>>> G.children('X')
Notes
-----
The heavy lifting is done by `networkx.successors`
"""
return list(self.dag.successors(source))
def descendants(self, source):
"""Obtain the descendants of a node.
Descendants are all the nodes reacheable through outgoing edges.
Parameters
----------
path : str or file
Filename or file handle.
Returns
-------
list()
List of the descendants of `source` in `G`
Examples
--------
>>> G = CausalModel()
>>> G.load_model('temp.dot')
Notes
-----
The heavy lifting is done by `networkx.descendants`
"""
return list(nx.descendants(self.dag, source))
def directed_paths(self, source, target):
"""Initialize the CausalModel object by reading the information from the dot file with the passed path.
The file should be a `dot` file and if it contains multiple graphs, only the first such graph is returned. All graphs _except_ the first are silently ignored.
Parameters
----------
path : str or file
Filename or file handle.
Returns
-------
None
Examples
--------
>>> G = CausalModel()
>>> G.load_model('temp.dot')
Notes
-----
The heavy lifting is done by `networkx.drawing.nx_pydot.read_dot`
"""
return {tuple(path) for path in nx.all_simple_paths(self.dag, source, target)}
def all_paths(self, source, target):
"""Initialize the CausalModel object by reading the information from the dot file with the passed path.
The file should be a `dot` file and if it contains multiple graphs, only the first such graph is returned. All graphs _except_ the first are silently ignored.
Parameters
----------
path : str or file
Filename or file handle.
Returns
-------
None
Examples
--------
>>> G = CausalModel()
>>> G.load_model('temp.dot')
Notes
-----
The heavy lifting is done by `networkx.drawing.nx_pydot.read_dot`
"""
return {tuple(path) for path in nx.all_simple_paths(self.dag.to_undirected(), source, target)}
def all_paths_conditional(self, source, target, remove):
"""Initialize the CausalModel object by reading the information from the dot file with the passed path.
The file should be a `dot` file and if it contains multiple graphs, only the first such graph is returned. All graphs _except_ the first are silently ignored.
Parameters
----------
path : str or file
Filename or file handle.
Returns
-------
None
Examples
--------
>>> G = CausalModel()
>>> G.load_model('temp.dot')
Notes
-----
The heavy lifting is done by `networkx.drawing.nx_pydot.read_dot`
"""
dag = self.dag.to_undirected()
dag.remove_nodes_from(remove)
return {tuple(path) for path in nx.all_simple_paths(dag, source, target)}
def plot_path(self, path, edges=False, ax=None, lw=3):
"""Initialize the CausalModel object by reading the information from the dot
file with the passed path.
The file should be a `dot` file and if it contains multiple graphs, only the
first such graph is returned. All graphs _except_ the first are silently ignored.
Parameters
----------
path : str or file
Filename or file handle.
Returns
-------
None
Examples
--------
>>> G = CausalModel()
>>> G.load_model('temp.dot')
Notes
-----
The heavy lifting is done by `networkx.drawing.nx_pydot.read_dot`
"""
fig = None
if ax == None:
fig, ax = plt.subplots(1)
if edges:
edgelist = path
else:
edgelist = {(path[i], path[i+1]) for i in range(len(path)-1)}
edges = set(self.dag.edges()) - set(edgelist)
nx.draw(self.dag, self.pos, node_color=self.colors[0], ax=ax, edgelist=[])
nx.draw_networkx_labels(self.dag, self.pos, ax=ax)
nx.draw_networkx_edges(self.dag, self.pos,
edgelist=edgelist,
width=lw, edge_color=self.colors[1], ax=ax)
nx.draw_networkx_edges(self.dag, self.pos,
edgelist=edges,
width=1, ax=ax)
if fig is not None:
fig.tight_layout()
def inputs(self):
nodes = set()
for node, deg in self.dag.in_degree():
if deg == 0:
nodes.add(node)
return nodes
def outputs(self):
nodes = set()
for node, deg in self.dag.out_degree():
if deg == 0:
nodes.add(node)
return nodes
def plot(self, output=None, pos=None, legend=False, ax=None, colors=False):
if pos is None:
if self.pos is None:
self.pos = self.layout()
pos = self.pos
nodes = list(pos.keys())
inputs = self.inputs()
outputs = self.outputs()
node_colors = []
node_pos = []
for node in nodes:
node_pos.append(pos[node])
if colors:
if node in inputs:
node_colors.append(self.colors[2])
elif node in outputs:
node_colors.append(self.colors[1])
else:
node_colors.append(self.colors[0])
else:
node_colors.append(self.colors[0])
node_pos = np.array(node_pos)
if ax is None:
ax = nx.draw(self.dag, pos, nodelist=nodes, node_color=node_colors)#, node_size=300)
else:
nx.draw(self.dag, pos, nodelist=nodes, node_color=node_colors, ax=ax)#, node_size=300)
labels = {(node_i, node_j) : label for node_i, node_j, label in self.dag.edges(data='label', default='')}
nx.draw_networkx_labels(self.dag, pos, ax=ax)
nx.draw_networkx_edge_labels(self.dag, pos, labels, ax=ax)
if legend:
node_types = ['Regular node', 'Input', 'Output']
node_colors = [self.colors[0], self.colors[2], self.colors[1]]
patches = [mpl.patches.Patch(color=node_colors[i], label=label) for i, label in enumerate(node_types)]
plt.legend(handles=patches, fontsize=10)
plt.gcf().tight_layout()
if output is None:
plt.show()
else:
plt.savefig(output, dpi=300)
plt.close()
def v_structures(self):
structs = set()
degrees = dict(self.dag.in_degree())
for node in degrees:
if degrees[node] >= 2:
for edge_i, edge_j in combinations(self.dag.in_edges(node), 2):
node_i = edge_i[0]
node_j = edge_j[0]
if not (node_i, node_j) in self.dag.edges and not (node_j, node_i) in self.dag.edges:
structs.add(tuple(sorted([edge_i, edge_j])))
return structs
def equivalence_class(self):
edges = list(self.dag.edges(data=True))
equivalent = [[self.copy(), []]]
structs = self.v_structures()
for i, edge in enumerate(edges):
new_edges = list(edges)
new_edges[i] = (edge[1], edge[0], edge[2])
G = CausalModel()
G.dag.add_edges_from(new_edges)
new_structs = CausalModel.v_structures(G)
if new_structs == structs and len(list(nx.simple_cycles(G.dag)))==0:
G.pos = dict(self.pos)
G.colors = [color for color in self.colors]
equivalent.append([G, new_edges[i][:2]])
return equivalent
def basis_set(self):
nodes = set(self.dag.nodes())
eqn = []
for node in nodes:
parents = set(self.parents(node))
descendants = set(self.descendants(node))
others = {n for n in nodes if n != node}
others -= parents
others -= descendants
others = sorted(others)
parents = sorted(parents)
if len(others) > 0:
if len(parents) > 0:
eqn.append('%s _||_ %s | %s' % (node, ", ".join(others), ', '.join(parents)))
else:
eqn.append('%s _||_ %s' % (node, ", ".join(others)))
return sorted(eqn)
def intervention_graph(self, nodes, drop_nodes=False):
G = self.copy()
for node in nodes:
G.dag.remove_edges_from(list(self.dag.in_edges('X')))
if drop_nodes:
degrees = dict(G.dag.degree())
remove = []
for node in degrees:
if degrees[node] == 0:
remove.append(node)
G.dag.remove_nodes_from(remove)
return G
if __name__ == "__main__":
names = ['m331', 'moAh6a6', 'vcFQ']
graph_id = 'temp'#names[2]
G = CausalModel()#graph_id)
G.load_model('dags/Causality.Fig.1.2.dot')
equivalent = G.equivalence_class()
fig, ax_lst = plt.subplots(3, 1, figsize=(6, 2.2))
ax_lst = np.array(ax_lst).flatten()
#G.plot(ax=ax_lst[0])
for i in range(len(equivalent)):
G.plot_path(equivalent[i], ax=ax_lst[i+1])
#ax_lst[-1].axis('off')
plt.show()
fig.tight_layout()