稀疏数据下 Transition Path Theory 中时间统计量的稳定性
Stability of temporal statistics in Transition Path Theory with sparse data
AI总结:
针对稀疏数据下 Transition Path Theory 时间统计量估计不稳定的问题,本文提出使用基于 k-means 聚类的 Voronoi 单元替代常规单元,获得了稳定的转移路径总持续时间估计,并推广出适用于研究连通性的剩余持续时间新统计量。
摘要:
Transition Path Theory (TPT) 对直接连接(即无绕道)Markov chain 中两个不连通状态(集)的轨迹集合提供了严格的统计刻画。Markov chain 是一种随机过程,其状态转移概率取决于前一步所达到的状态。Markov chain 可通过轨迹数据构建,方法是统计覆盖轨迹所张成区域的单元间的转移次数。在稀疏轨迹数据下,观察到使用常规单元会导致 transition paths 总持续时间的估计不稳定。通过使用基于轨迹数据 k-means 聚类得到的 Voronoi 单元,我们获得了该 TPT 统计量的稳定估计,并将其推广以构建 transition paths 的剩余持续时间,这是一种适用于研究连通性的新 TPT 统计量。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。