[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

A Numerical Efficiency Analysis of a Common Ancestor Condition

  • Conference paper
  • First Online:
Mathematical Aspects of Computer and Information Sciences (MACIS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11989))

  • 454 Accesses

Abstract

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.

Supported by ERASMUS+.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Steudel, B., Ay, N.: Information-theoretic inference of common ancestors. Entropy 17(4), 2304–2327 (2015)

    Article  MathSciNet  Google Scholar 

  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-8

    Google Scholar 

  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-4

    Google Scholar 

  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-4

    Google Scholar 

  5. Ay, N., Jost, J., Lê, H.V., Schwachhöfer, L.: Information Geometry. EMGFASMSM, vol. 64. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-56478-4. xi+407 pp. ISBN 978-3-319-56477-7, 978-3-319-56478-4

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Luca Carlini .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Carlini, L., Ay, N., Görgen, C. (2020). A Numerical Efficiency Analysis of a Common Ancestor Condition. In: Slamanig, D., Tsigaridas, E., Zafeirakopoulos, Z. (eds) Mathematical Aspects of Computer and Information Sciences. MACIS 2019. Lecture Notes in Computer Science(), vol 11989. Springer, Cham. https://doi.org/10.1007/978-3-030-43120-4_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-43120-4_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-43119-8

  • Online ISBN: 978-3-030-43120-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics