Related papers: Rapid state-recrossing kinetics in non-Markovian s…
A schematic model of over-damped motion is presented which permits one to calculate the mean first passage time for nuclear fission. Its asymptotic value may exceed considerably the lifetime suggested by Kramers rate formula, which applies…
We present an analytical method of calculating the mean first-passage times (MFPTs) for the magnetic moment of a uniaxial nanoparticle which is driven by a rapidly rotating, circularly polarized magnetic field and interacts with a heat…
We derive a general exact formula for the mean first passage time (MFPT) from a fixed point inside a planar domain to an escape region on its boundary. The underlying mixed Dirichlet-Neumann boundary value problem is conformally mapped onto…
The time-dependent barrier passage of an anomalous damping system is studied via the generalized Langevin equation (GLE) with non-Ohmic memory damping friction tensor and corresponding thermal colored noise tensor describing a particle…
New results on conditional joint probability distributions of first exit times are presented for a continuous-time stochastic process defined as the mixture of Markov jump processes moving at different speeds on the same finite state space,…
First passage times (FPTs) are often used to study timescales in physical, chemical, and biological processes. FPTs generically describe the time it takes a random "searcher" to find a "target." In many systems, the important timescale is…
An ensemble of trajectories with dynamical activity and first-passage time (FPT) is considered in the context of the thermodynamics of trajectories. The relationship between the average FPT and the total change in entropy is determined,…
We consider a generalization of the model by Doering and Gadoua to non-Markovian potential-switching generated by arbitrary renewal processes. For the Markovian switching process, we extend the original results by Doering and Gadoua by…
We present general methods to exactly calculate mean-first passage quantities on self-similar networks defined recursively. In particular, we calculate the mean first-passage time and the splitting probabilities associated to a source and…
We introduce a general approach for the study of the collective dynamics of non-interacting random walkers on connected networks. We analyze the movement of $R$ independent (Markovian) walkers, each defined by its own transition matrix. By…
We study two non-Markovian gene-expression models in which protein production is a stochastic process with a fat-tailed non-exponential waiting time distribution (WTD). For both models, we find two distinct scaling regimes separated by an…
The non-Markovian nature of polymer motions is accounted for in folding kinetics, using frequency-dependent friction. Folding, like many other problems in the physics of disordered systems, involves barrier crossing on a correlated energy…
We introduce a non-equilibrium discrete-time random walk model on multiplex networks, in which at each time step the walker first undergoes a random jump between neighboring nodes in the same layer, and then tries to hop from one node to…
In this thesis, we develop analytical methods to study out-of-equilibrium stochastic processes driven by colored noise, i.e., noise with temporal correlations. These non-Markovian processes pose significant analytical challenges compared to…
All real physical processes, including of the first-passage time, occur with a change in entropy. This circumstance is not taken into account when studying the first-passage time, but is illustrated in this article using the example of…
We investigate the mean first passage time of an active Brownian particle in one dimension using numerical simulations. The activity in one dimension is modeled as a two state model; the particle moves with a constant propulsion strength…
First-passage times are often the most relevant aspect of a complex Markovian network, because they signify when information processing has resulted in a definite decision. Previous studies have shown that for kinetic proofreading networks…
Transport is an important function of networks. Studying transport efficiency sheds light on the dynamic processes occurring within various underlying structures and offers a wide range of applications. To construct networks with different…
The first passage time for a single diffusing particle has been studied extensively, but the first passage time of a system of many diffusing particles, as is often the case in physical systems, has received little attention until recently.…
We present a novel computational method of first-passage times between a starting site and a target site of regular bounded lattices. We derive accurate expressions for all the moments of this first-passage time, validated by numerical…