Related papers: Sensitivity of the frog model to initial condition…
We consider open multi-agent systems, which are systems subject to frequent arrivals and departures of agents while the studied process takes place. We study the behavior of all-to-all pairwise gossip interactions in such open systems.…
We consider an interacting particle system on the one dimensional lattice $\bf Z$ modeling combustion. The process depends on two integer parameters $2\le a<M<\infty$. Particles move independently as continuous time simple symmetric random…
We consider a class of multi-particle reinforced interacting random walks. In this model, there are some (finite or infinite) particles performing random walks on a given (finite or infinite) connected graph, so that each particle has…
Consider a system of interacting particles indexed by the nodes of a graph whose vertices are equipped with marks representing parameters of the model such as the environment or initial data. Each particle takes values in a countable state…
We consider a branching random walk on $\Z$, where the particles behave differently in visited and unvisited sites. Informally, each site on the positive half-line contains initially a cookie. On the first visit of a site its cookie is…
Place an active particle at the root of the infinite $d$-ary tree and dormant particles at each non-root site. Active particles move towards the root with probability $p$ and otherwise move to a uniformly sampled child vertex. When an…
The characterization of the "most connected" nodes in static or slowly evolving complex networks has helped in understanding and predicting the behavior of social, biological, and technological networked systems, including their robustness…
In a cellular medium, the plasmic membrane is a place of interactions between the cell and its direct external environment. A classic model describes it as a fluid mosaic. The fluid phase of the membrane allows a lateral degree of freedom…
We analyze the dynamics of a population of independent random walkers on a graph and develop a simple model of epidemic spreading. We assume that each walker visits independently the nodes of a finite ergodic graph in a discrete-time…
We present a general framework for modeling a wide selection of flocking scenarios under free boundary conditions. Several variants have been considered - including examples for the widely observed behavior of hierarchically interacting…
We consider a general framework for multi-type interacting particle systems on graphs, where particles move one at a time by random walk steps, different types may have different speeds, and may interact, possibly randomly, when they meet.…
In this paper, we study the upper tail large deviation for the one-dimensional frog model. In this model, sleeping and active frogs are assigned to vertices on $\mathbb Z$. While sleeping frogs do not move, the active ones move as…
In this paper we propose a generalized model for the motion of a two-species self-driven objects ranging from a scenario of a completely random environment of particles of negligible excluded volume to a more deterministic regime of rigid…
We consider active Brownian particles that intermittently switch between active and inactive states. Such behavior is ubiquitous at all scales, from bacteria to animals and in artificial active systems. We derive exact expressions for key…
The first passage time (FPT) for random walks is a key indicator of how fast information diffuses in a given system. Despite the role of FPT as a fundamental feature in transport phenomena, its behavior, particularly in heterogeneous…
Group behavior has received much attention as a test case of self-organization. There has been much written in recent years to investigate interactions within groups of agents. These agents can be animals moving in an interactive way, such…
We provide a uniform upper bound on the minimal drift so that the one-per-site frog model on a $d$-ary tree is recurrent. To do this, we introduce a subprocess that couples across trees with different degrees. Finding couplings for frog…
In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the…
We consider one-dimensional systems comprising either active run-and-tumble particles (RTPs) or passive Brownian random walkers. These particles are either noninteracting or have hardcore exclusions. We study the dynamics of a single tracer…
In this paper, we introduce a spatial model for dormancy in random environment via a two-type branching random walk in continuous-time, where individuals can switch between dormant and active states through spontaneous switching independent…