Related papers: Chase-escape on the configuration model
Consider non-intersecting Brownian motions on the real line, starting from the origin at t=0, with a number of particles forced to reach p distinct target points at time t=1. This work shows that the transition probability, that is the…
We study the macroscopic geometry of first-passage competition on the integer lattice $Z^d$, with a particular interest in describing the behavior when one species initially occupies the exterior of a cone. First-passage competition is a…
One model of real-life spreading processes is First Passage Percolation (also called SI model) on random graphs. Social interactions often follow bursty patterns, which are usually modelled with i.i.d.~heavy-tailed passage times on edges.…
In this article we define and study a stochastic process on Galoisian covers of compact manifolds. The successive positions of the process are defined recursively by picking a point uniformly in the Dirichlet domain of the previous one. We…
We study the distribution of the 'gap time', the first time that a large gap appears, in the spatial birth and death point process on $[0,1]$ in which particles are added uniformly in space at rate $\lambda$ and are removed independently at…
In this paper, we derive an approximation for throughput of TCP Compound connections under random losses. Throughput expressions for TCP Compound under a deterministic loss model exist in the literature. These are obtained assuming the…
Traffic breakdown, as one of the most puzzling traffic flow phenomena, is characterized by sharply decreasing speed, abruptly increasing density and in particular suddenly plummeting capacity. In order to clarify its root mechanisms and…
We consider two-player combinatorial games in which the graph of positions is random and perhaps infinite, focusing on directed Galton-Watson trees. As the offspring distribution is varied, a game can undergo a phase transition, in which…
First passage percolation with recovery is a process aimed at modeling the spread of epidemics. On a graph $G$ place a red particle at a reference vertex $o$ and colorless particles (seeds) at all other vertices. The red particle starts…
We study the position distribution $P(\vec{R},N)$ of a run-and-tumble particle (RTP) in arbitrary dimension $d$, after $N$ runs. We assume that the constant speed $v>0$ of the particle during each running phase is independently drawn from a…
We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random graph becomes critical. The phase…
We prove a Large Deviation Principle for {\color{blue} jump-Markov } Processes on sparse large disordered network with disordered connectivity. The network is embedded in a geometric space, with the probability of a connection a (scaled)…
We study a lattice gas of persistent walkers, in which each site is occupied by at most one particle and the direction each particle attempts to move to depends on its last step. We analyse the mean squared displacement (MSD) of the…
We consider the number of edge crossings in a random graph drawing generated by projecting a random geometric graph on some compact convex set $W\subset \mathbb{R}^d$, $d\geq 3$, onto a plane. The positions of these crossings form the…
We consider a two-type oriented competition model on the first quadrant of the two-dimensional integer lattice. Each vertex of the space may contain only one particle of either Red type or Blue type. A vertex flips to the color of a…
The mixer chain on a graph G is the following Markov chain. Place tiles on the vertices of G, each tile labeled by its corresponding vertex. A "mixer" moves randomly on the graph, at each step either moving to a randomly chosen neighbor, or…
We consider a pursuit-evasion game [11] played between two agents, 'Blue' (the pursuer) and 'Red' (the evader), over $T$ time steps. Red aims to attack Blue's territory. Blue's objective is to intercept Red by time $T$ and thereby limit the…
We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such walk by studying the phase diagram…
We study the random loop model with crosses and bars on sparse random graphs. Our main objective is to prove the existence of macroscopic loops, in the sense that a loop visits a positive proportion of the vertices. We develop a…
We consider a branching random walk initiated by a single particle at location 0 in which particles alternately reproduce according to the law of a Galton-Watson process and disperse according to the law of a driftless random walk on the…