Related papers: Simulation and Optimization of Mean First Passage …
When a large number N of independent diffusing particles are placed upon a site of a d-dimensional Euclidean lattice randomly occupied by a concentration c of traps, what is the m-th moment <t^m_{j,N}> of the time t_{j,N} elapsed until the…
We present a time-domain iteration scheme for solving the Dynamical Mean-Field Theory (DMFT) self-consistent equations using retarded Green's functions in real time. Unlike conventional DMFT approaches that operate in imaginary time or…
Since diffusion processes arise in so many different fields, efficient tech-nics for the simulation of sample paths, like discretization schemes, represent crucial tools in applied probability. Such methods permit to obtain approximations…
The first passage is a generic concept for quantifying when a random quantity such as the position of a diffusing molecule or the value of a stock crosses a preset threshold (target) for the first time. The last decade saw an enlightening…
The length-scale dependence of the dynamic entropy is studied in a molecular dynamics simulation of a binary Lennard-Jones liquid above the mode-coupling critical temperature $T_c$. A number of methods exist for estimating the entropy of…
During recent decades, there has been a substantial development in optimal mass transport theory and methods. In this work, we consider multi-marginal problems wherein only partial information of each marginal is available, which is a setup…
We propose a simple scaling theory describing the variation of the mean first passage time (MFPT) $\tau(N,M)$ of a regular block copolymer of chain length $N$ and block size $M$ which is dragged through a selective liquid-liquid interface…
We formulate a dynamical model for microtubules interacting with a catastrophe-inducing boundary. In this model microtubules are either waiting to be nucleated, actively growing or shrinking, or stalled at the boundary. We first determine…
This study focuses on solving the numerical challenges of imposing absorbing boundary conditions for dynamic simulations in the material point method (MPM). To attenuate elastic waves leaving the computational domain, the current work…
In this paper, we present a Longstaff-Schwartz-type algorithm for optimal stopping time problems based on the Brownian motion filtration. The algorithm is based on Le\~ao, Ohashi and Russo and, in contrast to previous works, our methodology…
General upper bounds on fluctuations of trajectory observables were recently obtained. It turned out that the size of fluctuations of dynamical observable is limited from below and from above. For the moment generating function of general…
The Schr\"odinger integral-equation approach for calculating the classical first-passage time (C-fpt) probability density is extended to the case of quantum first-passage time (Q-fpt). Using this extension, we have calculated analytically…
We study the narrow escape problem in the disk, which consists in identifying the first exit time and first exit point distribution of a Brownian particle from the ball in dimension 2, with reflecting boundary conditions except on small…
Navigation in complex and noisy environments is a key issue in diverse fields from biology to engineering. Despite extensive progress in numerical optimization methods for computing navigation policies, insights into how disorder reshapes…
The Minimum Vertex Cover problem, a classical NP-complete problem, presents significant challenges for exact solution on large graphs. Fixed-Parameter Tractability (FPT) offers a powerful paradigm to address such problems by exploiting a…
This paper deals with the three-dimensional narrow escape problem in dendritic spine shaped domain, which is composed of a relatively big head and a thin neck. The narrow escape problem is to compute the mean first passage time of Brownian…
Motivated by robotic surveillance applications, this paper studies the novel problem of maximizing the return time entropy of a Markov chain, subject to a graph topology with travel times and stationary distribution. The return time entropy…
We study discrete random walks on the NFSFT and provide new methods to calculate the analytic solutions of the MFPT for any pair of nodes, the MTT for any target node and MDT for any source node. Further more, using the MTT and the MDT as…
We consider a particle undergoing diffusion with stochastic resetting in a bounded domain $\calU\subset \R^d$ for $d=2,3$. The domain is perforated by a set of partially absorbing targets within which the particle may be absorbed at a rate…
As a basic dynamic feature on complex networks, the property of random walk has received a lot of attention in recent years. In this paper, we first studied the analytical expression of the mean global first passage time (MGFPT) on the…