Mario Román

Home

❯

notes

❯

probability

❯

identifiability

identifiability

Jul 23, 20261 min read

  • Triangle identifiability problem, a first example.
  • Non-solvable identifiability problems, why it does not always work.
  • Napkin problem, an example problem.
  • Identification algorithm for the napkin problem, a run of the complete ID algorithm.
  • C-components, central notion of the algorithm.
  • C-component decomposition, part of the algoritm.
  • Derived conditionals, an auxiliary routine for conditionals and marginals
  • Identify algorithm, major part of the algorithm.
  • M-bias in causal inference, a confusing case of confounders for the napkin problem.

Literature.

  • On the Identification of Causal Effects (Tian, Pearl, 2003)
  • Complete Identification Methods for Causal Inference (Shpitser, 2008)
  • On Identifying Causal Effects (Tian, Shpitser, 2009)
  • When does the ID algorithm fail (Shpitser, 2023)
  • Identification of Conditional Interventional Distributions (Shpitser and Pearl, 2006)

Tags: causality.


Graph View

Backlinks

  • non-solvable identifiability problems
  • Identify algorithm
  • M-bias in causal inference
  • causality
  • triangle identifiability problem

Mario Román (2026), CC-BY-SA. Human written, using Quartz and Write.

  • GitHub
  • ArXiv
  • OrcID