arXiv (All)
open access
Recursive-Head Geometry and Order-Free Efficient Inference in Finite-State Nested Markov Models
Exploiting the equality restrictions that nested Markov models encode requires their tangent-space geometry. For strictly positive finite-state models on arbitrary acyclic directed mixed graphs (ADMGs), we differentiate the recursive-head chart and prove that the range of its score map is the full t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Nested Sequents for Intuitionistic Modal Logics via Structural Refinement#749920
- Automated Inference of Graph Transformation Rules#622689
- Context Tree Prior Distributions based on Node Weighting with exact Bayes Factors#986838
- Extending Triple Graph Grammars to Formalize Complex View Definitions on Families of Models - Long Version#444701
- Characterization of tree-child networks in terms of mu vectors#1051670
Record · ID 1011651
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive