相关论文: Hitting and Trapping Times on Branched Structures
The timescales of many physical, chemical, and biological processes are determined by first passage times (FPTs) of diffusion. The overwhelming majority of FPT research studies the time it takes a single diffusive searcher to find a target.…
In this article we study the distribution of the number of points of a simple random walk, visited a given number of times (the k-multiple point range). In a previous article we had developed a graph theoretical approach which is now…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
In the previous chapters, we explored the effects of resetting on networks considering one and two nodes. In this chapter, we will describe a generalization of random walks with resetting to an arbitrary number of nodes $\mathcal{M}$. In…
A phenomenological model for a measurement of barrier traversal times for particles is proposed. Two idealized detectors for passage and arrival provide entrance and exit times for the barrier traversal. The averaged traversal time is…
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 consider the quantum first detection problem for a particle evolving on a graph under repeated projective measurements with fixed rate $1/\tau$. A general formula for the mean first detected transition time is obtained for a quantum walk…
Above two dimensions, diffusion of a particle in a medium with quenched random traps is believed to be well-described by the annealed continuous time random walk (CTRW). We propose an approximate expression for the first-passage-time (FPT)…
Let $T$ be the regular tree in which every vertex has exactly $d\ge 3$ neighbours. Run a branching random walk on $T$, in which at each time step every particle gives birth to a random number of children with mean $d$ and finite variance,…
We study hitting times in simple random walks on graphs, which measure the time required to reach specific target vertices. Our main result establishes a sharp lower bound for the variance of hitting times. For a simple random walk on a…
Firstly, we compute the distribution function for the hitting time of a linear time-dependent boundary $t\mapsto a+bt,\ a\geq 0,\,b\in \R,$ by a reflecting Brownian motion. The main tool hereby is Doob's formula which gives the probability…
For a random walk on a confined one-dimensional domain, we consider mean first passage times (MFPT) in the presence of a mobile trap. The question we address is whether a mobile trap can improve capture times over a stationary trap. We…
Explicit determination of the mean first-passage time (MFPT) for trapping problem on complex media is a theoretical challenge. In this paper, we study random walks on the Apollonian network with a trap fixed at a given hub node (i.e. node…
Hitting the exit node from the entrance node faster on a graph is one of the properties that quantum walk algorithms can take advantage of to outperform classical random walk algorithms. Especially, continuous-time quantum walks on…
We determine the survival probability and first-passage time (FPT) to capture for a harmonically trapped particle, diffusing outside an absorbing spherical boundary by directly solving the differential equation for the survival probability.…
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…
Hitting times are the average time it takes a walk to reach a given final vertex from a given starting vertex. The hitting time for a classical random walk on a connected graph will always be finite. We show that, by contrast, quantum walks…
In this paper we consider a (reflected) Brownian motion with broken drift hitting a random boundary. Some dedicated calculations allow us to obtain the formula on the joint Laplace transform of the hitting time and hitting position. These…
The cover time is defined as the time needed for a random walker to visit every site of a confined domain. Here, we focus on persistent random walks, which provide a minimal model of random walks with short range memory. We derive the exact…
An overview is presented of recent work on some statistical problems on multiparticle random walks. We consider a Euclidean, deterministic fractal or disordered lattice and N >> 1 independent random walkers initially (t=0) placed onto the…