Related papers: Crossover behaviors in branching annihilating attr…

Let $G$ be a Cayley graph of a nonamenable group with spectral radius $\rho < 1$. It is known that branching random walk on $G$ with offspring distribution $\mu$ is transient, i.e., visits the origin at most finitely often almost surely, if…

We study the long-time behavior of the probability density associated with the decoupled continuous-time random walk which is characterized by a superheavy-tailed distribution of waiting times. It is shown that if the random walk is…

In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…

We study the high-dimensional uniform prudent self-avoiding walk, which assigns equal probability to all nearest-neighbor self-avoiding paths of a fixed length that respect the prudent condition, namely, the path cannot take any step in the…

An intrinsic branching structure within the transient random walk on a strip in a random environment is revealed. As applications, which enables us to express the hitting time explicitly, and specifies the density of the absolutely…

We study the first-passage properties of a random walk in the unit interval in which the length of a single step is uniformly distributed over the finite range [-a,a]. For a of the order of one, the exit probabilities to each edge of the…

The L\'evy walk process with rests is discussed. The jumping time is governed by an $\alpha$-stable distribution with $\alpha>1$ while a waiting time distribution is Poissonian and involves a position-dependent rate which reflects a…

Let D be a domain in the plane containing the origin. We are interested in the ensemble of self-avoiding walks (SAW's) in D which start at the origin and end on the boundary of the domain. We introduce an ensemble of SAW's that we expect to…

We prove that on any transitive graph $G$ with infinitely many ends, a self-avoiding walk of length $n$ is ballistic with extremely high probability, in the sense that there exist constants $c,t>0$ such that $\mathbb{P}_n(d_G(w_0,w_n)\geq…

We survey recent results of normal and anomalous diffusion of two types of random motions with long memory in ${\Bbb R}^d$ or ${\Bbb Z}^d$. The first class consists of random walks on ${\Bbb Z}^d$ in divergence-free random drift field,…

We study the conformational properties of polymers in presence of extended columnar defects of parallel orientation. Two classes of macromolecules are considered: the so-called partially directed polymers with preferred orientation along…

This is a short review of the two papers on the $x$-space asymptotics of the critical two-point function $G_{p_c}(x)$ for the long-range models of self-avoiding walk, percolation and the Ising model on $\mathbb{Z}^d$, defined by the…

We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…

We study a model of bacterial dynamics where two interacting random walkers perform run-and-tumble motion on a one-dimensional lattice under mutual exclusion and find an exact expression for the probability distribution in the steady state.…

It is a common practice to describe branching random walks in terms of birth, death and walk of particles, which makes it easier to use them in different applications. The main results obtained for the models of symmetric continuous-time…

We consider the biased random walk on a critical Galton-Watson tree conditioned to survive, and confirm that this model with trapping belongs to the same universality class as certain one-dimensional trapping models with slowly-varying…

Temporal networks serve as abstractions of many real-world dynamic systems. These networks typically evolve according to certain laws, such as the law of triadic closure, which is universal in social networks. Inductive representation…

We investigate neighbor-avoiding walks on the simple cubic lattice in the presence of an adsorbing surface. This class of lattice paths has been less studied using Monte Carlo simulations. Our investigation follows on from our previous…

We study the biased random walk process in random uncorrelated networks with arbitrary degree distributions. In our model, the bias is defined by the preferential transition probability, which, in recent years, has been commonly used to…

We show through intensive simulations that the paradigmatic features of anomalous diffusion are indeed the features of a (continuous-time) random walk driven by two different Markovian hopping-trap mechanisms. If $p \in (0,1/2)$ and $1-p$…