Related papers: Frog model wakeup time on the complete graph
The exact mean time between encounters of a given particle in a system consisting of many particles undergoing random walks in discrete time is calculated, on both regular and complex networks. Analytical results are obtained both for…
Our work is motivated by geographical forwarding of sporadic alarm packets to a base station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling periodically and asynchronously. When a node (referred to as the source)…
With the popularity of portable wireless devices it is important to model and predict how information or contagions spread by natural human mobility -- for understanding the spreading of deadly infectious diseases and for improving delay…
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…
Continuous time random Walk model has been versatile analytical formalism for studying and modeling diffusion processes in heterogeneous structures, such as disordered or porous media. We are studying the continuous limits of Heterogeneous…
We present an analytical method for computing the mean cover time of a random walk process on arbitrary, complex networks. The cover time is defined as the time a random walker requires to visit every node in the network at least once. This…
In this article we consider the frog model with drift on $\mathbb{Z}$ and investigate the behaviour of the cloud of the frogs. In particular, we show that the speed of the minimum equals the speed of a single frog and prove some properties…
We consider several problems relating to strongly-connected directed networks of identical finite-state processors that work synchronously in discrete time steps. The conceptually simplest of these is the Wake Up and Report Problem; this is…
We develop a simple and generic method to analyze randomized rumor spreading processes in fully connected networks. In contrast to all previous works, which heavily exploit the precise definition of the process under investigation, we only…
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 present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process). We consider arbitrary converging Markovian…
Random walks are a common model for exploration and discovery of complex networks. While numerous algorithms have been proposed to map out an unknown network, a complementary question arises: in a known network, which nodes and edges are…
In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…
We study the dynamics of the awakening during the night for healthy subjects and find that the wake and the sleep periods exhibit completely different behavior: the durations of wake periods are characterized by a scale-free power-law…
Topology of urban environments can be represented by means of graphs. We explore the graph representations of several compact urban patterns by random walks. The expected time of recurrence and the expected first passage time to a node…
We study a particle system with hopping (random walk) dynamics on the integer lattice $\mathbb Z^d$. The particles can exist in two states, active or inactive (sleeping); only the former can hop. The dynamics conserves the number of…
This paper develops a highly simplified model with which to analyze the phenomenon of sleep. Motivated by Crick's suggestion that sleep is the brain's way of ``taking out the trash,'' a suggestion that is supported by emerging evidence, we…
The concept of continuous-time random walks (CTRW) is a generalization of ordinary random walk models, and it is a powerful tool for investigating a broad spectrum of phenomena in natural, engineering, social and economic sciences.…
We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. At the beginning of each time…
We study an intermittent random walk on a random network of scale-free degree distribution. The walk is a combination of simple random walks of duration $t_w$ and random long-range jumps. While the time the walker needs to cover all the…