Related papers: The Elephant random walk with gradually increasing…
We derive a functional central limit theorem for the excursion of a random walk conditioned on sweeping a prescribed geometric area. We assume that the increments of the random walk are integer-valued, centered, with a third moment equal to…
We consider an exactly solvable model of branching random walk with random selection, which describes the evolution of a population with $N$ individuals on the real line. At each time step, every individual reproduces independently, and its…
The Rademacher random walk associated with a deterministic sequence $(a_n)_{n \geq 1}$ is the walk which starts at zero and, at step $i$, independently steps either up or down by $a_i$ with equal probability. We continue the study begun by…
Random walks on lattices with preferential relocation to previously visited sites provide a simple framework for modeling the displacements of animals and humans. When the lattice contains a few impurities or resource sites where the walker…
L\'evy walks are found in the migratory behaviour patterns of various organisms, and the reason for this phenomenon has been much discussed. We use simulations to demonstrate that learning causes the changes in confidence level during…
We consider random variables observed at arrival times of a renewal process, which possibly depends on those observations and has regularly varying steps with infinite mean. Due to the dependence and heavy tailed steps, the limiting…
The discrete stochastic dynamics of a random walker in the presence of resetting and memory is analyzed. Resetting and memory effects may compete for certain parameter regime and lead to significant changes in the long time dynamics of the…
The symmetric random walk is known to be recurrent in one and two dimensions, and becomes transient in three or higher dimensions. We compare the symmetric random walk to walks driven by certain \polya\ urns. We show that, in contrast, if…
Using the continuous-time random walk (CTRW) approach, we study the phenomenon of relaxation of two-state systems whose elements evolve according to a dichotomous process. Two characteristics of relaxation, the probability density function…
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…
For a generalized step reinforced random walk, starting from the origin, the first step is taken according to the first element of an innovation sequence. Then in subsequent epochs, it recalls a past epoch with probability proportional to a…
Active walker models have proved to be extremely effective in understanding the evolution of a large class of systems in biology like ant trail formation and pedestrian trails. We propose a simple model of a random walker which modifies its…
We show that the `erasing-larger-loops-first' (ELLF) method, which was first introduced for erasing loops from the simple random walk on the Sierpinski gasket, does work also for non-Markov random walks, in particular, self-repelling walks…
Using the technique of evolving sets, we explore the connection between entropy growth and transience for simple random walks on connected infinite graphs with bounded degree. In particular we show that for a simple random walk starting at…
The evolution of a walker in standard "Discrete-time Quantum Walk (DTQW)" is determined by coin and shift unitary operators. The conditional shift operator shifts the position of the walker to right or left by unit step size while the…
The Continuous-Time Random Walk (CTRW) formalism can be adapted to encompass stochastic processes with memory. In this article we will show how the random combination of two different unbiased CTRWs can give raise to a process with clear…
We study the persistence exponent for the first passage time of a random walk below the trajectory of another random walk. More precisely, let $\{B_n\}$ and $\{W_n\}$ be two centered, weakly dependent random walks. We establish that…
This thesis examines edge-reinforced random walks with some modifications to the standard definition. An overview of known results relating to the standard model is given and the proof of recurrence for the standard linearly edge-reinforced…
Given a finite-range random walk on a finitely generated free group , what is the asymptotic behaviour, as the number of steps goes to infinity, of the sequence of probabilities that the random walk is at a given element of the group? In…
The self-avoiding random walk (SARW) is a stochastic process whose state variable avoids returning to previously visited states. This non-Markovian feature has turned SARWs a powerful tool for modelling a plethora of relevant aspects in…