arXiv (All)
open access
Graph-theoretic framework for semi-Markov networks: transient and stationary occupation probabilities, hitting times and weak ergodicity breaking
Semi-Markov networks provide a natural framework for describing stochastic transitions between coarse-grained states with non-exponential dwell times, with applications ranging from biophysics and neuroscience to epidemiology and finance. Here, it is shown that finite semi-Markov networks admit expl
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
- Emergence of Complex Web Structures#820418
- Ergodicity, ergodicity breaking, and temporal evolution of probability density in non-equilibrium: new perspectives by multispeckle DLS#1129618
- The Statistical Mechanics of Indistinguishable Energy States and the Glass Transition#1034707
- Efficient and Fast Sampling from Arbitrary Probability Kernels using Sliced Gibbs Sampler#1198892
- Giant Components in Random Temporal Graphs *#1298934
Record · ID 1297857
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