Related papers: Limit Laws for Critical Dispersion on Complete Gra…

For parameters $n,\delta,B,$ and $C$, let $X=(X_{k\ell})$ be the random uniform contingency table whose first $\lfloor n^{\delta} \rfloor $ rows and columns have margin $\lfloor BCn \rfloor$ and the last $n$ rows and columns have margin…

A temporal graph $G$ is a sequence $(G_t)_{t \in I}$ of graphs on the same vertex set of size $n$. The \emph{temporal exploration problem} asks for the length of the shortest sequence of vertices that starts at a given vertex, visits every…

In this work we study a branching particle system of diffusion processes on the real line interacting through their rank in the system. Namely, each particle follows an independent Brownian motion, but only K $\ge$ 1 particles on the far…

We give a general existence and convergence result for interacting particle systems on locally finite graphs with possibly unbounded degrees or jump rates. We allow the local state space to be Polish, and the jumps at a site to affect the…

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 consider a critical continuous-time branching process (a Yule process) in which the individuals independently execute symmetric $\alpha-$stable random motions on the real line starting at their birth points. Because the branching process…

The theory of rapid mixing random walks plays a fundamental role in the study of modern randomised algorithms. Usually, the mixing time is measured with respect to the worst initial position. It is well known that the presence of…

We study the Fleming-Viot particle process formed by N interacting continuous-time asymmetric random walks on the cycle graph, with uniform killing. We show that this model has a remarkable exact solvability, despite the fact that it is…

We consider first-passage percolation on the edges of $\mathbb{Z}^2 \times k,$ namely the slab of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $1-p_c(\mathbb{S}_k)$) or 1 ((with probability…

The dispersion problem on graphs requires $k$ robots placed arbitrarily at the $n$ nodes of an anonymous graph, where $k \leq n$, to coordinate with each other to reach a final configuration in which each robot is at a distinct node of the…

We consider diffusion-limited annihilating systems with mobile $A$-particles and stationary $B$-particles placed throughout a graph. Mutual annihilation occurs whenever an $A$-particle meets a $B$-particle. Such systems, when ran in…

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…

Consider the random graph on $n$ vertices $1, ..., n$. Each vertex $i$ is assigned a type $X_i$ with $X_1, ..., X_n$ being independent identically distributed as a nonnegative discrete random variable $X$. We assume that ${\bf E}…

We study the probabilistic zero forcing process, a probabilistic variant of the classical zero forcing process. We show that for every connected graph $G$ on $n$ vertices, there exists an initial set consisting of a single vertex such that…

We consider the simple exclusion process in the integer segment $ [1, N]$ with $k\le N/2$ particles and spatially inhomogenous jumping rates. A particle at site $x\in [ 1, N]$ jumps to site $x-1$ (if $x\ge 2$) at rate $1-\omega_x$ and to…

We prove a Central Limit Theorem for the proportion of infected individuals for an epidemic model by dealing with a discrete time system of simple random walks on a complete graph with n vertices. Each random walk makes a role of a virus.…

In the averaging process on a graph $G = (V, E)$, a random mass distribution $\eta$ on $V$ is repeatedly updated via transformations of the form $\eta_{v}, \eta_{w} \mapsto (\eta_{v} + \eta_{w})/2$, with updates made according to…

The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…

In the simplest model of single-file diffusion, $N$ point particles wander on a segment of the $x$ axis of length $L$, with hard core interactions, which prevent passing, and with overdamped Brownian dynamics, $\lambda\dot{x}=\eta(t)$,…

We study the SIR epidemic model with infections carried by $k$ particles making independent random walks on a random regular graph. Here we assume $k\leq n^{\epsilon}$, where $n$ is the number of vertices in the random graph, and $\epsilon$…