Related papers: Random walks with fractally correlated traps: Stre…
We analyze time-discrete and continuous `fractional' random walks on undirected regular networks with special focus on cubic periodic lattices in $n=1,2,3,..$ dimensions. The fractional random walk dynamics is governed by a master equation…
A growing self-avoiding walk (GSAW) is a stochastic process that starts from the origin on a lattice and grows by occupying an unoccupied adjacent lattice site at random. A sufficiently long GSAW will reach a state in which all adjacent…
We study the support (i.e. the set of visited sites) of a t step random walk on a two-dimensional square lattice in the large t limit. A broad class of global properties M(t) of the support is considered, including, e.g., the number S(t) of…
We study a continuous time branching process where an individual splits into two daughters with rate b and dies with rate a, starting from a single individual at t=0. We show that the model can be mapped exactly to a random walk problem…
We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree conditioned to survive when the offspring distribution, $Z$ say, is in the domain of attraction of a stable law with index…
The explicit determinations of the mean first-passage time (MFPT) for trapping problem are limited to some simple structure, e.g., regular lattices and regular geometrical fractals, and determining MFPT for random walks on other media,…
Fractal dimension is central to understanding dynamical processes occurring on networks; however, the relation between fractal dimension and random walks on fractal scale-free networks has been rarely addressed, despite the fact that such…
In general, the power-law degree distribution has profound influence on various dynamical processes defined on scale-free networks. In this paper, we will show that power-law degree distribution alone does not suffice to characterize the…
Exploration and trapping properties of random walkers that may evanesce at any time as they walk have seen very little treatment in the literature, and yet a finite lifetime is a frequent occurrence, and its effects on a number of random…
Let X= {X_t, t \ge 0} be a continuous time random walk in an environment of i.i.d. random conductances {\mu_e \in [1, \infty), e \in E_d}, where E_d is the set of nonoriented nearest neighbor bonds on the Euclidean lattice Z^d and d\ge 3.…
Random walks including non-nearest-neighbor jumps appear in many real situations such as the diffusion of adatoms and have found numerous applications including PageRank search algorithm, however, related theoretical results are much less…
We consider the random walk of a particle in a two-dimensional self-affine random potential of Hurst exponent $H=1/2$ in the presence of an external force $F$. We present numerical results on the statistics of first-passage times that…
In the quest for signatures of coherent transport we consider exciton trapping in the continuous-time quantum walk framework. The survival probability displays different decay domains, related to distinct regions of the spectrum of the…
We study loop erased random walk (LERW) on the percolation cluster, with occupation probability $p\geq p_c$, in two and three dimensions. We find that the fractal dimensions of LERW$_p$ is close to normal LERW in Euclidean lattice, for all…
We consider random walks on $\Z^d$ among nearest-neighbor random conductances which are i.i.d., positive, bounded uniformly from above but whose support extends all the way to zero. Our focus is on the detailed properties of the paths of…
We study the one-dimensional branching random walk in the case when the step size distribution has a stretched exponential tail, and, in particular, no finite exponential moments. The tail of the step size $X$ decays as $\mathbb{P}[X \geq…
In this paper, we propose a general framework for the trapping problem on a weighted network with a perfect trap fixed at an arbitrary node. By utilizing the spectral graph theory, we provide an exact formula for mean first-passage time…
We consider a one-dimensional simple random walk killed by quenched soft obstacles. The position of the obstacles is drawn according to a renewal process with a power-law increment distribution. In a previous work, we computed the…
Self-avoiding walks are studied on the 3-simplex fractal lattice as a model of linear polymer conformations in a dilute, non-homogeneous solution. A model is supplemented with bending energies and attractive-interaction energies between…
We consider a system consisting of a planar random walk on a square lattice, submitted to stochastic elementary local deformations. Depending on the deformation transition rates, and specifically on a parameter $\eta$ which breaks the…