相关论文: The shape theorem for the frog model
This article studies vertex reinforced random walks that are non-backtracking (denoted VRNBW), i.e. U-turns forbidden. With this last property and for a strong reinforcement, the emergence of a path may occur with positive probability.…
The Random First Order Transition Theory (RFOT) predicts that transport proceeds by cooperative movement of particles in domains whose sizes increase as a liquid is compressed above a characteristic volume fraction, $\phi_d$. The rounded…
Bootstrap percolation is a prominent framework for studying the spreading of activity on a graph. We begin with an initial set of active vertices. The process then proceeds in rounds, and further vertices become active as soon as they have…
We study the Ergodic Properties of Random Walks in stationary ergodic environments without uniform ellipticity under a minimal assumption. There are two main components in our work. The first step is to adopt the arguments of Lawler to…
The rotor-router model on a graph describes a discrete-time walk accompanied by the deterministic evolution of configurations of rotors randomly placed on vertices of the graph. We prove the following property: if at some moment of time,…
The appearance of topological effects in systems exhibiting a non-trivial topological band structure strongly relies on the coherent wave nature of the equations of motion. Here, we reveal topological dynamics in a classical stochastic…
We consider convex hulls of random walks whose steps belong to the domain of attraction of a stable law in $\mathbb{R}^d$. We prove convergence of the convex hull in the space of all convex and compact subsets of $\mathbb{R}^d$, equipped…
The aim of this work is to demonstrate that the continuous-time frog model can spread arbitrary fast. The set of sites visited by an active particle can become infinite in a finite time.
We study a minimal cognitive flocking model, which assumes that the moving entities navigate using exclusively the available instantaneous visual information. The model consists of active particles, with no memory, that interact by a…
We consider shock measures in a class of conserving stochastic particle systems on Z. These shock measures have a product structure with a step-like density profile and include a second class particle at the shock position. We show for the…
We study a simple random walk on Z^2 with constraints on the axis. Motivation comes from physics when particles (a gas for example, see [Dal88]) are submitted to a local field. In our case we assume that the particle evolves freely in the…
Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\hbox{deg} (x)$ neighbors of its location uniformly at…
This paper studies a class of growing systems of random walks on regular trees, known as \emph{frog models with geometric lifetime} in the literature. With the help of results from renewal theory, we derive new bounds for their critical…
We consider an interacting particle system on trees known as the frog model: initially, a single active particle begins at the root and i.i.d.~$\mathrm{Poiss}(\lambda)$ many inactive particles are placed at each non-root vertex. Active…
The self-similar infall model (SSIM) is normally discussed in the context of radial orbits in spherical symmetry. However it is possible to retain the spherical symmetry while permitting the particles to move in Keplerian ellipses, each…
We discuss the collective dynamics of self-propelled particles with selective attraction and repulsion interactions. Each particle, or individual, may respond differently to its neighbors depending on the sign of their relative velocity.…
When particles move at a constant speed and have the tendency to align their directions of motion, ordered large scale movement can emerge despite significant levels of noise. Many variants of this model of self-propelled particles have…
In this paper, we study a spatial model for dormancy in a random environment via a two-type branching random walk in continuous-time, where individuals switch between dormant and active states depending on the current state of a fluctuating…
In this note, we consider the frog model on $\mathbb{Z}^d$ and a two-type version of it with two types of particles. For the one-type model, we show that the asymptotic shape does not depend on the initially activated set and the…
By a theorem of Volkov (2001) we know that on most graphs with positive probability the linearly vertex-reinforced random walk (VRRW) stays within a finite "trapping" subgraph at all large times. The question of whether this tail behavior…