Related papers: Persistent search in confined domains: a velocity-…
A relevant problem in quantum computing concerns how fast a source state can be driven into a target state according to Schr\"odinger's quantum mechanical evolution specified by a suitable driving Hamiltonian. In this paper, we study in…
We propose an approach for estimating the probability that a given small target, among many, will be the first to be reached in a molecular dynamics simulation. Reaching small targets out of a vast number of possible configurations…
While modern biotechnologies allow synthesizing new proteins and function measurements at scale, efficiently exploring a protein sequence space and engineering it remains a daunting task due to the vast sequence space of any given protein.…
Spatial search on graphs is one of the most important algorithmic applications of quantum walks. To show that a quantum-walk-based search is more efficient than a random-walk-based search is a difficult problem, which has been addressed in…
We consider processes that coincide with a given diffusion process outside a finite collection of domains. In each of the domains, there is, additionally, a large drift directed towards the interior of the domain. We describe the limiting…
We develop a method for deriving thermodynamic bounds for first-passage problems of currents with two boundaries in Markov chains. Using this method, we derive a thermodynamic bound on the rate of dissipation in terms of the splitting…
Relatively general techniques for computing mean first-passage time (MFPT) of random walks on networks with a specific property are very useful, since a universal method for calculating MFPT on general graphs is not available because of…
The phenomenon of data distribution evolving over time has been observed in a range of applications, calling the needs of adaptive learning algorithms. We thus study the problem of supervised gradual domain adaptation, where labeled data…
We consider the persistent exclusion process in which a set of persistent random walkers interact via hard-core exclusion on a hypercubic lattice in $d$ dimensions. We work within the ballistic regime whereby particles continue to hop in…
Intracellular processes often rely on the timely encounter of mobile reaction partners, including intermittently motor-driven organelles. The underlying cytoskeletal network presents a complex landscape that both directs particle movement…
How much time does it take for a fluctuating system, such as a polymer chain, to reach a target configuration that is rarely visited -- typically because of a high energy cost ? This question generally amounts to the determination of the…
Search processes are a fundamental part of natural and artificial systems. In such settings, the number of searchers is rarely constant: new agents may be recruited while others can abandon the search. Despite the ubiquity of these…
In the last few decades, noise-induced large fluctuations and transition phenomena have garnered significant attention in a variety of scientific contexts. The concept of prehistory probability has been proposed within the framework of…
We study the random walk problem on a deterministic scale-free network, in the presence of a set of static, identical targets; due to the strong inhomogeneity of the underlying structure the mean first-passage time (MFPT), meant as a…
The statistics of the slowest first-passage time among a large population of $N$ searchers is crucial for determining the completion time of many stochastic processes. Classical extreme-value theory predicts that for diffusing particles in…
The first-passage time (FPT), i.e., the moment when a stochastic process reaches a given threshold value for the first time, is a fundamental mathematical concept with immediate applications. In particular, it quantifies the statistics of…
The first-passage time (FPT) is a fundamental concept in stochastic processes, representing the time it takes for a process to reach a specified threshold for the first time. Often, considering a time-dependent threshold is essential for…
We introduce the exit time finite state projection (ETFSP) scheme, a truncation-based method that yields approximations to the exit distribution and occupation measure associated with the time of exit from a domain (i.e., the time of first…
Chase-escape is a competitive growth process in which red particles spread to adjacent empty sites according to a rate-$\lambda$ Poisson process while being chased and consumed by blue particles according to a rate-$1$ Poisson process.…
Levy flights are known to be optimal search strategies in the particular case of revisitable targets. In the relevant situation of non revisitable targets, we propose an alternative model of bidimensional search processes, which explicitly…