tutorial on causality using probability trees(deepmind).ipynb

{
  "nbformat": 4,
  "nbformat_minor": 0,
  "metadata": {
    "colab": {
      "name": "Copy of Causality Tutorial.ipynb",
      "provenance": [],
      "collapsed_sections": [],
      "include_colab_link": true
    },
    "kernelspec": {
      "display_name": "Python 3",
      "language": "python",
      "name": "python3"
    },
    "language_info": {
      "codemirror_mode": {
        "name": "ipython",
        "version": 3
      },
      "file_extension": ".py",
      "mimetype": "text/x-python",
      "name": "python",
      "nbconvert_exporter": "python",
      "pygments_lexer": "ipython3",
      "version": "3.7.3"
    }
  },
  "cells": [
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "view-in-github",
        "colab_type": "text"
      },
      "source": [
        "<a href=\"https://colab.research.google.com/github/khwajawisal/Using_Synthetic_gradients/blob/master/tutorial%20on%20causality%20using%20probability%20trees(deepmind).ipynb\" target=\"_parent\"><img src=\"https://colab.research.google.com/assets/colab-badge.svg\" alt=\"Open In Colab\"/></a>"
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "N1EHYIqxd80m"
      },
      "source": [
        "> Copyright 2020 DeepMind Technologies Limited.\n",
        ">\n",
        "> Licensed under the Apache License, Version 2.0 (the \"License\");\n",
        "> you may not use this file except in compliance with the License.\n",
        "> \n",
        "> You may obtain a copy of the License at\n",
        "> https://www.apache.org/licenses/LICENSE-2.0\n",
        "> \n",
        "> Unless required by applicable law or agreed to in writing, software\n",
        "> distributed under the License is distributed on an \"AS IS\" BASIS,\n",
        "> WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n",
        "> See the License for the specific language governing permissions and\n",
        "> limitations under the License."
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "qHP8zlWs1OUN"
      },
      "source": [
        "# **Tutorial: Causal Reasoning in Probability Trees**\n",
        "\n",
        "*By the AGI Safety Analysis Team @ DeepMind.*\n",
        "\n",
        "**Summary:** This is the companion tutorial for the paper \"Algorithms\n",
        "for Causal Reasoning in Probability trees\" by Genewein T. et al. (2020).\n",
        "\n",
        "Probability trees are one of the simplest models of causal\n",
        "generative processes.They possess clean semantics and are strictly more general\n",
        "than causal Bayesian networks, being able to e.g. represent causal relations\n",
        "that causal Bayesian networks can’t. Even so, they have received little\n",
        "attention from the AI and ML community.\n",
        "\n",
        "In this tutorial we present new algorithms for causal reasoning in discrete\n",
        "probability trees that cover the entire causal hierarchy (association,\n",
        "intervention, and counterfactuals), operating on arbitrary logical and causal\n",
        "events."
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "XUQVMuc2_VlG"
      },
      "source": [
        "\n",
        "# Part I: Basics\n",
        "\n"
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "P4cjtJaR_VlH"
      },
      "source": [
        "### Setup\n",
        "\n",
        "First we install the `graphviz` package:"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "JlbLG8sy_VlI",
        "outputId": "14f98714-3098-4cda-bc65-8514c5ffb973",
        "colab": {
          "base_uri": "https://localhost:8080/"
        }
      },
      "source": [
        "!apt-get install graphviz\n",
        "!pip install graphviz"
      ],
      "execution_count": null,
      "outputs": [
        {
          "output_type": "stream",
          "text": [
            "Reading package lists... Done\n",
            "Building dependency tree       \n",
            "Reading state information... Done\n",
            "graphviz is already the newest version (2.40.1-2).\n",
            "0 upgraded, 0 newly installed, 0 to remove and 11 not upgraded.\n",
            "Requirement already satisfied: graphviz in /usr/local/lib/python3.6/dist-packages (0.10.1)\n"
          ],
          "name": "stdout"
        }
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "KxQFfJio_VlM"
      },
      "source": [
        "### Imports and data structures\n",
        "\n",
        "We import Numpy and Pyplot, and then we define the basic data structures for\n",
        "this tutorial."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "cellView": "both",
        "id": "HFs6Q37E_VlM"
      },
      "source": [
        "#@title Imports\n",
        "\n",
        "import numpy as np\n",
        "import matplotlib as mpl\n",
        "import matplotlib.pyplot as plt"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "code",
      "metadata": {
        "cellView": "form",
        "id": "yTTsE6f1_oIA"
      },
      "source": [
        "#@title Data structures\n",
        "\n",
        "import graphviz\n",
        "import copy\n",
        "from random import random\n",
        "\n",
        "\n",
        "class MinCut:\n",
        "  \"\"\"A representation of an event in a probability tree.\"\"\"\n",
        "\n",
        "  def __init__(self, root, t=frozenset(), f=frozenset()):\n",
        "    self._root = root\n",
        "    self.t = t\n",
        "    self.f = f\n",
        "\n",
        "  def __str__(self):\n",
        "\n",
        "    true_elements = ', '.join([str(id) for id in sorted(self.t)])\n",
        "    false_elements = ', '.join([str(id) for id in sorted(self.f)])\n",
        "    return '{true: {' + true_elements + '}, false: {' + false_elements + '}}'\n",
        "\n",
        "  def __reptr__(self):\n",
        "    return self.__str__()\n",
        "\n",
        "  # Proposition\n",
        "  def prop(root, statement):\n",
        "    cond_lst = Node._parse_statements(statement)\n",
        "\n",
        "    # Complain if more than one statement.\n",
        "    if len(cond_lst) != 1:\n",
        "      raise Exception('\\'prop\\' takes one and only one statement.')\n",
        "      return None\n",
        "\n",
        "    # Remove list envelope.\n",
        "    cond = cond_lst[0]\n",
        "\n",
        "    # Recurse.\n",
        "    return MinCut._prop(root, root, cond)\n",
        "\n",
        "  def _prop(root, node, cond):\n",
        "    # Take var and val of condition.\n",
        "    condvar, condval = cond\n",
        "\n",
        "    # Search for variable.\n",
        "    for var, val in node.assign:\n",
        "      if condvar == var:\n",
        "        if condval == val:\n",
        "          return MinCut(root, frozenset([node.id]), frozenset())\n",
        "        else:\n",
        "          return MinCut(root, frozenset(), frozenset([node.id]))\n",
        "\n",
        "    # If we reach a leaf node and the variable isn't resolved,\n",
        "    # raise an exception.\n",
        "    if not node.children:\n",
        "      msg = 'Node ' + str(node.id) + ': ' \\\n",
        "          + 'min-cut for condition \"' + condvar + ' = ' \\\n",
        "          + condval + '\" is undefined.'\n",
        "      raise Exception(msg)\n",
        "\n",
        "    # Variable not found, recurse.\n",
        "    t_set = frozenset()\n",
        "    f_set = frozenset()\n",
        "    for child in node.children:\n",
        "      _, subnode = child\n",
        "      subcut = MinCut._prop(root, subnode, cond)\n",
        "      t_set = t_set.union(subcut.t)\n",
        "      f_set = f_set.union(subcut.f)\n",
        "\n",
        "    # Consolidate into node if children are either only true or false nodes.\n",
        "    cut = MinCut(root, t_set, f_set)\n",
        "    if not cut.f:\n",
        "      cut.t = frozenset([node.id])\n",
        "    elif not cut.t:\n",
        "      cut.f = frozenset([node.id])\n",
        "\n",
        "    return cut\n",
        "\n",
        "  # Negation\n",
        "  def neg(self):\n",
        "    return MinCut(self._root, t=self.f, f=self.t)\n",
        "\n",
        "  def __invert__(self):\n",
        "    return self.neg()\n",
        "\n",
        "  # Conjunction\n",
        "  def conj(root, cut1, cut2):\n",
        "    return MinCut._conj(root, root, cut1, cut2, False, False)\n",
        "\n",
        "  def _conj(root, node, cut1, cut2, end1=False, end2=False):\n",
        "    # Base case.\n",
        "    if (node.id in cut1.f) or (node.id in cut2.f):\n",
        "      return MinCut(root, frozenset(), frozenset([node.id]))\n",
        "    if node.id in cut1.t:\n",
        "      end1 = True\n",
        "    if node.id in cut2.t:\n",
        "      end2 = True\n",
        "    if end1 and end2:\n",
        "      return MinCut(root, frozenset([node.id]), frozenset())\n",
        "\n",
        "    # Recurse.\n",
        "    t_set = frozenset()\n",
        "    f_set = frozenset()\n",
        "    for _, subnode in node.children:\n",
        "      subcut = MinCut._conj(root, subnode, cut1, cut2, end1, end2)\n",
        "      t_set = t_set.union(subcut.t)\n",
        "      f_set = f_set.union(subcut.f)\n",
        "\n",
        "    # Consolidate into node if children are either only true or false nodes.\n",
        "    cut = MinCut(root, t_set, f_set)\n",
        "    if not cut.f:\n",
        "      cut.t = frozenset([node.id])\n",
        "    elif not cut.t:\n",
        "      cut.f = frozenset([node.id])\n",
        "    return cut\n",
        "\n",
        "  def __and__(self, operand):\n",
        "    return MinCut.conj(self._root, self, operand)\n",
        "\n",
        "  # Disjunction\n",
        "  def disj(root, cut1, cut2):\n",
        "    return MinCut.neg(MinCut.conj(root, MinCut.neg(cut1), MinCut.neg(cut2)))\n",
        "\n",
        "  def __or__(self, operand):\n",
        "    return MinCut.disj(self._root, self, operand)\n",
        "\n",
        "  # Causal dependence\n",
        "  def precedes(root, cut_c, cut_e):\n",
        "    return MinCut._precedes(root, root, cut_c, cut_e, False)\n",
        "\n",
        "  def _precedes(root, node, cut_c, cut_e, found_c):\n",
        "    # Base case.\n",
        "    if not found_c:\n",
        "      if (node.id in cut_e.t or node.id in cut_e.f or node.id in cut_c.f):\n",
        "        return MinCut(root, frozenset(), frozenset([node.id]))\n",
        "      if (node.id in cut_c.t):\n",
        "        found_c = True\n",
        "    if found_c:\n",
        "      if (node.id in cut_e.t):\n",
        "        return MinCut(root, frozenset([node.id]), frozenset())\n",
        "      if (node.id in cut_e.f):\n",
        "        return MinCut(root, frozenset(), frozenset([node.id]))\n",
        "\n",
        "    # Recursion.\n",
        "    t_set = frozenset()\n",
        "    f_set = frozenset()\n",
        "    for _, subnode in node.children:\n",
        "      subcut = MinCut._precedes(root, subnode, cut_c, cut_e, found_c)\n",
        "      t_set = t_set.union(subcut.t)\n",
        "      f_set = f_set.union(subcut.f)\n",
        "\n",
        "    # Consolidate into node if children are either only true or false nodes.\n",
        "    cut = MinCut(root, t_set, f_set)\n",
        "    if not cut.f:\n",
        "      cut.t = frozenset([node.id])\n",
        "    elif not cut.t:\n",
        "      cut.f = frozenset([node.id])\n",
        "    return cut\n",
        "\n",
        "  def __lt__(self, operand):\n",
        "    return MinCut.precedes(self._root, self, operand)\n",
        "\n",
        "\n",
        "class Critical:\n",
        "  \"\"\"A representation of the critical set associated to an event.\"\"\"\n",
        "\n",
        "  # Constructor\n",
        "  def __init__(self, s=frozenset()):\n",
        "    self.s = s\n",
        "\n",
        "  def __str__(self):\n",
        "    elements = ', '.join([str(id) for id in sorted(self.s)])\n",
        "    return '{' + elements + '}'\n",
        "\n",
        "  def __reptr__(self):\n",
        "    return self.__str__()\n",
        "\n",
        "  def critical(root, cut):\n",
        "    _, crit = Critical._critical(root, cut)\n",
        "    return crit\n",
        "\n",
        "  def _critical(node, cut):\n",
        "    # Base case.\n",
        "    if node.id in cut.t:\n",
        "      return (False, Critical(frozenset()))\n",
        "    if node.id in cut.f:\n",
        "      return (True, Critical(frozenset()))\n",
        "    # Recurse.\n",
        "    s = frozenset()\n",
        "    for _, subnode in node.children:\n",
        "      incut, subcrit = Critical._critical(subnode, cut)\n",
        "      if incut:\n",
        "        s = s.union(frozenset([node.id]))\n",
        "      else:\n",
        "        s = s.union(subcrit.s)\n",
        "\n",
        "    return (False, Critical(s))\n",
        "\n",
        "\n",
        "class Node:\n",
        "  \"\"\"A node in probability tree.\"\"\"\n",
        "\n",
        "  # Constructor.\n",
        "  def __init__(self, uid, statements, children=None):\n",
        "    # Automatically assigned ID.\n",
        "    self.id = uid\n",
        "\n",
        "    # Assignments.\n",
        "    if isinstance(statements, str):\n",
        "      self.assign = Node._parse_statements(statements)\n",
        "    else:\n",
        "      self.assign = statements\n",
        "\n",
        "    # Children.\n",
        "    if children is None:\n",
        "      self.children = []\n",
        "    else:\n",
        "      self.children = children\n",
        "\n",
        "  # Parse statements.\n",
        "  def _parse_statements(statements):\n",
        "    statement_list = statements.split(',')\n",
        "    pair_list = [x.split('=') for x in statement_list]\n",
        "    assign = [(var.strip(), val.strip()) for var, val in pair_list]\n",
        "    return assign\n",
        "\n",
        "  # Sample.\n",
        "  def sample(self):\n",
        "    return self._sample(dict())\n",
        "\n",
        "  def _sample(self, smp):\n",
        "    # Add new assignments.\n",
        "    newsmp = {var: val for var, val in self.assign}\n",
        "    smp = dict(smp, **newsmp)\n",
        "\n",
        "    # Base case.\n",
        "    if not self.children:\n",
        "      return smp\n",
        "\n",
        "    # Recurse.\n",
        "    rnum = random()\n",
        "    for child in self.children:\n",
        "      subprob, subnode = child\n",
        "      rnum -= subprob\n",
        "      if rnum <= 0:\n",
        "        return subnode._sample(smp)\n",
        "\n",
        "    # Something went wrong: probabilities aren't normalized.\n",
        "    msg = 'Node ' + str(self.id) + ': ' \\\n",
        "      + 'probabilities of transitions do not add up to one.'\n",
        "    raise Exception(msg)\n",
        "\n",
        "  # Insert.\n",
        "  def insert(self, prob, node):\n",
        "    self.children.append((prob, node))\n",
        "\n",
        "  # Compute probability of cut.\n",
        "  def prob(self, cut):\n",
        "    return self._prob(cut, 1.0)\n",
        "\n",
        "  def _prob(self, cut, prob):\n",
        "    # Base case.\n",
        "    if self.id in cut.t:\n",
        "      return prob\n",
        "    if self.id in cut.f:\n",
        "      return 0.0\n",
        "\n",
        "    # Recurse.\n",
        "    probsum = 0.0\n",
        "    for child in self.children:\n",
        "      subprob, subnode = child\n",
        "      resprob = subnode._prob(cut, prob * subprob)\n",
        "      probsum += resprob\n",
        "\n",
        "    return probsum\n",
        "\n",
        "  # Return a dictionary with all the random variables and their values.\n",
        "  def rvs(self):\n",
        "    sts = dict()\n",
        "    return self._rvs(sts)\n",
        "\n",
        "  def _rvs(self, sts):\n",
        "    for var, val in self.assign:\n",
        "      if not (var in sts):\n",
        "        sts[var] = list()\n",
        "      if not (val in sts[var]):\n",
        "        sts[var].append(val)\n",
        "\n",
        "    for _, subnode in self.children:\n",
        "      sts = subnode._rvs(sts)\n",
        "\n",
        "    return sts\n",
        "\n",
        "  # Auxiliary function for computing the list of children.\n",
        "  def _normalize_children(children, probsum, logsum):\n",
        "    newchildren = None\n",
        "    if probsum > 0.0:\n",
        "      newchildren = [\n",
        "          (subprob / probsum, subnode) for _, subprob, subnode in children\n",
        "      ]\n",
        "    else:\n",
        "      newchildren = [\n",
        "          (sublog / logsum, subnode) for sublog, _, subnode in children\n",
        "      ]\n",
        "    return newchildren\n",
        "\n",
        "  # Conditioning\n",
        "  def see(self, cut):\n",
        "    root = copy.deepcopy(self)\n",
        "    root._see(cut, 1.0)\n",
        "    return root\n",
        "\n",
        "  def _see(self, cut, prob):\n",
        "    # Base case.\n",
        "    if self.id in cut.t:\n",
        "      newnode = Node(self.id, self.assign)\n",
        "      return (1.0, prob)\n",
        "    if self.id in cut.f:\n",
        "      newnode = Node(self.id, self.assign)\n",
        "      return (0.0, 0.0)\n",
        "\n",
        "    # Recurse.\n",
        "    newchildren = []\n",
        "    probsum = 0.0\n",
        "    logsum = 0.0\n",
        "    for subprob, subnode in self.children:\n",
        "      reslog, resprob = subnode._see(cut, prob * subprob)\n",
        "\n",
        "      newchildren.append((reslog, resprob, subnode))\n",
        "      logsum += reslog\n",
        "      probsum += resprob\n",
        "\n",
        "    # Normalize.\n",
        "    self.children = Node._normalize_children(newchildren, probsum, logsum)\n",
        "\n",
        "    return (1.0, probsum)\n",
        "\n",
        "  # Causal intervention\n",
        "  def do(self, cut):\n",
        "    root = copy.deepcopy(self)\n",
        "    root._do(cut)\n",
        "    return root\n",
        "\n",
        "  def _do(self, cut):\n",
        "    # Base case.\n",
        "    if self.id in cut.t:\n",
        "      return True\n",
        "    if self.id in cut.f:\n",
        "      return False\n",
        "\n",
        "    # Recurse.\n",
        "    newchildren = []\n",
        "    probsum = 0.0\n",
        "    logsum = 0.0\n",
        "    for subprob, subnode in self.children:\n",
        "      resdo = subnode._do(cut)\n",
        "\n",
        "      if resdo:\n",
        "        newchildren.append((1.0, subprob, subnode))\n",
        "        probsum += subprob\n",
        "        logsum += 1.0\n",
        "      else:\n",
        "        newchildren.append((0.0, 0.0, subnode))\n",
        "\n",
        "    # Normalize.\n",
        "    self.children = Node._normalize_children(newchildren, probsum, logsum)\n",
        "\n",
        "    return (1.0, probsum)\n",
        "\n",
        "  # Counterfactual/subjunctive conditional\n",
        "  def cf(self, root_prem, cut_subj):\n",
        "    root_subj = self.do(cut_subj)\n",
        "    root_subj._cf(root_prem, cut_subj)\n",
        "    return root_subj\n",
        "\n",
        "  def _cf(self, prem, cut):\n",
        "    # Base case.\n",
        "    if self.id in cut.t:\n",
        "      return True\n",
        "    if self.id in cut.f:\n",
        "      return False\n",
        "\n",
        "    # Recurse.\n",
        "    critical = False\n",
        "\n",
        "    for child, child_prem in zip(self.children, prem.children):\n",
        "      (_, subnode) = child\n",
        "      (_, subnode_prem) = child_prem\n",
        "      in_do = subnode._cf(subnode_prem, cut)\n",
        "      if not in_do:\n",
        "        critical = True\n",
        "        continue\n",
        "\n",
        "    # Pick children if node is critical.\n",
        "    if not critical:\n",
        "      self.children = [\n",
        "          (subprob, subnode)\n",
        "          for (_, subnode), (subprob, _) in zip(self.children, prem.children)\n",
        "      ]\n",
        "\n",
        "    return True\n",
        "\n",
        "  # Show probability tree.\n",
        "  def show(self, show_id=False, show_prob=False, cut=None, crit=None):\n",
        "    # Initialize Digraph.\n",
        "    graph_attr = {\n",
        "        'bgcolor': 'White',\n",
        "        'rankdir': 'LR',\n",
        "        'nodesep': '0.1',\n",
        "        'ranksep': '0.3',\n",
        "        'sep': '0'\n",
        "    }\n",
        "    node_attr = {\n",
        "        'style': 'rounded',\n",
        "        'shape': 'box',\n",
        "        'height': '0.1',\n",
        "        'width': '0.5',\n",
        "        'fontsize': '10',\n",
        "        'margin': '0.1, 0.02'\n",
        "    }\n",
        "    edge_attr = {'fontsize': '10'}\n",
        "    g = graphviz.Digraph(\n",
        "        'g',\n",
        "        format='svg',\n",
        "        graph_attr=graph_attr,\n",
        "        node_attr=node_attr,\n",
        "        edge_attr=edge_attr)\n",
        "\n",
        "    # Recursion.\n",
        "    return self._show(\n",
        "        g, 1.0, show_id=show_id, show_prob=show_prob, cut=cut, crit=crit)\n",
        "\n",
        "  def _show(self, g, prob, show_id=False, show_prob=False, cut=None, crit=None):\n",
        "    # Create label.\n",
        "    labels = [name + ' = ' + value for name, value in self.assign]\n",
        "    node_label = '\\n'.join(labels)\n",
        "    if show_id:\n",
        "      node_label = str(self.id) + '\\n' + node_label\n",
        "    if show_prob:\n",
        "      node_label = node_label + '\\np = ' + '{0:.3g}'.format(prob)\n",
        "\n",
        "    # Decorate node.\n",
        "    attr = {'style': 'filled, rounded', 'fillcolor': 'WhiteSmoke'}\n",
        "    if not (cut is None):\n",
        "      if self.id in cut.t:\n",
        "        attr = {'style': 'filled, rounded', 'fillcolor': 'AquaMarine'}\n",
        "      elif self.id in cut.f:\n",
        "        attr = {'style': 'filled, rounded', 'fillcolor': 'LightCoral'}\n",
        "    if not (crit is None):\n",
        "      if self.id in crit.s:\n",
        "        attr = {'style': 'filled, rounded', 'fillcolor': 'Plum'}\n",
        "    g.node(str(self.id), label=node_label, **attr)\n",
        "\n",
        "    # Recurse.\n",
        "    for child in self.children:\n",
        "      subprob, subnode = child\n",
        "      subnode._show(\n",
        "          g,\n",
        "          prob * subprob,\n",
        "          show_id=show_id,\n",
        "          show_prob=show_prob,\n",
        "          cut=cut,\n",
        "          crit=crit)\n",
        "      g.edge(str(self.id), str(subnode.id), label='{0:.3g}'.format(subprob))\n",
        "\n",
        "    return g\n",
        "\n",
        "  def find(self, uid):\n",
        "    if self.id == uid:\n",
        "      return self\n",
        "\n",
        "    for child in self.children:\n",
        "      subprob, subnode = child\n",
        "      found_node = subnode.find(uid)\n",
        "      if found_node is not None:\n",
        "        return found_node\n",
        "\n",
        "    return None\n",
        "\n",
        "\n",
        "class PTree:\n",
        "  \"\"\"A probability tree.\"\"\"\n",
        "\n",
        "  def __init__(self):\n",
        "    \"\"\"Create a probability tree.\"\"\"\n",
        "    self._root = None\n",
        "    self._count = 0\n",
        "\n",
        "  def root(self, statements, children=None):\n",
        "    \"\"\"Sets the root node.\n",
        "\n",
        "        Parameters\n",
        "        ----------\n",
        "        statements : str\n",
        "            A string containing a comma-separated list of statements of\n",
        "            the form \"var = val\", such as \"X=1, Y=0\". These are the\n",
        "            values resolved by the root node.\n",
        "        children : list((float, Node)), (default: None)\n",
        "            A list of (probability, child node) pairs. These are the root\n",
        "            node's children and their transition probabilities.\n",
        "\n",
        "        Returns\n",
        "        -------\n",
        "        Node\n",
        "            the root node of the probability tree.\n",
        "        \"\"\"\n",
        "    self._count += 1\n",
        "    self._root = Node(self._count, statements, children)\n",
        "    return self._root\n",
        "\n",
        "  def child(self, prob, statements, children=None):\n",
        "    \"\"\"Create a child node and its transition probability.\n",
        "\n",
        "        Parameters\n",
        "        ----------\n",
        "        prob : float\n",
        "            The probability of the transition\n",
        "        statements : str\n",
        "            A string containing a comma-separated list of statements of\n",
        "            the form \"var = val\", such as \"X=1, Y=0\". These are the\n",
        "            values resolved by the child node.\n",
        "        children : list((float, Node)), (default: None)\n",
        "            A list of (probability, child node) pairs to be set as the\n",
        "            children of the node.\n",
        "\n",
        "        Returns\n",
        "        -------\n",
        "        Node\n",
        "            the created node.\n",
        "        \"\"\"\n",
        "    self._count += 1\n",
        "    return (prob, Node(self._count, statements, children))\n",
        "\n",
        "  def get_root(self):\n",
        "    \"\"\"Return the root node.\n",
        "\n",
        "        Returns\n",
        "        -------\n",
        "        Node\n",
        "            the root node of the probability tree.\n",
        "        \"\"\"\n",
        "    return self._root\n",
        "\n",
        "  def show(self, show_id=False, show_prob=False, cut=None, crit=None):\n",
        "    \"\"\"Returns a graph of the probability tree.\n",
        "\n",
        "        Parameters\n",
        "        ----------\n",
        "        show_id: Bool (default: False)\n",
        "            If true, display the unique id's.\n",
        "        show_prob : Bool (default: False)\n",
        "            If true, display the node probabilities.\n",
        "        cut : MinCut (default: None)\n",
        "            If a MinCut is given, then display it.\n",
        "        crit : Critical (default: None)\n",
        "            If a Critical set is given, then show it.\n",
        "\n",
        "        Returns\n",
        "        -------\n",
        "        Node\n",
        "            the created node.\n",
        "        \"\"\"\n",
        "    return self._root.show(\n",
        "        show_id=show_id, show_prob=show_prob, cut=cut, crit=crit)\n",
        "\n",
        "  def rvs(self):\n",
        "    \"\"\"Return a dictionary with all the random variables and their values.\n",
        "\n",
        "        Returns\n",
        "        -------\n",
        "        dict(str: list)\n",
        "            A dictionary with all the random variables pointing at lists\n",
        "            containing their possible values.\n",
        "        \"\"\"\n",
        "    return self._root.rvs()\n",
        "\n",
        "  def rv(self, var):\n",
        "    \"\"\"Return a probability distribution for a given random variable.\n",
        "\n",
        "        Parameters\n",
        "        ----------\n",
        "        var: str\n",
        "            A string containing the name of the random variable.\n",
        "\n",
        "        Returns\n",
        "        -------\n",
        "        list((float, str))\n",
        "            A list with pairs (prob, val), where prob and val are the\n",
        "            probability\n",
        "            and the value of the random variable.\n",
        "        \"\"\"\n",
        "    return [(self.prob(self.prop(var + ' = ' + val)), val)\n",
        "            for val in self.rvs()[var]]\n",
        "\n",
        "  def expect(self, var):\n",
        "    \"\"\"Return the expected value of a random variable.\n",
        "\n",
        "        Parameters\n",
        "        ----------\n",
        "        var: str\n",
        "            A string containing the name of the random variable.\n",
        "\n",
        "        Returns\n",
        "        -------\n",
        "        float\n",
        "            The expected value of the random variable.\n",
        "        \"\"\"\n",
        "    e = 0.0\n",
        "    for prob, val in self.rv(var):\n",
        "      e += prob * float(val)\n",
        "    return e\n",
        "\n",
        "  def find(self, uid):\n",
        "    \"\"\"Return a node with given unique identifier.\n",
        "\n",
        "        Parameters\n",
        "        ----------\n",
        "        uid: int\n",
        "            Identifier of the node to be returned.\n",
        "\n",
        "        Returns\n",
        "        -------\n",
        "        Node or None\n",
        "            Returns the node if found, otherwise None.\n",
        "        \"\"\"\n",
        "    return self._root.find(uid)\n",
        "\n",
        "  def prop(self, statement):\n",
        "    \"\"\"Returns min-cut of a statement.\n",
        "\n",
        "        Parameters\n",
        "        ----------\n",
        "        statement: str\n",
        "            A single statement of the form \"var = val\", such as \"X = 1\".\n",
        "\n",
        "        Returns\n",
        "        -------\n",
        "        MinCut\n",
        "            the min-cut of the event corresponding to the statement.\n",
        "        \"\"\"\n",
        "    return MinCut.prop(self._root, statement)\n",
        "\n",
        "  def critical(self, cut):\n",
        "    \"\"\"Returns critical set of a min-cut.\n",
        "\n",
        "        Parameters\n",
        "        ----------\n",
        "        cut: MinCut\n",
        "            A min-cuts.\n",
        "\n",
        "        Returns\n",
        "        -------\n",
        "        Critical\n",
        "            the critical set for the min-cut.\n",
        "        \"\"\"\n",
        "    return Critical.critical(self._root, cut)\n",
        "\n",
        "  def sample(self):\n",
        "    \"\"\"Sample a realization.\n",
        "    \n",
        "    Returns\n",
        "    -------\n",
        "    dict((str:str))\n",
        "        A dictionary of bound random variables such as\n",
        "\n",
        "            { 'X': '1', 'Y': '0' }.\n",
        "    \"\"\"\n",
        "    return self._root.sample()\n",
        "\n",
        "  def prob(self, cut):\n",
        "    \"\"\"Compute probability of a min-cut.\n",
        "\n",
        "        Parameters\n",
        "        ----------\n",
        "        cut: MinCut\n",
        "            A min-cut for an event.\n",
        "\n",
        "        Returns\n",
        "        -------\n",
        "        float\n",
        "            The probability of the event of the min-cut.\n",
        "        \"\"\"\n",
        "    return self._root.prob(cut)\n",
        "\n",
        "  def see(self, cut):\n",
        "    \"\"\"Return a probability tree conditioned on a cut.\n",
        "\n",
        "        Parameters\n",
        "        ----------\n",
        "        cut: MinCut\n",
        "            A min-cut for an event.\n",
        "\n",
        "        Returns\n",
        "        -------\n",
        "        PTree\n",
        "            A new probability tree.\n",
        "        \"\"\"\n",
        "    newptree = PTree()\n",
        "    newptree._root = self._root.see(cut)\n",
        "    return newptree\n",
        "\n",
        "  def do(self, cut):\n",
        "    \"\"\"Intervene on a cut.\n",
        "\n",
        "        Parameters\n",
        "        ----------\n",
        "        cut: MinCut\n",
        "            A min-cut for an event.\n",
        "\n",
        "        Returns\n",
        "        -------\n",
        "        float\n",
        "            A new probability tree.\n",
        "        \"\"\"\n",
        "    newptree = PTree()\n",
        "    newptree._root = self._root.do(cut)\n",
        "    return newptree\n",
        "\n",
        "  def cf(self, tree_prem, cut_subj):\n",
        "    \"\"\"Return a subjunctive conditional tree.\n",
        "\n",
        "        Parameters\n",
        "        ----------\n",
        "        tree_prem: PTree\n",
        "            A probality tree representing the premises for the subjunctive\n",
        "            evaluation.\n",
        "            This probability tree must have been obtained through operations on\n",
        "            the\n",
        "            base probability tree.\n",
        "        cut_do: MinCut\n",
        "            A min-cut for an event. This min-cut is the subjunctive condition of\n",
        "            the\n",
        "            counterfactual.\n",
        "\n",
        "        Returns\n",
        "        -------\n",
        "        float\n",
        "            A new probability tree.\n",
        "        \"\"\"\n",
        "    newptree = PTree()\n",
        "    newptree._root = self._root.cf(tree_prem._root, cut_subj)\n",
        "    return newptree\n",
        "\n",
        "  def fromFunc(func, root_statement=None):\n",
        "    \"\"\"Build a probability tree from a factory function.\n",
        "\n",
        "        Building probability trees can be difficult, especially when we have\n",
        "        to manually specify all its nodes. To simplify this, `fromFunc` allows\n",
        "        building a probability tree using a factory function. A factory\n",
        "        function is a function that:\n",
        "\n",
        "        - receives a dictionary of bound random variables, such as\n",
        "\n",
        "            { 'X': '1', 'Y': '0' }\n",
        "\n",
        "        - and returns either `None` if a leaf has been reached, or a list\n",
        "          of transitions and their statements, such as\n",
        "\n",
        "            [(0.3, 'Z = 0'), (0.2, 'Z = 1'), (0.5, 'Z = 2')].\n",
        "\n",
        "        Such a factory function contains all the necessary information for\n",
        "        building a probability tree.\n",
        "\n",
        "        The advantage of using a factory function is that we can exploit\n",
        "        symmetries (such as conditional independencies) to code a much\n",
        "        more compact description of the probability tree.\n",
        "\n",
        "\n",
        "        Parameters\n",
        "        ----------\n",
        "        func: Function: dict((str: str)) -> list((float, str))\n",
        "            A probality tree factory function.\n",
        "\n",
        "        root_statement: str (default: None)\n",
        "            A string containing the statement (e.g. 'root = 0')\n",
        "            for the root node. If `None`, 'Ω = 1' is used.\n",
        "\n",
        "        Returns\n",
        "        -------\n",
        "        PTree\n",
        "            A new probability tree.\n",
        "        \"\"\"\n",
        "    if not root_statement:\n",
        "      root_statement = 'O = 1'\n",
        "\n",
        "    tree = PTree()\n",
        "    bvars = dict(Node._parse_statements(root_statement))\n",
        "    tree.root(root_statement, tree._fromFunc(func, bvars))\n",
        "    return tree\n",
        "\n",
        "  def _fromFunc(self, func, bvars):\n",
        "    \"\"\"Auxiliary method for PTree.fromFunc().\"\"\"\n",
        "\n",
        "    transition_list = func(bvars)\n",
        "    if not transition_list:\n",
        "      return None\n",
        "    children = []\n",
        "    for prob, statement in transition_list:\n",
        "      add_vars = dict(Node._parse_statements(statement))\n",
        "      new_bvars = {**bvars, **add_vars}\n",
        "      res = self._fromFunc(func, new_bvars)\n",
        "      children.append(self.child(prob, statement, res))\n",
        "    return children"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "lcEgcO7C_VlQ"
      },
      "source": [
        "## 1. Probability trees\n",
        "\n",
        "A **probability tree** is a representation of a random experiment or process.\n",
        "Starting from the **root node**, the process iteratively takes **random\n",
        "transitions** to **child nodes**, terminating at a **leaf node**. A path from\n",
        "the root node to a node is a **(partial) realization**, and a path from the root\n",
        "node to a leaf node is a **total realization**. Every node in the tree has one\n",
        "or more **statements** associated with it. When a realization reaches a node,\n",
        "the statements indicate which values are bound to random variables.\n",
        "\n",
        "Let's create our first probability tree. It shows a random variable $X$ where: -\n",
        "$X = 0$ with probability $0.5$; - $X = 1$ with probability $0.3$; - and $X = 2$\n",
        "with probability $0.2$."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "IKiO-SgJ_VlQ",
        "outputId": "4aa6b2cd-a24b-4920-fd68-460734726b20",
        "colab": {
          "base_uri": "https://localhost:8080/",
          "height": 110
        }
      },
      "source": [
        "# Creata a blank probability tree.\n",
        "pt = PTree()\n",
        "\n",
        "# Add a root node and the children.\n",
        "pt.root(\n",
        "    'O = 1',\n",
        "    [pt.child(0.5, 'X = 1'),\n",
        "     pt.child(0.3, 'X = 2'),\n",
        "     pt.child(0.2, 'X = 3')])\n",
        "\n",
        "# Display it.\n",
        "display(pt.show())"
      ],
      "execution_count": null,
      "outputs": [
        {
          "output_type": "display_data",
          "data": {
            "text/plain": [
              "<graphviz.dot.Digraph at 0x7f843b7b3b70>"
            ],
            "image/svg+xml": "<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\"?>\n<!DOCTYPE svg PUBLIC \"-//W3C//DTD SVG 1.1//EN\"\n \"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd\">\n<!-- Generated by graphviz version 2.40.1 (20161225.0304)\n -->\n<!-- Title: g Pages: 1 -->\n<svg width=\"115pt\" height=\"67pt\"\n viewBox=\"0.00 0.00 115.00 67.00\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">\n<g id=\"graph0\" class=\"graph\" transform=\"scale(1 1) rotate(0) translate(4 63)\">\n<title>g</title>\n<polygon fill=\"#ffffff\" stroke=\"transparent\" points=\"-4,4 -4,-63 111,-63 111,4 -4,4\"/>\n<!-- 4 -->\n<g id=\"node1\" class=\"node\">\n<title>4</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M31.6667,-36C31.6667,-36 4.3333,-36 4.3333,-36 2.1667,-36 0,-33.8333 0,-31.6667 0,-31.6667 0,-27.3333 0,-27.3333 0,-25.1667 2.1667,-23 4.3333,-23 4.3333,-23 31.6667,-23 31.6667,-23 33.8333,-23 36,-25.1667 36,-27.3333 36,-27.3333 36,-31.6667 36,-31.6667 36,-33.8333 33.8333,-36 31.6667,-36\"/>\n<text text-anchor=\"middle\" x=\"18\" y=\"-27\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">O = 1</text>\n</g>\n<!-- 1 -->\n<g id=\"node2\" class=\"node\">\n<title>1</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M102.6667,-59C102.6667,-59 75.3333,-59 75.3333,-59 73.1667,-59 71,-56.8333 71,-54.6667 71,-54.6667 71,-50.3333 71,-50.3333 71,-48.1667 73.1667,-46 75.3333,-46 75.3333,-46 102.6667,-46 102.6667,-46 104.8333,-46 107,-48.1667 107,-50.3333 107,-50.3333 107,-54.6667 107,-54.6667 107,-56.8333 104.8333,-59 102.6667,-59\"/>\n<text text-anchor=\"middle\" x=\"89\" y=\"-50\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">X = 1</text>\n</g>\n<!-- 4&#45;&gt;1 -->\n<g id=\"edge1\" class=\"edge\">\n<title>4&#45;&gt;1</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M32.9039,-36.1226C37.3874,-37.9907 42.3517,-39.9377 47,-41.5 51.4611,-42.9994 56.2444,-44.4217 60.9275,-45.7154\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"60.2943,-49.1677 70.8553,-48.3219 62.0719,-42.3972 60.2943,-49.1677\"/>\n<text text-anchor=\"middle\" x=\"53.5\" y=\"-47.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 2 -->\n<g id=\"node3\" class=\"node\">\n<title>2</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M102.6667,-36C102.6667,-36 75.3333,-36 75.3333,-36 73.1667,-36 71,-33.8333 71,-31.6667 71,-31.6667 71,-27.3333 71,-27.3333 71,-25.1667 73.1667,-23 75.3333,-23 75.3333,-23 102.6667,-23 102.6667,-23 104.8333,-23 107,-25.1667 107,-27.3333 107,-27.3333 107,-31.6667 107,-31.6667 107,-33.8333 104.8333,-36 102.6667,-36\"/>\n<text text-anchor=\"middle\" x=\"89\" y=\"-27\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">X = 2</text>\n</g>\n<!-- 4&#45;&gt;2 -->\n<g id=\"edge2\" class=\"edge\">\n<title>4&#45;&gt;2</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M36.2843,-29.5C43.5978,-29.5 52.1977,-29.5 60.3055,-29.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"60.531,-33.0001 70.5309,-29.5 60.5309,-26.0001 60.531,-33.0001\"/>\n<text text-anchor=\"middle\" x=\"53.5\" y=\"-32.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.3</text>\n</g>\n<!-- 3 -->\n<g id=\"node4\" class=\"node\">\n<title>3</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M102.6667,-13C102.6667,-13 75.3333,-13 75.3333,-13 73.1667,-13 71,-10.8333 71,-8.6667 71,-8.6667 71,-4.3333 71,-4.3333 71,-2.1667 73.1667,0 75.3333,0 75.3333,0 102.6667,0 102.6667,0 104.8333,0 107,-2.1667 107,-4.3333 107,-4.3333 107,-8.6667 107,-8.6667 107,-10.8333 104.8333,-13 102.6667,-13\"/>\n<text text-anchor=\"middle\" x=\"89\" y=\"-4\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">X = 3</text>\n</g>\n<!-- 4&#45;&gt;3 -->\n<g id=\"edge3\" class=\"edge\">\n<title>4&#45;&gt;3</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M32.9039,-22.8774C37.3874,-21.0093 42.3517,-19.0623 47,-17.5 51.4611,-16.0006 56.2444,-14.5783 60.9275,-13.2846\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"62.0719,-16.6028 70.8553,-10.6781 60.2943,-9.8323 62.0719,-16.6028\"/>\n<text text-anchor=\"middle\" x=\"53.5\" y=\"-20.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.2</text>\n</g>\n</g>\n</svg>\n"
          },
          "metadata": {
            "tags": []
          }
        }
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "pU9B9TJf_VlV"
      },
      "source": [
        "We'll typically call the root node $O$, standing for \"**O**mega\" ($\\Omega$),\n",
        "which is a common name for the sample space in the literature.\n",
        "\n",
        "After creating a probability tree, we can ask it to return: \n",
        "-   the list of random variables and their values using the method `rvs()`; \n",
        "-   the probability distribution for a given random variable using \n",
        "`rv(varname)`; \n",
        "- the expected value of a *numerical* random variable with \n",
        "`expected(varname)`;\n",
        "- and obtain a random sample from the tree with `sample()`."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "a-MsyV_d_VlV",
        "outputId": "7655afac-0e44-420e-be76-d22b463e7ff0",
        "colab": {
          "base_uri": "https://localhost:8080/"
        }
      },
      "source": [
        "rvs = pt.rvs()\n",
        "print('Random variables:', rvs)\n",
        "\n",
        "pdist = pt.rv('X')\n",
        "print('P(X) =', pdist)\n",
        "\n",
        "expect = pt.expect('X')\n",
        "print('E(X) =', expect)\n",
        "\n",
        "smp = pt.sample()\n",
        "print('Sample =', smp)"
      ],
      "execution_count": null,
      "outputs": [
        {
          "output_type": "stream",
          "text": [
            "Random variables: {'O': ['1'], 'X': ['0', '1'], 'Y': ['0', '1', '2']}\n",
            "P(X) = [(0.2, '0'), (0.8, '1')]\n",
            "E(X) = 0.8\n",
            "Sample = {'O': '1', 'X': '1', 'Y': '2'}\n"
          ],
          "name": "stdout"
        }
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "BscAftLn_VlZ"
      },
      "source": [
        "### Causal dependencies\n",
        "\n",
        "In a probability tree, a causal dependency $X \\rightarrow Y$ is expressed\n",
        "through a node $X$ having a descendent node $Y$. For instance, consider the next\n",
        "probability tree:"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "0DDBKwNs_Vla",
        "outputId": "bf7d6ce6-72a3-487d-c078-c4ca5c60ddec",
        "colab": {
          "base_uri": "https://localhost:8080/",
          "height": 141
        }
      },
      "source": [
        "# Create a blank probability tree.\n",
        "pt = PTree()\n",
        "\n",
        "# Add a root node and the children.\n",
        "pt.root('O = 1', [\n",
        "    pt.child(0.3, 'X = 0', [\n",
        "        pt.child(0.2, 'Y = 0'),\n",
        "        pt.child(0.8, 'Y = 1'),\n",
        "    ]),\n",
        "    pt.child(0.7, 'X = 1', [\n",
        "        pt.child(0.8, 'Y = 0'),\n",
        "        pt.child(0.2, 'Y = 1'),\n",
        "    ]),\n",
        "])\n",
        "\n",
        "# Display it.\n",
        "display(pt.show())"
      ],
      "execution_count": null,
      "outputs": [
        {
          "output_type": "display_data",
          "data": {
            "text/plain": [
              "<graphviz.dot.Digraph at 0x7f3c05b79e10>"
            ],
            "image/svg+xml": "<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\"?>\n<!DOCTYPE svg PUBLIC \"-//W3C//DTD SVG 1.1//EN\"\n \"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd\">\n<!-- Generated by graphviz version 2.40.1 (20161225.0304)\n -->\n<!-- Title: g Pages: 1 -->\n<svg width=\"186pt\" height=\"90pt\"\n viewBox=\"0.00 0.00 186.00 90.00\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">\n<g id=\"graph0\" class=\"graph\" transform=\"scale(1 1) rotate(0) translate(4 86)\">\n<title>g</title>\n<polygon fill=\"#ffffff\" stroke=\"transparent\" points=\"-4,4 -4,-86 182,-86 182,4 -4,4\"/>\n<!-- 7 -->\n<g id=\"node1\" class=\"node\">\n<title>7</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M31.6667,-47C31.6667,-47 4.3333,-47 4.3333,-47 2.1667,-47 0,-44.8333 0,-42.6667 0,-42.6667 0,-38.3333 0,-38.3333 0,-36.1667 2.1667,-34 4.3333,-34 4.3333,-34 31.6667,-34 31.6667,-34 33.8333,-34 36,-36.1667 36,-38.3333 36,-38.3333 36,-42.6667 36,-42.6667 36,-44.8333 33.8333,-47 31.6667,-47\"/>\n<text text-anchor=\"middle\" x=\"18\" y=\"-38\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">O = 1</text>\n</g>\n<!-- 3 -->\n<g id=\"node2\" class=\"node\">\n<title>3</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M102.6667,-59C102.6667,-59 75.3333,-59 75.3333,-59 73.1667,-59 71,-56.8333 71,-54.6667 71,-54.6667 71,-50.3333 71,-50.3333 71,-48.1667 73.1667,-46 75.3333,-46 75.3333,-46 102.6667,-46 102.6667,-46 104.8333,-46 107,-48.1667 107,-50.3333 107,-50.3333 107,-54.6667 107,-54.6667 107,-56.8333 104.8333,-59 102.6667,-59\"/>\n<text text-anchor=\"middle\" x=\"89\" y=\"-50\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">X = 0</text>\n</g>\n<!-- 7&#45;&gt;3 -->\n<g id=\"edge3\" class=\"edge\">\n<title>7&#45;&gt;3</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M36.2843,-43.5903C43.68,-44.8403 52.3911,-46.3126 60.5786,-47.6964\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"60.0875,-51.1629 70.5309,-49.3785 61.2541,-44.2608 60.0875,-51.1629\"/>\n<text text-anchor=\"middle\" x=\"53.5\" y=\"-50.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.3</text>\n</g>\n<!-- 6 -->\n<g id=\"node5\" class=\"node\">\n<title>6</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M102.6667,-36C102.6667,-36 75.3333,-36 75.3333,-36 73.1667,-36 71,-33.8333 71,-31.6667 71,-31.6667 71,-27.3333 71,-27.3333 71,-25.1667 73.1667,-23 75.3333,-23 75.3333,-23 102.6667,-23 102.6667,-23 104.8333,-23 107,-25.1667 107,-27.3333 107,-27.3333 107,-31.6667 107,-31.6667 107,-33.8333 104.8333,-36 102.6667,-36\"/>\n<text text-anchor=\"middle\" x=\"89\" y=\"-27\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">X = 1</text>\n</g>\n<!-- 7&#45;&gt;6 -->\n<g id=\"edge6\" class=\"edge\">\n<title>7&#45;&gt;6</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M36.0181,-35.7321C39.6357,-34.8934 43.4243,-34.0987 47,-33.5 51.3886,-32.7652 56.0596,-32.1538 60.6316,-31.6488\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"61.3231,-35.0984 70.9412,-30.6551 60.6515,-28.1307 61.3231,-35.0984\"/>\n<text text-anchor=\"middle\" x=\"53.5\" y=\"-36.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.7</text>\n</g>\n<!-- 1 -->\n<g id=\"node3\" class=\"node\">\n<title>1</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M173.6667,-82C173.6667,-82 146.3333,-82 146.3333,-82 144.1667,-82 142,-79.8333 142,-77.6667 142,-77.6667 142,-73.3333 142,-73.3333 142,-71.1667 144.1667,-69 146.3333,-69 146.3333,-69 173.6667,-69 173.6667,-69 175.8333,-69 178,-71.1667 178,-73.3333 178,-73.3333 178,-77.6667 178,-77.6667 178,-79.8333 175.8333,-82 173.6667,-82\"/>\n<text text-anchor=\"middle\" x=\"160\" y=\"-73\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">Y = 0</text>\n</g>\n<!-- 3&#45;&gt;1 -->\n<g id=\"edge1\" class=\"edge\">\n<title>3&#45;&gt;1</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M103.9039,-59.1226C108.3874,-60.9907 113.3517,-62.9377 118,-64.5 122.4611,-65.9994 127.2444,-67.4217 131.9275,-68.7154\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"131.2943,-72.1677 141.8553,-71.3219 133.0719,-65.3972 131.2943,-72.1677\"/>\n<text text-anchor=\"middle\" x=\"124.5\" y=\"-70.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.2</text>\n</g>\n<!-- 2 -->\n<g id=\"node4\" class=\"node\">\n<title>2</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M173.6667,-59C173.6667,-59 146.3333,-59 146.3333,-59 144.1667,-59 142,-56.8333 142,-54.6667 142,-54.6667 142,-50.3333 142,-50.3333 142,-48.1667 144.1667,-46 146.3333,-46 146.3333,-46 173.6667,-46 173.6667,-46 175.8333,-46 178,-48.1667 178,-50.3333 178,-50.3333 178,-54.6667 178,-54.6667 178,-56.8333 175.8333,-59 173.6667,-59\"/>\n<text text-anchor=\"middle\" x=\"160\" y=\"-50\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">Y = 1</text>\n</g>\n<!-- 3&#45;&gt;2 -->\n<g id=\"edge2\" class=\"edge\">\n<title>3&#45;&gt;2</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M107.2843,-52.5C114.5978,-52.5 123.1977,-52.5 131.3055,-52.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"131.531,-56.0001 141.5309,-52.5 131.5309,-49.0001 131.531,-56.0001\"/>\n<text text-anchor=\"middle\" x=\"124.5\" y=\"-55.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.8</text>\n</g>\n<!-- 4 -->\n<g id=\"node6\" class=\"node\">\n<title>4</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M173.6667,-36C173.6667,-36 146.3333,-36 146.3333,-36 144.1667,-36 142,-33.8333 142,-31.6667 142,-31.6667 142,-27.3333 142,-27.3333 142,-25.1667 144.1667,-23 146.3333,-23 146.3333,-23 173.6667,-23 173.6667,-23 175.8333,-23 178,-25.1667 178,-27.3333 178,-27.3333 178,-31.6667 178,-31.6667 178,-33.8333 175.8333,-36 173.6667,-36\"/>\n<text text-anchor=\"middle\" x=\"160\" y=\"-27\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">Y = 0</text>\n</g>\n<!-- 6&#45;&gt;4 -->\n<g id=\"edge4\" class=\"edge\">\n<title>6&#45;&gt;4</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M107.2843,-29.5C114.5978,-29.5 123.1977,-29.5 131.3055,-29.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"131.531,-33.0001 141.5309,-29.5 131.5309,-26.0001 131.531,-33.0001\"/>\n<text text-anchor=\"middle\" x=\"124.5\" y=\"-32.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.8</text>\n</g>\n<!-- 5 -->\n<g id=\"node7\" class=\"node\">\n<title>5</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M173.6667,-13C173.6667,-13 146.3333,-13 146.3333,-13 144.1667,-13 142,-10.8333 142,-8.6667 142,-8.6667 142,-4.3333 142,-4.3333 142,-2.1667 144.1667,0 146.3333,0 146.3333,0 173.6667,0 173.6667,0 175.8333,0 178,-2.1667 178,-4.3333 178,-4.3333 178,-8.6667 178,-8.6667 178,-10.8333 175.8333,-13 173.6667,-13\"/>\n<text text-anchor=\"middle\" x=\"160\" y=\"-4\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">Y = 1</text>\n</g>\n<!-- 6&#45;&gt;5 -->\n<g id=\"edge5\" class=\"edge\">\n<title>6&#45;&gt;5</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M103.9039,-22.8774C108.3874,-21.0093 113.3517,-19.0623 118,-17.5 122.4611,-16.0006 127.2444,-14.5783 131.9275,-13.2846\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"133.0719,-16.6028 141.8553,-10.6781 131.2943,-9.8323 133.0719,-16.6028\"/>\n<text text-anchor=\"middle\" x=\"124.5\" y=\"-20.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.2</text>\n</g>\n</g>\n</svg>\n"
          },
          "metadata": {
            "tags": []
          }
        }
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "YenMXlr6_Vld"
      },
      "source": [
        "Here $Y$ is a descendant of $X$ and therefore $X \\rightarrow Y$. This means that\n",
        "we can affect the value of $Y$ by choosing $X$ but not viceversa. The exact\n",
        "semantics of this requires **interventions**, which we'll review later. Notice\n",
        "how the value of $X$ changes the distribution over $Y$: - $P(Y=1|X=0) >\n",
        "P(Y=0|X=0)$, - $P(Y=1|X=1) < P(Y=0|X=1)$.\n",
        "\n",
        "If we want to express that neither $X \\rightarrow Y$ nor $Y \\rightarrow X$ are\n",
        "the case, then we need to combine both random variables into the same nodes as\n",
        "follows:"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "Pot5uw-R_Vld",
        "outputId": "805f7ab5-7383-4780-faaa-13683d0ca173",
        "colab": {
          "base_uri": "https://localhost:8080/",
          "height": 188
        }
      },
      "source": [
        "# Creata a blank probability tree.\n",
        "pt = PTree()\n",
        "\n",
        "# Add a root node and the children.\n",
        "pt.root('O = 1', [\n",
        "    pt.child(0.3 * 0.2, 'X = 0, Y = 0'),\n",
        "    pt.child(0.3 * 0.8, 'X = 0, Y = 1'),\n",
        "    pt.child(0.7 * 0.8, 'X = 1, Y = 0'),\n",
        "    pt.child(0.7 * 0.2, 'X = 1, Y = 1')\n",
        "])\n",
        "\n",
        "# Display it.\n",
        "display(pt.show())"
      ],
      "execution_count": null,
      "outputs": [
        {
          "output_type": "display_data",
          "data": {
            "text/plain": [
              "<graphviz.dot.Digraph at 0x7f3c05b79c18>"
            ],
            "image/svg+xml": "<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\"?>\n<!DOCTYPE svg PUBLIC \"-//W3C//DTD SVG 1.1//EN\"\n \"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd\">\n<!-- Generated by graphviz version 2.40.1 (20161225.0304)\n -->\n<!-- Title: g Pages: 1 -->\n<svg width=\"121pt\" height=\"125pt\"\n viewBox=\"0.00 0.00 121.00 125.00\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">\n<g id=\"graph0\" class=\"graph\" transform=\"scale(1 1) rotate(0) translate(4 121)\">\n<title>g</title>\n<polygon fill=\"#ffffff\" stroke=\"transparent\" points=\"-4,4 -4,-121 117,-121 117,4 -4,4\"/>\n<!-- 5 -->\n<g id=\"node1\" class=\"node\">\n<title>5</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M31.6667,-64.5C31.6667,-64.5 4.3333,-64.5 4.3333,-64.5 2.1667,-64.5 0,-62.3333 0,-60.1667 0,-60.1667 0,-55.8333 0,-55.8333 0,-53.6667 2.1667,-51.5 4.3333,-51.5 4.3333,-51.5 31.6667,-51.5 31.6667,-51.5 33.8333,-51.5 36,-53.6667 36,-55.8333 36,-55.8333 36,-60.1667 36,-60.1667 36,-62.3333 33.8333,-64.5 31.6667,-64.5\"/>\n<text text-anchor=\"middle\" x=\"18\" y=\"-55.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">O = 1</text>\n</g>\n<!-- 1 -->\n<g id=\"node2\" class=\"node\">\n<title>1</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M105,-117C105,-117 85,-117 85,-117 81,-117 77,-113 77,-109 77,-109 77,-101 77,-101 77,-97 81,-93 85,-93 85,-93 105,-93 105,-93 109,-93 113,-97 113,-101 113,-101 113,-109 113,-109 113,-113 109,-117 105,-117\"/>\n<text text-anchor=\"middle\" x=\"95\" y=\"-108\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">X = 0</text>\n<text text-anchor=\"middle\" x=\"95\" y=\"-97\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">Y = 0</text>\n</g>\n<!-- 5&#45;&gt;1 -->\n<g id=\"edge1\" class=\"edge\">\n<title>5&#45;&gt;1</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M26.4256,-64.5493C32.1071,-68.8527 39.8445,-74.498 47,-79 53.6179,-83.1637 60.9554,-87.344 67.8614,-91.0978\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"66.4312,-94.3014 76.9031,-95.9106 69.7203,-88.1223 66.4312,-94.3014\"/>\n<text text-anchor=\"middle\" x=\"56.5\" y=\"-92\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.06</text>\n</g>\n<!-- 2 -->\n<g id=\"node3\" class=\"node\">\n<title>2</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M105,-86C105,-86 85,-86 85,-86 81,-86 77,-82 77,-78 77,-78 77,-70 77,-70 77,-66 81,-62 85,-62 85,-62 105,-62 105,-62 109,-62 113,-66 113,-70 113,-70 113,-78 113,-78 113,-82 109,-86 105,-86\"/>\n<text text-anchor=\"middle\" x=\"95\" y=\"-77\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">X = 0</text>\n<text text-anchor=\"middle\" x=\"95\" y=\"-66\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">Y = 1</text>\n</g>\n<!-- 5&#45;&gt;2 -->\n<g id=\"edge2\" class=\"edge\">\n<title>5&#45;&gt;2</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M36.2479,-61.7918C45.3578,-63.6847 56.5826,-66.0172 66.7718,-68.1344\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"66.3801,-71.6277 76.8831,-70.2354 67.8043,-64.7741 66.3801,-71.6277\"/>\n<text text-anchor=\"middle\" x=\"56.5\" y=\"-70\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.24</text>\n</g>\n<!-- 3 -->\n<g id=\"node4\" class=\"node\">\n<title>3</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M105,-55C105,-55 85,-55 85,-55 81,-55 77,-51 77,-47 77,-47 77,-39 77,-39 77,-35 81,-31 85,-31 85,-31 105,-31 105,-31 109,-31 113,-35 113,-39 113,-39 113,-47 113,-47 113,-51 109,-55 105,-55\"/>\n<text text-anchor=\"middle\" x=\"95\" y=\"-46\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">X = 1</text>\n<text text-anchor=\"middle\" x=\"95\" y=\"-35\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">Y = 0</text>\n</g>\n<!-- 5&#45;&gt;3 -->\n<g id=\"edge3\" class=\"edge\">\n<title>5&#45;&gt;3</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M36.2479,-54.4452C45.3578,-52.6705 56.5826,-50.4839 66.7718,-48.499\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"67.7368,-51.8769 76.8831,-46.5293 66.3983,-45.006 67.7368,-51.8769\"/>\n<text text-anchor=\"middle\" x=\"56.5\" y=\"-55\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.56</text>\n</g>\n<!-- 4 -->\n<g id=\"node5\" class=\"node\">\n<title>4</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M105,-24C105,-24 85,-24 85,-24 81,-24 77,-20 77,-16 77,-16 77,-8 77,-8 77,-4 81,0 85,0 85,0 105,0 105,0 109,0 113,-4 113,-8 113,-8 113,-16 113,-16 113,-20 109,-24 105,-24\"/>\n<text text-anchor=\"middle\" x=\"95\" y=\"-15\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">X = 1</text>\n<text text-anchor=\"middle\" x=\"95\" y=\"-4\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">Y = 1</text>\n</g>\n<!-- 5&#45;&gt;4 -->\n<g id=\"edge4\" class=\"edge\">\n<title>5&#45;&gt;4</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M25.839,-51.4201C31.5181,-46.8136 39.4868,-40.672 47,-36 53.5274,-31.941 60.8327,-28.0057 67.7367,-24.5358\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"69.3344,-27.6507 76.7916,-20.1248 66.2688,-21.3577 69.3344,-27.6507\"/>\n<text text-anchor=\"middle\" x=\"56.5\" y=\"-39\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.14</text>\n</g>\n</g>\n</svg>\n"
          },
          "metadata": {
            "tags": []
          }
        }
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "t9ntPBZd_Vlk"
      },
      "source": [
        "### Another tree: drug testing\n",
        "\n",
        "Let's build another example. Here we have a drug testing situation:\n",
        "\n",
        "-   A patient has a probability of being ill ($D = 1$).\n",
        "-   If the patient takes the drug ($T = 1$) when she is ill, she will likely\n",
        "    feel better ($R = 1$), otherwise she will likely feel worse ($R = 0$).\n",
        "-   However, if she takes the drug when she is not ill, the situation is\n",
        "    inverted: the drug might make her feel worse ($R = 0$).\n",
        "\n",
        "![Drug Testing CBN](http://www.adaptiveagents.org/_media/wiki/drug-testing.png)\n",
        "\n",
        "This tree can also be represented as the above causal Bayesian graph. This is\n",
        "always the case when the causal ordering of the random variables is the same, no\n",
        "matter which realization path is taken in the tree."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "AxK8DRP3_Vlk",
        "outputId": "cdd12dcf-74a4-4043-94aa-4d0eece3a7b0",
        "colab": {
          "base_uri": "https://localhost:8080/",
          "height": 281
        }
      },
      "source": [
        "med = PTree()\n",
        "med.root('O = 1', [\n",
        "    med.child(0.4, 'D = 0', [\n",
        "        med.child(0.5, 'T = 0',\n",
        "                  [med.child(0.2, 'R = 0'),\n",
        "                   med.child(0.8, 'R = 1')]),\n",
        "        med.child(0.5, 'T = 1',\n",
        "                  [med.child(0.8, 'R = 0'),\n",
        "                   med.child(0.2, 'R = 1')])\n",
        "    ]),\n",
        "    med.child(0.6, 'D = 1', [\n",
        "        med.child(0.5, 'T = 0',\n",
        "                  [med.child(0.8, 'R = 0'),\n",
        "                   med.child(0.2, 'R = 1')]),\n",
        "        med.child(0.5, 'T = 1',\n",
        "                  [med.child(0.2, 'R = 0'),\n",
        "                   med.child(0.8, 'R = 1')])\n",
        "    ])\n",
        "])\n",
        "\n",
        "print('Random variables:', med.rvs())\n",
        "display(med.show())"
      ],
      "execution_count": null,
      "outputs": [
        {
          "output_type": "stream",
          "text": [
            "Random variables: {'O': ['1'], 'D': ['0', '1'], 'T': ['0', '1'], 'R': ['0', '1']}\n"
          ],
          "name": "stdout"
        },
        {
          "output_type": "display_data",
          "data": {
            "text/plain": [
              "<graphviz.dot.Digraph at 0x7f3c05b88550>"
            ],
            "image/svg+xml": "<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\"?>\n<!DOCTYPE svg PUBLIC \"-//W3C//DTD SVG 1.1//EN\"\n \"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd\">\n<!-- Generated by graphviz version 2.40.1 (20161225.0304)\n -->\n<!-- Title: g Pages: 1 -->\n<svg width=\"257pt\" height=\"182pt\"\n viewBox=\"0.00 0.00 257.00 182.00\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">\n<g id=\"graph0\" class=\"graph\" transform=\"scale(1 1) rotate(0) translate(4 178)\">\n<title>g</title>\n<polygon fill=\"#ffffff\" stroke=\"transparent\" points=\"-4,4 -4,-178 253,-178 253,4 -4,4\"/>\n<!-- 15 -->\n<g id=\"node1\" class=\"node\">\n<title>15</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M31.6667,-92C31.6667,-92 4.3333,-92 4.3333,-92 2.1667,-92 0,-89.8333 0,-87.6667 0,-87.6667 0,-83.3333 0,-83.3333 0,-81.1667 2.1667,-79 4.3333,-79 4.3333,-79 31.6667,-79 31.6667,-79 33.8333,-79 36,-81.1667 36,-83.3333 36,-83.3333 36,-87.6667 36,-87.6667 36,-89.8333 33.8333,-92 31.6667,-92\"/>\n<text text-anchor=\"middle\" x=\"18\" y=\"-83\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">O = 1</text>\n</g>\n<!-- 7 -->\n<g id=\"node2\" class=\"node\">\n<title>7</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M102.6667,-121C102.6667,-121 75.3333,-121 75.3333,-121 73.1667,-121 71,-118.8333 71,-116.6667 71,-116.6667 71,-112.3333 71,-112.3333 71,-110.1667 73.1667,-108 75.3333,-108 75.3333,-108 102.6667,-108 102.6667,-108 104.8333,-108 107,-110.1667 107,-112.3333 107,-112.3333 107,-116.6667 107,-116.6667 107,-118.8333 104.8333,-121 102.6667,-121\"/>\n<text text-anchor=\"middle\" x=\"89\" y=\"-112\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">D = 0</text>\n</g>\n<!-- 15&#45;&gt;7 -->\n<g id=\"edge7\" class=\"edge\">\n<title>15&#45;&gt;7</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M34.111,-92.0805C42.8257,-95.6401 53.7891,-100.1181 63.6219,-104.1343\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"62.3717,-107.4043 72.9528,-107.9455 65.0187,-100.924 62.3717,-107.4043\"/>\n<text text-anchor=\"middle\" x=\"53.5\" y=\"-105.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.4</text>\n</g>\n<!-- 14 -->\n<g id=\"node9\" class=\"node\">\n<title>14</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M102.6667,-76C102.6667,-76 75.3333,-76 75.3333,-76 73.1667,-76 71,-73.8333 71,-71.6667 71,-71.6667 71,-67.3333 71,-67.3333 71,-65.1667 73.1667,-63 75.3333,-63 75.3333,-63 102.6667,-63 102.6667,-63 104.8333,-63 107,-65.1667 107,-67.3333 107,-67.3333 107,-71.6667 107,-71.6667 107,-73.8333 104.8333,-76 102.6667,-76\"/>\n<text text-anchor=\"middle\" x=\"89\" y=\"-67\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">D = 1</text>\n</g>\n<!-- 15&#45;&gt;14 -->\n<g id=\"edge14\" class=\"edge\">\n<title>15&#45;&gt;14</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M36.2843,-81.3796C43.68,-79.713 52.3911,-77.7499 60.5786,-75.9048\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"61.545,-79.2749 70.5309,-73.662 60.0061,-72.4461 61.545,-79.2749\"/>\n<text text-anchor=\"middle\" x=\"53.5\" y=\"-81.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.6</text>\n</g>\n<!-- 3 -->\n<g id=\"node3\" class=\"node\">\n<title>3</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M173.6667,-151C173.6667,-151 146.3333,-151 146.3333,-151 144.1667,-151 142,-148.8333 142,-146.6667 142,-146.6667 142,-142.3333 142,-142.3333 142,-140.1667 144.1667,-138 146.3333,-138 146.3333,-138 173.6667,-138 173.6667,-138 175.8333,-138 178,-140.1667 178,-142.3333 178,-142.3333 178,-146.6667 178,-146.6667 178,-148.8333 175.8333,-151 173.6667,-151\"/>\n<text text-anchor=\"middle\" x=\"160\" y=\"-142\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">T = 0</text>\n</g>\n<!-- 7&#45;&gt;3 -->\n<g id=\"edge3\" class=\"edge\">\n<title>7&#45;&gt;3</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M104.4059,-121.0096C113.3072,-124.7706 124.7215,-129.5936 134.889,-133.8897\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"133.5588,-137.1272 144.1325,-137.7954 136.2833,-130.6792 133.5588,-137.1272\"/>\n<text text-anchor=\"middle\" x=\"124.5\" y=\"-134.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 6 -->\n<g id=\"node6\" class=\"node\">\n<title>6</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M173.6667,-121C173.6667,-121 146.3333,-121 146.3333,-121 144.1667,-121 142,-118.8333 142,-116.6667 142,-116.6667 142,-112.3333 142,-112.3333 142,-110.1667 144.1667,-108 146.3333,-108 146.3333,-108 173.6667,-108 173.6667,-108 175.8333,-108 178,-110.1667 178,-112.3333 178,-112.3333 178,-116.6667 178,-116.6667 178,-118.8333 175.8333,-121 173.6667,-121\"/>\n<text text-anchor=\"middle\" x=\"160\" y=\"-112\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">T = 1</text>\n</g>\n<!-- 7&#45;&gt;6 -->\n<g id=\"edge6\" class=\"edge\">\n<title>7&#45;&gt;6</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M107.2843,-114.5C114.5978,-114.5 123.1977,-114.5 131.3055,-114.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"131.531,-118.0001 141.5309,-114.5 131.5309,-111.0001 131.531,-118.0001\"/>\n<text text-anchor=\"middle\" x=\"124.5\" y=\"-117.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 1 -->\n<g id=\"node4\" class=\"node\">\n<title>1</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M244.6667,-174C244.6667,-174 217.3333,-174 217.3333,-174 215.1667,-174 213,-171.8333 213,-169.6667 213,-169.6667 213,-165.3333 213,-165.3333 213,-163.1667 215.1667,-161 217.3333,-161 217.3333,-161 244.6667,-161 244.6667,-161 246.8333,-161 249,-163.1667 249,-165.3333 249,-165.3333 249,-169.6667 249,-169.6667 249,-171.8333 246.8333,-174 244.6667,-174\"/>\n<text text-anchor=\"middle\" x=\"231\" y=\"-165\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">R = 0</text>\n</g>\n<!-- 3&#45;&gt;1 -->\n<g id=\"edge1\" class=\"edge\">\n<title>3&#45;&gt;1</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M174.9039,-151.1226C179.3874,-152.9907 184.3517,-154.9377 189,-156.5 193.4611,-157.9994 198.2444,-159.4217 202.9275,-160.7154\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"202.2943,-164.1677 212.8553,-163.3219 204.0719,-157.3972 202.2943,-164.1677\"/>\n<text text-anchor=\"middle\" x=\"195.5\" y=\"-162.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.2</text>\n</g>\n<!-- 2 -->\n<g id=\"node5\" class=\"node\">\n<title>2</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M244.6667,-151C244.6667,-151 217.3333,-151 217.3333,-151 215.1667,-151 213,-148.8333 213,-146.6667 213,-146.6667 213,-142.3333 213,-142.3333 213,-140.1667 215.1667,-138 217.3333,-138 217.3333,-138 244.6667,-138 244.6667,-138 246.8333,-138 249,-140.1667 249,-142.3333 249,-142.3333 249,-146.6667 249,-146.6667 249,-148.8333 246.8333,-151 244.6667,-151\"/>\n<text text-anchor=\"middle\" x=\"231\" y=\"-142\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">R = 1</text>\n</g>\n<!-- 3&#45;&gt;2 -->\n<g id=\"edge2\" class=\"edge\">\n<title>3&#45;&gt;2</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M178.2843,-144.5C185.5978,-144.5 194.1977,-144.5 202.3055,-144.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"202.531,-148.0001 212.5309,-144.5 202.5309,-141.0001 202.531,-148.0001\"/>\n<text text-anchor=\"middle\" x=\"195.5\" y=\"-147.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.8</text>\n</g>\n<!-- 4 -->\n<g id=\"node7\" class=\"node\">\n<title>4</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M244.6667,-128C244.6667,-128 217.3333,-128 217.3333,-128 215.1667,-128 213,-125.8333 213,-123.6667 213,-123.6667 213,-119.3333 213,-119.3333 213,-117.1667 215.1667,-115 217.3333,-115 217.3333,-115 244.6667,-115 244.6667,-115 246.8333,-115 249,-117.1667 249,-119.3333 249,-119.3333 249,-123.6667 249,-123.6667 249,-125.8333 246.8333,-128 244.6667,-128\"/>\n<text text-anchor=\"middle\" x=\"231\" y=\"-119\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">R = 0</text>\n</g>\n<!-- 6&#45;&gt;4 -->\n<g id=\"edge4\" class=\"edge\">\n<title>6&#45;&gt;4</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M178.2843,-116.3027C185.68,-117.0318 194.3911,-117.8907 202.5786,-118.6979\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"202.2357,-122.181 212.5309,-119.6791 202.9226,-115.2147 202.2357,-122.181\"/>\n<text text-anchor=\"middle\" x=\"195.5\" y=\"-121.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.8</text>\n</g>\n<!-- 5 -->\n<g id=\"node8\" class=\"node\">\n<title>5</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M244.6667,-105C244.6667,-105 217.3333,-105 217.3333,-105 215.1667,-105 213,-102.8333 213,-100.6667 213,-100.6667 213,-96.3333 213,-96.3333 213,-94.1667 215.1667,-92 217.3333,-92 217.3333,-92 244.6667,-92 244.6667,-92 246.8333,-92 249,-94.1667 249,-96.3333 249,-96.3333 249,-100.6667 249,-100.6667 249,-102.8333 246.8333,-105 244.6667,-105\"/>\n<text text-anchor=\"middle\" x=\"231\" y=\"-96\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">R = 1</text>\n</g>\n<!-- 6&#45;&gt;5 -->\n<g id=\"edge5\" class=\"edge\">\n<title>6&#45;&gt;5</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M177.3227,-107.9265C181.1299,-106.6511 185.1692,-105.4252 189,-104.5 193.4704,-103.4203 198.2586,-102.5104 202.9436,-101.7516\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"203.4712,-105.2119 212.8716,-100.3248 202.4754,-98.283 203.4712,-105.2119\"/>\n<text text-anchor=\"middle\" x=\"195.5\" y=\"-107.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.2</text>\n</g>\n<!-- 10 -->\n<g id=\"node10\" class=\"node\">\n<title>10</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M173.6667,-76C173.6667,-76 146.3333,-76 146.3333,-76 144.1667,-76 142,-73.8333 142,-71.6667 142,-71.6667 142,-67.3333 142,-67.3333 142,-65.1667 144.1667,-63 146.3333,-63 146.3333,-63 173.6667,-63 173.6667,-63 175.8333,-63 178,-65.1667 178,-67.3333 178,-67.3333 178,-71.6667 178,-71.6667 178,-73.8333 175.8333,-76 173.6667,-76\"/>\n<text text-anchor=\"middle\" x=\"160\" y=\"-67\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">T = 0</text>\n</g>\n<!-- 14&#45;&gt;10 -->\n<g id=\"edge10\" class=\"edge\">\n<title>14&#45;&gt;10</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M107.2843,-69.5C114.5978,-69.5 123.1977,-69.5 131.3055,-69.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"131.531,-73.0001 141.5309,-69.5 131.5309,-66.0001 131.531,-73.0001\"/>\n<text text-anchor=\"middle\" x=\"124.5\" y=\"-72.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 13 -->\n<g id=\"node13\" class=\"node\">\n<title>13</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M173.6667,-36C173.6667,-36 146.3333,-36 146.3333,-36 144.1667,-36 142,-33.8333 142,-31.6667 142,-31.6667 142,-27.3333 142,-27.3333 142,-25.1667 144.1667,-23 146.3333,-23 146.3333,-23 173.6667,-23 173.6667,-23 175.8333,-23 178,-25.1667 178,-27.3333 178,-27.3333 178,-31.6667 178,-31.6667 178,-33.8333 175.8333,-36 173.6667,-36\"/>\n<text text-anchor=\"middle\" x=\"160\" y=\"-27\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">T = 1</text>\n</g>\n<!-- 14&#45;&gt;13 -->\n<g id=\"edge13\" class=\"edge\">\n<title>14&#45;&gt;13</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M100.7242,-62.8948C111.1445,-57.0243 126.6228,-48.3041 139.1496,-41.2467\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"141.0265,-44.2066 148.0211,-36.2487 137.5906,-38.1078 141.0265,-44.2066\"/>\n<text text-anchor=\"middle\" x=\"124.5\" y=\"-55.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 8 -->\n<g id=\"node11\" class=\"node\">\n<title>8</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M244.6667,-82C244.6667,-82 217.3333,-82 217.3333,-82 215.1667,-82 213,-79.8333 213,-77.6667 213,-77.6667 213,-73.3333 213,-73.3333 213,-71.1667 215.1667,-69 217.3333,-69 217.3333,-69 244.6667,-69 244.6667,-69 246.8333,-69 249,-71.1667 249,-73.3333 249,-73.3333 249,-77.6667 249,-77.6667 249,-79.8333 246.8333,-82 244.6667,-82\"/>\n<text text-anchor=\"middle\" x=\"231\" y=\"-73\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">R = 0</text>\n</g>\n<!-- 10&#45;&gt;8 -->\n<g id=\"edge8\" class=\"edge\">\n<title>10&#45;&gt;8</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M178.2843,-71.0451C185.5978,-71.6632 194.1977,-72.3899 202.3055,-73.0751\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"202.2717,-76.5846 212.5309,-73.9392 202.8612,-69.6095 202.2717,-76.5846\"/>\n<text text-anchor=\"middle\" x=\"195.5\" y=\"-75.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.8</text>\n</g>\n<!-- 9 -->\n<g id=\"node12\" class=\"node\">\n<title>9</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M244.6667,-59C244.6667,-59 217.3333,-59 217.3333,-59 215.1667,-59 213,-56.8333 213,-54.6667 213,-54.6667 213,-50.3333 213,-50.3333 213,-48.1667 215.1667,-46 217.3333,-46 217.3333,-46 244.6667,-46 244.6667,-46 246.8333,-46 249,-48.1667 249,-50.3333 249,-50.3333 249,-54.6667 249,-54.6667 249,-56.8333 246.8333,-59 244.6667,-59\"/>\n<text text-anchor=\"middle\" x=\"231\" y=\"-50\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">R = 1</text>\n</g>\n<!-- 10&#45;&gt;9 -->\n<g id=\"edge9\" class=\"edge\">\n<title>10&#45;&gt;9</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M177.3394,-62.994C181.1455,-61.7143 185.1802,-60.4697 189,-59.5 193.4736,-58.3643 198.2635,-57.3663 202.9491,-56.5062\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"203.5924,-59.9473 212.8771,-54.844 202.4364,-53.0434 203.5924,-59.9473\"/>\n<text text-anchor=\"middle\" x=\"195.5\" y=\"-62.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.2</text>\n</g>\n<!-- 11 -->\n<g id=\"node14\" class=\"node\">\n<title>11</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M244.6667,-36C244.6667,-36 217.3333,-36 217.3333,-36 215.1667,-36 213,-33.8333 213,-31.6667 213,-31.6667 213,-27.3333 213,-27.3333 213,-25.1667 215.1667,-23 217.3333,-23 217.3333,-23 244.6667,-23 244.6667,-23 246.8333,-23 249,-25.1667 249,-27.3333 249,-27.3333 249,-31.6667 249,-31.6667 249,-33.8333 246.8333,-36 244.6667,-36\"/>\n<text text-anchor=\"middle\" x=\"231\" y=\"-27\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">R = 0</text>\n</g>\n<!-- 13&#45;&gt;11 -->\n<g id=\"edge11\" class=\"edge\">\n<title>13&#45;&gt;11</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M178.2843,-29.5C185.5978,-29.5 194.1977,-29.5 202.3055,-29.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"202.531,-33.0001 212.5309,-29.5 202.5309,-26.0001 202.531,-33.0001\"/>\n<text text-anchor=\"middle\" x=\"195.5\" y=\"-32.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.2</text>\n</g>\n<!-- 12 -->\n<g id=\"node15\" class=\"node\">\n<title>12</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M244.6667,-13C244.6667,-13 217.3333,-13 217.3333,-13 215.1667,-13 213,-10.8333 213,-8.6667 213,-8.6667 213,-4.3333 213,-4.3333 213,-2.1667 215.1667,0 217.3333,0 217.3333,0 244.6667,0 244.6667,0 246.8333,0 249,-2.1667 249,-4.3333 249,-4.3333 249,-8.6667 249,-8.6667 249,-10.8333 246.8333,-13 244.6667,-13\"/>\n<text text-anchor=\"middle\" x=\"231\" y=\"-4\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">R = 1</text>\n</g>\n<!-- 13&#45;&gt;12 -->\n<g id=\"edge12\" class=\"edge\">\n<title>13&#45;&gt;12</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M174.9039,-22.8774C179.3874,-21.0093 184.3517,-19.0623 189,-17.5 193.4611,-16.0006 198.2444,-14.5783 202.9275,-13.2846\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"204.0719,-16.6028 212.8553,-10.6781 202.2943,-9.8323 204.0719,-16.6028\"/>\n<text text-anchor=\"middle\" x=\"195.5\" y=\"-20.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.8</text>\n</g>\n</g>\n</svg>\n"
          },
          "metadata": {
            "tags": []
          }
        }
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "Fq63jb0u_Vln"
      },
      "source": [
        "### A tree that cannot be represented as a Bayesian graph: Weather-Barometer Worlds\n",
        "\n",
        "We can also build a tree where the different realization paths have different\n",
        "causal dependencies. For instance, imagine we have two possible worlds: - Our\n",
        "world ($A = 0$) where the weather ($W$) influences the barometer reading\n",
        "($B$); - An alien world ($A = 1$) where the barometer influences the weather.\n",
        "\n",
        "Such a situation with multiple causal dependencies cannot be captured in a\n",
        "single graphical model:\n",
        "\n",
        "![Weather-Barometer Worlds](http://www.adaptiveagents.org/_media/wiki/weather-barometer-worlds.png)"
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "er74BN7n_Vlo"
      },
      "source": [
        "However, we can represent it using a probability tree:\n",
        "\n",
        "![Weather-Barometer Worlds Probability Tree](http://www.adaptiveagents.org/_media/wiki/wb_tree.png)"
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "afVSi5xo_Vlo"
      },
      "source": [
        "### Exercise 1\n",
        "\n",
        "Now it's your turn to create a probability tree. Create the \"weather-barometer\n",
        "worlds\" probability tree and name it `wb`."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "bCeTXeTe7WDM"
      },
      "source": [
        ""
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "ehQ37yPg7Wil"
      },
      "source": [
        "#### Solution"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "Q7W7exq4_Vlp",
        "outputId": "317ec8b1-1844-4396-e66d-b31c0d055aa7",
        "colab": {
          "base_uri": "https://localhost:8080/",
          "height": 264
        }
      },
      "source": [
        "# Create blank tree.\n",
        "wb = PTree()\n",
        "\n",
        "# Set the root node and its sub-nodes.\n",
        "wb.root('O = 1', [\n",
        "    wb.child(0.5, 'A = 0', [\n",
        "        wb.child(0.5, 'W = 0',\n",
        "                 [wb.child(0.75, 'B = 0'),\n",
        "                  wb.child(0.25, 'B = 1')]),\n",
        "        wb.child(0.5, 'W = 1',\n",
        "                 [wb.child(0.25, 'B = 0'),\n",
        "                  wb.child(0.75, 'B = 1')])\n",
        "    ]),\n",
        "    wb.child(0.5, 'A = 1', [\n",
        "        wb.child(0.5, 'B = 0',\n",
        "                 [wb.child(0.75, 'W = 0'),\n",
        "                  wb.child(0.25, 'W = 1')]),\n",
        "        wb.child(0.5, 'B = 1',\n",
        "                 [wb.child(0.25, 'W = 0'),\n",
        "                  wb.child(0.75, 'W = 1')])\n",
        "    ])\n",
        "])\n",
        "\n",
        "# Display it.\n",
        "display(wb.show())"
      ],
      "execution_count": null,
      "outputs": [
        {
          "output_type": "display_data",
          "data": {
            "text/plain": [
              "<graphviz.dot.Digraph at 0x7f3c05b88668>"
            ],
            "image/svg+xml": "<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\"?>\n<!DOCTYPE svg PUBLIC \"-//W3C//DTD SVG 1.1//EN\"\n \"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd\">\n<!-- Generated by graphviz version 2.40.1 (20161225.0304)\n -->\n<!-- Title: g Pages: 1 -->\n<svg width=\"269pt\" height=\"182pt\"\n viewBox=\"0.00 0.00 269.00 182.00\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">\n<g id=\"graph0\" class=\"graph\" transform=\"scale(1 1) rotate(0) translate(4 178)\">\n<title>g</title>\n<polygon fill=\"#ffffff\" stroke=\"transparent\" points=\"-4,4 -4,-178 265,-178 265,4 -4,4\"/>\n<!-- 15 -->\n<g id=\"node1\" class=\"node\">\n<title>15</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M31.6667,-92C31.6667,-92 4.3333,-92 4.3333,-92 2.1667,-92 0,-89.8333 0,-87.6667 0,-87.6667 0,-83.3333 0,-83.3333 0,-81.1667 2.1667,-79 4.3333,-79 4.3333,-79 31.6667,-79 31.6667,-79 33.8333,-79 36,-81.1667 36,-83.3333 36,-83.3333 36,-87.6667 36,-87.6667 36,-89.8333 33.8333,-92 31.6667,-92\"/>\n<text text-anchor=\"middle\" x=\"18\" y=\"-83\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">O = 1</text>\n</g>\n<!-- 7 -->\n<g id=\"node2\" class=\"node\">\n<title>7</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M102.6667,-121C102.6667,-121 75.3333,-121 75.3333,-121 73.1667,-121 71,-118.8333 71,-116.6667 71,-116.6667 71,-112.3333 71,-112.3333 71,-110.1667 73.1667,-108 75.3333,-108 75.3333,-108 102.6667,-108 102.6667,-108 104.8333,-108 107,-110.1667 107,-112.3333 107,-112.3333 107,-116.6667 107,-116.6667 107,-118.8333 104.8333,-121 102.6667,-121\"/>\n<text text-anchor=\"middle\" x=\"89\" y=\"-112\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">A = 0</text>\n</g>\n<!-- 15&#45;&gt;7 -->\n<g id=\"edge7\" class=\"edge\">\n<title>15&#45;&gt;7</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M34.111,-92.0805C42.8257,-95.6401 53.7891,-100.1181 63.6219,-104.1343\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"62.3717,-107.4043 72.9528,-107.9455 65.0187,-100.924 62.3717,-107.4043\"/>\n<text text-anchor=\"middle\" x=\"53.5\" y=\"-105.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 14 -->\n<g id=\"node9\" class=\"node\">\n<title>14</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M102.6667,-76C102.6667,-76 75.3333,-76 75.3333,-76 73.1667,-76 71,-73.8333 71,-71.6667 71,-71.6667 71,-67.3333 71,-67.3333 71,-65.1667 73.1667,-63 75.3333,-63 75.3333,-63 102.6667,-63 102.6667,-63 104.8333,-63 107,-65.1667 107,-67.3333 107,-67.3333 107,-71.6667 107,-71.6667 107,-73.8333 104.8333,-76 102.6667,-76\"/>\n<text text-anchor=\"middle\" x=\"89\" y=\"-67\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">A = 1</text>\n</g>\n<!-- 15&#45;&gt;14 -->\n<g id=\"edge14\" class=\"edge\">\n<title>15&#45;&gt;14</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M36.2843,-81.3796C43.68,-79.713 52.3911,-77.7499 60.5786,-75.9048\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"61.545,-79.2749 70.5309,-73.662 60.0061,-72.4461 61.545,-79.2749\"/>\n<text text-anchor=\"middle\" x=\"53.5\" y=\"-81.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 3 -->\n<g id=\"node3\" class=\"node\">\n<title>3</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M176.6667,-151C176.6667,-151 146.3333,-151 146.3333,-151 144.1667,-151 142,-148.8333 142,-146.6667 142,-146.6667 142,-142.3333 142,-142.3333 142,-140.1667 144.1667,-138 146.3333,-138 146.3333,-138 176.6667,-138 176.6667,-138 178.8333,-138 181,-140.1667 181,-142.3333 181,-142.3333 181,-146.6667 181,-146.6667 181,-148.8333 178.8333,-151 176.6667,-151\"/>\n<text text-anchor=\"middle\" x=\"161.5\" y=\"-142\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">W = 0</text>\n</g>\n<!-- 7&#45;&gt;3 -->\n<g id=\"edge3\" class=\"edge\">\n<title>7&#45;&gt;3</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M104.7314,-121.0096C113.8207,-124.7706 125.4762,-129.5936 135.8585,-133.8897\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"134.7189,-137.2059 145.2973,-137.7954 137.3954,-130.7378 134.7189,-137.2059\"/>\n<text text-anchor=\"middle\" x=\"124.5\" y=\"-133.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 6 -->\n<g id=\"node6\" class=\"node\">\n<title>6</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M176.6667,-121C176.6667,-121 146.3333,-121 146.3333,-121 144.1667,-121 142,-118.8333 142,-116.6667 142,-116.6667 142,-112.3333 142,-112.3333 142,-110.1667 144.1667,-108 146.3333,-108 146.3333,-108 176.6667,-108 176.6667,-108 178.8333,-108 181,-110.1667 181,-112.3333 181,-112.3333 181,-116.6667 181,-116.6667 181,-118.8333 178.8333,-121 176.6667,-121\"/>\n<text text-anchor=\"middle\" x=\"161.5\" y=\"-112\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">W = 1</text>\n</g>\n<!-- 7&#45;&gt;6 -->\n<g id=\"edge6\" class=\"edge\">\n<title>7&#45;&gt;6</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M107.2948,-114.5C114.7275,-114.5 123.5076,-114.5 131.8123,-114.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"131.9402,-118.0001 141.9402,-114.5 131.9401,-111.0001 131.9402,-118.0001\"/>\n<text text-anchor=\"middle\" x=\"124.5\" y=\"-117.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 1 -->\n<g id=\"node4\" class=\"node\">\n<title>1</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M255.1667,-174C255.1667,-174 227.8333,-174 227.8333,-174 225.6667,-174 223.5,-171.8333 223.5,-169.6667 223.5,-169.6667 223.5,-165.3333 223.5,-165.3333 223.5,-163.1667 225.6667,-161 227.8333,-161 227.8333,-161 255.1667,-161 255.1667,-161 257.3333,-161 259.5,-163.1667 259.5,-165.3333 259.5,-165.3333 259.5,-169.6667 259.5,-169.6667 259.5,-171.8333 257.3333,-174 255.1667,-174\"/>\n<text text-anchor=\"middle\" x=\"241.5\" y=\"-165\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">B = 0</text>\n</g>\n<!-- 3&#45;&gt;1 -->\n<g id=\"edge1\" class=\"edge\">\n<title>3&#45;&gt;1</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M176.8503,-151.0798C181.6467,-152.9888 186.9938,-154.9692 192,-156.5 198.9006,-158.6101 206.457,-160.4967 213.5418,-162.0865\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"212.9437,-165.5375 223.4531,-164.195 214.4003,-158.6908 212.9437,-165.5375\"/>\n<text text-anchor=\"middle\" x=\"201.5\" y=\"-163.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.75</text>\n</g>\n<!-- 2 -->\n<g id=\"node5\" class=\"node\">\n<title>2</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M255.1667,-151C255.1667,-151 227.8333,-151 227.8333,-151 225.6667,-151 223.5,-148.8333 223.5,-146.6667 223.5,-146.6667 223.5,-142.3333 223.5,-142.3333 223.5,-140.1667 225.6667,-138 227.8333,-138 227.8333,-138 255.1667,-138 255.1667,-138 257.3333,-138 259.5,-140.1667 259.5,-142.3333 259.5,-142.3333 259.5,-146.6667 259.5,-146.6667 259.5,-148.8333 257.3333,-151 255.1667,-151\"/>\n<text text-anchor=\"middle\" x=\"241.5\" y=\"-142\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">B = 1</text>\n</g>\n<!-- 3&#45;&gt;2 -->\n<g id=\"edge2\" class=\"edge\">\n<title>3&#45;&gt;2</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M181.2753,-144.5C190.9226,-144.5 202.6999,-144.5 213.2726,-144.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"213.3202,-148.0001 223.3202,-144.5 213.3202,-141.0001 213.3202,-148.0001\"/>\n<text text-anchor=\"middle\" x=\"201.5\" y=\"-147.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.25</text>\n</g>\n<!-- 4 -->\n<g id=\"node7\" class=\"node\">\n<title>4</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M255.1667,-128C255.1667,-128 227.8333,-128 227.8333,-128 225.6667,-128 223.5,-125.8333 223.5,-123.6667 223.5,-123.6667 223.5,-119.3333 223.5,-119.3333 223.5,-117.1667 225.6667,-115 227.8333,-115 227.8333,-115 255.1667,-115 255.1667,-115 257.3333,-115 259.5,-117.1667 259.5,-119.3333 259.5,-119.3333 259.5,-123.6667 259.5,-123.6667 259.5,-125.8333 257.3333,-128 255.1667,-128\"/>\n<text text-anchor=\"middle\" x=\"241.5\" y=\"-119\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">B = 0</text>\n</g>\n<!-- 6&#45;&gt;4 -->\n<g id=\"edge4\" class=\"edge\">\n<title>6&#45;&gt;4</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M181.2753,-116.2303C190.9226,-117.0745 202.6999,-118.105 213.2726,-119.0301\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"213.0531,-122.5242 223.3202,-119.9093 213.6634,-115.5508 213.0531,-122.5242\"/>\n<text text-anchor=\"middle\" x=\"201.5\" y=\"-121.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.25</text>\n</g>\n<!-- 5 -->\n<g id=\"node8\" class=\"node\">\n<title>5</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M255.1667,-105C255.1667,-105 227.8333,-105 227.8333,-105 225.6667,-105 223.5,-102.8333 223.5,-100.6667 223.5,-100.6667 223.5,-96.3333 223.5,-96.3333 223.5,-94.1667 225.6667,-92 227.8333,-92 227.8333,-92 255.1667,-92 255.1667,-92 257.3333,-92 259.5,-94.1667 259.5,-96.3333 259.5,-96.3333 259.5,-100.6667 259.5,-100.6667 259.5,-102.8333 257.3333,-105 255.1667,-105\"/>\n<text text-anchor=\"middle\" x=\"241.5\" y=\"-96\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">B = 1</text>\n</g>\n<!-- 6&#45;&gt;5 -->\n<g id=\"edge5\" class=\"edge\">\n<title>6&#45;&gt;5</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M179.4001,-107.9837C183.4982,-106.6736 187.8658,-105.4189 192,-104.5 198.7656,-102.9961 206.1409,-101.8461 213.0829,-100.9756\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"213.9295,-104.4035 223.485,-99.8272 213.1613,-97.4458 213.9295,-104.4035\"/>\n<text text-anchor=\"middle\" x=\"201.5\" y=\"-107.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.75</text>\n</g>\n<!-- 10 -->\n<g id=\"node10\" class=\"node\">\n<title>10</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M175.1667,-76C175.1667,-76 147.8333,-76 147.8333,-76 145.6667,-76 143.5,-73.8333 143.5,-71.6667 143.5,-71.6667 143.5,-67.3333 143.5,-67.3333 143.5,-65.1667 145.6667,-63 147.8333,-63 147.8333,-63 175.1667,-63 175.1667,-63 177.3333,-63 179.5,-65.1667 179.5,-67.3333 179.5,-67.3333 179.5,-71.6667 179.5,-71.6667 179.5,-73.8333 177.3333,-76 175.1667,-76\"/>\n<text text-anchor=\"middle\" x=\"161.5\" y=\"-67\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">B = 0</text>\n</g>\n<!-- 14&#45;&gt;10 -->\n<g id=\"edge10\" class=\"edge\">\n<title>14&#45;&gt;10</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M107.2948,-69.5C115.168,-69.5 124.5529,-69.5 133.2833,-69.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"133.4622,-73.0001 143.4622,-69.5 133.4622,-66.0001 133.4622,-73.0001\"/>\n<text text-anchor=\"middle\" x=\"124.5\" y=\"-72.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 13 -->\n<g id=\"node13\" class=\"node\">\n<title>13</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M175.1667,-36C175.1667,-36 147.8333,-36 147.8333,-36 145.6667,-36 143.5,-33.8333 143.5,-31.6667 143.5,-31.6667 143.5,-27.3333 143.5,-27.3333 143.5,-25.1667 145.6667,-23 147.8333,-23 147.8333,-23 175.1667,-23 175.1667,-23 177.3333,-23 179.5,-25.1667 179.5,-27.3333 179.5,-27.3333 179.5,-31.6667 179.5,-31.6667 179.5,-33.8333 177.3333,-36 175.1667,-36\"/>\n<text text-anchor=\"middle\" x=\"161.5\" y=\"-27\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">B = 1</text>\n</g>\n<!-- 14&#45;&gt;13 -->\n<g id=\"edge13\" class=\"edge\">\n<title>14&#45;&gt;13</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M100.9719,-62.8948C111.6123,-57.0243 127.4176,-48.3041 140.2091,-41.2467\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"142.203,-44.144 149.268,-36.2487 138.8214,-38.015 142.203,-44.144\"/>\n<text text-anchor=\"middle\" x=\"124.5\" y=\"-55.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 8 -->\n<g id=\"node11\" class=\"node\">\n<title>8</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M256.6667,-82C256.6667,-82 226.3333,-82 226.3333,-82 224.1667,-82 222,-79.8333 222,-77.6667 222,-77.6667 222,-73.3333 222,-73.3333 222,-71.1667 224.1667,-69 226.3333,-69 226.3333,-69 256.6667,-69 256.6667,-69 258.8333,-69 261,-71.1667 261,-73.3333 261,-73.3333 261,-77.6667 261,-77.6667 261,-79.8333 258.8333,-82 256.6667,-82\"/>\n<text text-anchor=\"middle\" x=\"241.5\" y=\"-73\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">W = 0</text>\n</g>\n<!-- 10&#45;&gt;8 -->\n<g id=\"edge8\" class=\"edge\">\n<title>10&#45;&gt;8</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M179.6532,-70.8615C189.0577,-71.5668 200.7863,-72.4465 211.494,-73.2496\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"211.5038,-76.76 221.7376,-74.0178 212.0274,-69.7796 211.5038,-76.76\"/>\n<text text-anchor=\"middle\" x=\"201.5\" y=\"-75.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.75</text>\n</g>\n<!-- 9 -->\n<g id=\"node12\" class=\"node\">\n<title>9</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M256.6667,-59C256.6667,-59 226.3333,-59 226.3333,-59 224.1667,-59 222,-56.8333 222,-54.6667 222,-54.6667 222,-50.3333 222,-50.3333 222,-48.1667 224.1667,-46 226.3333,-46 226.3333,-46 256.6667,-46 256.6667,-46 258.8333,-46 261,-48.1667 261,-50.3333 261,-50.3333 261,-54.6667 261,-54.6667 261,-56.8333 258.8333,-59 256.6667,-59\"/>\n<text text-anchor=\"middle\" x=\"241.5\" y=\"-50\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">W = 1</text>\n</g>\n<!-- 10&#45;&gt;9 -->\n<g id=\"edge9\" class=\"edge\">\n<title>10&#45;&gt;9</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M179.738,-62.9409C183.7408,-61.6646 187.9837,-60.4347 192,-59.5 198.1736,-58.0633 204.8533,-56.8766 211.2479,-55.9142\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"212.1657,-59.3215 221.6008,-54.5018 211.2194,-52.3857 212.1657,-59.3215\"/>\n<text text-anchor=\"middle\" x=\"201.5\" y=\"-62.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.25</text>\n</g>\n<!-- 11 -->\n<g id=\"node14\" class=\"node\">\n<title>11</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M256.6667,-36C256.6667,-36 226.3333,-36 226.3333,-36 224.1667,-36 222,-33.8333 222,-31.6667 222,-31.6667 222,-27.3333 222,-27.3333 222,-25.1667 224.1667,-23 226.3333,-23 226.3333,-23 256.6667,-23 256.6667,-23 258.8333,-23 261,-25.1667 261,-27.3333 261,-27.3333 261,-31.6667 261,-31.6667 261,-33.8333 258.8333,-36 256.6667,-36\"/>\n<text text-anchor=\"middle\" x=\"241.5\" y=\"-27\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">W = 0</text>\n</g>\n<!-- 13&#45;&gt;11 -->\n<g id=\"edge11\" class=\"edge\">\n<title>13&#45;&gt;11</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M179.6532,-29.5C189.0577,-29.5 200.7863,-29.5 211.494,-29.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"211.7376,-33.0001 221.7376,-29.5 211.7375,-26.0001 211.7376,-33.0001\"/>\n<text text-anchor=\"middle\" x=\"201.5\" y=\"-32.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.25</text>\n</g>\n<!-- 12 -->\n<g id=\"node15\" class=\"node\">\n<title>12</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M256.6667,-13C256.6667,-13 226.3333,-13 226.3333,-13 224.1667,-13 222,-10.8333 222,-8.6667 222,-8.6667 222,-4.3333 222,-4.3333 222,-2.1667 224.1667,0 226.3333,0 226.3333,0 256.6667,0 256.6667,0 258.8333,0 261,-2.1667 261,-4.3333 261,-4.3333 261,-8.6667 261,-8.6667 261,-10.8333 258.8333,-13 256.6667,-13\"/>\n<text text-anchor=\"middle\" x=\"241.5\" y=\"-4\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">W = 1</text>\n</g>\n<!-- 13&#45;&gt;12 -->\n<g id=\"edge12\" class=\"edge\">\n<title>13&#45;&gt;12</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M176.8503,-22.9202C181.6467,-21.0112 186.9938,-19.0308 192,-17.5 198.2982,-15.5741 205.1426,-13.8344 211.6762,-12.3366\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"212.5344,-15.7319 221.5642,-10.1899 211.0493,-8.8913 212.5344,-15.7319\"/>\n<text text-anchor=\"middle\" x=\"201.5\" y=\"-20.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.75</text>\n</g>\n</g>\n</svg>\n"
          },
          "metadata": {
            "tags": []
          }
        }
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "9TvtFpta_Vls"
      },
      "source": [
        "### Remember:\n",
        "\n",
        "-   A node can contain more than one statement.\n",
        "-   The tree doesn't have to be balanced.\n",
        "\n",
        "See the next example."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "e4RxAStn_Vls",
        "outputId": "ff9fd073-6b5e-4c1e-ef1b-2f87494c346b",
        "colab": {
          "base_uri": "https://localhost:8080/",
          "height": 106
        }
      },
      "source": [
        "pt = PTree()\n",
        "pt.root('O = 1', [\n",
        "    pt.child(0.2, 'X = 0, Y = 0'),\n",
        "    pt.child(0.8, 'X = 1', [pt.child(0.3, 'Y = 1'),\n",
        "                            pt.child(0.7, 'Y = 2')])\n",
        "])\n",
        "\n",
        "display(pt.show())"
      ],
      "execution_count": null,
      "outputs": [
        {
          "output_type": "display_data",
          "data": {
            "text/plain": [
              "<graphviz.dot.Digraph at 0x7f3c05b79be0>"
            ],
            "image/svg+xml": "<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\"?>\n<!DOCTYPE svg PUBLIC \"-//W3C//DTD SVG 1.1//EN\"\n \"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd\">\n<!-- Generated by graphviz version 2.40.1 (20161225.0304)\n -->\n<!-- Title: g Pages: 1 -->\n<svg width=\"186pt\" height=\"64pt\"\n viewBox=\"0.00 0.00 186.00 63.50\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">\n<g id=\"graph0\" class=\"graph\" transform=\"scale(1 1) rotate(0) translate(4 59.5)\">\n<title>g</title>\n<polygon fill=\"#ffffff\" stroke=\"transparent\" points=\"-4,4 -4,-59.5 182,-59.5 182,4 -4,4\"/>\n<!-- 5 -->\n<g id=\"node1\" class=\"node\">\n<title>5</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M31.6667,-37C31.6667,-37 4.3333,-37 4.3333,-37 2.1667,-37 0,-34.8333 0,-32.6667 0,-32.6667 0,-28.3333 0,-28.3333 0,-26.1667 2.1667,-24 4.3333,-24 4.3333,-24 31.6667,-24 31.6667,-24 33.8333,-24 36,-26.1667 36,-28.3333 36,-28.3333 36,-32.6667 36,-32.6667 36,-34.8333 33.8333,-37 31.6667,-37\"/>\n<text text-anchor=\"middle\" x=\"18\" y=\"-28\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">O = 1</text>\n</g>\n<!-- 1 -->\n<g id=\"node2\" class=\"node\">\n<title>1</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M99,-55.5C99,-55.5 79,-55.5 79,-55.5 75,-55.5 71,-51.5 71,-47.5 71,-47.5 71,-39.5 71,-39.5 71,-35.5 75,-31.5 79,-31.5 79,-31.5 99,-31.5 99,-31.5 103,-31.5 107,-35.5 107,-39.5 107,-39.5 107,-47.5 107,-47.5 107,-51.5 103,-55.5 99,-55.5\"/>\n<text text-anchor=\"middle\" x=\"89\" y=\"-46.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">X = 0</text>\n<text text-anchor=\"middle\" x=\"89\" y=\"-35.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">Y = 0</text>\n</g>\n<!-- 5&#45;&gt;1 -->\n<g id=\"edge1\" class=\"edge\">\n<title>5&#45;&gt;1</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M36.2843,-33.8478C43.68,-35.202 52.3911,-36.797 60.5786,-38.2961\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"60.0641,-41.76 70.5309,-40.1183 61.3248,-34.8744 60.0641,-41.76\"/>\n<text text-anchor=\"middle\" x=\"53.5\" y=\"-40.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.2</text>\n</g>\n<!-- 4 -->\n<g id=\"node3\" class=\"node\">\n<title>4</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M102.6667,-24C102.6667,-24 75.3333,-24 75.3333,-24 73.1667,-24 71,-21.8333 71,-19.6667 71,-19.6667 71,-15.3333 71,-15.3333 71,-13.1667 73.1667,-11 75.3333,-11 75.3333,-11 102.6667,-11 102.6667,-11 104.8333,-11 107,-13.1667 107,-15.3333 107,-15.3333 107,-19.6667 107,-19.6667 107,-21.8333 104.8333,-24 102.6667,-24\"/>\n<text text-anchor=\"middle\" x=\"89\" y=\"-15\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">X = 1</text>\n</g>\n<!-- 5&#45;&gt;4 -->\n<g id=\"edge4\" class=\"edge\">\n<title>5&#45;&gt;4</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M36.0419,-25.8647C39.6576,-25.0151 43.4393,-24.1825 47,-23.5 51.5167,-22.6343 56.3286,-21.8339 61.023,-21.1186\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"61.5495,-24.579 70.9519,-19.6959 60.5565,-17.6498 61.5495,-24.579\"/>\n<text text-anchor=\"middle\" x=\"53.5\" y=\"-26.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.8</text>\n</g>\n<!-- 2 -->\n<g id=\"node4\" class=\"node\">\n<title>2</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M173.6667,-36C173.6667,-36 146.3333,-36 146.3333,-36 144.1667,-36 142,-33.8333 142,-31.6667 142,-31.6667 142,-27.3333 142,-27.3333 142,-25.1667 144.1667,-23 146.3333,-23 146.3333,-23 173.6667,-23 173.6667,-23 175.8333,-23 178,-25.1667 178,-27.3333 178,-27.3333 178,-31.6667 178,-31.6667 178,-33.8333 175.8333,-36 173.6667,-36\"/>\n<text text-anchor=\"middle\" x=\"160\" y=\"-27\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">Y = 1</text>\n</g>\n<!-- 4&#45;&gt;2 -->\n<g id=\"edge2\" class=\"edge\">\n<title>4&#45;&gt;2</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M107.2843,-20.5903C114.68,-21.8403 123.3911,-23.3126 131.5786,-24.6964\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"131.0875,-28.1629 141.5309,-26.3785 132.2541,-21.2608 131.0875,-28.1629\"/>\n<text text-anchor=\"middle\" x=\"124.5\" y=\"-28.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.3</text>\n</g>\n<!-- 3 -->\n<g id=\"node5\" class=\"node\">\n<title>3</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M173.6667,-13C173.6667,-13 146.3333,-13 146.3333,-13 144.1667,-13 142,-10.8333 142,-8.6667 142,-8.6667 142,-4.3333 142,-4.3333 142,-2.1667 144.1667,0 146.3333,0 146.3333,0 173.6667,0 173.6667,0 175.8333,0 178,-2.1667 178,-4.3333 178,-4.3333 178,-8.6667 178,-8.6667 178,-10.8333 175.8333,-13 173.6667,-13\"/>\n<text text-anchor=\"middle\" x=\"160\" y=\"-4\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">Y = 2</text>\n</g>\n<!-- 4&#45;&gt;3 -->\n<g id=\"edge3\" class=\"edge\">\n<title>4&#45;&gt;3</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M107.0181,-12.7321C110.6357,-11.8934 114.4243,-11.0987 118,-10.5 122.3886,-9.7652 127.0596,-9.1538 131.6316,-8.6488\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"132.3231,-12.0984 141.9412,-7.6551 131.6515,-5.1307 132.3231,-12.0984\"/>\n<text text-anchor=\"middle\" x=\"124.5\" y=\"-13.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.7</text>\n</g>\n</g>\n</svg>\n"
          },
          "metadata": {
            "tags": []
          }
        }
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "tZijtGvW_Vlw"
      },
      "source": [
        "### Displaying additional information\n",
        "\n",
        "We can display additional information about probability trees: \n",
        "- **Unique identifiers**: Each node has an automatically assigned \n",
        "unique identifier. Use `show_id = True` to display it. \n",
        "- **Probability**: Each node has a probability of being realized. \n",
        "Use `show_prob = True` to display this information."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "xZRlhlq__Vlw",
        "outputId": "4b07ccc8-2ab3-4743-c809-97946c28c2be",
        "colab": {
          "base_uri": "https://localhost:8080/",
          "height": 470
        }
      },
      "source": [
        "display(med.show(show_prob=True, show_id=True))"
      ],
      "execution_count": null,
      "outputs": [
        {
          "output_type": "display_data",
          "data": {
            "text/plain": [
              "<graphviz.dot.Digraph at 0x7f3c05b79b38>"
            ],
            "image/svg+xml": "<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\"?>\n<!DOCTYPE svg PUBLIC \"-//W3C//DTD SVG 1.1//EN\"\n \"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd\">\n<!-- Generated by graphviz version 2.40.1 (20161225.0304)\n -->\n<!-- Title: g Pages: 1 -->\n<svg width=\"281pt\" height=\"337pt\"\n viewBox=\"0.00 0.00 281.00 337.00\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">\n<g id=\"graph0\" class=\"graph\" transform=\"scale(1 1) rotate(0) translate(4 333)\">\n<title>g</title>\n<polygon fill=\"#ffffff\" stroke=\"transparent\" points=\"-4,4 -4,-333 277,-333 277,4 -4,4\"/>\n<!-- 15 -->\n<g id=\"node1\" class=\"node\">\n<title>15</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M24.3333,-187C24.3333,-187 11.6667,-187 11.6667,-187 5.8333,-187 0,-181.1667 0,-175.3333 0,-175.3333 0,-163.6667 0,-163.6667 0,-157.8333 5.8333,-152 11.6667,-152 11.6667,-152 24.3333,-152 24.3333,-152 30.1667,-152 36,-157.8333 36,-163.6667 36,-163.6667 36,-175.3333 36,-175.3333 36,-181.1667 30.1667,-187 24.3333,-187\"/>\n<text text-anchor=\"middle\" x=\"18\" y=\"-178\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">15</text>\n<text text-anchor=\"middle\" x=\"18\" y=\"-167\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">O = 1</text>\n<text text-anchor=\"middle\" x=\"18\" y=\"-156\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 1</text>\n</g>\n<!-- 7 -->\n<g id=\"node2\" class=\"node\">\n<title>7</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M101.3333,-230C101.3333,-230 82.6667,-230 82.6667,-230 76.8333,-230 71,-224.1667 71,-218.3333 71,-218.3333 71,-206.6667 71,-206.6667 71,-200.8333 76.8333,-195 82.6667,-195 82.6667,-195 101.3333,-195 101.3333,-195 107.1667,-195 113,-200.8333 113,-206.6667 113,-206.6667 113,-218.3333 113,-218.3333 113,-224.1667 107.1667,-230 101.3333,-230\"/>\n<text text-anchor=\"middle\" x=\"92\" y=\"-221\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">7</text>\n<text text-anchor=\"middle\" x=\"92\" y=\"-210\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">D = 0</text>\n<text text-anchor=\"middle\" x=\"92\" y=\"-199\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.4</text>\n</g>\n<!-- 15&#45;&gt;7 -->\n<g id=\"edge7\" class=\"edge\">\n<title>15&#45;&gt;7</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M36.2921,-180.1292C44.0429,-184.633 53.28,-190.0006 61.9824,-195.0573\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"60.3681,-198.1673 70.7729,-200.1653 63.8851,-192.1149 60.3681,-198.1673\"/>\n<text text-anchor=\"middle\" x=\"53.5\" y=\"-196.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.4</text>\n</g>\n<!-- 14 -->\n<g id=\"node9\" class=\"node\">\n<title>14</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M101.3333,-146C101.3333,-146 82.6667,-146 82.6667,-146 76.8333,-146 71,-140.1667 71,-134.3333 71,-134.3333 71,-122.6667 71,-122.6667 71,-116.8333 76.8333,-111 82.6667,-111 82.6667,-111 101.3333,-111 101.3333,-111 107.1667,-111 113,-116.8333 113,-122.6667 113,-122.6667 113,-134.3333 113,-134.3333 113,-140.1667 107.1667,-146 101.3333,-146\"/>\n<text text-anchor=\"middle\" x=\"92\" y=\"-137\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">14</text>\n<text text-anchor=\"middle\" x=\"92\" y=\"-126\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">D = 1</text>\n<text text-anchor=\"middle\" x=\"92\" y=\"-115\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.6</text>\n</g>\n<!-- 15&#45;&gt;14 -->\n<g id=\"edge14\" class=\"edge\">\n<title>15&#45;&gt;14</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M36.2921,-159.3652C44.0429,-155.0708 53.28,-149.953 61.9824,-145.1314\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"63.722,-148.1689 70.7729,-140.261 60.3295,-142.0459 63.722,-148.1689\"/>\n<text text-anchor=\"middle\" x=\"53.5\" y=\"-155.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.6</text>\n</g>\n<!-- 3 -->\n<g id=\"node3\" class=\"node\">\n<title>3</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M178.3333,-287C178.3333,-287 159.6667,-287 159.6667,-287 153.8333,-287 148,-281.1667 148,-275.3333 148,-275.3333 148,-263.6667 148,-263.6667 148,-257.8333 153.8333,-252 159.6667,-252 159.6667,-252 178.3333,-252 178.3333,-252 184.1667,-252 190,-257.8333 190,-263.6667 190,-263.6667 190,-275.3333 190,-275.3333 190,-281.1667 184.1667,-287 178.3333,-287\"/>\n<text text-anchor=\"middle\" x=\"169\" y=\"-278\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">3</text>\n<text text-anchor=\"middle\" x=\"169\" y=\"-267\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">T = 0</text>\n<text text-anchor=\"middle\" x=\"169\" y=\"-256\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.2</text>\n</g>\n<!-- 7&#45;&gt;3 -->\n<g id=\"edge3\" class=\"edge\">\n<title>7&#45;&gt;3</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M113.0406,-228.0755C121.2741,-234.1704 130.8591,-241.2659 139.7457,-247.8442\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"137.865,-250.8066 147.9849,-253.9433 142.0298,-245.1804 137.865,-250.8066\"/>\n<text text-anchor=\"middle\" x=\"130.5\" y=\"-246.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 6 -->\n<g id=\"node6\" class=\"node\">\n<title>6</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M178.3333,-230C178.3333,-230 159.6667,-230 159.6667,-230 153.8333,-230 148,-224.1667 148,-218.3333 148,-218.3333 148,-206.6667 148,-206.6667 148,-200.8333 153.8333,-195 159.6667,-195 159.6667,-195 178.3333,-195 178.3333,-195 184.1667,-195 190,-200.8333 190,-206.6667 190,-206.6667 190,-218.3333 190,-218.3333 190,-224.1667 184.1667,-230 178.3333,-230\"/>\n<text text-anchor=\"middle\" x=\"169\" y=\"-221\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">6</text>\n<text text-anchor=\"middle\" x=\"169\" y=\"-210\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">T = 1</text>\n<text text-anchor=\"middle\" x=\"169\" y=\"-199\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.2</text>\n</g>\n<!-- 7&#45;&gt;6 -->\n<g id=\"edge6\" class=\"edge\">\n<title>7&#45;&gt;6</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M113.0406,-212.5C120.6799,-212.5 129.4828,-212.5 137.8117,-212.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"137.9849,-216.0001 147.9849,-212.5 137.9848,-209.0001 137.9849,-216.0001\"/>\n<text text-anchor=\"middle\" x=\"130.5\" y=\"-215.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 1 -->\n<g id=\"node4\" class=\"node\">\n<title>1</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M261.3333,-329C261.3333,-329 236.6667,-329 236.6667,-329 230.8333,-329 225,-323.1667 225,-317.3333 225,-317.3333 225,-305.6667 225,-305.6667 225,-299.8333 230.8333,-294 236.6667,-294 236.6667,-294 261.3333,-294 261.3333,-294 267.1667,-294 273,-299.8333 273,-305.6667 273,-305.6667 273,-317.3333 273,-317.3333 273,-323.1667 267.1667,-329 261.3333,-329\"/>\n<text text-anchor=\"middle\" x=\"249\" y=\"-320\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">1</text>\n<text text-anchor=\"middle\" x=\"249\" y=\"-309\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">R = 0</text>\n<text text-anchor=\"middle\" x=\"249\" y=\"-298\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.04</text>\n</g>\n<!-- 3&#45;&gt;1 -->\n<g id=\"edge1\" class=\"edge\">\n<title>3&#45;&gt;1</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M190.0191,-280.535C197.9216,-284.6839 207.1109,-289.5082 215.8505,-294.0965\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"214.2416,-297.2048 224.7225,-298.7543 217.4955,-291.007 214.2416,-297.2048\"/>\n<text text-anchor=\"middle\" x=\"207.5\" y=\"-295.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.2</text>\n</g>\n<!-- 2 -->\n<g id=\"node5\" class=\"node\">\n<title>2</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M261.3333,-287C261.3333,-287 236.6667,-287 236.6667,-287 230.8333,-287 225,-281.1667 225,-275.3333 225,-275.3333 225,-263.6667 225,-263.6667 225,-257.8333 230.8333,-252 236.6667,-252 236.6667,-252 261.3333,-252 261.3333,-252 267.1667,-252 273,-257.8333 273,-263.6667 273,-263.6667 273,-275.3333 273,-275.3333 273,-281.1667 267.1667,-287 261.3333,-287\"/>\n<text text-anchor=\"middle\" x=\"249\" y=\"-278\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">2</text>\n<text text-anchor=\"middle\" x=\"249\" y=\"-267\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">R = 1</text>\n<text text-anchor=\"middle\" x=\"249\" y=\"-256\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.16</text>\n</g>\n<!-- 3&#45;&gt;2 -->\n<g id=\"edge2\" class=\"edge\">\n<title>3&#45;&gt;2</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M190.0191,-269.5C197.5057,-269.5 206.1472,-269.5 214.4671,-269.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"214.7225,-273.0001 224.7225,-269.5 214.7225,-266.0001 214.7225,-273.0001\"/>\n<text text-anchor=\"middle\" x=\"207.5\" y=\"-272.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.8</text>\n</g>\n<!-- 4 -->\n<g id=\"node7\" class=\"node\">\n<title>4</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M261.3333,-245C261.3333,-245 236.6667,-245 236.6667,-245 230.8333,-245 225,-239.1667 225,-233.3333 225,-233.3333 225,-221.6667 225,-221.6667 225,-215.8333 230.8333,-210 236.6667,-210 236.6667,-210 261.3333,-210 261.3333,-210 267.1667,-210 273,-215.8333 273,-221.6667 273,-221.6667 273,-233.3333 273,-233.3333 273,-239.1667 267.1667,-245 261.3333,-245\"/>\n<text text-anchor=\"middle\" x=\"249\" y=\"-236\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">4</text>\n<text text-anchor=\"middle\" x=\"249\" y=\"-225\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">R = 0</text>\n<text text-anchor=\"middle\" x=\"249\" y=\"-214\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.16</text>\n</g>\n<!-- 6&#45;&gt;4 -->\n<g id=\"edge4\" class=\"edge\">\n<title>6&#45;&gt;4</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M190.0191,-216.4411C197.5889,-217.8604 206.3394,-219.5011 214.7443,-221.0771\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"214.2487,-224.5451 224.7225,-222.948 215.5388,-217.665 214.2487,-224.5451\"/>\n<text text-anchor=\"middle\" x=\"207.5\" y=\"-223.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.8</text>\n</g>\n<!-- 5 -->\n<g id=\"node8\" class=\"node\">\n<title>5</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M261.3333,-203C261.3333,-203 236.6667,-203 236.6667,-203 230.8333,-203 225,-197.1667 225,-191.3333 225,-191.3333 225,-179.6667 225,-179.6667 225,-173.8333 230.8333,-168 236.6667,-168 236.6667,-168 261.3333,-168 261.3333,-168 267.1667,-168 273,-173.8333 273,-179.6667 273,-179.6667 273,-191.3333 273,-191.3333 273,-197.1667 267.1667,-203 261.3333,-203\"/>\n<text text-anchor=\"middle\" x=\"249\" y=\"-194\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">5</text>\n<text text-anchor=\"middle\" x=\"249\" y=\"-183\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">R = 1</text>\n<text text-anchor=\"middle\" x=\"249\" y=\"-172\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.04</text>\n</g>\n<!-- 6&#45;&gt;5 -->\n<g id=\"edge5\" class=\"edge\">\n<title>6&#45;&gt;5</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M190.0191,-205.4061C197.6721,-202.8232 206.5318,-199.833 215.0213,-196.9678\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"216.3668,-200.2077 224.7225,-193.6937 214.1283,-193.5753 216.3668,-200.2077\"/>\n<text text-anchor=\"middle\" x=\"207.5\" y=\"-203.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.2</text>\n</g>\n<!-- 10 -->\n<g id=\"node10\" class=\"node\">\n<title>10</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M178.3333,-146C178.3333,-146 159.6667,-146 159.6667,-146 153.8333,-146 148,-140.1667 148,-134.3333 148,-134.3333 148,-122.6667 148,-122.6667 148,-116.8333 153.8333,-111 159.6667,-111 159.6667,-111 178.3333,-111 178.3333,-111 184.1667,-111 190,-116.8333 190,-122.6667 190,-122.6667 190,-134.3333 190,-134.3333 190,-140.1667 184.1667,-146 178.3333,-146\"/>\n<text text-anchor=\"middle\" x=\"169\" y=\"-137\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">10</text>\n<text text-anchor=\"middle\" x=\"169\" y=\"-126\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">T = 0</text>\n<text text-anchor=\"middle\" x=\"169\" y=\"-115\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.3</text>\n</g>\n<!-- 14&#45;&gt;10 -->\n<g id=\"edge10\" class=\"edge\">\n<title>14&#45;&gt;10</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M113.0406,-128.5C120.6799,-128.5 129.4828,-128.5 137.8117,-128.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"137.9849,-132.0001 147.9849,-128.5 137.9848,-125.0001 137.9849,-132.0001\"/>\n<text text-anchor=\"middle\" x=\"130.5\" y=\"-131.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 13 -->\n<g id=\"node13\" class=\"node\">\n<title>13</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M178.3333,-77C178.3333,-77 159.6667,-77 159.6667,-77 153.8333,-77 148,-71.1667 148,-65.3333 148,-65.3333 148,-53.6667 148,-53.6667 148,-47.8333 153.8333,-42 159.6667,-42 159.6667,-42 178.3333,-42 178.3333,-42 184.1667,-42 190,-47.8333 190,-53.6667 190,-53.6667 190,-65.3333 190,-65.3333 190,-71.1667 184.1667,-77 178.3333,-77\"/>\n<text text-anchor=\"middle\" x=\"169\" y=\"-68\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">13</text>\n<text text-anchor=\"middle\" x=\"169\" y=\"-57\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">T = 1</text>\n<text text-anchor=\"middle\" x=\"169\" y=\"-46\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.3</text>\n</g>\n<!-- 14&#45;&gt;13 -->\n<g id=\"edge13\" class=\"edge\">\n<title>14&#45;&gt;13</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M111.8294,-110.7308C120.9008,-102.6019 131.7968,-92.8379 141.6324,-84.0242\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"144.1262,-86.4892 149.2378,-77.209 139.4546,-81.2761 144.1262,-86.4892\"/>\n<text text-anchor=\"middle\" x=\"130.5\" y=\"-100.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 8 -->\n<g id=\"node11\" class=\"node\">\n<title>8</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M261.3333,-161C261.3333,-161 236.6667,-161 236.6667,-161 230.8333,-161 225,-155.1667 225,-149.3333 225,-149.3333 225,-137.6667 225,-137.6667 225,-131.8333 230.8333,-126 236.6667,-126 236.6667,-126 261.3333,-126 261.3333,-126 267.1667,-126 273,-131.8333 273,-137.6667 273,-137.6667 273,-149.3333 273,-149.3333 273,-155.1667 267.1667,-161 261.3333,-161\"/>\n<text text-anchor=\"middle\" x=\"249\" y=\"-152\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">8</text>\n<text text-anchor=\"middle\" x=\"249\" y=\"-141\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">R = 0</text>\n<text text-anchor=\"middle\" x=\"249\" y=\"-130\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.24</text>\n</g>\n<!-- 10&#45;&gt;8 -->\n<g id=\"edge8\" class=\"edge\">\n<title>10&#45;&gt;8</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M190.0191,-132.4411C197.5889,-133.8604 206.3394,-135.5011 214.7443,-137.0771\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"214.2487,-140.5451 224.7225,-138.948 215.5388,-133.665 214.2487,-140.5451\"/>\n<text text-anchor=\"middle\" x=\"207.5\" y=\"-139.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.8</text>\n</g>\n<!-- 9 -->\n<g id=\"node12\" class=\"node\">\n<title>9</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M261.3333,-119C261.3333,-119 236.6667,-119 236.6667,-119 230.8333,-119 225,-113.1667 225,-107.3333 225,-107.3333 225,-95.6667 225,-95.6667 225,-89.8333 230.8333,-84 236.6667,-84 236.6667,-84 261.3333,-84 261.3333,-84 267.1667,-84 273,-89.8333 273,-95.6667 273,-95.6667 273,-107.3333 273,-107.3333 273,-113.1667 267.1667,-119 261.3333,-119\"/>\n<text text-anchor=\"middle\" x=\"249\" y=\"-110\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">9</text>\n<text text-anchor=\"middle\" x=\"249\" y=\"-99\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">R = 1</text>\n<text text-anchor=\"middle\" x=\"249\" y=\"-88\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.06</text>\n</g>\n<!-- 10&#45;&gt;9 -->\n<g id=\"edge9\" class=\"edge\">\n<title>10&#45;&gt;9</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M190.0191,-121.4061C197.6721,-118.8232 206.5318,-115.833 215.0213,-112.9678\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"216.3668,-116.2077 224.7225,-109.6937 214.1283,-109.5753 216.3668,-116.2077\"/>\n<text text-anchor=\"middle\" x=\"207.5\" y=\"-119.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.2</text>\n</g>\n<!-- 11 -->\n<g id=\"node14\" class=\"node\">\n<title>11</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M261.3333,-77C261.3333,-77 236.6667,-77 236.6667,-77 230.8333,-77 225,-71.1667 225,-65.3333 225,-65.3333 225,-53.6667 225,-53.6667 225,-47.8333 230.8333,-42 236.6667,-42 236.6667,-42 261.3333,-42 261.3333,-42 267.1667,-42 273,-47.8333 273,-53.6667 273,-53.6667 273,-65.3333 273,-65.3333 273,-71.1667 267.1667,-77 261.3333,-77\"/>\n<text text-anchor=\"middle\" x=\"249\" y=\"-68\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">11</text>\n<text text-anchor=\"middle\" x=\"249\" y=\"-57\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">R = 0</text>\n<text text-anchor=\"middle\" x=\"249\" y=\"-46\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.06</text>\n</g>\n<!-- 13&#45;&gt;11 -->\n<g id=\"edge11\" class=\"edge\">\n<title>13&#45;&gt;11</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M190.0191,-59.5C197.5057,-59.5 206.1472,-59.5 214.4671,-59.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"214.7225,-63.0001 224.7225,-59.5 214.7225,-56.0001 214.7225,-63.0001\"/>\n<text text-anchor=\"middle\" x=\"207.5\" y=\"-62.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.2</text>\n</g>\n<!-- 12 -->\n<g id=\"node15\" class=\"node\">\n<title>12</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M261.3333,-35C261.3333,-35 236.6667,-35 236.6667,-35 230.8333,-35 225,-29.1667 225,-23.3333 225,-23.3333 225,-11.6667 225,-11.6667 225,-5.8333 230.8333,0 236.6667,0 236.6667,0 261.3333,0 261.3333,0 267.1667,0 273,-5.8333 273,-11.6667 273,-11.6667 273,-23.3333 273,-23.3333 273,-29.1667 267.1667,-35 261.3333,-35\"/>\n<text text-anchor=\"middle\" x=\"249\" y=\"-26\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">12</text>\n<text text-anchor=\"middle\" x=\"249\" y=\"-15\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">R = 1</text>\n<text text-anchor=\"middle\" x=\"249\" y=\"-4\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.24</text>\n</g>\n<!-- 13&#45;&gt;12 -->\n<g id=\"edge12\" class=\"edge\">\n<title>13&#45;&gt;12</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M190.0191,-48.465C197.9216,-44.3161 207.1109,-39.4918 215.8505,-34.9035\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"217.4955,-37.993 224.7225,-30.2457 214.2416,-31.7952 217.4955,-37.993\"/>\n<text text-anchor=\"middle\" x=\"207.5\" y=\"-44.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.8</text>\n</g>\n</g>\n</svg>\n"
          },
          "metadata": {
            "tags": []
          }
        }
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "CRsPVDcg_Vlz"
      },
      "source": [
        "### Exercise 2\n",
        "\n",
        "For the probability tree `wb`: \n",
        "- list all the random variables; \n",
        "- compute the probability distribution of the barometer ($B$); \n",
        "- display the probability tree with the unique ids and probabilities\n",
        "of every node."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "qBqyFExK7eor"
      },
      "source": [
        ""
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "HHmLu4w_7e-S"
      },
      "source": [
        "#### Solution"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "cHoN3mQp_Vl0",
        "outputId": "6815d259-b9f5-4e13-c203-08a98d7ed7f5",
        "colab": {
          "base_uri": "https://localhost:8080/",
          "height": 504
        }
      },
      "source": [
        "print(wb.rvs())\n",
        "print(wb.rv('B'))\n",
        "display(wb.show(show_id=True, show_prob=True))"
      ],
      "execution_count": null,
      "outputs": [
        {
          "output_type": "stream",
          "text": [
            "{'O': ['1'], 'A': ['0', '1'], 'W': ['0', '1'], 'B': ['0', '1']}\n",
            "[(0.5, '0'), (0.5, '1')]\n"
          ],
          "name": "stdout"
        },
        {
          "output_type": "display_data",
          "data": {
            "text/plain": [
              "<graphviz.dot.Digraph at 0x7f3c05b79e80>"
            ],
            "image/svg+xml": "<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\"?>\n<!DOCTYPE svg PUBLIC \"-//W3C//DTD SVG 1.1//EN\"\n \"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd\">\n<!-- Generated by graphviz version 2.40.1 (20161225.0304)\n -->\n<!-- Title: g Pages: 1 -->\n<svg width=\"303pt\" height=\"337pt\"\n viewBox=\"0.00 0.00 303.00 337.00\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">\n<g id=\"graph0\" class=\"graph\" transform=\"scale(1 1) rotate(0) translate(4 333)\">\n<title>g</title>\n<polygon fill=\"#ffffff\" stroke=\"transparent\" points=\"-4,4 -4,-333 299,-333 299,4 -4,4\"/>\n<!-- 15 -->\n<g id=\"node1\" class=\"node\">\n<title>15</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M24.3333,-187C24.3333,-187 11.6667,-187 11.6667,-187 5.8333,-187 0,-181.1667 0,-175.3333 0,-175.3333 0,-163.6667 0,-163.6667 0,-157.8333 5.8333,-152 11.6667,-152 11.6667,-152 24.3333,-152 24.3333,-152 30.1667,-152 36,-157.8333 36,-163.6667 36,-163.6667 36,-175.3333 36,-175.3333 36,-181.1667 30.1667,-187 24.3333,-187\"/>\n<text text-anchor=\"middle\" x=\"18\" y=\"-178\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">15</text>\n<text text-anchor=\"middle\" x=\"18\" y=\"-167\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">O = 1</text>\n<text text-anchor=\"middle\" x=\"18\" y=\"-156\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 1</text>\n</g>\n<!-- 7 -->\n<g id=\"node2\" class=\"node\">\n<title>7</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M101.3333,-230C101.3333,-230 82.6667,-230 82.6667,-230 76.8333,-230 71,-224.1667 71,-218.3333 71,-218.3333 71,-206.6667 71,-206.6667 71,-200.8333 76.8333,-195 82.6667,-195 82.6667,-195 101.3333,-195 101.3333,-195 107.1667,-195 113,-200.8333 113,-206.6667 113,-206.6667 113,-218.3333 113,-218.3333 113,-224.1667 107.1667,-230 101.3333,-230\"/>\n<text text-anchor=\"middle\" x=\"92\" y=\"-221\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">7</text>\n<text text-anchor=\"middle\" x=\"92\" y=\"-210\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">A = 0</text>\n<text text-anchor=\"middle\" x=\"92\" y=\"-199\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.5</text>\n</g>\n<!-- 15&#45;&gt;7 -->\n<g id=\"edge7\" class=\"edge\">\n<title>15&#45;&gt;7</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M36.2921,-180.1292C44.0429,-184.633 53.28,-190.0006 61.9824,-195.0573\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"60.3681,-198.1673 70.7729,-200.1653 63.8851,-192.1149 60.3681,-198.1673\"/>\n<text text-anchor=\"middle\" x=\"53.5\" y=\"-196.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 14 -->\n<g id=\"node9\" class=\"node\">\n<title>14</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M101.3333,-146C101.3333,-146 82.6667,-146 82.6667,-146 76.8333,-146 71,-140.1667 71,-134.3333 71,-134.3333 71,-122.6667 71,-122.6667 71,-116.8333 76.8333,-111 82.6667,-111 82.6667,-111 101.3333,-111 101.3333,-111 107.1667,-111 113,-116.8333 113,-122.6667 113,-122.6667 113,-134.3333 113,-134.3333 113,-140.1667 107.1667,-146 101.3333,-146\"/>\n<text text-anchor=\"middle\" x=\"92\" y=\"-137\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">14</text>\n<text text-anchor=\"middle\" x=\"92\" y=\"-126\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">A = 1</text>\n<text text-anchor=\"middle\" x=\"92\" y=\"-115\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.5</text>\n</g>\n<!-- 15&#45;&gt;14 -->\n<g id=\"edge14\" class=\"edge\">\n<title>15&#45;&gt;14</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M36.2921,-159.3652C44.0429,-155.0708 53.28,-149.953 61.9824,-145.1314\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"63.722,-148.1689 70.7729,-140.261 60.3295,-142.0459 63.722,-148.1689\"/>\n<text text-anchor=\"middle\" x=\"53.5\" y=\"-155.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 3 -->\n<g id=\"node3\" class=\"node\">\n<title>3</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M184.3333,-287C184.3333,-287 159.6667,-287 159.6667,-287 153.8333,-287 148,-281.1667 148,-275.3333 148,-275.3333 148,-263.6667 148,-263.6667 148,-257.8333 153.8333,-252 159.6667,-252 159.6667,-252 184.3333,-252 184.3333,-252 190.1667,-252 196,-257.8333 196,-263.6667 196,-263.6667 196,-275.3333 196,-275.3333 196,-281.1667 190.1667,-287 184.3333,-287\"/>\n<text text-anchor=\"middle\" x=\"172\" y=\"-278\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">3</text>\n<text text-anchor=\"middle\" x=\"172\" y=\"-267\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">W = 0</text>\n<text text-anchor=\"middle\" x=\"172\" y=\"-256\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.25</text>\n</g>\n<!-- 7&#45;&gt;3 -->\n<g id=\"edge3\" class=\"edge\">\n<title>7&#45;&gt;3</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M113.0191,-227.4761C121.088,-233.2252 130.4984,-239.9301 139.4019,-246.2738\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"137.5473,-249.25 147.7225,-252.2023 141.6093,-243.549 137.5473,-249.25\"/>\n<text text-anchor=\"middle\" x=\"130.5\" y=\"-246.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 6 -->\n<g id=\"node6\" class=\"node\">\n<title>6</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M184.3333,-230C184.3333,-230 159.6667,-230 159.6667,-230 153.8333,-230 148,-224.1667 148,-218.3333 148,-218.3333 148,-206.6667 148,-206.6667 148,-200.8333 153.8333,-195 159.6667,-195 159.6667,-195 184.3333,-195 184.3333,-195 190.1667,-195 196,-200.8333 196,-206.6667 196,-206.6667 196,-218.3333 196,-218.3333 196,-224.1667 190.1667,-230 184.3333,-230\"/>\n<text text-anchor=\"middle\" x=\"172\" y=\"-221\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">6</text>\n<text text-anchor=\"middle\" x=\"172\" y=\"-210\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">W = 1</text>\n<text text-anchor=\"middle\" x=\"172\" y=\"-199\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.25</text>\n</g>\n<!-- 7&#45;&gt;6 -->\n<g id=\"edge6\" class=\"edge\">\n<title>7&#45;&gt;6</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M113.0191,-212.5C120.5057,-212.5 129.1472,-212.5 137.4671,-212.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"137.7225,-216.0001 147.7225,-212.5 137.7225,-209.0001 137.7225,-216.0001\"/>\n<text text-anchor=\"middle\" x=\"130.5\" y=\"-215.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 1 -->\n<g id=\"node4\" class=\"node\">\n<title>1</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M280.8333,-329C280.8333,-329 251.1667,-329 251.1667,-329 245.3333,-329 239.5,-323.1667 239.5,-317.3333 239.5,-317.3333 239.5,-305.6667 239.5,-305.6667 239.5,-299.8333 245.3333,-294 251.1667,-294 251.1667,-294 280.8333,-294 280.8333,-294 286.6667,-294 292.5,-299.8333 292.5,-305.6667 292.5,-305.6667 292.5,-317.3333 292.5,-317.3333 292.5,-323.1667 286.6667,-329 280.8333,-329\"/>\n<text text-anchor=\"middle\" x=\"266\" y=\"-320\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">1</text>\n<text text-anchor=\"middle\" x=\"266\" y=\"-309\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">B = 0</text>\n<text text-anchor=\"middle\" x=\"266\" y=\"-298\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.188</text>\n</g>\n<!-- 3&#45;&gt;1 -->\n<g id=\"edge1\" class=\"edge\">\n<title>3&#45;&gt;1</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M196.2073,-280.316C206.4919,-284.9113 218.6976,-290.3649 230.0033,-295.4164\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"228.6686,-298.6534 239.2265,-299.5374 231.5242,-292.2624 228.6686,-298.6534\"/>\n<text text-anchor=\"middle\" x=\"216.5\" y=\"-295.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.75</text>\n</g>\n<!-- 2 -->\n<g id=\"node5\" class=\"node\">\n<title>2</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M283.3333,-287C283.3333,-287 248.6667,-287 248.6667,-287 242.8333,-287 237,-281.1667 237,-275.3333 237,-275.3333 237,-263.6667 237,-263.6667 237,-257.8333 242.8333,-252 248.6667,-252 248.6667,-252 283.3333,-252 283.3333,-252 289.1667,-252 295,-257.8333 295,-263.6667 295,-263.6667 295,-275.3333 295,-275.3333 295,-281.1667 289.1667,-287 283.3333,-287\"/>\n<text text-anchor=\"middle\" x=\"266\" y=\"-278\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">2</text>\n<text text-anchor=\"middle\" x=\"266\" y=\"-267\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">B = 1</text>\n<text text-anchor=\"middle\" x=\"266\" y=\"-256\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.0625</text>\n</g>\n<!-- 3&#45;&gt;2 -->\n<g id=\"edge2\" class=\"edge\">\n<title>3&#45;&gt;2</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M196.2073,-269.5C205.5093,-269.5 216.3829,-269.5 226.7408,-269.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"226.8494,-273.0001 236.8494,-269.5 226.8493,-266.0001 226.8494,-273.0001\"/>\n<text text-anchor=\"middle\" x=\"216.5\" y=\"-272.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.25</text>\n</g>\n<!-- 4 -->\n<g id=\"node7\" class=\"node\">\n<title>4</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M283.3333,-245C283.3333,-245 248.6667,-245 248.6667,-245 242.8333,-245 237,-239.1667 237,-233.3333 237,-233.3333 237,-221.6667 237,-221.6667 237,-215.8333 242.8333,-210 248.6667,-210 248.6667,-210 283.3333,-210 283.3333,-210 289.1667,-210 295,-215.8333 295,-221.6667 295,-221.6667 295,-233.3333 295,-233.3333 295,-239.1667 289.1667,-245 283.3333,-245\"/>\n<text text-anchor=\"middle\" x=\"266\" y=\"-236\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">4</text>\n<text text-anchor=\"middle\" x=\"266\" y=\"-225\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">B = 0</text>\n<text text-anchor=\"middle\" x=\"266\" y=\"-214\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.0625</text>\n</g>\n<!-- 6&#45;&gt;4 -->\n<g id=\"edge4\" class=\"edge\">\n<title>6&#45;&gt;4</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M196.2073,-216.3629C205.5093,-217.8472 216.3829,-219.5824 226.7408,-221.2352\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"226.4228,-224.7287 236.8494,-222.8483 227.5259,-217.8161 226.4228,-224.7287\"/>\n<text text-anchor=\"middle\" x=\"216.5\" y=\"-223.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.25</text>\n</g>\n<!-- 5 -->\n<g id=\"node8\" class=\"node\">\n<title>5</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M280.8333,-203C280.8333,-203 251.1667,-203 251.1667,-203 245.3333,-203 239.5,-197.1667 239.5,-191.3333 239.5,-191.3333 239.5,-179.6667 239.5,-179.6667 239.5,-173.8333 245.3333,-168 251.1667,-168 251.1667,-168 280.8333,-168 280.8333,-168 286.6667,-168 292.5,-173.8333 292.5,-179.6667 292.5,-179.6667 292.5,-191.3333 292.5,-191.3333 292.5,-197.1667 286.6667,-203 280.8333,-203\"/>\n<text text-anchor=\"middle\" x=\"266\" y=\"-194\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">5</text>\n<text text-anchor=\"middle\" x=\"266\" y=\"-183\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">B = 1</text>\n<text text-anchor=\"middle\" x=\"266\" y=\"-172\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.188</text>\n</g>\n<!-- 6&#45;&gt;5 -->\n<g id=\"edge5\" class=\"edge\">\n<title>6&#45;&gt;5</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M196.2073,-205.5468C206.2862,-202.6518 218.2101,-199.2269 229.3239,-196.0346\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"230.5814,-199.315 239.2265,-193.1903 228.6488,-192.5871 230.5814,-199.315\"/>\n<text text-anchor=\"middle\" x=\"216.5\" y=\"-204.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.75</text>\n</g>\n<!-- 10 -->\n<g id=\"node10\" class=\"node\">\n<title>10</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M184.3333,-146C184.3333,-146 159.6667,-146 159.6667,-146 153.8333,-146 148,-140.1667 148,-134.3333 148,-134.3333 148,-122.6667 148,-122.6667 148,-116.8333 153.8333,-111 159.6667,-111 159.6667,-111 184.3333,-111 184.3333,-111 190.1667,-111 196,-116.8333 196,-122.6667 196,-122.6667 196,-134.3333 196,-134.3333 196,-140.1667 190.1667,-146 184.3333,-146\"/>\n<text text-anchor=\"middle\" x=\"172\" y=\"-137\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">10</text>\n<text text-anchor=\"middle\" x=\"172\" y=\"-126\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">B = 0</text>\n<text text-anchor=\"middle\" x=\"172\" y=\"-115\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.25</text>\n</g>\n<!-- 14&#45;&gt;10 -->\n<g id=\"edge10\" class=\"edge\">\n<title>14&#45;&gt;10</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M113.0191,-128.5C120.5057,-128.5 129.1472,-128.5 137.4671,-128.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"137.7225,-132.0001 147.7225,-128.5 137.7225,-125.0001 137.7225,-132.0001\"/>\n<text text-anchor=\"middle\" x=\"130.5\" y=\"-131.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 13 -->\n<g id=\"node13\" class=\"node\">\n<title>13</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M184.3333,-77C184.3333,-77 159.6667,-77 159.6667,-77 153.8333,-77 148,-71.1667 148,-65.3333 148,-65.3333 148,-53.6667 148,-53.6667 148,-47.8333 153.8333,-42 159.6667,-42 159.6667,-42 184.3333,-42 184.3333,-42 190.1667,-42 196,-47.8333 196,-53.6667 196,-53.6667 196,-65.3333 196,-65.3333 196,-71.1667 190.1667,-77 184.3333,-77\"/>\n<text text-anchor=\"middle\" x=\"172\" y=\"-68\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">13</text>\n<text text-anchor=\"middle\" x=\"172\" y=\"-57\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">B = 1</text>\n<text text-anchor=\"middle\" x=\"172\" y=\"-46\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.25</text>\n</g>\n<!-- 14&#45;&gt;13 -->\n<g id=\"edge13\" class=\"edge\">\n<title>14&#45;&gt;13</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M112.602,-110.7308C122.1201,-102.5214 133.5717,-92.6444 143.8693,-83.7627\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"146.1813,-86.3907 151.4678,-77.209 141.6094,-81.0899 146.1813,-86.3907\"/>\n<text text-anchor=\"middle\" x=\"130.5\" y=\"-102.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.5</text>\n</g>\n<!-- 8 -->\n<g id=\"node11\" class=\"node\">\n<title>8</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M280.8333,-161C280.8333,-161 251.1667,-161 251.1667,-161 245.3333,-161 239.5,-155.1667 239.5,-149.3333 239.5,-149.3333 239.5,-137.6667 239.5,-137.6667 239.5,-131.8333 245.3333,-126 251.1667,-126 251.1667,-126 280.8333,-126 280.8333,-126 286.6667,-126 292.5,-131.8333 292.5,-137.6667 292.5,-137.6667 292.5,-149.3333 292.5,-149.3333 292.5,-155.1667 286.6667,-161 280.8333,-161\"/>\n<text text-anchor=\"middle\" x=\"266\" y=\"-152\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">8</text>\n<text text-anchor=\"middle\" x=\"266\" y=\"-141\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">W = 0</text>\n<text text-anchor=\"middle\" x=\"266\" y=\"-130\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.188</text>\n</g>\n<!-- 10&#45;&gt;8 -->\n<g id=\"edge8\" class=\"edge\">\n<title>10&#45;&gt;8</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M196.2073,-132.3629C206.2862,-133.9712 218.2101,-135.874 229.3239,-137.6474\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"228.7999,-141.108 239.2265,-139.2276 229.903,-134.1955 228.7999,-141.108\"/>\n<text text-anchor=\"middle\" x=\"216.5\" y=\"-139.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.75</text>\n</g>\n<!-- 9 -->\n<g id=\"node12\" class=\"node\">\n<title>9</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M283.3333,-119C283.3333,-119 248.6667,-119 248.6667,-119 242.8333,-119 237,-113.1667 237,-107.3333 237,-107.3333 237,-95.6667 237,-95.6667 237,-89.8333 242.8333,-84 248.6667,-84 248.6667,-84 283.3333,-84 283.3333,-84 289.1667,-84 295,-89.8333 295,-95.6667 295,-95.6667 295,-107.3333 295,-107.3333 295,-113.1667 289.1667,-119 283.3333,-119\"/>\n<text text-anchor=\"middle\" x=\"266\" y=\"-110\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">9</text>\n<text text-anchor=\"middle\" x=\"266\" y=\"-99\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">W = 1</text>\n<text text-anchor=\"middle\" x=\"266\" y=\"-88\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.0625</text>\n</g>\n<!-- 10&#45;&gt;9 -->\n<g id=\"edge9\" class=\"edge\">\n<title>10&#45;&gt;9</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M196.2073,-121.5468C205.6062,-118.8472 216.6096,-115.6866 227.0643,-112.6837\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"228.2043,-115.9978 236.8494,-109.8731 226.2717,-109.2699 228.2043,-115.9978\"/>\n<text text-anchor=\"middle\" x=\"216.5\" y=\"-120.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.25</text>\n</g>\n<!-- 11 -->\n<g id=\"node14\" class=\"node\">\n<title>11</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M283.3333,-77C283.3333,-77 248.6667,-77 248.6667,-77 242.8333,-77 237,-71.1667 237,-65.3333 237,-65.3333 237,-53.6667 237,-53.6667 237,-47.8333 242.8333,-42 248.6667,-42 248.6667,-42 283.3333,-42 283.3333,-42 289.1667,-42 295,-47.8333 295,-53.6667 295,-53.6667 295,-65.3333 295,-65.3333 295,-71.1667 289.1667,-77 283.3333,-77\"/>\n<text text-anchor=\"middle\" x=\"266\" y=\"-68\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">11</text>\n<text text-anchor=\"middle\" x=\"266\" y=\"-57\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">W = 0</text>\n<text text-anchor=\"middle\" x=\"266\" y=\"-46\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.0625</text>\n</g>\n<!-- 13&#45;&gt;11 -->\n<g id=\"edge11\" class=\"edge\">\n<title>13&#45;&gt;11</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M196.2073,-59.5C205.5093,-59.5 216.3829,-59.5 226.7408,-59.5\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"226.8494,-63.0001 236.8494,-59.5 226.8493,-56.0001 226.8494,-63.0001\"/>\n<text text-anchor=\"middle\" x=\"216.5\" y=\"-62.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.25</text>\n</g>\n<!-- 12 -->\n<g id=\"node15\" class=\"node\">\n<title>12</title>\n<path fill=\"#f5f5f5\" stroke=\"#000000\" d=\"M280.8333,-35C280.8333,-35 251.1667,-35 251.1667,-35 245.3333,-35 239.5,-29.1667 239.5,-23.3333 239.5,-23.3333 239.5,-11.6667 239.5,-11.6667 239.5,-5.8333 245.3333,0 251.1667,0 251.1667,0 280.8333,0 280.8333,0 286.6667,0 292.5,-5.8333 292.5,-11.6667 292.5,-11.6667 292.5,-23.3333 292.5,-23.3333 292.5,-29.1667 286.6667,-35 280.8333,-35\"/>\n<text text-anchor=\"middle\" x=\"266\" y=\"-26\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">12</text>\n<text text-anchor=\"middle\" x=\"266\" y=\"-15\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">W = 1</text>\n<text text-anchor=\"middle\" x=\"266\" y=\"-4\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">p = 0.188</text>\n</g>\n<!-- 13&#45;&gt;12 -->\n<g id=\"edge12\" class=\"edge\">\n<title>13&#45;&gt;12</title>\n<path fill=\"none\" stroke=\"#000000\" d=\"M196.2073,-48.684C206.4919,-44.0887 218.6976,-38.6351 230.0033,-33.5836\"/>\n<polygon fill=\"#000000\" stroke=\"#000000\" points=\"231.5242,-36.7376 239.2265,-29.4626 228.6686,-30.3466 231.5242,-36.7376\"/>\n<text text-anchor=\"middle\" x=\"216.5\" y=\"-45.5\" font-family=\"Times,serif\" font-size=\"10.00\" fill=\"#000000\">0.75</text>\n</g>\n</g>\n</svg>\n"
          },
          "metadata": {
            "tags": []
          }
        }
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "rqcodRJr_Vl3"
      },
      "source": [
        "## 2. Propositions and min-cuts\n",
        "\n",
        "We've seen that a probability tree is a simple way of representing all the\n",
        "possible realizations and their causal dependencies. We now investigate the\n",
        "possible **events** in a probability tree.\n",
        "\n",
        "An **event** is a collection of full realizations. We can **describe** events\n",
        "using propositions about random variables (e.g. $W = 0$, $B = 1$) and the\n",
        "logical connectives of negation, conjunction (AND), and disjunction (OR). The\n",
        "connectives allow us to state composite events, such as $\\neg(W = 1 \\wedge B =\n",
        "0)$. For instance, the event $B = 0$ is the set of all realizations, i.e. paths\n",
        "from the root to a leaf, that **pass through a node** with the statement $B=0$.\n",
        "\n",
        "We can **represent** events using cuts, and in particular, **min-cuts**. A\n",
        "**min-cut** is a minimal representation of an event in terms of the nodes of a\n",
        "probability tree. The min-cut of an event collects the smallest number of nodes\n",
        "in the probability tree that resolves whether an event has occurred or not. In\n",
        "other words, if a realization hits a node in the min-cut, then we know for sure\n",
        "whether the event has occurred or not. (In measure theory, a similar notion to\n",
        "min-cut would be the algebra that renders the event measurable.)\n",
        "\n",
        "Our implementation of min-cuts furthermore distinguishes between the nodes that\n",
        "render the event true from the nodes that render the event false.\n",
        "\n",
        "Let's start by constructing a min-cut for a setting of a random variable in our\n",
        "drug testing example. Verify that the min-cut is correct for the setting of the\n",
        "random variable."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "CmjmqUAW_Vl3"
      },
      "source": [
        "# Build a cut for the proposition 'R = 1'.\n",
        "cut = med.prop('R=1')\n",
        "\n",
        "# The result is of type MinCut:\n",
        "print('Type of a cut:', type(cut))\n",
        "\n",
        "# Print the min-cut. Note that the elements in the\n",
        "# true and false sets refer to the ids of the prob tree.\n",
        "print('Min-cut for \"R = 1\":', cut)\n",
        "\n",
        "# Render the probability tree with a cut.\n",
        "display(med.show(cut=cut, show_id=True))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "9Bb9yBqP_Vl6"
      },
      "source": [
        "Let's do a min-cut for not taking the treatment ($T = 0$)"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "6-zNSWmL_Vl7"
      },
      "source": [
        "# Build a cut for the proposition 'T = 0'.\n",
        "cut = med.prop('T=0')\n",
        "\n",
        "# Print the min-cut. Note that the elements in the\n",
        "# true and false sets refer to the ids of the prob tree.\n",
        "print('Min-cut for \"T = 0\":', cut)\n",
        "\n",
        "# Render the probability tree with a cut.\n",
        "display(med.show(cut=cut, show_id=True))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "IQxIGXeu_Vl-"
      },
      "source": [
        "We can build negative events too using the `~` unary operator. As an example,\n",
        "let's negate the previous event. Compare the two cuts. Notice that a negation\n",
        "simply inverts the nodes that are true and false."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "hMApKX3O_Vl_"
      },
      "source": [
        "cut = ~med.prop('T = 0')\n",
        "print('Min-cut for \"T = 0\":', med.prop('T = 0'))\n",
        "print('Min-cut for \"not T = 0\":', ~med.prop('T = 0'))\n",
        "display(med.show(cut=cut, show_id=True))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "DGP5kr7K_VmC"
      },
      "source": [
        "Now let's build more complex events using conjunctions (`&`) and disjunctions\n",
        "(`|`). Make sure these min-cuts make sense to you. Notice that the conjunction\n",
        "of two events pick out the earliest occurrence of false nodes and the last\n",
        "occurence of true nodes, whereas the disjunction does the opposite."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "vOrfMXyA_VmD"
      },
      "source": [
        "# Recovery\n",
        "cut1 = med.prop('R=1')\n",
        "print('Cut for \"R = 1\":')\n",
        "display(med.show(cut=cut1))\n",
        "\n",
        "# Taking the treatment\n",
        "cut2 = med.prop('T=1')\n",
        "print('Cut for \"T=1\":')\n",
        "display(med.show(cut=cut2))\n",
        "\n",
        "# Conjunction: taking the treatment and recovery\n",
        "cut_and = cut1 & cut2\n",
        "print('Cut for \"T=1 and R=1\":')\n",
        "display(med.show(cut=cut_and))\n",
        "\n",
        "# Disjunction: taking the treatment or recovery\n",
        "cut_or = cut1 | cut2\n",
        "print('Cut for \"T=1 or R=1\":')\n",
        "display(med.show(cut=cut_or))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "1AxBz2Ml_VmG"
      },
      "source": [
        "### The precedence relation\n",
        "\n",
        "In addition to the Boolean operators, we can also use a causal connective which\n",
        "cannot stated in logical terms: the **precedence relation** $\\prec$. This\n",
        "relation allows building min-cuts for events where one event $A$ precedes\n",
        "another event $B$, written $A \\prec B$, and thus requires the additional\n",
        "information provided by the probability tree's structure.\n",
        "\n",
        "Let's try one example. We want to build the min-cut where having the disease\n",
        "($D=1$) precedes feeling better ($R=1$), and vice-versa."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "2WvNpbQG_VmH"
      },
      "source": [
        "# Disease and recovery min-cuts.\n",
        "cut1 = med.prop('D=1') < med.prop('R=1')\n",
        "cut2 = med.prop('R=1') < med.prop('D=1')\n",
        "\n",
        "# Display.\n",
        "print('Cut for D=1 < R=1:')\n",
        "display(med.show(cut=cut1))\n",
        "\n",
        "print('Cut for R=1 < D=1:')\n",
        "display(med.show(cut=cut2))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "YbYnVRiM_VmJ"
      },
      "source": [
        "### Requirement: random variables must be measurable\n",
        "\n",
        "If we try to build a min-cut using a variable that is not measurable, then an\n",
        "exception is raised. For instance, the random variable $X$ below is not\n",
        "measurable within the probability tree, because the realization starting at the\n",
        "root and reaching the leaf $Y = 2$ never sets the value for $X$.\n",
        "\n",
        "Attempting to build a min-cut for an event involving $X$ will throw an error."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "ujFLeAMN_VmK"
      },
      "source": [
        "pt = PTree()\n",
        "pt.root('O = 1', [\n",
        "    pt.child(0.1, 'X = 0, Y = 0'),\n",
        "    pt.child(0.2, 'X = 1, Y = 1'),\n",
        "    pt.child(0.7, 'Y = 2')\n",
        "])\n",
        "\n",
        "display(pt.show())"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "zyP7gSPl_VmN"
      },
      "source": [
        "### Special case: probabilistic truth versus logical truth\n",
        "\n",
        "Let's have a look at one special case. Our definitions make a distinction\n",
        "between **logical** and **probabilistic truth**. This is best seen in the\n",
        "example below.\n",
        "\n",
        "In this example, we have a probability tree with three outcomes: $X = 1, 2$, and\n",
        "$3$. - $X = 1$ occurs with probability one. \n",
        "- Hence, probabilistically, the event $X=1$ is resolved at the level of the\n",
        "root node. \n",
        "- However, it isn't resolved at the logical level, since $X = 2$ or $X = 3$ \n",
        "can happen logically, although with probability zero.\n",
        "\n",
        "Distinguishing between logical truth and probabilistic truth is important for\n",
        "stating counterfactuals. This will become clearer later."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "8IXq-jVl_VmN"
      },
      "source": [
        "# First we add all the nodes.\n",
        "pt = PTree()\n",
        "pt.root('O = 1',\n",
        "        [pt.child(1, 'X = 1'),\n",
        "         pt.child(0, 'X = 2'),\n",
        "         pt.child(0, 'X = 3')])\n",
        "\n",
        "# Show the cut for 'X = 0'\n",
        "cut = pt.prop('X = 1')\n",
        "print('While the root node \"O=1\" does resolve the event \"X=1\"\\n' +\n",
        "      'probabilistically, it does not resolve the event logically.')\n",
        "display(pt.show(cut=cut))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "K7OJKlcZ_VmQ"
      },
      "source": [
        "### Exercise 3\n",
        "\n",
        "For the `wb` probability tree, build the min-cuts for the following events:\n",
        "- the world is alien ($A = 1$); \n",
        "- the weather is sunny ($W = 1$); \n",
        "- the barometer goes down and the weather is sunny ($B = 0 \\wedge W = 1$); \n",
        "- the negation of \"barometer does not go down or weather is not sunny\", \n",
        "$\\neg(\\neg(B = 0) \\vee \\neg(W = 1))$.\n",
        "\n",
        "Display every min-cut. In particular, compare the last two. What do you observe?"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "HlKSQi1l7rDJ"
      },
      "source": [
        ""
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "bD3LT8NV7rRV"
      },
      "source": [
        "#### Solution"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "3ttu0mlR_VmQ"
      },
      "source": [
        "# Exercise.\n",
        "\n",
        "# A = 1.\n",
        "cut = wb.prop('A=1')\n",
        "print('Cut for \"A=1\":')\n",
        "display(wb.show(cut=cut))\n",
        "\n",
        "# W = 1.\n",
        "cut = wb.prop('W=1')\n",
        "print('Cut for \"W=1\":')\n",
        "display(wb.show(cut=cut))\n",
        "\n",
        "# B = 0 and W = 1.\n",
        "cut = wb.prop('B=0') & wb.prop('W=1')\n",
        "print('Cut for \"B=0 and W=1\":')\n",
        "display(wb.show(cut=cut))\n",
        "\n",
        "# not( not(B = 0) or not(W = 1) ).\n",
        "cut = ~(~wb.prop('B=0') | ~wb.prop('W=1'))\n",
        "print('Cut for \"not( not(B=0) or not(W=1) )\":')\n",
        "display(wb.show(cut=cut))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "ehK-sadN_VmT"
      },
      "source": [
        "### Exercise 4\n",
        "\n",
        "For the `wb` probability tree, determine the min-cut for whenever the weather\n",
        "($W$) affects the value of the barometer ($B$). This min-cut should coincide\n",
        "with the min-cut for the event ($A=0$).\n",
        "\n",
        "Hint: enumerate all the 4 cases (values for $W$ and $B$) and combine them using\n",
        "disjunctions."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "rZe9JCMB7wo9"
      },
      "source": [
        ""
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "ZtQffc1P7wxk"
      },
      "source": [
        "#### Solution"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "bX6AxxDk_VmT"
      },
      "source": [
        "# Build the min-cut.\n",
        "cut = (wb.prop('W=0') < wb.prop('B=0')) \\\n",
        "    | (wb.prop('W=0') < wb.prop('B=1')) \\\n",
        "    | (wb.prop('W=1') < wb.prop('B=0')) \\\n",
        "    | (wb.prop('W=1') < wb.prop('B=1'))\n",
        "\n",
        "# Display.\n",
        "display(wb.show(cut=cut))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "5PCmW5ol_VmX"
      },
      "source": [
        "## 3. Critical sets\n",
        "\n",
        "Min-cuts correspond to the smallest set of nodes where it becomes clear whether\n",
        "an event has occurred or not. Every min-cut has an associated **critical set**:\n",
        "the set of nodes that **determines** whether an event won't occur. Given an\n",
        "event, the associated **critical set** is defined as the set of parents of the\n",
        "event's false set in the min-cut.\n",
        "\n",
        "Together, a critical set and a min-cut form the set of **mechanisms** that\n",
        "determine the occurrence of the event.\n",
        "\n",
        "Let's have a look at a simple example. Here, the critical set is the singleton\n",
        "containing the root node. Critical sets are computed using the function\n",
        "`PTree.critical(cut)`, where `cut` is an event's min-cut. We can display the\n",
        "critical set by providing the optional argument `crit` to the `PTree.show()`\n",
        "function."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "9g2F9NKF_VmX"
      },
      "source": [
        "# First we add all the nodes.\n",
        "pt = PTree()\n",
        "pt.root('O = 1',\n",
        "        [pt.child(1, 'X = 1'),\n",
        "         pt.child(0, 'X = 2'),\n",
        "         pt.child(0, 'X = 3')])\n",
        "\n",
        "# Get the critical set for a min-cut.\n",
        "cut = pt.prop('X = 1')\n",
        "crit = pt.critical(cut)\n",
        "\n",
        "# Show the critical set.\n",
        "print('Min-cut for \"X=1\":', cut)\n",
        "print('Critical set for \"X=1\":', crit)\n",
        "display(pt.show(show_id=True, cut=cut, crit=crit))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "wE7voIju_Vma"
      },
      "source": [
        "Let's work out another example. Consider the following probability tree.\n",
        "\n",
        "![Min-Cuts and Critical Sets](http://www.adaptiveagents.org/_media/wiki/mincut-critical.png)\n",
        "\n",
        "Try to predict the min-cut and the critical set of the events $X=1$, $Y=1$, and\n",
        "$Y=0$."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "4YvLDtzB_Vma"
      },
      "source": [
        "pt = PTree()\n",
        "pt.root('O = 1', [\n",
        "    pt.child(0.2, 'X = 0, Y = 0'),\n",
        "    pt.child(0.8, 'X = 1', [pt.child(0.3, 'Y = 1'),\n",
        "                            pt.child(0.7, 'Y = 0')])\n",
        "])\n",
        "\n",
        "# Original tree.\n",
        "print('Original tree:')\n",
        "display(pt.show(show_id=True))\n",
        "\n",
        "# 'X=1'\n",
        "cut = pt.prop('X=1')\n",
        "crit = pt.critical(cut)\n",
        "print('Min-cut and critical set for \"X=1\":')\n",
        "display(pt.show(show_id=True, cut=cut, crit=crit))\n",
        "\n",
        "# 'Y=1'\n",
        "cut = pt.prop('Y=1')\n",
        "crit = pt.critical(cut)\n",
        "print('Min-cut and critical set for \"Y=1\":')\n",
        "display(pt.show(show_id=True, cut=cut, crit=crit))\n",
        "\n",
        "# 'Y=0'\n",
        "cut = pt.prop('Y=0')\n",
        "crit = pt.critical(cut)\n",
        "print('Min-cut and critical set for \"Y=0\":')\n",
        "display(pt.show(show_id=True, cut=cut, crit=crit))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "CtfxGITj_Vmd"
      },
      "source": [
        "### Exercise 5\n",
        "\n",
        "For the `wb` tree, compute and display the mechanisms (i.e. the min-cut and the\n",
        "critical set) for the following events: \n",
        "- the world is alien ($A = 1$); \n",
        "- the barometer goes down ($B = 0$); \n",
        "- the weather is sunny ($W = 1$); \n",
        "- the barometer goes down and weather is sunny ($B = 0 \\wedge W = 1$)."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "pw-AG0Ma76Al"
      },
      "source": [
        ""
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "-1fUlg1O76bp"
      },
      "source": [
        "#### Solution"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "Wqkni_k4_Vmd"
      },
      "source": [
        "# Exercise.\n",
        "\n",
        "# A = 1.\n",
        "cut = wb.prop('A=1')\n",
        "crit = wb.critical(cut)\n",
        "print('Mechanism for \"A=1\":')\n",
        "display(wb.show(cut=cut, crit=crit))\n",
        "\n",
        "# B = 0.\n",
        "cut = wb.prop('B=0')\n",
        "crit = wb.critical(cut)\n",
        "print('Mechanisms for \"B=0\":')\n",
        "display(wb.show(cut=cut, crit=crit))\n",
        "\n",
        "# W = 1.\n",
        "cut = wb.prop('W=1')\n",
        "crit = wb.critical(cut)\n",
        "print('Mechanisms for \"W=1\":')\n",
        "display(wb.show(cut=cut, crit=crit))\n",
        "\n",
        "# B = 0 and W = 1.\n",
        "cut = wb.prop('B=0') & wb.prop('W=1')\n",
        "crit = wb.critical(cut)\n",
        "print('Mechanisms for \"B=0 and W=1\":')\n",
        "display(wb.show(cut=cut, crit=crit))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "FPMH5CQ-_Vmg"
      },
      "source": [
        "We'll return later to critical sets, as they are important for determining the\n",
        "operations of conditioning and intervening on probability trees."
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "9ggdcdjg_Vmg"
      },
      "source": [
        "## 4. Evaluating probabilities\n",
        "\n",
        "We can also evaluate probabilities of events. For instance, you may ask:\n",
        "\n",
        "-   \"$P(R=1)$: What is the probability of recovery?\"\n",
        "-   \"$P(R=0)$: What is the probability of not recovering?\"\n",
        "-   \"$P(D=1)$: What is the probability of having the disease?\"\n",
        "-   \"$P(D=1 \\wedge R=0)$: What is the probability of taking the drug and not\n",
        "    recovering?\"\n",
        "-   \"$P(D=1 \\vee R=0)$: What is the probability of taking the drug or not\n",
        "    recovering?\"\n",
        "-   \"$P(D=1 \\prec R=1)$: What is the probability of taking the drug preceding\n",
        "    the recovery?\"\n",
        "\n",
        "To do so, we use the min-cut of the event.\n",
        "\n",
        "Let's have a look at some of them. Compare to the graph of the probability tree."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "lkH9LPzB_Vmh"
      },
      "source": [
        "# Min-cuts for some events\n",
        "cut1 = med.prop('R=1')\n",
        "cut2 = med.prop('D=1')\n",
        "cut1_neg = ~cut1\n",
        "cut_and = cut2 & cut1_neg\n",
        "cut_or = cut2 | cut1_neg\n",
        "cut_prec = cut2 < cut1\n",
        "\n",
        "print('P(R=1) =', med.prob(cut1))\n",
        "print('P(R=0) =', med.prob(cut1_neg))\n",
        "print('P(D=1) =', med.prob(cut2))\n",
        "print('P(D=1 and R=0) =', med.prob(cut_and))\n",
        "print('P(D=1 or R=0) =', med.prob(cut_or))\n",
        "print('P(D=1 precedes R=1) =', med.prob(cut_prec))\n",
        "\n",
        "display(med.show(show_prob=True))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "Bwc00gKT_Vmj"
      },
      "source": [
        "### Exercise 6\n",
        "\n",
        "For the `wb` tree, evaluate the probability of the following events: \n",
        "- the world is ours ($A = 0$) and the barometer goes down ($B = 0$); \n",
        "- it is not the case that the barometer goes down or the weather \n",
        "is sunny ($\\neg(B = 0 \\vee W = 1)$).\n",
        "\n",
        "Print the probabilities and display the probability trees."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "5NWdMrLW7_cj"
      },
      "source": [
        ""
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "NUy8SH-O7_jT"
      },
      "source": [
        "#### Solution"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "xTbTw3Ky_Vmk"
      },
      "source": [
        "# Exercise.\n",
        "\n",
        "# A = 0 and B = 0\n",
        "cut = wb.prop('A=0') & wb.prop('B=0')\n",
        "print('P(A=0 and B=0) =', wb.prob(cut))\n",
        "display(wb.show(cut=cut))\n",
        "\n",
        "# not(B = 0 or W = 1)\n",
        "cut = ~(wb.prop('B=0') | wb.prop('W=1'))\n",
        "print('P(not(B=0 or W=1)) =', wb.prob(cut))\n",
        "display(wb.show(cut=cut))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "6Y8wjMCi_Vmm"
      },
      "source": [
        "## 5. Conditioning\n",
        "\n",
        "We have learned how to represent events using min-cuts. Now we can use min-cuts\n",
        "to **condition** probability trees **on events**. Conditioning allows asking\n",
        "questions after making **observations**, such as:\n",
        "\n",
        "-   \"$P(R=1|T=1)$: What is the probability of recovery given that a patient has\n",
        "    taken the treatment?\"\n",
        "-   \"$P(D=1|R=1)$: What is the probability of having had the disease given that\n",
        "    a patient has recovered/felt better?\"\n",
        "\n",
        "### How to compute conditions\n",
        "\n",
        "Conditioning takes a probability tree and produces a new probability tree with\n",
        "modified transition probabilities. These are obtained by removing all the total\n",
        "realizations that are **incompatible with the condition**, and then\n",
        "renormalizing, as illustrated below.\n",
        "\n",
        "<img src=\"http://www.adaptiveagents.org/_media/wiki/see.png\" alt=\"Seeing\" width=\"700\"/>\n",
        "\n",
        "In the example, we compute the result of seeing $Y= 1$. \n",
        "Conditioning on an event proceeds in two steps: \n",
        "- first, we remove the probability mass of the realizations\n",
        "passing through the false set of the event’s min-cut \n",
        "(hihglighted in dark, bottom row); \n",
        "- then we renormalize the probabilities. \n",
        "\n",
        "We can do this recursively by aggregating the original probabilities \n",
        "of the true set. The top row shows the result of conditioning a\n",
        "probability tree on the event $Y= 1$, which also highlights the modified\n",
        "transition probabilities in red. The bottom row shows the same \n",
        "operation in a probability mass diagram, which is a representation of a\n",
        "probability tree that emphasizes the probabilities."
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "USe_1o89_Vmn"
      },
      "source": [
        "Let's have a look at the drug testing example. We will condition on $R=1$.\n",
        "Observe how the probabilities change."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "-Is4k0IR_Vmn"
      },
      "source": [
        "# Now we condition.\n",
        "cut = med.prop('R=1')\n",
        "med_see = med.see(cut)\n",
        "\n",
        "# Critical set.\n",
        "crit = med.critical(cut)\n",
        "\n",
        "# Compare probabilities of events.\n",
        "print('Before conditioning: P(R=1) =', med.prob(cut))\n",
        "print('After  conditioning: P(R=1 | R=1) =', med_see.prob(cut))\n",
        "\n",
        "# Display both trees for comparison.\n",
        "print('\\nOriginal tree:')\n",
        "display(med.show(show_prob=True))\n",
        "\n",
        "print('Tree after conditioning on \"R=1\":')\n",
        "display(med_see.show(cut=cut, crit=crit, show_prob=True))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "KF9E83_8_Vmq"
      },
      "source": [
        "We can condition on composite events too and evaluate the probability of events.\n",
        "\n",
        "Assume you observe that the drug was taken and a recovery is observed. Then, it\n",
        "is very likely that the patient had the disease."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "L_ULii7K_Vmq"
      },
      "source": [
        "# Min-cuts.\n",
        "cut_r = med.prop('R=1')\n",
        "cut_tr = med.prop('T=1') & med.prop('R=1')\n",
        "cut_disease = med.prop('D=1')\n",
        "\n",
        "# Critical set.\n",
        "crit = med.critical(cut_tr)\n",
        "\n",
        "# Condition.\n",
        "med_see_r = med.see(cut_r)\n",
        "med_see_tr = med.see(cut_tr)\n",
        "\n",
        "# Now we evaluate the posterior probability of having a disease.\n",
        "print('P(D = 1) =', med.prob(cut_disease))\n",
        "print('P(D = 1 | R = 1) =', med_see_r.prob(cut_disease))\n",
        "print('P(D = 1 | T = 1, R = 1) =', med_see_tr.prob(cut_disease))\n",
        "\n",
        "# Display prob tree.\n",
        "print('\\nProbability tree after conditioning on \"T=1 and R=1\":')\n",
        "display(med_see_tr.show(cut=cut_tr, show_id=True, crit=crit))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "RVtd_Pov_Vmt"
      },
      "source": [
        "### Special case: conditioning on trivial events\n",
        "\n",
        "Let's have a look at a special case: conditioning on **trivial events**, namely\n",
        "the **sure event** and the **impossible event**.\n",
        "\n",
        "Observe that conditioning on trivial events does not change the probability\n",
        "tree."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "R9Zcg6lH_Vmt"
      },
      "source": [
        "# Create a simple tree.\n",
        "pt = PTree()\n",
        "pt.root('O = 1', [\n",
        "    pt.child(0.6, 'X = 0, Y = 0'),\n",
        "    pt.child(0.6, 'X = 1', [pt.child(0.3, 'Y = 0'),\n",
        "                            pt.child(0.7, 'Y = 0')]),\n",
        "])\n",
        "\n",
        "# Show tree.\n",
        "print('Original tree:')\n",
        "display(pt.show())\n",
        "\n",
        "# Condition on Y = 0.\n",
        "cut = pt.prop('Y=0')\n",
        "pt_see_sure = pt.see(cut)\n",
        "print('Conditioning on \"Y = 0\":')\n",
        "display(pt_see_sure.show(cut=cut))\n",
        "\n",
        "# Condiiton on not Y = 0.\n",
        "neg_cut = ~cut\n",
        "pt_see_impossible = pt.see(neg_cut)\n",
        "print('Conditioning on \"not Y = 0\":')\n",
        "display(pt_see_impossible.show(cut=neg_cut))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "RLijoy-__Vmy"
      },
      "source": [
        "### Special case: conditioning on an event with probability zero\n",
        "\n",
        "Let's return to our simple example with tree outcomes. Assume we're conditioning\n",
        "on an event with **probability zero**, which can happen **logically but not\n",
        "probabilistically**. Using the measure-theoretic definition of conditional\n",
        "probabilities, we are required to pick a so-called **version** of the\n",
        "conditional distribution. There are infinite choices.\n",
        "\n",
        "Here, we have settled on the following. If we condition on an event with\n",
        "probability zero, then we assign uniform probability over all the possible\n",
        "transitions. This is just one arbitrary way of solving this problem.\n",
        "\n",
        "See the example below."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "61sYhPTI_Vmz"
      },
      "source": [
        "# Create a simple tree.\n",
        "pt = PTree()\n",
        "pt.root(\n",
        "    'O = 1',\n",
        "    [pt.child(1.0, 'X = 1'),\n",
        "     pt.child(0.0, 'X = 2'),\n",
        "     pt.child(0.0, 'X = 3')])\n",
        "\n",
        "# Let's pick the negative event for our minimal prob tree.\n",
        "cut = ~pt.prop('X = 1')\n",
        "display(pt.show(cut=cut))\n",
        "\n",
        "pt_see = pt.see(cut)\n",
        "display(pt_see.show(cut=cut))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "2fuYExoQ_Vm1"
      },
      "source": [
        "### Exercise 7\n",
        "\n",
        "For the `wb` tree, print the probability distribution of \n",
        "- the weather $W$ \n",
        "- and the barometer $B$.\n",
        "\n",
        "Do this for the following probability trees: \n",
        "- the original tree \n",
        "- the probability tree conditioned on it being an alien world ($\\theta = 1$) \n",
        "- the probability tree conditioned on the weather being sunny ($W = 1$).\n",
        "\n",
        "What do you observe? Does observing (conditioning) give you any additional\n",
        "information? If no, why? If yes, why is that?"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "D3WqIjaK8FSA"
      },
      "source": [
        ""
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "13s9eGWF8FZA"
      },
      "source": [
        "#### Solution"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "mMryXm_d_Vm2"
      },
      "source": [
        "# Exercise\n",
        "\n",
        "# No condition.\n",
        "print('P(W) =', wb.rv('W'))\n",
        "print('P(B) =', wb.rv('B'))\n",
        "\n",
        "# Condition on \"A = 1\"\n",
        "cut = wb.prop('A=1')\n",
        "print('P(W | A=1) =', wb.see(cut).rv('W'))\n",
        "print('P(B | A=1) =', wb.see(cut).rv('B'))\n",
        "\n",
        "# Condition on \"W = 1\"\n",
        "cut = wb.prop('W=1')\n",
        "print('P(W | W=1) =', wb.see(cut).rv('W'))\n",
        "print('P(B | W=1) =', wb.see(cut).rv('B'))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "9Dmexb79_Vm4"
      },
      "source": [
        "## 6. Interventions\n",
        "\n",
        "Interventions are at the heart of causal reasoning.\n",
        "\n",
        "We have seen how to filter probability trees using observational data through\n",
        "the use of conditioning. Now we investigate how a probability tree transforms\n",
        "when it is intervened. An **intervention** is a change to the random process\n",
        "itself to make something happen, as opposed to a filtration. We can ask\n",
        "questions like:\n",
        "\n",
        "-   \"$P(R=1|T \\leftarrow 1)$: What is the probability of recovery given that **I\n",
        "    take the drug**?\"\n",
        "-   \"$P(D=1|T \\leftarrow 1 \\wedge R=1)$: What is the probability of having the\n",
        "    disease given **that I take the drug** and that I observe a recovery?\"\n",
        "\n",
        "Here, the notation $T \\leftarrow 1$ is a shorthand for the more common notation\n",
        "$\\mathrm{do}(T = 1)$.\n",
        "\n",
        "### How to compute interventions\n",
        "\n",
        "Interventions differ from conditioning in the following: \n",
        "- they change the transition probabilities **minimally**, \n",
        "so as to make a desired event happen; \n",
        "- they **do not filter** the total realizations of the probability tree; \n",
        "- they are **easier to execute** than conditions, because they only \n",
        "change the transition probabilities that leave the critical set, \n",
        "and they do not require the backward induction of probabilities. \n",
        "\n",
        "See the illustration below.\n",
        "\n",
        "<img src=\"http://www.adaptiveagents.org/_media/wiki/do.png\" alt=\"Doing\" width=\"700\"/>\n",
        "\n",
        "Example intervention on $Y \\leftarrow 1$. An intervention proceeds in two steps:\n",
        "- first, it selects the partial realizations starting in a critical node \n",
        "and ending in a leaf that traverse the false set of the event’s min-cut; \n",
        "- then it removes their probability mass, renormalizing the probabilities\n",
        "from the transitions leaving the critical set. \n",
        "\n",
        "The top row shows the result of intervening a probability tree\n",
        "on $Y \\leftarrow 1$. The bottom row show the same procedure on \n",
        "the corresponding probability mass diagram.\n",
        "\n",
        "Let's start with a simple comparison to illustrate the difference."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "z4PLcgN5_Vm5"
      },
      "source": [
        "pt = PTree()\n",
        "pt.root('O = 1', [\n",
        "    pt.child(0.2, 'X = 0, Y = 0'),\n",
        "    pt.child(0.8, 'X = 1', [pt.child(0.3, 'Y = 1'),\n",
        "                            pt.child(0.7, 'Y = 0')])\n",
        "])\n",
        "\n",
        "print('Original:')\n",
        "display(pt.show(show_prob=True, cut=cut, crit=crit))\n",
        "\n",
        "# 'Y=1'\n",
        "cut = pt.prop('Y = 1')\n",
        "crit = pt.critical(cut)\n",
        "pt_see = pt.see(cut)\n",
        "pt_do = pt.do(cut)\n",
        "print('Condition on \"Y=1\":')\n",
        "display(pt_see.show(cut=cut, crit=crit))\n",
        "print('Intervention on \"Y<-1\":')\n",
        "display(pt_do.show(cut=cut, crit=crit))\n",
        "\n",
        "# 'Y=0'\n",
        "cut = pt.prop('Y = 0')\n",
        "crit = pt.critical(cut)\n",
        "pt_see = pt.see(cut)\n",
        "pt_do = pt.do(cut)\n",
        "print('Condition on \"Y = 0\":')\n",
        "display(pt_see.show(cut=cut, crit=crit))\n",
        "print('Intervention on \"Y <- 0\":')\n",
        "display(pt_do.show(cut=cut, crit=crit))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "xJ-_TtAY_Vm7"
      },
      "source": [
        "Notice that the mechanisms for $Y=0$ and $Y=1$ are different. In general, a\n",
        "single random variable can have **multiple mechanism** for setting their\n",
        "individual values."
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "LUvv_FNz_Vm8"
      },
      "source": [
        "Let's return to our drug testing example. We investigate the effect of taking\n",
        "the treatment, that is, by intervening on $T \\leftarrow 1$. How do the\n",
        "probabilities of: \n",
        "- having the disease ($D = 1$); \n",
        "- taking the treatment ($T = 1$); \n",
        "- and recovering ($R = 1$)\n",
        "\n",
        "change after taking the treatment ($T \\leftarrow 1$)?"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "6iFDVc7Z_Vm8"
      },
      "source": [
        "# Min-Cuts.\n",
        "cut_dis = med.prop('D = 1')\n",
        "cut_arg = med.prop('R = 1')\n",
        "cut_do = med.prop('T = 1')\n",
        "\n",
        "# Critical set.\n",
        "crit_do = med.critical(cut_do)\n",
        "\n",
        "# Perform intervention.\n",
        "med_do = med.do(cut_do)\n",
        "\n",
        "# Display original tree.\n",
        "print('Original tree:')\n",
        "print('P(D = 1) =', med.prob(cut_dis))\n",
        "print('P(T = 1) =', med.prob(cut_do))\n",
        "print('P(R = 1) =', med.prob(cut_arg))\n",
        "display(med.show(cut=cut_do, show_prob=True, crit=crit_do))\n",
        "\n",
        "# Display tree after invervention.\n",
        "print('Tree after intervening on \"T <- 1\":')\n",
        "print('P(D = 1 | T <- 1) =', med_do.prob(cut_dis))\n",
        "print('P(T = 1 | T <- 1) =', med_do.prob(cut_do))\n",
        "print('P(R = 1 | T <- 1) =', med_do.prob(cut_arg))\n",
        "display(med_do.show(cut=cut_do, show_prob=True, crit=crit_do))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "9auv9QLe_Vm_"
      },
      "source": [
        "In other words, for the example above, taking the treatment increases the\n",
        "chances of recovery. This is due to the base rates (i.e. the probability of\n",
        "having a disease). The base rates are not affected by the decision of taking the\n",
        "treatment."
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "RXjEiNWa_VnA"
      },
      "source": [
        "### Special case: intervening on an event with probability zero\n",
        "\n",
        "Assume we're intervening on an event with **probability zero**. Recall that this\n",
        "is possible **logically**, but **not probabilistically**. How do we set the\n",
        "transition probabilities leaving the critical set? Here again we settle on\n",
        "assigning uniform probabilities over all the transitions affected by the\n",
        "intervention.\n",
        "\n",
        "See the example below."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "NUgHl3mT_VnA"
      },
      "source": [
        "# Create a simple tree.\n",
        "pt = PTree()\n",
        "pt.root(\n",
        "    'O = 1',\n",
        "    [pt.child(1.0, 'X = 1'),\n",
        "     pt.child(0.0, 'X = 2'),\n",
        "     pt.child(0.0, 'X = 3')])\n",
        "\n",
        "# Let's pick the negative event for our minimal prob tree.\n",
        "cut = ~pt.prop('X = 1')\n",
        "crit = pt.critical(cut)\n",
        "\n",
        "# Intervene.\n",
        "pt_do = pt.do(cut)\n",
        "\n",
        "# Show results.\n",
        "print('Before the intervention:')\n",
        "display(pt.show(cut=cut, crit=crit))\n",
        "print('After the invention on \"not X <- 1\":')\n",
        "display(pt_do.show(cut=cut, crit=crit))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "qNqHBq19_VnD"
      },
      "source": [
        "### Exercise 8\n",
        "\n",
        "For the `wb` tree, print the probability distribution of \n",
        "- the weather $W$ \n",
        "- and the barometer $B$.\n",
        "\n",
        "Do this for the following probability trees: \n",
        "- the original tree \n",
        "- the probability tree resulting from enforcing it to being \n",
        "an alien world ($A \\leftarrow 1$) \n",
        "- the probability tree resulting from setting the weather to\n",
        "being sunny ($W \\leftarrow 1$).\n",
        "\n",
        "What do you observe? Compare these results with your previous exercise, where\n",
        "you conditioned on the same events. Why are the probabilities different when you\n",
        "condition and when you intervene? How is this related to the different causal\n",
        "dependencies in both worlds?"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "pgP-6OwU8LBq"
      },
      "source": [
        ""
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "9JFZjAra8LJd"
      },
      "source": [
        "#### Solution"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "8Fui2W_l_VnE"
      },
      "source": [
        "# Exercise\n",
        "\n",
        "# No intervention.\n",
        "print('P(W) =', wb.rv('W'))\n",
        "print('P(B) =', wb.rv('B'))\n",
        "\n",
        "# Intervention on \"A <- 1\"\n",
        "cut = wb.prop('A=1')\n",
        "print('P(W|A <- 1) =', wb.do(cut).rv('W'))\n",
        "print('P(B|A <- 1) =', wb.do(cut).rv('B'))\n",
        "\n",
        "# Condition on \"W <- 1\"\n",
        "cut = wb.prop('W=1')\n",
        "print('P(W|W <- 1) =', wb.do(cut).rv('W'))\n",
        "print('P(B|W <- 1) =', wb.do(cut).rv('B'))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "SCZyxF5l_VnG"
      },
      "source": [
        "### Exercise 9\n",
        "\n",
        "Next, evaluate the following probabilities:\n",
        "\n",
        "-   What is the probability of being in our world ($A=0$), given that you\n",
        "    observe a sunny weather ($W=1$) and the barometer going up ($B=1$)?\n",
        "-   What is the probability of being in our world ($A=0$), given that you first\n",
        "    observe a sunny weather ($W=1$) and then **you force** the barometer to go\n",
        "    up ($B\\leftarrow 1$)?\n",
        "-   What is the probability of being in our world ($A=0$), given that you first\n",
        "    **force** the barometer to go up ($B\\leftarrow 1$) and then observe a sunny\n",
        "    weather ($W=1$)?\n",
        "\n",
        "Answer the following questions:\n",
        "\n",
        "-   Does conditioning give different results from intervening? If so, why?\n",
        "-   When you mix conditions and interventions, does the order matter? If so,\n",
        "    why?"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "uB3igmF58OyH"
      },
      "source": [
        ""
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "k1vLg3F_8O7c"
      },
      "source": [
        "#### Solution"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "i2B5UhDT_VnJ"
      },
      "source": [
        "# Exercise\n",
        "cutw = wb.prop('W=1')\n",
        "cutb = wb.prop('B=1')\n",
        "cuttheta = wb.prop('A=0')\n",
        "\n",
        "# Question 1\n",
        "print('P(A = 0 | W = 1 and B = 1) =', wb.see(cutw).see(cutb).prob(cuttheta))\n",
        "\n",
        "# Question 2\n",
        "print('P(A = 0 | W = 1 then B <- 1) =', wb.see(cutw).do(cutb).prob(cuttheta))\n",
        "\n",
        "# Question 3\n",
        "print('P(A = 0 | B <- 1 then W = 1) =', wb.do(cutb).see(cutw).prob(cuttheta))\n",
        "\n",
        "display(wb.show())"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "3OMlUFKF_VnM"
      },
      "source": [
        "## 7. Counterfactuals\n",
        "\n",
        "Finally, we have counterfactuals. Counterfactuals are questions about how the\n",
        "experiment could have gone if something about it were different. For instance:\n",
        "\n",
        "-   \"What is the probability of having the disease **had I not recovered**,\n",
        "    given that I have recovered?\"\n",
        "-   \"Given that I have taken the treatment and recovered, what is the\n",
        "    probability of recovery **had I not taken the treatment**?\"\n",
        "\n",
        "These are tricky questions because they mix two moods:\n",
        "\n",
        "-   **indicative statements** - things that have actually happened;\n",
        "-   **subjunctive statements** - things that could have happened \n",
        "in an alternate reality/possible world.\n",
        "\n",
        "Because of this, counterfactuals spawn a new scope of random variables:\n",
        "\n",
        "<img src=\"http://www.adaptiveagents.org/_media/wiki/counterfactual.png\" alt=\"Counterfactual\" width=\"400\"/>\n",
        "\n",
        "These two questions above are spelled as follows:\n",
        "\n",
        "-   $P(D^\\ast=1|R=1)$, where $D^\\ast=D_{R \\leftarrow 0}$\n",
        "-   $P(R^\\ast=1|T\\leftarrow 1; R=1)$, where $R^\\ast=R_{T\\leftarrow 0}$\n",
        "\n",
        "Here the random variables with an asterisk $D^\\ast, R^\\ast$ are copies of the\n",
        "original random variables $D, R$ that ocurr in an alternate reality. The\n",
        "notation $D_{T \\leftarrow 0}$ means that the random variable $D$ is in the new\n",
        "scope spawned by the intervention on $T\\leftarrow 0$.\n",
        "\n",
        "### Computing a counterfactual\n",
        "\n",
        "The next figure shows how to obtain a counterfactual:\n",
        "\n",
        "<img src=\"http://www.adaptiveagents.org/_media/wiki/cf.png\" alt=\"Computing a counterfactual\" width=\"700\"/>\n",
        "\n",
        "The example shows a counterfactual probability tree generated by imposing $Y\n",
        "\\leftarrow 1$, given the factual premise $Z = 1$. Starting from a **reference\n",
        "probability tree**, we first derive two additional trees: a **factual premise**,\n",
        "capturing the current state of affairs; and a **counterfactual premise**,\n",
        "represented as an intervention on the reference tree.\n",
        "\n",
        "To form the counterfactual we proceed as follows:\n",
        "-   We slice both derived trees along the critical set\n",
        "of the counterfactual premise. \n",
        "-   Then, we compose the counterfactual tree by\n",
        "taking the transition probabilities **upstream of the slice**\n",
        "from the factual premise, and those **downstream of the slice** \n",
        "from the counterfactual premise. \n",
        "\n",
        "The events downstream then span a new scope containing copies \n",
        "of the original random variables (marked with \"∗\"), ready to \n",
        "adopt new values. \n",
        "\n",
        "In particular note that $Z^\\ast = 0$ can happen in our alternate \n",
        "reality, even though we know that $Z = 1$."
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "4Xq_CBmU_VnM"
      },
      "source": [
        "Let's have a look at a minimal example."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "wgfuKqZr_VnN"
      },
      "source": [
        "pt = PTree()\n",
        "pt.root('O = 1', [\n",
        "    pt.child(0.25, 'X = 0', [\n",
        "        pt.child(0.25, 'Y = 0',\n",
        "                 [pt.child(0.1, 'Z = 0'),\n",
        "                  pt.child(0.9, 'Z = 1')]),\n",
        "        pt.child(0.75, 'Y = 1',\n",
        "                 [pt.child(0.2, 'Z = 0'),\n",
        "                  pt.child(0.8, 'Z = 1')]),\n",
        "    ]),\n",
        "    pt.child(0.75, 'X = 1',\n",
        "             [pt.child(0.75, 'Y = 0, Z = 0'),\n",
        "              pt.child(0.25, 'Y = 1, Z = 0')])\n",
        "])\n",
        "\n",
        "print('Original:')\n",
        "display(pt.show())\n",
        "\n",
        "# Condition on 'Y=0', do 'Y=1'\n",
        "cut_see = pt.prop('Y=0')\n",
        "cut_do = pt.prop('Y=1')\n",
        "\n",
        "# Critical set.\n",
        "crit = pt.critical(cut_do)\n",
        "\n",
        "# Evaluate conditional, intervention, and counterfactual.\n",
        "pt_see = pt.see(cut_see)\n",
        "pt_do = pt.do(cut_do)\n",
        "pt_cf = pt.cf(pt_see, cut_do)\n",
        "\n",
        "# Display results.\n",
        "print('Condition on \"Y = 0\":')\n",
        "display(pt_see.show(cut=cut_see, crit=crit))\n",
        "print('Intervention on \"Y <- 1\":')\n",
        "display(pt_do.show(cut=cut_do, crit=crit))\n",
        "print('Counterfactual with premise \"Y = 0\" and subjunctive \"Y = 1\":')\n",
        "display(pt_cf.show(cut=cut_do, crit=crit))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "u6L7VDH9_VnP"
      },
      "source": [
        "Now we return to our drug testing example. Let's ask the two questions we asked\n",
        "before. We start with the question: \"What is the probability of having the\n",
        "disease **had I not recovered**, given that I have recovered?\", that is\n",
        "$$P(D^\\ast=1|R=1), \\qquad D^\\ast=D_{R \\leftarrow 0}.$$"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "1_dAJkjj_VnQ"
      },
      "source": [
        "# Cuts.\n",
        "cut_disease = med.prop('D = 1')\n",
        "cut_recovery = med.prop('R = 1')\n",
        "cut_not_recovery = ~cut_recovery\n",
        "\n",
        "# Critical.\n",
        "crit = med.critical(cut_not_recovery)\n",
        "\n",
        "# Compute counterfactual:\n",
        "# - compute factual premise,\n",
        "# - use factual premise and subjunctive premise to compute counterfactual.\n",
        "med_factual_prem = med.see(cut_recovery)\n",
        "med_cf = med.cf(med_factual_prem, cut_not_recovery)\n",
        "\n",
        "print('Baseline:')\n",
        "print('P(D = 1) =', med.prob(cut_disease))\n",
        "display(med.show())\n",
        "print('Premise:')\n",
        "print('P(D = 1 | R = 1) =', med_factual_prem.prob(cut_disease))\n",
        "display(med_factual_prem.show())\n",
        "print('Counterfactual:')\n",
        "print('P(D* = 1 | R = 1) =', med_cf.prob(cut_disease), ', D* = D[R <- 0]')\n",
        "display(med_cf.show(crit=crit, cut=cut_not_recovery))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "eAPyY5O8_VnS"
      },
      "source": [
        "As we can see, the probability of the disease in the indicative and the\n",
        "counterfactual aren't different. This is because the recovery $R$ is independent\n",
        "of the disease $D$, and because the disease is upstream of the critical set.\n",
        "\n",
        "Let's have a look at the second question: $$P(R^\\ast=1|T\\leftarrow 1;\n",
        "R=1), \\qquad R^\\ast=R_{T\\leftarrow 0}$$"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "Nm-h3YPh_VnS"
      },
      "source": [
        "# Cuts.\n",
        "cut_treatment = med.prop('T = 1')\n",
        "cut_not_treatment = ~cut_treatment\n",
        "cut_recovery = med.prop('R = 1')\n",
        "\n",
        "# Critical.\n",
        "crit = med.critical(cut_not_treatment)\n",
        "\n",
        "# Compute counterfactual:\n",
        "# - compute factual premise,\n",
        "# - use factual premise and counterfactual premise to compute counterfactual.\n",
        "med_factual_prem = med.do(cut_treatment).see(cut_recovery)\n",
        "med_cf = med.cf(med_factual_prem, cut_not_treatment)\n",
        "\n",
        "# Display results.\n",
        "print('Baseline:')\n",
        "print('P(R = 1) =', med.prob(cut_recovery))\n",
        "display(med.show())\n",
        "\n",
        "print('Premise:')\n",
        "print('P(R = 1 | T <- 1 and R = 1) =', med_factual_prem.prob(cut_recovery))\n",
        "display(med_factual_prem.show())\n",
        "\n",
        "print('Counterfactual:')\n",
        "print('P(R* = 1 | T <- 1 and R = 1) =', med_cf.prob(cut_recovery),\n",
        "      ', R* = R[T <- 0]')\n",
        "display(med_cf.show(cut=cut_not_treatment, crit=crit))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "bCsw7tTM_VnV"
      },
      "source": [
        "Hence, if I had not taken the treatment, then the probability of recovery would\n",
        "have been lower. Why is that? \n",
        "-   In our premise, I have taken the treatment and\n",
        "then observed a recovery. \n",
        "-   This implies that, most likely, I had the disease,\n",
        "since taking the treatment when I don't have the disease is risky and can lead\n",
        "to illness. \n",
        "-   Thus, knowing that I probably have the disease, I know that, had I\n",
        "not taken the treatment, I would most likely not have recovered."
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "B3DdaUXJ_VnV"
      },
      "source": [
        "### Exercise 10\n",
        "\n",
        "Consider the drug testing probability tree `med`.\n",
        "\n",
        "-   Assume you take the drug ($T \\leftarrow 1$) and you feel bad afterwards\n",
        "    ($R = 0$).\n",
        "-   Given this information, what is the probability of recovery ($R = 1$) had\n",
        "    you not taken the drug ($T = 0$)?\n",
        "\n",
        "Compute the **regret**, i.e. the difference: $$ \\mathbb{E}[ R^\\ast | T\n",
        "\\leftarrow 1; R = 0 ] - \\mathbb{E}[ R | T \\leftarrow 1; R = 0 ], $$ where\n",
        "$R^\\ast = R_{T \\leftarrow 0}$."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "JAoYBJcn8gve"
      },
      "source": [
        ""
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "yxuqdgvA8g-J"
      },
      "source": [
        "#### Solution"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "23ziOdxr_VnV"
      },
      "source": [
        "# Exercise\n",
        "\n",
        "med_prem = med.do(med.prop('T=1')).see(med.prop('R=0'))\n",
        "med_cf = med.cf(med_prem, med.prop('T=0'))\n",
        "\n",
        "print('P(R* = 1 | T <- 1, R = 0) =', med_cf.prob(med.prop('R=1')))\n",
        "\n",
        "regret = med_cf.expect('R') - med_prem.expect('R')\n",
        "print('Regret = ', regret)\n",
        "\n",
        "display(med_prem.show(cut=med.prop('R=0')))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "ioUtMVOs_VnX"
      },
      "source": [
        "### Exercise 11\n",
        "\n",
        "Take the probability tree `wb`. Evaluate the following counterfactuals:\n",
        "\n",
        "1.  Assume that you set the world to ours ($A \\leftarrow 0$) and the weather to\n",
        "    sunny ($W \\leftarrow 1$). What is the probability distribution of observing\n",
        "    a high barometer value ($B = 1$) had you set the weather to rainy ($W\n",
        "    \\leftarrow 0$)? Does the fact that you set the world and the weather affect\n",
        "    the value of the counterfactual?\n",
        "\n",
        "2.  Assume that you set the barometer to a high value ($B \\leftarrow 1$), and\n",
        "    you observe that the weather is sunny ($W=1$). What is the probability of\n",
        "    observing a sunny weather ($W=1$) had you set the barometer to a low value\n",
        "    ($B=0$)?\n",
        "\n",
        "These are highly non-trivial questions. What do you observe? Do the results make\n",
        "sense to you?"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "6dh5MySa8j83"
      },
      "source": [
        ""
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "jWpZ0riB8kG3"
      },
      "source": [
        "#### Solution"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "KGzDgfzs_VnY"
      },
      "source": [
        "# Question 1.\n",
        "wb_prem = wb.do(wb.prop('A=0')).do(wb.prop('W=1'))\n",
        "wb_cf = wb.cf(wb_prem, wb.prop('W=0'))\n",
        "print('P(B*| A <- 0, W <- 1) =', wb_cf.rv('B'), ' where B* = B[W <- 0]')\n",
        "display(wb_cf.show(show_prob=True, cut=wb.prop('B=1')))\n",
        "\n",
        "# Question 2.\n",
        "wb_prem = wb.do(wb.prop('B=1')).see(wb.prop('W=1'))\n",
        "wb_cf = wb.cf(wb_prem, wb.prop('B=0'))\n",
        "print('P(W* | B <- 1 then W <- 1) =', wb_cf.rv('W'), ' where W* = W[B <- 0]')\n",
        "display(wb_cf.show(show_prob=True, cut=wb.prop('W=1')))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "ZB-JZdum16ZJ"
      },
      "source": [
        "# Part II: Examples"
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "jw5OiWWC_Vna"
      },
      "source": [
        "## Construction of probability trees using factory functions\n",
        "\n",
        "Building probability trees can be difficult, especially when we have to manually\n",
        "specify all its nodes. \n",
        "\n",
        "To simplify this, we could design a function `factory(bvar)` which: \n",
        "-   receives a dictionary `bvar` of bound random variables, such as \n",
        "`{ 'X': '1', 'Y': '0' }` \n",
        "-   and returns a list of transitions and their statements, such as \n",
        "`[(0.3, 'Z = 0'), (0.2, 'Z = 1'), (0.5, 'Z = 2')].` If all relevant\n",
        "events have been defined already, return `None`.\n",
        "\n",
        "Such a function contains all the necessary information for building a\n",
        "probability tree. We call this a **probability tree factory**. We can pass a\n",
        "description function to the method `PTree.fromFunc()` to build a probability\n",
        "tree.\n",
        "\n",
        "The advantage of using this method is that we can exploit symmetries (e.g.\n",
        "conditional independencies) to code a much more compact description of the\n",
        "probability tree. Essentially, it is like specifying a probabilistic program.\n",
        "\n",
        "Let's experiment with this."
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "ce_kzARO_Vna"
      },
      "source": [
        "## Burglar, Earthquake, Alarm\n",
        "\n",
        "Let's start with a classical example: a burglar alarm. The alarm gets \n",
        "triggered by a burglar breaking into our home. However, the alarm can \n",
        "also be set off by an earthquake. \n",
        "\n",
        "Let's define the factory function."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "94KpJKbm_Vnb"
      },
      "source": [
        "def alarm(bvar):\n",
        "  # Define the burglar and earthquake events.\n",
        "  if 'Burglar' not in bvar:\n",
        "    pb = 0.1   # Probability of burglar\n",
        "    pe = 0.001 # Probability of earthquake\n",
        "    return [((1 - pb) * (1 - pe), 'Burglar=0, Earthquake=0'),\n",
        "            ((1 - pb) * pe, 'Burglar=0, Earthquake=1'),\n",
        "            (pb * (1 - pe), 'Burglar=1, Earthquake=0'),\n",
        "            (pb * pe, 'Burglar=1, Earthquake=1')]\n",
        "\n",
        "  # Define the alarm event.\n",
        "  if 'Alarm' not in bvar:\n",
        "    if bvar['Burglar'] == '0' and bvar['Earthquake'] == '0':\n",
        "      return [(0.999, 'Alarm=0'), (0.001, 'Alarm=1')]\n",
        "    if bvar['Burglar'] == '0' and bvar['Earthquake'] == '1':\n",
        "      return [(0.01, 'Alarm=0'), (0.99, 'Alarm=1')]\n",
        "    if bvar['Burglar'] == '1' and bvar['Earthquake'] == '0':\n",
        "      return [(0.1, 'Alarm=0'), (0.9, 'Alarm=1')]\n",
        "    else:\n",
        "      return [(0.001, 'Alarm=0'), (0.999, 'Alarm=1')]\n",
        "\n",
        "  # All the events defined.\n",
        "  return None"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "HYjrsERo_Vnd"
      },
      "source": [
        "Now, let's create the probability tree."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "JOvj1N5X_Vnd"
      },
      "source": [
        "# Create the probability tree.\n",
        "al = PTree.fromFunc(alarm, 'Root = 1')\n",
        "\n",
        "# Print all the random variables.\n",
        "print('Random variables:', al.rvs())\n",
        "print('\\nP(Alarm) =', al.rv('Alarm'))\n",
        "\n",
        "print('\\nOriginal probability tree:')\n",
        "display(al.show())\n",
        "\n",
        "print('\\nSome samples from the probability tree:')\n",
        "for k in range(5):\n",
        "  print(al.sample())"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "z6PQk0Du_Vnh"
      },
      "source": [
        "Assume now you hear the alarm. Which explanation is more likely:\n",
        "did the earthquake or the burglar trigger the alarm?"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "bG3qSQz7_Vni"
      },
      "source": [
        "# Condition on the alarm going off.\n",
        "cut = al.prop('Alarm=1')\n",
        "crit = al.critical(cut)\n",
        "al_see = al.see(cut)\n",
        "\n",
        "# Compute probability distributions for earthquake and burglar.\n",
        "print('P(Earthquake = 1 | Alarm = 1) =', al_see.prob(al.prop('Earthquake=1')))\n",
        "print('P(Burglar = 1 | Alarm = 1) =', al_see.prob(al.prop('Burglar=1')))\n",
        "\n",
        "# Display the conditional probability tree.\n",
        "\n",
        "print('\\nConditional probability tree:')\n",
        "display(al_see.show(show_prob=True, cut=cut, crit=crit))\n",
        "\n",
        "print('\\nSome samples from the conditional probability tree:')\n",
        "for k in range(5):\n",
        "  print(al_see.sample())"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "v8jmncNUF5kS"
      },
      "source": [
        "As we can see, it is far more likely that the burglar set off the alarm.\n",
        "\n",
        "If we now tamper with the alarm, setting it off, then what is the probability\n",
        "that there was a burglar or an earthquake?"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "pl3Ps_PAJB89"
      },
      "source": [
        "# Intervene on the alarm going off.\n",
        "cut = al.prop('Alarm=1')\n",
        "crit = al.critical(cut)\n",
        "al_do = al.do(cut)\n",
        "\n",
        "# Compute probability distributions for earthquake and burglar.\n",
        "print('P(Earthquake = 1 | Alarm <- 1) =', al_do.prob(al.prop('Earthquake=1')))\n",
        "print('P(Burglar = 1 | Alarm <- 1) =', al_do.prob(al.prop('Burglar=1')))\n",
        "\n",
        "# Display the intervened probability tree.\n",
        "\n",
        "print('\\nIntervened probability tree:')\n",
        "display(al_do.show(show_prob=True, cut=cut, crit=crit))\n",
        "\n",
        "print('\\nSome samples from the intervened probability tree:')\n",
        "for k in range(5):\n",
        "  print(al_do.sample())"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "xYUfpc-2KJ27"
      },
      "source": [
        "Now we observe that the probabilities of the burglar and earthquake\n",
        "events are exactly as the base rates - we have severed the\n",
        "causal dependencies connecting those events with the alarm."
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "_UO1GC7T_Vnl"
      },
      "source": [
        "## Coin toss prediction\n",
        "\n",
        "Let's build another probability tree. This is a discrete approximation to a\n",
        "process having a continuous random variable: a **Beta-Bernoulli process**. \n",
        "This problem was first studied by Rev. Thomas Bayes (\"An Essay towards\n",
        "solving a Problem in the Doctrine of Chances\", 1763) .\n",
        "\n",
        "The story goes as follows. Someone picks a coin with an unknown bias and then throws it repeatedly. Our goal is to infer the next outcome based only on the observed outcomes (and not on the latent bias). The unknown bias is drawn\n",
        "uniformly from the interval [0, 1].\n",
        "\n",
        "Let's start by coding the factory function for the discretized Beta-Bernoulli\n",
        "process. Here we assume that the prior distribution over the bias is uniform,\n",
        "and discretized into `divtheta = 40` bins. Then `T = 5` coin tosses follow. "
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "cellView": "both",
        "id": "X00sYFKB_Vnm"
      },
      "source": [
        "#@title Beta-Bernoulli factory function.\n",
        "\n",
        "def betaBernoulli(bvar, divtheta=41, T=5):\n",
        "  # Root: defined.\n",
        "  # Define biases Bias=0, 1/divtheta, 2/divtheta, ... , 1\n",
        "  if 'Bias' not in bvar:\n",
        "    ptheta = 1.0 / divtheta\n",
        "    biases = [(ptheta, 'Bias=' + str(theta))\n",
        "              for theta in np.linspace(0.0, 1.0, divtheta, endpoint=True)]\n",
        "    return biases\n",
        "\n",
        "  # Biases: defined.\n",
        "  # Now create Bernoulli observations X_1, X_2, ... , X_T,\n",
        "  # where X_t=0 or X_t=1.\n",
        "  t = 1\n",
        "  for var in bvar:\n",
        "    if '_' not in var:\n",
        "      continue\n",
        "    t += 1\n",
        "  if t <= T:\n",
        "    theta = float(bvar['Bias'])\n",
        "    varstr = 'X_' + str(t)\n",
        "    return [(1 - theta, varstr + '=0'), (theta, varstr + '=1')]\n",
        "\n",
        "  # All the events defined.\n",
        "  return None"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "4e3ZM5Vl_Vnr"
      },
      "source": [
        "We now build the probability tree. Let's also print the \n",
        "random variables and get a few samples."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "zN3TzCnQHoz6"
      },
      "source": [
        "# Create tree.\n",
        "bb = PTree.fromFunc(betaBernoulli)\n",
        "\n",
        "# Show random variables.\n",
        "print('Random variables:')\n",
        "print(bb.rvs())\n",
        "\n",
        "# Get sample.\n",
        "print('\\nSamples from the process:')\n",
        "for n in range(10):\n",
        "  print(bb.sample())"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "R4yVyNboW84N"
      },
      "source": [
        "The tree itself is quite large (over 1000 nodes). \n",
        "Normally such trees are too large to\n",
        "display, for instance when `T` is large.\n",
        "\n",
        "Let's display it."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "EvV6Gv4XaTxZ"
      },
      "source": [
        "bb.show()"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "JEuxhMkKHlUm"
      },
      "source": [
        "\n",
        "### Exercise \n",
        "\n",
        "Let's do some inference now.\n",
        "\n",
        "Assume you observe the first four toin cosses. They are\n",
        "```\n",
        "observations = ['X_1=1', 'X_2=1', 'X_3=0', 'X_4=1']\n",
        "```\n",
        "\n",
        "Answer the following questions:\n",
        "1.  What is the prior distribution over the unknown bias?\n",
        "2.  What is the probability of the next outcome being Heads (`X_5=1`)?\n",
        "3.  Given the observations, what is the distribution over the\n",
        "latent bias?\n",
        "4.  Rather than observing the four outcomes, assume instead\n",
        "that you enforce the outcomes. What is the probability of\n",
        "the next outcome being Heads?\n",
        "5.  What is the distribution over the latent bias if you enforce\n",
        "the data?"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "cwdfiRj-bNBR"
      },
      "source": [
        ""
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "7fTawNEfbNZ1"
      },
      "source": [
        "#### Solution"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "yPG6AbQo_Vnr"
      },
      "source": [
        "# Prepare the cut forthe data.\n",
        "observations = ['X_1=1', 'X_2=1', 'X_3=0', 'X_4=1']\n",
        "cut_data = None\n",
        "for s in observations:\n",
        "  if cut_data is None:\n",
        "    cut_data = bb.prop(s)\n",
        "  else:\n",
        "    cut_data &= bb.prop(s)\n",
        "\n",
        "# Prepare the cut for the query.\n",
        "cut_query = bb.prop('X_5=1')\n",
        "\n",
        "# Question 1\n",
        "bias = bb.rv('Bias')\n",
        "print('P(Bias) :\\n' + str(bias))\n",
        "\n",
        "# Question 2\n",
        "bb_cond = bb.see(cut_data)\n",
        "print('\\nP(X_5 = 1 | Data) = ' + str(bb_cond.prob(cut_query)))\n",
        "\n",
        "# Question 3\n",
        "bias_cond = bb_cond.rv('Bias')\n",
        "print('\\nP(Bias | Data) :\\n' + str(bias_cond))\n",
        "\n",
        "# Question 4\n",
        "bb_int = bb.do(cut_data)\n",
        "print('\\nP(X_5 = 1 | do(Data)) = ' + str(bb_int.prob(cut_query)))\n",
        "\n",
        "# Question 5\n",
        "bias_int = bb_int.rv('Bias')\n",
        "print('\\nP(Bias | do(Data)) :' + str(bias_int))\n",
        "\n",
        "# Display distribution over bias.\n",
        "print('\\nDistribution over biases for the three settings:')\n",
        "\n",
        "fig = plt.figure(figsize=(15, 5))\n",
        "\n",
        "# Show prior.\n",
        "plt.subplot(131)\n",
        "res = bb.rv('Bias')\n",
        "theta = np.array([theta for _, theta in res], dtype=np.float)\n",
        "prob = np.array([prob for prob, _ in res])\n",
        "plt.fill_between(theta, prob, 0)\n",
        "plt.title('P(Bias)')\n",
        "plt.ylim([-0.005, 0.1])\n",
        "plt.xlabel('Bias')\n",
        "\n",
        "# Show posterior after conditioning.\n",
        "plt.subplot(132)\n",
        "res = bb.see(cut).rv('Bias')\n",
        "theta = np.array([theta for _, theta in res], dtype=np.float)\n",
        "prob = np.array([prob for prob, _ in res])\n",
        "plt.fill_between(theta, prob, 0)\n",
        "plt.title('P(Bias|D)')\n",
        "plt.ylim([-0.005, 0.1])\n",
        "plt.xlabel('Bias')\n",
        "\n",
        "# Show posterior after intervening.\n",
        "plt.subplot(133)\n",
        "res = bb.do(cut).rv('Bias')\n",
        "theta = np.array([theta for _, theta in res], dtype=np.float)\n",
        "prob = np.array([prob for prob, _ in res])\n",
        "plt.fill_between(theta, prob, 0)\n",
        "plt.title('P(Bias|do(D))')\n",
        "plt.ylim([-0.005, 0.1])\n",
        "plt.xlabel('Bias')\n",
        "\n",
        "plt.show()"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "eoNn0c5rj5U1"
      },
      "source": [
        "## Who's in charge?\n",
        "\n",
        "In this problem we will look at causal induction. Alice and Bob play a game\n",
        "where both of them shout either 'chicken' or 'egg'.\n",
        "\n",
        "At the beginning of the game, one of them is chosen to be the leader, and\n",
        "the other, the follower. The follower will always attempt to match the\n",
        "leader: so if Alice is the leader and Bob the follower, and Alice\n",
        "shouts 'chicken', then Bob will attempt to shout 'chicken' too (with\n",
        "60% success rate).\n",
        "\n",
        "A typical game would look like this:\n",
        "\n",
        "-  Round 1: Alice shouts 'egg', Bob shouts 'chicken'.\n",
        "-  Round 2: Alice shouts 'chicken', Bob shouts 'chicken'.\n",
        "-  Round 3: Alice shouts 'chicken', Bob shouts 'chicken'.\n",
        "-  Round 4: Alice shouts 'egg', Bob shouts 'egg'.\n",
        "\n",
        "Note that you hear both of them shouting simultaneously.\n",
        "\n",
        "Our goal is to discover who's the leader. This is a **causal induction\n",
        "problem**, because we want to figure out whether:\n",
        "-  hypothesis `Leader = Alice`: Alice $\\rightarrow$ Bob;\n",
        "-  or hypothesis `Leader = Bob`: Bob $\\rightarrow$ Alice.\n",
        "\n",
        "Let's start by defining the factory function."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "cellView": "both",
        "id": "pRDAaQwW_zuF"
      },
      "source": [
        "#@title Leader factory function.\n",
        "\n",
        "def leader(bvar, T=2):\n",
        "  p = 0.75 # Probability of match.\n",
        "\n",
        "  # Define leader.\n",
        "  if 'Leader' not in bvar:\n",
        "    return [(0.5, 'Leader=Alice'), (0.5, 'Leader=Bob')]\n",
        "\n",
        "  # Now create the shouts.\n",
        "\n",
        "  # Figure out the leader.\n",
        "  if bvar['Leader'] == 'Alice':\n",
        "    leader = 'Alice'\n",
        "    follower = 'Bob'\n",
        "  else:\n",
        "    leader = 'Bob'\n",
        "    follower = 'Alice'\n",
        "\n",
        "  # Define random variables of shouts.\n",
        "  for t in range(1, T+1):\n",
        "    leader_str = leader + '_' + str(t)\n",
        "    if leader_str not in bvar:\n",
        "      return [(0.5, leader_str + '=chicken'), (0.5, leader_str + '=egg')]\n",
        "\n",
        "    follower_str = follower + '_' + str(t)\n",
        "    if follower_str not in bvar:\n",
        "      if bvar[leader_str] == 'chicken':\n",
        "        return [(p, follower_str + '=chicken'), (1-p, follower_str + '=egg')]\n",
        "      else:\n",
        "        return [(1-p, follower_str + '=chicken'), (p, follower_str + '=egg')]\n",
        "\n",
        "  # We're done.\n",
        "  return None\n",
        "\n",
        "# Create true environment.\n",
        "class ChickenEggGame:\n",
        "\n",
        "  def __init__(self, T=2):\n",
        "    self.T = T\n",
        "    self.pt = PTree.fromFunc(lambda bvar:leader(bvar, T=T))\n",
        "    smp = self.pt.sample()\n",
        "    self.pt.do(self.pt.prop('Leader=' + smp['Leader']))\n",
        "    self.time = 0\n",
        "\n",
        "  def step(self, name, word):\n",
        "    # Check whether parameters are okay.\n",
        "    if name != 'Alice' and name != 'Bob':\n",
        "      raise Exception('\"name\" has to be either \"Alice\" or \"Bob\".')\n",
        "    if word != 'chicken' and word != 'egg':\n",
        "      raise Exception('\"word\" has to be either \"chicken\" or \"egg\".')\n",
        "    if self.time > self.T -1:\n",
        "      raise Exception('The game has only ' + str(self.T) + ' rounds.')\n",
        "\n",
        "    # Enforce instruction.\n",
        "    self.time = self.time + 1\n",
        "    cut_do = self.pt.prop(name + '_' + str(self.time) + '=' + word)\n",
        "    self.pt = self.pt.do(cut_do)\n",
        "\n",
        "    # Produce next sample.\n",
        "    smp = self.pt.sample()\n",
        "    if name == 'Alice':\n",
        "      varname = 'Bob_' + str(self.time)\n",
        "    else:\n",
        "      varname = 'Alice_' + str(self.time)\n",
        "    response = smp[varname]\n",
        "    cut_see = self.pt.prop(varname + '=' + response) \n",
        "    self.pt = self.pt.see(cut_see)\n",
        "\n",
        "    return varname + '=' + response\n",
        "\n",
        "  def reveal(self):\n",
        "    smp = self.pt.sample()\n",
        "    return smp['Leader']"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "0IwyuPLrsE0v"
      },
      "source": [
        "The factory function is called `leader()`.\n",
        "\n",
        "Let's first have a look at how the probability tree would\n",
        "look like for `T = 2` rounds."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "gveaR8W2sSJv"
      },
      "source": [
        "ld = PTree.fromFunc(lambda bvar: leader(bvar, T=2), root_statement='Root = 1')\n",
        "display(ld.show())"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "LU6ZQ0e1cUw3"
      },
      "source": [
        "Notice how the transition probabilities of `Alice_n, Bob_n`,\n",
        "`n = 1, 2`, are identical within the subtree rooted at \n",
        "`Leader = Alice`. The same is true for the transitions probabilities\n",
        "within the subtree rooted at `Leader = Bob`.\n"
      ]
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "ZtXmvPbIsqBI"
      },
      "source": [
        "Now, let's create a new probability tree for a slightly longer game,\n",
        "namely `T = 5`. **This tree is too big to display** (over 2K nodes)\n",
        "but we can still sample from it."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "lekPv0r1Egti"
      },
      "source": [
        "T = 5\n",
        "ld = PTree.fromFunc(lambda bvar: leader(bvar, T=T), root_statement='Root = 1')\n",
        "\n",
        "print('Samples from the probability tree:')\n",
        "for n in range(T):\n",
        "  print(ld.sample())"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "dNdejpEjR6WI"
      },
      "source": [
        "Let's first figure out the joint distribution over Alice's and Bob's shouts\n",
        "in the first round (remember, rounds are i.i.d.) when Alice is the leader,\n",
        "and compare this to the situation when Bob is the leader.\n",
        "\n",
        "We can do this by setting `Leader` to whoever we want to be the leader,\n",
        "and then enumerate the joint probabilities over the combinations of\n",
        "shouts."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "X1lMShnYEqDz"
      },
      "source": [
        "import itertools\n",
        "\n",
        "# Define cuts for both leaders.\n",
        "cut_leader_a = ld.prop('Leader = Alice')\n",
        "cut_leader_b = ld.prop('Leader = Bob')\n",
        "\n",
        "# The words they can say.\n",
        "words = ['chicken', 'egg']\n",
        "\n",
        "# Print the joint distribution over\n",
        "# shouts when Alice is the leader.\n",
        "print('Leader = Alice')\n",
        "for word_a, word_b in itertools.product(words, words):\n",
        "  cut = ld.prop('Alice_1 = ' + word_a) & ld.prop('Bob_1 = ' + word_b)\n",
        "  prob = ld.do(cut_leader_a).prob(cut)\n",
        "  fmt = 'P( Alice_1 = {}, Bob_1 = {} | Leader <- Alice) = {:.2f}'\n",
        "  print(fmt.format(word_a, word_b, prob))\n",
        "\n",
        "# Print the joint distribution over\n",
        "# shouts when Bob is the leader.\n",
        "print('\\nLeader = Bob')\n",
        "for word_a, word_b in itertools.product(words, words):\n",
        "  cut = ld.prop('Alice_1 = ' + word_a) & ld.prop('Bob_1 = ' + word_b)\n",
        "  prob = ld.do(cut_leader_b).prob(cut)\n",
        "  fmt = 'P( Alice_1 = {}, Bob_1 = {} | Leader <- Bob) = {:.2f}'\n",
        "  print(fmt.format(word_a, word_b, prob))"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "IxkzXrhDawc1"
      },
      "source": [
        "Looking at the joint probabilities, **we realize that they are identical**.\n",
        "This means that we cannot identify who's the leader by conditioning on\n",
        "our observations. Let's try this with the following observations:\n",
        "```\n",
        "obs = [\n",
        "  'Alice_1=chicken', 'Bob_1=egg', \n",
        "  'Alice_2=egg', 'Bob_2=egg', \n",
        "  'Alice_3=egg', 'Bob_3=egg'\n",
        "  ]\n",
        "```\n",
        "\n",
        "We now compare the prior and posterior probabilities of Bob being the leader."
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "skor-95PGNpa"
      },
      "source": [
        "import functools \n",
        "\n",
        "obs = [\n",
        "  'Alice_1=chicken', 'Bob_1=egg', \n",
        "  'Alice_2=egg', 'Bob_2=egg', \n",
        "  'Alice_3=egg', 'Bob_3=egg'\n",
        "  ]\n",
        "cuts_data = [ld.prop(data) for data in obs]\n",
        "cut_data = functools.reduce(lambda x, y: x & y, cuts_data)\n",
        "cut_query = ld.prop('Leader=Bob')\n",
        "\n",
        "prob_prior = ld.prob(cut_query)\n",
        "prob_post = ld.see(cut_data).prob(cut_query)\n",
        "print('Prior and posterior probabilities:')\n",
        "print('P( Leader = Bob ) = {:.2f}'.format(prob_prior))\n",
        "print('P( Leader = Bob | Data ) = {:.2f}'.format(prob_post))\n"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "dR2U7_0quNYm"
      },
      "source": [
        "As you can see, this doesn't work - we can't disentangle the two hypotheses\n",
        "just by looking at the data.\n",
        "\n",
        "Intuitively, we could figure out whether Alice or Bob is the leader by\n",
        "intervening the game - for instance, by instructing Bob to say what\n",
        "we want and observe Alice's reaction:\n",
        "-  if Alice matches Bob many times, then she's probably the follower;\n",
        "-  instead if Alice does not attempt to match Bob, then we can conclude \n",
        "that Alice is the leader.\n",
        "\n",
        "Crucially, we need to **interact** in order to collect the data. \n",
        "It's not enough to passively observe. For this, we'll use\n",
        "an implementation of the game (`ChickenEggGame`) that allows\n",
        "us to instruct either Alice or Bob to shout the word we want. "
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "f7rPh-f6UKWM"
      },
      "source": [
        "T = 5\n",
        "game = ChickenEggGame(T=T)\n",
        "\n",
        "# Do T rounds.\n",
        "for n in range(T):\n",
        "  reply = game.step('Alice', 'chicken')\n",
        "  print(reply)\n",
        "\n",
        "# Reveal.\n",
        "print('The true leader is:' + game.reveal())"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "po_krgRljGmp"
      },
      "source": [
        "###  Exercise\n",
        "\n",
        "Using `ChickenEggGame`, play `T=5` rounds giving an instruction.\n",
        "Use a copy of the probability tree `ld` to record the results,\n",
        "appropriately distinguishing between conditions and interventions.\n",
        "Finally, compute the posterior probability of Alice being the\n",
        "leader and compare with ground truth (using the `reveal` method).\n",
        "\n"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "5-5dNAcdk0Nz"
      },
      "source": [
        ""
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "markdown",
      "metadata": {
        "id": "z4icvktpk0v0"
      },
      "source": [
        "#### Solution"
      ]
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "m9DZhCjcVn4-"
      },
      "source": [
        "import copy\n",
        "\n",
        "T = 5\n",
        "game = ChickenEggGame(T=T)\n",
        "\n",
        "# Do T rounds.\n",
        "print('Game:')\n",
        "ldg = copy.deepcopy(ld)\n",
        "for t in range(1, T+1):\n",
        "  reply = game.step('Alice', 'chicken')\n",
        "  instruction = 'Alice_' + str(t) + '=chicken'\n",
        "  ldg = ldg.do(ldg.prop(instruction))\n",
        "  ldg = ldg.see(ldg.prop(reply))\n",
        "  print(instruction + ', ' + reply)\n",
        "\n",
        "# Prediction.\n",
        "print('\\nPrediction:')\n",
        "cut_query = ldg.prop('Leader=Alice')\n",
        "prob_post = ldg.prob(cut_query)\n",
        "print('P(Leader = Alice | Data) = {:.5f}'.format(prob_post))\n",
        "\n",
        "# Reveal ground truth.\n",
        "print('\\nGround truth:')\n",
        "print('Leader = ' + game.reveal())"
      ],
      "execution_count": null,
      "outputs": []
    },
    {
      "cell_type": "code",
      "metadata": {
        "id": "QMvQGn9KclPU"
      },
      "source": [
        ""
      ],
      "execution_count": null,
      "outputs": []
    }
  ]
}