相关论文: Random Walk with Shrinking Steps: First Passage Ch…

We suggest a model for data losses in a single node of a packet-switched network (like the Internet) which reduces to one-dimensional discrete random walks with unusual boundary conditions. The model shows critical behavior with an abrupt…

The first-return time is the time that it takes a random walker to go back to the initial position for the first time. We study the first-return time when random walkers perform fractional kinetics, specifically fractional diffusion, that…

We introduce a multidimensional walk with memory and random tendency. The asymptotic behaviour is characterized, proving a law of large numbers and showing a phase transition from diffusive to superdiffusive regimes. In first case, we…

In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…

We study how an evanescence process affects the number of distinct sites visited by a continuous time random walker in one dimension. We distinguish two very different cases, namely, when evanescence can only occur concurrently with a jump,…

Let $X$ be a real valued L\'evy process that is in the domain of attraction of a stable law without centering with norming function $c.$ As an analogue of the random walk results in \cite{vw} and \cite{rad} we study the local behaviour of…

We consider a continuous-time branching random walk on a multidimensional lattice in a random branching medium. It is theoretically known that, in such branching random walks, large rare fluctuations of the medium may lead to anomalous…

Let X_0=0, X_1, X_2, ..., be an aperiodic random walk generated by a sequence xi_1, xi_2, ..., of i.i.d. integer-valued random variables with common distribution p(.) having zero mean and finite variance. For an N-step trajectory…

We propose a variety of models of random walk, discrete in space and time, suitable for simulating stable random variables of arbitrary index $\alpha$ ($0< \alpha \le 2$), in the symmetric case. We show that by properly scaled transition to…

Let (Z_n)_{n\in\N_0} be a d-dimensional random walk in random scenery, i.e., Z_n=\sum_{k=0}^{n-1}Y_{S_k} with (S_k)_{k\in\N_0} a random walk in Z^d and (Y_z)_{z\in Z^d} an i.i.d. scenery, independent of the walk. We assume that the random…

We study the random walk on dynamical percolation of $\mathbb{Z}^d$ (resp., the two-dimensional triangular lattice $\mathcal{T}$), where each edge (resp., each site) can be either open or closed, refreshing its status at rate $\mu\in…

We study the asymptotic behavior of the critical density of the activated random walk model as the sleep rate $\lambda$ tends to $0$ and $\infty$. For large $\lambda$, we prove new lower bounds in dimensions 1 and 2, showing that in one…

We investigate the first-passage properties of a jump process with a constant drift, focusing on two key observables: the first-passage time $\tau$ and the number of jumps $n$ before the first-passage event. By mapping the problem onto an…

Let $(M,d,\mu)$ be a uniformly discrete metric measure space satisfying space homogeneous volume doubling condition. We consider discrete time Markov chains on $M$ symmetric with respect to $\mu$ and whose one-step transition density is…

We evaluate the limit distribution of the maximal excursion of a random walk in any dimension for homogeneous environments and for self-similar supports under the assumption of spherical symmetry. This distribution is obtained in closed…

Starting from the model of continuous time random walk, we focus our interest on random walks in which the probability distributions of the waiting times and jumps have fat tails characterized by power laws with exponent between 0 and 1 for…

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 set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…

We consider a minimal model of one-dimensional discrete-time random walk with step-reinforcement, introduced by Harbola, Kumar, and Lindenberg (2014): The walker can move forward (never backward), or remain at rest. For each $n=1,2,\cdots$,…

We consider various two-dimensional lattices such as square, Kagome, Lieb, honeycomb, dice lattices of finite extent, to study the effect of lattice profile in terms of the number of nearest neighbour and connectivity patterns on the…