Related papers: Information Dissemination via Random Walks in d-Di…
We establish recurrence criteria for sums of independent random variables which take values in Euclidean lattices of varying dimension. In particular, we describe transient inhomogenous random walks in the plane which interlace two…
We study a simple model of a random walker in d dimensions moving in the presence of a local heterogeneous attracting factor expressed in terms of an assigned space-dependent "attractiveness function", a situation frequently encountered in…
We consider the general problem of geometric task allocation, wherein a large, decentralised swarm of simple mobile agents must detect the locations of tasks in the plane and position themselves nearby. The tasks are represented by an a…
Motivated by applications in intelligent highway systems, the paper studies the problem of guiding mobile agents in a one-dimensional formation to their desired relative positions. Only coarse information is used which is communicated from…
The analysis of contagion-diffusion processes in metapopulations is a powerful theoretical tool to study how mobility influences the spread of communicable diseases. Nevertheless, many metapopulation approaches use indistinguishable agents…
Coined quantum walks may be interpreted as the motion in position space of a quantum particle with a spin degree of freedom; the dynamics are determined by iterating a unitary transformation which is the product of a spin transformation and…
We evaluate the limit distribution of the maximal excursion of a random walk in any dimension for homogeneous environments and for self-similar supports under the assumption of spherical symmetry. This distribution is obtained in closed…
The paper investigates efficient distributed computation in dynamic networks in which the network topology changes (arbitrarily) from round to round. Our first contribution is a rigorous framework for design and analysis of distributed…
We consider a d-dimensional random quantum walk with site-dependent random coin operators. The corresponding transition coefficients are characterized by deterministic amplitudes times independent identically distributed site-dependent…
A L\'evy random medium, in a given space, is a random point process where the distances between points, a.k.a. targets, are long-tailed. Random walks visiting the targets of a L\'evy random medium have been used to model many (physical,…
Most spreading processes require spatial proximity between agents. The stationary state of spreading dynamics in a population of mobile agents thus depends on the interplay between the time and length scales involved in the epidemic process…
We consider information diffusion on Web-like networks and how random walks can simulate it. A well-studied problem in this domain is Partial Cover Time, i.e., the calculation of the expected number of steps a random walker needs to visit a…
Consider $N$ points randomly distributed along a line segment of unitary length. A walker explores this disordered medium moving according to a partially self-avoiding deterministic walk. The walker, with memory $\mu$, leaves from the…
Physical social encounters are governed by a set of socio-psychological behavioral rules with a high degree of uniform validity. Past research has shown how these rules or the resulting properties of the encounters (e.g. the geometry of…
We prove limit theorems for random walks with $n$ steps in the $d$-dimensional Euclidean space as both $n$ and $d$ tend to infinity. One of our results states that the path of such a random walk, viewed as a compact subset of the…
We study the problem of an agent continuously faced with the decision of placing or not placing trust in an institution. The agent makes use of Bayesian learning in order to estimate the institution's true trustworthiness and makes the…
Using random walk simulations we explore diffusive transport through monodisperse sphere packings over a range of packing fractions, $\phi$, in the vicinity of the jamming transition at $\phi_{c}$. Various diffusion properties are computed…
We investigate the time averaged squared displacement (TASD) of continuous time random walks with respect to the number of steps $N$, which the random walker performed during the data acquisition time $T$. We prove that the TASD, and as…
We consider a discrete time biased random walk conditioned to avoid Bernoulli obstacles on ${\mathbb Z}^d$ ($d\geq 2$) up to time $N$. This model is known to undergo a phase transition: for a large bias, the walk is ballistic whereas for a…
This paper proposes a new architecture for multi-agent systems to cover an unknowingly distributed fast, safely, and decentralizedly. The inter-agent communication is organized by a directed graph with fixed topology, and we model agent…