Related papers: Interacting elephant random walks
We study absorbing phase transitions in the one-dimensional branching annihilating random walk with long-range repulsion. The repulsion is implemented as hopping bias in such a way that a particle is more likely to hop away from its closest…
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…
We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination…
Random walks and related spatial stochastic models have been used in a range of application areas including animal and plant ecology, infectious disease epidemiology, developmental biology, wound healing, and oncology. Classical random walk…
In this paper, we explain the connection between the Elephant Random Walk (ERW) and an urn model \`a la P\'olya and derive functional limit theorems for the former. The ERW model was introduced by Sch\"utz and Trimper [2004] to study memory…
We investigate quantum walks in multiple dimensions with different quantum coins. We augment the model by assuming that at each step the amplitudes of the coin state are multiplied by random phases. This model enables us to study in detail…
We consider a population of $N$ labeled random walkers moving on a substrate, and an excitation jumping among the walkers upon contact. The label $\mathcal{X}(t)$ of the walker carrying the excitation at time $t$ can be viewed as a…
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…
We consider multidimensional discrete valued random walks with nonzero drift killed when leaving general cones of the euclidian space. We find the asymptotics for the exit time from the cone and study weak convergence of the process…
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…
We perform simulations for one dimensional continuous-time random walks in two dynamic random environments with fast (independent spin-flips) and slow (simple symmetric exclusion) decay of space-time correlations, respectively. We focus on…
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…
Random walks are ubiquitous in the sciences, and they are interesting from both theoretical and practical perspectives. They are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including…
Starting from a simple animal-biology example, a general, somewhat counter-intuitive property of diffusion random walks is presented. It is shown that for any (non-homogeneous) purely diffusing system, under any isotropic uniform incidence,…
We consider a one-dimensional continuous time random walk with transition rates depending on an underlying autonomous simple symmetric exclusion process starting out of equilibrium. This model represents an example of a random walk in a…
Motivated by novel results in the theory of complex adaptive systems, we analyze the dynamics of random walks in which the jumping probabilities are {\it time-dependent}. We determine the survival probability in the presence of an absorbing…
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,…
We consider a discrete-time continuous-space random walk under the constraints that the number of returns to the origin (local time) and the total area under the walk are fixed. We first compute the joint probability of an excursion having…
We establish an invariance principle for a one-dimensional random walk in a dynamical random environment given by a speed-change exclusion process. The jump probabilities of the walk depend on the configuration of the exclusion in a finite…
Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the…