REVIEW 3 cited by
Derivation of the First Passage Time Distribution for Markovian Process on Discrete Network
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Based on the analysis of probability flow, where the First Passage (FP) is realised as the sink of probability, we summarise the protocol to find the distribution of the First Passage Time (FTP). We also describe the corresponding formula for the discrete time case.
Forward citations
Cited by 3 Pith papers
-
A Universal Control Budget for First-Passage Kinetics
Mean first-passage time sensitivities of any finite Markov chain lie in [-1,1] and sum to -1, a conserved control budget that caps kinetic-proofreading discrimination at the number of checkpoints.
-
Entropy estimation for partially accessible Markov networks based on imperfect observations: Role of finite resolution and finite statistics
With ideal statistics, the resolved-transition waiting-time estimator is best; the TUR wins near equilibrium, the blurred-transition estimator wins far from equilibrium, and finite statistics can cause overestimation.
-
Optimal switching strategies in multi-drug therapies for chronic diseases
A mathematical model predicts that optimal multi-drug therapy switching depends on initial efficacy and pathogen mutation rate, and that constraints on switching create non-trivial optimal protocols.
Discussion (0). Continue with ORCID to comment.