Related papers: Nonfixation for Activated Random Walks

We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…

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…

Our objective is to sample the node set of a large unknown graph via crawling, to accurately estimate a given metric of interest. We design a random walk on an appropriately defined weighted graph that achieves high efficiency by…

We study the dynamics of two conservative lattice gas models on the infinite d-dimensional hypercubic lattice: the Activated Random Walks (ARW) and the Stochastic Sandpiles Model (SSM), introduced in the physics literature in the early…

We show the critical density for activated random walks on Euclidean lattices is at most one.

In this paper we introduce the notion of Random Walk in Changing Environment - a random walk in which each step is performed in a different graph on the same set of vertices, or more generally, a weighted random walk on the same vertex and…

We prove results for random walks in dynamic random environments which do not require the strong uniform mixing assumptions present in the literature. We focus on the "environment seen from the walker"-process and in particular its…

We introduce a non-equilibrium discrete-time random walk model on multiplex networks, in which at each time step the walker first undergoes a random jump between neighboring nodes in the same layer, and then tries to hop from one node to…

The node2vec random walk is a non-Markovian random walk on the vertex set of a graph, widely used for network embedding and exploration. This random walk model is defined in terms of three parameters which control the probability of,…

Algebraic random walks (ARW) and quantum mechanical random walks (QRW) are investigated and related. Based on minimal data provided by the underlying bialgebras of functions defined on e. g the real line R, the abelian finite group Z_N, and…

This thesis explores a central question: how does memory affect the way random walkers explore space? By analyzing various non-Markovian models, where past behavior directly influences future dynamics, we uncover new mechanisms and…

We prove a shape theorem for a growing set of simple random walks on Z^d, known as frog model. The dynamics of this process is described as follows: There are active particles, which perform independent discrete time SRWs, and sleeping…

We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…

We consider random walks in random environments on Z^d. Under a transitivity hypothesis that is much weaker than the customary ellipticity condition, and assuming an absolutely continuous invariant measure on the space of the environments,…

In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…

We study a discrete time self interacting random process on graphs, which we call Greedy Random Walk. The walker is located initially at some vertex. As time evolves, each vertex maintains the set of adjacent edges touching it that have not…

We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…

The frog model is a system of interacting random walks. Initially, there is one particle at each vertex of a connected graph $\mathcal{G}$. All particles are inactive at time zero, except for the one which is placed at the root of…

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 study a random walk driven by a particle system from a generic class, and establish a law of large numbers for the walk for almost all densities of the environment. To do so, we exploit the finite-ranged approximations of the environment…