Skip to content

huge_network (39 nodes)

The full 39-node synthetic network (data/huge_network.json). Maximum parent count: 7. Three nodes (node1, node24, node36) share an identical 5-parent set (node25, node13, node16, node17, node37); their entry into the topological prefix at sizes 32, 33, 34 is the topology event responsible for the selective-eviction phase transition discussed in the lazy-bayes evaluation.

Bayesian network (DAG)

flowchart TB
    node1["node1"]
    node2["node2"]
    node3["node3"]
    node4["node4"]
    node5["node5"]
    node6["node6"]
    node7["node7"]
    node8["node8"]
    node9["node9"]
    node10["node10"]
    node11["node11"]
    node12["node12"]
    node13["node13"]
    node14["node14"]
    node15["node15"]
    node16["node16"]
    node17["node17"]
    node18["node18"]
    node19["node19"]
    node20["node20"]
    node21["node21"]
    node22["node22"]
    node23["node23"]
    node24["node24"]
    node25["node25"]
    node26["node26"]
    node27["node27"]
    node28["node28"]
    node29["node29"]
    node30["node30"]
    node31["node31"]
    node32["node32"]
    node33["node33"]
    node34["node34"]
    node35["node35"]
    node36["node36"]
    node37["node37"]
    node38["node38"]
    node39["node39"]
    node25 --> node1
    node13 --> node1
    node16 --> node1
    node17 --> node1
    node37 --> node1
    node3 --> node2
    node4 --> node2
    node5 --> node2
    node6 --> node2
    node7 --> node2
    node8 --> node2
    node9 --> node2
    node11 --> node10
    node12 --> node10
    node14 --> node13
    node15 --> node13
    node23 --> node17
    node18 --> node17
    node19 --> node18
    node20 --> node18
    node21 --> node18
    node22 --> node18
    node25 --> node24
    node13 --> node24
    node16 --> node24
    node17 --> node24
    node37 --> node24
    node26 --> node25
    node27 --> node25
    node28 --> node25
    node29 --> node25
    node30 --> node25
    node1 --> node31
    node24 --> node31
    node1 --> node32
    node24 --> node32
    node1 --> node33
    node24 --> node33
    node1 --> node34
    node24 --> node34
    node1 --> node35
    node24 --> node35
    node25 --> node36
    node13 --> node36
    node16 --> node36
    node17 --> node36
    node37 --> node36
    node38 --> node37
    node39 --> node37
    node2 --> node38
    node10 --> node38

Junction tree

Cliques labelled with their variable sets; edges labelled with the separator (the intersection of the two cliques' domains).

flowchart LR
    C0["C0<br/>node1, node13, node16, node17, node24, node25, node37"]
    C1["C1<br/>node1, node24, node31"]
    C2["C2<br/>node1, node24, node32"]
    C3["C3<br/>node1, node24, node33"]
    C4["C4<br/>node1, node24, node34"]
    C5["C5<br/>node1, node24, node35"]
    C6["C6<br/>node2, node3, node4, node5, node6, node7, node8, node9"]
    C7["C7<br/>node2, node10, node38"]
    C8["C8<br/>node10, node11, node12"]
    C9["C9<br/>node13, node14, node15"]
    C10["C10<br/>node13, node16, node17, node25, node36, node37"]
    C11["C11<br/>node17, node18, node23"]
    C12["C12<br/>node18, node19, node20, node21, node22"]
    C13["C13<br/>node25, node26, node27, node28, node29, node30"]
    C14["C14<br/>node37, node38, node39"]
    C0 ---|"node1, node24"| C1
    C0 ---|"node1, node24"| C2
    C0 ---|"node1, node24"| C3
    C0 ---|"node1, node24"| C4
    C0 ---|"node1, node24"| C5
    C0 ---|"node13"| C9
    C0 ---|"node13, node16, node17, node25, node37"| C10
    C0 ---|"node17"| C11
    C0 ---|"node25"| C13
    C0 ---|"node37"| C14
    C6 ---|"node2"| C7
    C7 ---|"node10"| C8
    C7 ---|"node38"| C14
    C11 ---|"node18"| C12