Related papers: Monotonicity and phase transition for the VRJP and…
In this article we shall derive functional limit theorems for the multi-dimensional elephant random walk (MERW) and thus extend the results provided for the one-dimensional marginal by Bercu and Laulin (2019). The MERW is a non-Markovian…
This paper is devoted to the asymptotic analysis of the amnesic elephant random walk (AERW) using a martingale approach. More precisely, our analysis relies on asymptotic results for multidimensional martingales with matrix normalization.…
The rotor walk is a derandomized version of the random walk on a graph. On successive visits to any given vertex, the walker is routed to each of the neighboring vertices in some fixed cyclic order, rather than to a random sequence of…
Random walks in random sceneries (RWRS) are simple examples of stochastic processes in disordered media. They were introduced at the end of the 70's by Kesten-Spitzer and Borodin, motivated by the construction of new self-similar processes…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
We provide analytical solutions for two types of random walk: generic random walk (GRW) and maximal entropy random walk (MERW) on a Cayley tree with arbitrary branching number, root degree, and number of generations. For MERW, we obtain the…
We investigate aging continuous time random walks (ACTRW), introduced by Monthus and Bouchaud [{\em J. Phys. A} {\bf 29}, 3847 (1996)]. Statistical behaviors of the displacement of the random walker ${\bf r}={\bf r}(t) - {\bf r}(0)$ in the…
Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…
The combined Continuous Time Random Walk (CTRW) in position and momentum space is introduced, in the form of two coupled integral equations that describe the evolution of the probability distribution for finding a particle at a certain…
Continuous time random walks (CTRWs) are used in physics to model anomalous diffusion, by incorporating a random waiting time between particle jumps. In finance, the particle jumps are log-returns and the waiting times measure delay between…
We define a general model of stochastically-evolving graphs, namely the \emph{Edge-Uniform Stochastically-Evolving Graphs}. In this model, each possible edge of an underlying general static graph evolves independently being either alive or…
The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{\'e}vy walks for which the persistence times depend on some internal…
This work explores a synchronization-like phenomenon induced by common noise for continuous-time Markov jump processes given by chemical reaction networks. A corresponding random dynamical system is formulated in a two-step procedure, at…
A distinguishing property of communities in networks is that cycles are more prevalent within communities than across communities. Thus, the detection of these communities may be aided through the incorporation of measures of the local…
A distinguishing property of communities in networks is that cycles are more prevalent within communities than across communities. Thus, the detection of these communities may be aided through the incorporation of measures of the local…
We present a graph random walk (GRW) method for the study of charge transport properties of complex molecular materials in the time-of-flight regime. The molecules forming the material are represented by the vertices of a directed weighted…
Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research. In this paper, we use random…
Reinforcement learning (RL) has shown great potential in enabling quadruped robots to perform agile locomotion. However, directly training policies to simultaneously handle dual extreme challenges, i.e., extreme underactuation and extreme…
Under certain circumstances, a swarm of a species of trail-laying ants known as army ants can become caught in a doomed revolving motion known as the death spiral, in which each ant follows the one in front of it in a never-ending loop…
We study random walks in i.i.d. random environments on $\mathbb{Z}^d$ when there are two basic types of vertices, which we call "blue" and "red". Each color represents a different probability distribution on transition probability vectors.…