arXiv (All)
open access
Path Enumeration by Position-Visit Counts in Recombining Trinomial Trees
Recombining trinomial trees are a workhorse for modeling discrete-event systems in option pricing, logistics, and feedback control. Because each node stores a state-dependent quantity, a depth-$D$ tree contains $3^D$ raw trajectories, making exhaustive enumeration rapidly infeasible. However, when e
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
- Fractal Hyper-Trees: Combinatorial Enumeration, Symmetry Properties, and Ultrametric Structures#1014941
- The Volitional Index: A Probabilistic Framework for Decision-making in Tripartite Systems#689836
- The context-dependent, combinatorial logic of BMP signaling#467477
- Cardinality-Constrained Randomized Assortments with Balanced Market Share#1130644
- Counting Successor-Closed Subsets of Functional Digraphs#793937
Record · ID 1076754
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