Algorithmic barriers to representing conditional independence

DOI10.5555/3470152.3470197MaRDI QIDQ6654510zbMATH OpenFDO

Authors Nathanael Ackerman, Jeremy Avigad, Cameron E. Freer, Daniel M. Roy, Jason Rute

Publication date 19 December 2024

Full work available at URL https://doi.org/10.5555/3470152.3470197

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Computation over the reals, computable analysis (03D78) Exchangeability for stochastic processes (60G09)

Recommendations

• Computable exchangeable sequences have computable de Finetti measures
• Computable de Finetti measures
• On finite exchangeability and conditional independence
• On the computability of conditional probability
• Graphical and algebraic representatives of conditional independence models

This page was built for publication: Algorithmic barriers to representing conditional independence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654510)