Pith. sign in

REVIEW

First passage in discrete-time absorbing Markov chains under stochastic resetting

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 2111.01330 v1 pith:QANXLJ6B submitted 2021-11-02 cond-mat.stat-mech

First passage in discrete-time absorbing Markov chains under stochastic resetting

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

First passage of stochastic processes under resetting has recently been an active research topic in the field of statistical physics. However, most of previous studies mainly focused on the systems with continuous time and space. In this paper, we study the effect of stochastic resetting on first passage properties of discrete-time absorbing Markov chains, described by a transition matrix $\brm{Q}$ between transient states and a transition matrix $\brm{R}$ from transient states to absorbing states. Using a renewal approach, we exactly derive the unconditional mean first passage time (MFPT) to either of absorbing states, the splitting probability the and conditional MFPT to each absorbing state. All the quantities can be expressed in terms of a deformed fundamental matrix $\brm{Z_{\gamma}}=\left[\brm{I}-(1-\gamma) \brm{Q} \right]^{-1}$ and $\brm{R}$, where $\brm{I}$ is the identity matrix, and $\gamma$ is the resetting probability at each time step. We further show a sufficient condition under which the unconditional MPFT can be optimized by stochastic resetting. Finally, we apply our results to two concrete examples: symmetric random walks on one-dimensional lattices with absorbing boundaries and voter model on complete graphs.

discussion (0)

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