Pith. sign in

REVIEW

Arrival time for the fastest among N switching stochastic particles

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

arxiv 2112.12760 v2 pith:PJQMS4EV submitted 2021-12-23 cond-mat.stat-mech q-bio.SC

Arrival time for the fastest among N switching stochastic particles

classification cond-mat.stat-mech q-bio.SC
keywords particlesswitchingfasteststatestochastictimearrivalderived
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The first arrivals among $N$ Brownian particles is ubiquitous in the life sciences, as it often trigger cellular processes from the molecular level. We study here the case where stochastic particles, which represent molecules, proteins or molecules can switch between two states inside the non-negative real line. The switching process is modeled as a two-state Markov chain and particles can only escape in state 1. We estimate the fastest arrival time by solving asymptotically the Fokker-Planck equations for three different initial distributions: Dirac-delta, uniformly distributed and long-tail decay. The derived formulas reveal that the fastest particle avoid switching when the switching rates are much smaller than the diffusion time scale, but switches twice when the diffusion is state 2 is much faster than in state 1. The present results are compared to stochastic simulations revealing the range of validity of the derived formulas.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.