Related papers: Parsimonious Flooding in Geometric Random-Walks
A spreading process can be observed when particular information, substances, or diseases spread through a population over time in social and biological systems. It is widely believed that contact interactions among individual entities play…
Many mobile ad hoc network protocols use simple flooding, in order to adapt to changes in time varying network topology. Most of the times, a network-wide flood results in redundant packets and increases network congestion, probability of…
In this paper, we study random gossip processes in communication models that describe the peer-to-peer networking functionality included in standard smartphone operating systems. Random gossip processes spread information through the basic…
Probability models have been proposed in the literature to account for "intelligent" behavior in many contexts. In this paper, probability propagation is applied to model agent's motion in potentially complex scenarios that include goals…
We study the diffusion process through an ideal polymer network, using numerical methods. Polymers are modeled by random walks on the bonds of a two-dimensional square lattice. Molecules occupy the lattice cells and may jump to the…
We study the spread of information in finite and infinite inhomogeneous spatial random graphs. We assume that each edge has a transmission cost that is a product of an i.i.d. random variable L and a penalty factor: edges between vertices of…
A lot of previous work showed that the sectional mean first-passage time (SMFPT), i.e., the average of mean first-passage time (MFPT) for random walks to a given hub node (node with maximum degree) averaged over all starting points in…
The study proposes a modeling framework for investigating the disease dynamics with adaptive human behavior during a disease outbreak, considering the impacts of both local observations and global information. One important application…
Infectious diseases that incorporate pre-symptomatic transmission are challenging to monitor, model, predict and contain. We address this scenario by studying a variant of a stochastic susceptible-exposed-infected-recovered model on…
We study the problem of how to coordinate the actions of independent agents in a distributed system where message arrival times are unbounded, but are determined by an exponential probability distribution. Asynchronous protocols executed in…
Consider a graph where the sites are distributed in space according to a Poisson point process on $\mathbb R^n$. We study a population evolving on this network, with individuals jumping between sites with a rate which decreases…
Diffusion is modeled on the recently proposed Hanoi networks by studying the mean- square displacement of random walks with time, <r^2>~t^{2/d_w}. It is found that diffusion - the quintessential mode of transport throughout Nature -…
We study lower bounds for the problem of approximating a one dimensional distribution given (noisy) measurements of its moments. We show that there are distributions on $[-1,1]$ that cannot be approximated to accuracy $\epsilon$ in…
We introduce a model of epidemics among moving particles on any locally finite graph. At any time, each vertex is empty, occupied by a healthy particle, or occupied by an infected particle. Infected particles recover at rate $1$ and…
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the…
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…
We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…
In this paper we present analytical and random walk based solutions to diffusion in semi-permeable layered media with varying diffusivity. We propose a new random walk transit model (hybrid model) based on treating the membrane permeability…
Given a connected region in two-dimensional space where events of a certain kind occur according to a certain time-varying density, we consider the problem of setting up a network of autonomous mobile agents to detect the occurrence of…
We study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of…