Related papers: Information Dissemination via Random Walks in d-Di…
A model for information spreading in a population of $N$ mobile agents is extended to $d$-dimensional regular lattices. This model, already studied on two-dimensional lattices, also takes into account the degeneration of information as it…
We study the dynamics of information (or virus) dissemination by $m$ mobile agents performing independent random walks on an $n$-node grid. We formulate our results in terms of two scenarios: broadcasting and gossiping. In the broadcasting…
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…
We introduce a model for information spreading among a population of N agents diffusing on a square LxL lattice, starting from an informed agent (Source). Information passing from informed to unaware agents occurs whenever the relative…
We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…
We study the information spreading yielded by the \emph{(Parsimonious) $1$-Flooding Protocol} in geometric Mobile Ad-Hoc Networks. We consider $n$ agents on a convex plane region of diameter $D$ performing independent random walks with move…
We consider the problem of spread of information among mobile agents on the torus. The agents are initially distributed as a Poisson point process on the torus, and move as independent simple random walks. Two agents can share information…
We study the problem of randomized information dissemination in networks. We compare the now standard PUSH-PULL protocol, with agent-based alternatives where information is disseminated by a collection of agents performing independent…
We investigate crossing path probabilities for two agents that move randomly in a bounded region of the plane or on a sphere (denoted $R$). At each discrete time-step the agents move, independently, fixed distances $d_1$ and $d_2$ at angles…
The patterns of motion of mobile agents has received recently wide attention in the literature. There is a number of recent studies centered around the motion behavior of many agents ranging from albatrosses to human beings. Special…
We present results for the ordered sequence of first passage times of arrival of N random walkers at a boundary in Euclidean spaces of d dimensions.
We survey recent results of normal and anomalous diffusion of two types of random motions with long memory in ${\Bbb R}^d$ or ${\Bbb Z}^d$. The first class consists of random walks on ${\Bbb Z}^d$ in divergence-free random drift field,…
Conventional distributed approaches to coverage control may suffer from lack of convergence and poor performance, due to the fact that agents have limited information, especially in non-convex discrete environments. To address this issue,…
We consider a class of self-interacting random walks in deterministic or random environments, known as excited random walks or cookie walks, on the d-dimensional integer lattice. The main purpose of this paper is two-fold: to give a survey…
Here we consider the communications tactics appropriate for a group of agents that need to "swarm" together in a highly adversarial environment. Specfically, whilst they need to cooperate by exchanging information with each other about…
We introduce the pushy random walk, where a walker can push multiple obstacles, thereby penetrating large distances in environments with finite obstacle density. This process provides a minimal model for experimentally observed interactions…
During epidemics, the population is asked to Socially Distance, with pairs of individuals keeping two meters apart. We model this as a new optimization problem by considering a team of agents placed on the nodes of a network. Their common…
We consider the dispersion problem for mobile agents. Initially, k agents are located at arbitrary nodes in an undirected graph. Agents can migrate from node to node via an edge in the graph synchronously. Our goal is to let the k agents be…
We investigate the problem of spreading information contents in a wireless ad hoc network with mechanisms embracing the peer-to-peer paradigm. In our vision, information dissemination should satisfy the following requirements: (i) it…
The spontaneous behavioral changes of the agents during an epidemic can have significant effects on the delay and the prevalence of its spread. In this work, we study a social distancing game among the agents of a population, who determine…