Related papers: Parsimonious Flooding in Geometric Random-Walks
This thesis investigates critical phenomena and equilibrium states in various stochastic models through three interconnected studies. In the first chapter, we analyze the Activated Random Walk model on a one-dimensional ring in the…
This paper investigates the formation control problem of heterogeneous, autonomous agents that communicate over a wireless multiple access channel. Instead of avoiding interference through orthogonal node-to-node transmissions, we exploit…
Consider a random medium consisting of points randomly distributed so that there is no correlation among the distances. This is the random link model, which is the high dimensionality limit (mean field approximation) for the euclidean…
Randomized rumor spreading processes diffuse information on an undirected graph and have been widely studied. In this work, we present a generic framework for analyzing a broad class of such processes on regular graphs. Our analysis is…
We study a family of discrete-time random-walk models. The starting point is a fixed generalized transfer operator $R$ subject to a set of axioms, and a given endomorphism in a compact Hausdorff space $X$. Our setup includes a host of…
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…
The propagation of an initially localized perturbation via an interacting many-particle Hamiltonian dynamics is investigated. We argue that the propagation of the perturbation can be captured by the use of a continuous-time random walk…
It is recognised now that a variety of real-life phenomena ranging from diffuson of cold atoms to motion of humans exhibit dispersal faster than normal diffusion. L\'evy walks is a model that excelled in describing such superdiffusive…
Much ethical evaluation treats actions dyadically: one agent acts on one recipient. In networked, platform-mediated environments, this lens misses how public acts diffuse. We introduce a minimal message-passing model in which an initiating…
We consider the following interacting particle system: There is a ``gas'' of particles, each of which performs a continuous-time simple random walk on $\mathbb{Z}^d$, with jump rate $D_A$. These particles are called $A$-particles and move…
In this paper, we design a greedy routing on networks of mobile agents. In the greedy routing algorithm, every time step a packet in agent $i$ is delivered to the agent $j$ whose distance from the destination is shortest among searched…
Two mobile agents, starting from different nodes of a network modeled as a graph, and woken up at possibly different times, have to meet at the same node. This problem is known as rendezvous. We consider deterministic distributed rendezvous…
The Aldous gossip process represents the dissemination of information in geographical space as a process of locally deterministic spread, augmented by random long range transmissions. Starting from a single initially informed individual,…
One of the major issues in the theoretical modeling of epidemic spreading is the development of methods to control the transmission of an infectious agent. Human behavior plays a fundamental role in the spreading dynamics and can be used to…
We model the transmission of information of a message on the Erd\"os-R\'eny random graph with parameters $(n,p)$ and limited resources. The vertices of the graph represent servers that may broadcast a message at random. Each server has a…
Suppose we are given finitely generated groups $\Gamma_1,...,\Gamma_m$ equipped with irreducible random walks. Thereby we assume that the expansions of the corresponding Green functions at their radii of convergence contain only logarithmic…
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…
We study spreading processes in two-dimensional systems of heterogeneous active agents that exhibit different individual active speeds. We obtain, combining kinetic and complex network theory, an analytical expression for the spreading…
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…
Ubiquitous sensing devices frequently disseminate data among them. The use of a distributed event-based system that decouples publishers from subscribers arises as an ideal candidate to implement the dissemination process. In this paper, we…