A Numerical Efficiency Analysis of a Common Ancestor Condition

  • Luca CarliniEmail author
  • Nihat Ay
  • Christiane Görgen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11989)


The aim of this paper is to understand if the sufficient condition for the existence of a common ancestor for some variables in a larger graph discovered by Steudel and Ay is worth checking. The goodness of this criterion will be tested with a numerical method.


Causality Entropy Graphical models Information theory Statistical model 


  1. 1.
    Steudel, B., Ay, N.: Information-theoretic inference of common ancestors. Entropy 17(4), 2304–2327 (2015)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Pearl, J.: Causality. Models, Reasoning, and Inference, 2nd edn., xx+464 pp. Cambridge University Press, Cambridge (2009). ISBN 978-0-521-89560-6, 0-521-77362-8Google Scholar
  3. 3.
    Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn., xxiv+748 pp. Wiley, Hoboken (2006). ISBN 978-0-471-24195-9, 0-471-24195-4Google Scholar
  4. 4.
    Collazo, R.A., Görgen, C., Smith, J.Q.: Chain Event Graphs. Chapman and Hall/CRC Computer Science and Data Analysis Series, xx+233 pp. CRC Press, Boca Raton (2018). ISBN 978-1-4987-2960-4Google Scholar
  5. 5.
    Ay, N., Jost, J., Lê, H.V., Schwachhöfer, L.: Information Geometry. EMGFASMSM, vol. 64. Springer, Cham (2017). xi+407 pp. ISBN 978-3-319-56477-7, 978-3-319-56478-4CrossRefzbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Max Planck Institute for Mathematics in the SciencesLeipzigGermany
  2. 2.Santa Fe InstituteSanta FeUSA
  3. 3.Faculty of Mathematics and Computer ScienceUniversity of LeipzigLeipzigGermany
  4. 4.Università degli Studi di GenovaGenoaItaly

Personalised recommendations