First-passage times in random walks have a vast number of diverse applications in physics, chemistry, biology, and finance. In general, environmental conditions for a stochastic process are not constant on the time scale of the average first-passage time or control might be applied to reduce noise. We investigate moments of the first-passage time distribution under an exponential transient describing relaxation of environmental conditions. We solve the Laplace-transformed (generalized) master equation analytically using a novel method that is applicable to general state schemes. The first-passage time from one end to the other of a linear chain of states is our application for the solutions. The dependence of its average on the relaxation rate obeys a power law for slow transients. The exponent ν depends on the chain length N like ν=-N/(N+1) to leading order. Slow transients substantially reduce the noise of first-passage times expressed as the coefficient of variation (CV), even if the average first-passage time is much longer than the transient. The CV has a pronounced minimum for some lengths, which we call resonant lengths. These results also suggest a simple and efficient noise control strategy and are closely related to the timing of repetitive excitations, coherence resonance, and information transmission by noisy excitable systems. A resonant number of steps from the inhibited state to the excitation threshold and slow recovery from negative feedback provide optimal timing noise reduction and information transmission.

Download full-text PDF

Source
http://dx.doi.org/10.1063/1.5023164DOI Listing

Publication Analysis

Top Keywords

first-passage time
16
random walks
8
first-passage times
8
environmental conditions
8
average first-passage
8
reduce noise
8
slow transients
8
time
6
first-passage
6
stretch stray
4

Similar Publications

Random walks on scale-free flowers with stochastic resetting.

Chaos

January 2025

School of Mathematical Science, Jiangsu University, Zhenjiang, Jiangsu 212013, China.

This study explores the impact of stochastic resetting on the random walk dynamics within scale-free (u,v)-flowers. Utilizing the generating function technique, we develop a recursive relationship for the generating function of the first passage time and establish a connection between the mean first passage time with and without resetting. Our investigation spans multiple scenarios, with the random walker starting from various positions and aiming to reach different target nodes, allowing us to identify the optimal resetting probability that minimizes the mean first passage time for each case.

View Article and Find Full Text PDF

Uncovering Dynamical Equations of Stochastic Decision Models Using Data-Driven SINDy Algorithm.

Neural Comput

January 2025

Intelligent Systems Research Centre, School of Computing, Engineering and Intelligent Systems, Ulster University, BT48 7JL Derry-Londonderry, Northern Ireland, U.K.

Decision formation in perceptual decision making involves sensory evidence accumulation instantiated by the temporal integration of an internal decision variable toward some decision criterion or threshold, as described by sequential sampling theoretical models. The decision variable can be represented in the form of experimentally observable neural activities. Hence, elucidating the appropriate theoretical model becomes crucial to understanding the mechanisms underlying perceptual decision formation.

View Article and Find Full Text PDF

We consider a discrete-time Markovian random walk with resets on a connected undirected network. The resets, in which the walker is relocated to randomly chosen nodes, are governed by an independent discrete-time renewal process. Some nodes of the network are target nodes, and we focus on the statistics of first hitting of these nodes.

View Article and Find Full Text PDF

We present a procedure for enhanced sampling of molecular dynamics simulations through informed stochastic resetting. Many phenomena, such as protein folding and crystal nucleation, occur over time scales inaccessible in standard simulations. We recently showed that stochastic resetting can accelerate molecular simulations that exhibit broad transition time distributions.

View Article and Find Full Text PDF

Random Walk on T-Fractal with Stochastic Resetting.

Entropy (Basel)

November 2024

School of Mathematical Science, Jiangsu University, Zhenjiang 212013, China.

In this study, we explore the impact of stochastic resetting on the dynamics of random walks on a T-fractal network. By employing the generating function technique, we establish a recursive relation between the generating function of the first passage time (FPT) and derive the relationship between the mean first passage time (MFPT) with resetting and the generating function of the FPT without resetting. Our analysis covers various scenarios for a random walker reaching a target site from the starting position; for each case, we determine the optimal resetting probability γ* that minimizes the MFPT.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!