相关论文: The dispersion time of random walks on finite grap…
We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all…
In the classical model of Diffusion Limited Aggregation (DLA), introduced by Witten and Sander, the process begins with a single particle cluster placed at the origin of a space, and then, one at a time, particles make a random walk from…
We study a synchronous dispersion process in which $M$ particles are initially placed at a distinguished origin vertex of a graph $G$. At each time step, at each vertex $v$ occupied by more than one particle at the beginning of this step,…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
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…
Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a…
In the Diffusion Limited Aggregation (DLA) process on on $\mathbb{Z}^2$, or more generally $\mathbb{Z}^d$, particles aggregate to an initially occupied origin by arrivals on a random walk. The scaling limit of the result, empirically, is a…
We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. At the beginning of each time…
Internal DLA (IDLA) is an internal aggregation model in which particles perform random walks from the origin, in turn, and stop upon reaching an unoccupied site. Levine and Peres showed that, when particles start instead from fixed…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
Internal Diffusion Limited Aggregation is an interacting particle system that describes the growth of a random cluster governed by the boundary harmonic measure seen from an internal point. Our paper studies IDLA in $\mathbb{Z}^d$ driven by…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
Internal diffusion-limited aggregation (IDLA) is a stochastic growth model on a graph $G$ which describes the formation of a random set of vertices growing from the origin (some fixed vertex) of $G$. Particles start at the origin and…
We consider a cluster growth model on Z^d, called internal diffusion limited aggregation (internal DLA). In this model, random walks start at the origin, one at a time, and stop moving when reaching a site not occupied by previous walks. It…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
We consider two random walks evolving synchronously on a random out-regular graph of $n$ vertices with bounded out-degree $r\ge 2$, also known as a random Deterministic Finite Automaton (DFA). We show that, with high probability with…
We consider Activated Random Walks on arbitrary finite networks, with particles being inserted at random and absorbed at the boundary. Despite the non-reversibility of the dynamics and the lack of knowledge on the stationary distribution,…
We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we…
We examine the aggregate behavior of one-dimensional random walks in a model known as (one-dimensional) Internal Diffusion Limited Aggregation. In this model, a sequence of $n$ particles perform random walks on the integers, beginning at…
Information propagation on graphs is a fundamental topic in distributed computing. One of the simplest models of information propagation is the push protocol in which at each round each agent independently pushes the current knowledge to a…