{'fraction_non_alphanumeric': 0.013708019191226868, 'fraction_numerical': 0.0, 'mean_word_length': 5.3755458515283845, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
First passage under restart for discrete space and time: Application to one-dimensional confined lattice random walks.

First passage under restart has recently emerged as a conceptual framework to study various stochastic processes under restart mechanism. Emanating from the canonical diffusion problem by Evans and Majumdar, restart has been shown to outperform the completion of many first-passage processes which otherwise would take longer time to finish. However, most of the studies so far assumed continuous time underlying first-passage time processes and moreover considered continuous time resetting restricting out restart processes broken up into synchronized time steps. To bridge this gap, in this paper, we study discrete space and time first-passage processes under discrete time resetting in a general setup without specifying their forms. We sketch out the steps to compute the moments and the probability density function which is often intractable in the continuous time restarted process. A criterion that dictates when restart remains beneficial is then derived. We apply our results to a symmetric and a biased random walker in one-dimensional lattice confined within two absorbing boundaries. Numerical simulations are found to be in excellent agreement with the theoretical results. Our method can be useful to understand the effect of restart on the spatiotemporal dynamics of confined lattice random walks in arbitrary dimensions.