Related papers: Exit problem for Ornstein-Uhlenbeck processes: a r…
Random walk has wide applications in many fields, such as machine learning, biology, physics, and chemistry. Random walk can be discrete or continuous in time and space. Asymmetric random walk could be described by drift-diffusion equation.…
We prove an estimate for the probability that a simple random walk in a simply connected subset A of Z^2 starting on the boundary exits A at another specified boundary point. The estimates are uniform over all domains of a given inradius.…
Von Renesse and the author (Ann. Prob. '09) developed a second order calculus on the Wasserstein space P([0,1]) of probability measures on the unit interval. The basic objects of interest had been Dirichlet form, semigroup and continuous…
We focus on the existence and characterization of the limit for a certain critical branching random walks in time-space random environment in one dimension which was introduced by M. Birnkenr et.al. Each particle performs simple random walk…
The purpose of this article is to compute the expected first exit times of Brownian motion from a variety of domains in the Euclidean plane and in the hyperbolic plane.
We study the Brownian motion of a classical particle in one-dimensional inhomogeneous environments where the transition probabilities follow quasiperiodic or aperiodic distributions. Exploiting an exact correspondence with the…
We consider the sum of the coordinates of a simple random walk on the K-dimensional hypercube, and prove a double asymptotic of this process, as both the time parameter n and the space parameter K tend to infinity. Depending on the…
The survival probability for a periodic non-autonomous Ornstein-Uhlenbeck process is calculated analytically using two different methods. The first uses an asymptotic approach. We treat the associated Kolmogorov Backward Equation with an…
We develop Random Batch Methods for interacting particle systems with large number of particles. These methods use small but random batches for particle interactions, thus the computational cost is reduced from $O(N^2)$ per time step to…
The run-and-tumble walk, consisting in randomly reoriented ballistic excursions, models phenomena ranging from gas kinetics to bacteria motility. We evaluate the mean time required for this walk to find a fixed target within a 2D or 3D…
The time needed for a particle to exit a confining domain through a small window, called the narrow escape time (NET), is a limiting factor of various processes, such as some biochemical reactions in cells. Obtaining an estimate of the mean…
We consider the motion of an active Brownian particle with speed fluctuations in d-dimensions in the presence of both translational and orientational diffusion. We use an Ornstein-Uhlenbeck process for active speed generation. Using a…
The motion of self-propelled particles is modeled as a persistent random walk. An analytical framework is developed that allows the derivation of exact expressions for the time evolution of arbitrary moments of the persistent walk's…
In a system made up of independent random walks, fluctuations of order $n^{1/4}$ from the hydrodynamic limit come from particle current across characteristics. We show that a two-parameter space-time particle current process converges to a…
This paper presents necessary and sufficient conditions for on- and off-diagonal transition probability estimates for random walks on weighted graphs. On the integer lattice and on may fractal type graphs both the volume of a ball and the…
Efficiency of search for randomly distributed targets is a prominent problem in many branches of the sciences. For the stochastic process of L\'evy walks, a specific range of optimal efficiencies was suggested under variation of search…
We consider a particle diffusing along the links of a general graph possessing some absorbing vertices. The particle, with a spatially-dependent diffusion constant D(x) is subjected to a drift U(x) that is defined in every point of each…
Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by…
In this note, by an elementary use of Girsanov's transform we show that the exit time for either a biased random walk or a drifted Brownian motion on a symmetric interval is stochastically monotone with respect to the drift parameter. In…
The presented explanations are provided for the one--dimensional diffusion process with constant drift by using forward Fokker--Planck technique. We are interested in the outflow probability in a finite interval, i.e. first passage time…