相关论文: Transition probabilities of step-reinforced random…

A natural extension of a right-continuous integer-valued random walk is one which can jump to the right by one or two units. First passage times above a given fixed level then admit a tractable Laplace transform (probability generating…

We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…

We consider non-reversible random walks evolving on a potential field in a bounded domain of $\mathbb{R}^d$. We describe the complete metastable behavior of the random walk among the landscape of valleys, and we derive the Eyring-Kramers…

The loop-erased random walk (LERW) in $\mathbb{Z}^4$ is the process obtained by erasing loops chronologically for simple random walk. We prove that the escape probability of the LERW renormalized by $(\log n)^{\frac{1}{3}}$ converges almost…

Random walks (RWs) are fundamental stochastic processes with applications across physics, computer science, and information processing. A recent extension, the laser chaos decision-maker, employs chaotic time series from semiconductor…

Strong ratio limit theorems associated with a broad class of spread out random walks on unimodular groups were proved in the preceding paper, where these random walks were assumed to have the convergence parameter $R=1$. In the present…

We consider one-dimensional discrete-time random walks (RWs) of $n$ steps, starting from $x_0=0$, with arbitrary symmetric and continuous jump distributions $f(\eta)$, including the important case of L\'evy flights. We study the statistics…

A simple symmetric random walk is considered on a spider that is a collection of half lines (we call them legs) joined at the origin. We establish a strong approximation of this random walk by the so-called Brownian spider. Transition…

We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…

In the present paper, we introduce and analyze elephant random walks (ERWs) on bipartite periodic lattices arising as coverings of dipole graphs. We focus on lattices whose admissible step directions in the two parts of the bipartition are…

Let $b$ be an integer greater than 1 and let $W^{\ee}=(W^{\ee}_n; n\geq 0)$ be a random walk on the $b$-ary rooted tree $\U_b$, starting at the root, going up (resp. down) with probability $1/2+\epsilon$ (resp. $1/2 -\epsilon$), $\epsilon…

We study Random Walks in an i.i.d. Random Environment (RWRE) defined on $b$-regular trees. We prove a functional central limit theorem (FCLT) for transient processes, under a moment condition on the environment. We emphasize that we make no…

The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function $W$ taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting…

We study the limiting behaviors of a generalized elephant random walk on the integer lattice. This random walk is defined by using two sequences of parameters expressing the memory at each step from the whole past and the drift of each step…

We prove a conjecture by Bertoin that the multi-dimensional elephant random walk on $\mathbb{Z}^d$($d\geq 3$) is transient and the expected number of zeros is finite. We also provide some estimates on the rate of escape. In dimensions $d=…

What is the probability that a random walk in the free group ends in a proper power? Or in a primitive element? We present a formula that computes the exponential decay rate of the probability that a random walk on a regular tree ends in a…

As a strategy to complete games quickly, we investigate one-dimensional random walks where the step length increases deterministically upon each return to the origin. When the step length after the kth return equals k, the displacement of…

The vertex-reinforced jump process (VRJP), introduced by Davis and Volkov, is a continuous-time process that tends to come-back to already visited vertices. It is closely linked to the edge-reinforced random walk (ERRW) introduced by…

We give a complete and unified description -- under some stability assumptions -- of the functional scaling limits associated with some persistent random walks for which the recurrent or transient type is studied in [1]. As a result, we…

Elephant random walks were studied recently in \cite{mukherjee2025elephant} on the groups $\mathbb{Z}^{*d_1} * \mathbb{Z}_2^{*d_2}$ whose Cayley graphs are infinite $d$-regular trees with $d = 2d_1 + d_2$. It was found that for $d \ge 3$,…