Springer Nature OA
open access
CC BY 4.0
Information geometry of absorbing Markov-chain and discriminative random walks
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
- Learning Random Geometric Graphs Drawn in Probabilistic Metric Spaces#467120
- On the Termination Problem for Probabilistic Higher-Order Recursive Programs#635508
- On the Termination Problem for Probabilistic Higher-Order Recursive Programs#633159
- Discrete Poincaré inequalities and universal approximators for random graphs#617336
- A proof of Ross's conjecture for two-site moving-target search#926160
Record · ID 195023
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