Papers › Stability of temporal statistics in Transition Path Theory with sparse data
Stability of temporal statistics in Transition Path Theory with sparse data
G. Bonner, F. J. Beron-Vera, M. J. Olascoaga
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Transition Path Theory (TPT) provides a rigorous statistical characterization of the ensemble of trajectories connecting directly, i.e., without detours, two disconnected (sets of) states in a Markov chain, a stochastic process that undergoes transitions from one state to another with probability depending on the state attained in the previous step. Markov chains can be constructed using trajectory data via counting of transitions between cells covering the domain spanned by trajectories. With sparse trajectory data, the use of regular cells is observed to result in unstable estimates of the total duration of transition paths. Using Voronoi cells resulting from k-means clustering of the trajectory data, we obtain stable estimates of this TPT statistic, which is generalized to frame the remaining duration of transition paths, a new TPT statistic suitable for investigating connectivity.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections