Related papers: Parsimonious Flooding in Geometric Random-Walks
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 the random walk Metropolis algorithm on $\mathbb{R}^n$ with Gaussian proposals, and when the target probability measure is the $n$-fold product of a one-dimensional law. In the limit $n\to\infty$, it is well known (see [Ann.…
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 study the enhanced diffusivity in the so called elephant random walk model with stops (ERWS) by including symmetric random walk steps at small probability $\epsilon$. At any $\epsilon > 0$, the large time behavior transitions from…
This paper studies a discrete-time time-varying multi-layer networked SIWS (susceptible-infected-water-susceptible) model with multiple resources under both single-virus and competing multi-virus settings. Besides the human-to-human…
A high fidelity model for the propagation of pathogens via aerosols in the presence of moving pedestrians is proposed. The key idea is the tight coupling of computational fluid dynamics and computational crowd dynamics in order to capture…
The asynchronous push&pull protocol, a randomized distributed algorithm for spreading a rumour in a graph $G$, works as follows. Independent Poisson clocks of rate 1 are associated with the vertices of $G$. Initially, one vertex of $G$…
Radio networks are a long-studied model for distributed system of devices which communicate wirelessly. When these devices are mobile or have limited capabilities, the system is often best modeled by the ad-hoc variant, in which the devices…
Randomized rumor spreading is a classical protocol to disseminate information across a network. At SODA 2008, a quasirandom version of this protocol was proposed and competitive bounds for its run-time were proven. This prompts the…
We consider a diffusing particle, with diffusion constant D', moving in one dimension in an infinite sea of noninteracting mobile traps with diffusion constant D and density rho. We show that the asymptotic behavior of the survival…
In this paper we study the asymptotic behavior of the Random-Walk Metropolis algorithm on probability densities with two different `scales', where most of the probability mass is distributed along certain key directions with the…
We study the graph-theoretic properties of the trace of random walks on pseudorandom graphs. We show that for any $\varepsilon>0$, there exists a constant $C$ such that the cover time of an $(n,d,\lambda)$-graph $G$ with $d/\lambda\ge C$ is…
A deterministic pathogen transmission model based on high-fidelity physics has been developed. The model combines computational fluid dynamics and computational crowd dynamics in order to be able to provide accurate tracing of viral matter…
Information, ideas, and diseases, or more generally, contagions, spread over space and time through individual transmissions via social networks, as well as through external sources. A detailed picture of any diffusion process can be…
Recent experiments show that both natural and artificial microswimmers in narrow channel-like geometries will self-organise to form steady, directed flows. This suggests that networks of flowing active matter could function as novel…
Self-avoidance is a common mechanism to improve the efficiency of a random walker for covering a spatial domain. However, how this efficiency decreases when self-avoidance is impaired or limited by other processes has remained largely…
We consider a random walk in random environment in the low disorder regime on $\mathbb Z^d$. That is, the probability that the random walk jumps from a site $x$ to a nearest neighboring site $x+e$ is given by $p(e)+\epsilon \xi(x,e)$, where…
Aldous [(2007) Preprint] defined a gossip process in which space is a discrete $N\times N$ torus, and the state of the process at time $t$ is the set of individuals who know the information. Information spreads from a site to its nearest…
The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity…
Maximization of the entropy rate is an important issue to design diffusion processes aiming at a well-mixed state. We demonstrate that it is possible to construct maximal-entropy random walks with only local information on the graph…