Related papers: Continuous first-passage percolation and continuou…
We pursue the study of a random coloring first passage percolation model introduced by Fontes and Newman. We prove that the asymptotic shape of this first passage percolation model continuously depends on the law of the coloring. The proof…
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.…
A large and sparse random graph with independent exponentially distributed link weights can be used to model the propagation of messages or diseases in a network with an unknown connectivity structure. In this article we study an extended…
We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…
Consider a stochastic growth model on $\mathbb{Z} ^d$. Start with some active particle at the origin and sleeping particles elsewhere. The initial number of particles at $x \in \mathbb{Z} ^d$ is $\eta(x)$, where $\eta (x)$ are independent…
We study a large family of competing spatial growth models. In these the vertices in Z^d can take on three possible states {0,1,2}. Vertices in states 1 and 2 remain in their states forever, while vertices in state 0 which are adjacent to a…
Chase-escape percolation is a variation of the standard epidemic spread models. In this model, each site can be in one of three states: unoccupied, occupied by a single prey, or occupied by a single predator. Prey particles spread to…
We study a geometric version of first-passage percolation on the complete graph, known as long-range first-passage percolation. Here, the vertices of the complete graph $\mathcal K_n$ are embedded in the $d$-dimensional torus $\mathbb…
First-passage percolation is the study of the metric space $(\mathbb{Z}^d,T)$, where $T$ is a random metric defined as the weighted graph metric using random edge-weights $(t_e)_{e\in \mathcal{E}^d}$ assigned to the nearest-neighbor edges…
We propose a unifying theoretical framework for the analysis of first-passage time distributions in two important classes of stochastic processes in which the diffusivity of a particle evolves randomly in time. In the first class of…
We consider growing spheres seeded by random injection in time and space. Growth stops when two spheres meet leading eventually to a jammed state. We study the statistics of growth limited by packing theoretically in d dimensions and via…
We have characterized the scaling behavior of the first-passage percolation (FPP) model on two types of discrete networks, the regular square lattice and the disordered Delaunay lattice, thereby addressing the effect of the underlying…
Consider first passage percolation on $\mathbb{Z}^d$ with passage times given by i.i.d. random variables with common distribution $F$. Let $t_\pi(u,v)$ be the time from $u$ to $v$ for a path $\pi$ and $t(u,v)$ the minimal time among all…
As a first step in the first passage problem for passive tracer in stratified porous media, we consider the case of a two-dimensional system consisting of two layers with different convection velocities. Using a lattice generating function…
We consider a stochastic model, describing the growth of two competing infections on $\mathbb{R}^d$. The growth takes place by way of spherical outbursts in the infected region, an outburst in the type 1 (2) infected region causing all…
We introduce perhaps the simplest models of graph evolution with choice that demonstrate discontinuous percolation transitions and can be analyzed via mathematical evolution equations. These models are local, in the sense that at each step…
We study a discrete time self interacting random process on graphs, which we call Greedy Random Walk. The walker is located initially at some vertex. As time evolves, each vertex maintains the set of adjacent edges touching it that have not…
We study a natural growth process with competition, which was recently introduced to analyze MDLA, a challenging model for the growth of an aggregate by diffusing particles. The growth process consists of two first-passage percolation…
Recently a general growth curve including the well known growth equations, such as Malthus, logistic, Bertallanfy, Gompertz, has been studied. We now propose two stochastic formulations of this growth equation. They are obtained starting…
We introduce and study a class of abstract continuous action minimization problems that generalize continuous first and last passage percolation. In this class of models a limit shape exists. Our main result provides a framework under which…