Related papers: The winner takes it all but one
Investigating the emergence of a particular cell type is a recurring theme in models of growing cellular populations. The evolution of resistance to therapy is a classic example. Common questions are: when does the cell type first occur,…
We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…
The one-dimensional nearest-neighbor totally asymmetric simple exclusion process can be constructed in the same space as a last-passage percolation model in Z^2. We show that the trajectory of a second class particle in the exclusion…
Background: Recently developed techniques to study the spread of infectious diseases through networks make assumptions that the initial proportion infected is infinitesimal and the population behavior is static throughout the epidemic. The…
We study first-passage percolation where edges in the left and right half-planes are assigned values according to different distributions. We show that the asymptotic growth of the resulting inhomogeneous first-passage process obeys a shape…
The spread of an infectious disease can, in some cases, promote the propagation of other pathogens favouring violent outbreaks, which cause a discontinuous transition to an endemic state. The topology of the contact network plays a crucial…
Bootstrap percolation is a type of cellular automaton which has been used to model various physical phenomena, such as ferromagnetism. For each natural number $r$, the $r$-neighbour bootstrap process is an update rule for vertices of a…
We study the accessibility percolation model on infinite trees. The model is defined by associating an absolute continuous random variable $X_v$ to each vertex $v$ of the tree. The main question to be considered is the existence or not of…
We study a simple case of the susceptible-weakened-infected-removed model in regular random graphs in a situation where an epidemic starts from a finite fraction of initially infected nodes (seeds). Previous studies have shown that,…
We investigate the long-time behavior of the survival probability of a tagged particle in a single-file diffusion in a finite interval. The boundary conditions are of two types: 1) one boundary is absorbing the second is reflecting, 2) both…
We investigate the expected time to extinction in the susceptible-infectious-susceptible (SIS) model of disease spreading. Rather than using stochastic simulations, or asymptotic calculations in network models, we solve the extinction time…
We propose and unify classes of different models for information propagation over graphs. In a first class, propagation is modelled as a wave which emanates from a set of \emph{known} nodes at an initial time, to all other \emph{unknown}…
Diseases emerge, persist and vanish in an ongoing battle for available hosts. Hosts, on the other hand, defend themselves by developing immunity that limits the ability of pathogens to reinfect them. We here explore a multi-disease system…
In the last decades, many authors have used the susceptible-infected-recovered model to study the impact of the disease spreading on the evolution of the infected individuals. However, few authors focused on the temporal unfolding of the…
We propose a new model that describes the dynamics of epidemic spreading on connected graphs. Our model consists in a PDE-ODE system where at each vertex of the graph we have a standard SIR model and connexions between vertices are given by…
We determine the asymptotic speed of the first-passage percolation process on some ladder-like graphs (or width-2 stretches) when the times associated with different edges are independent and exponentially distributed but not necessarily…
We study a problem on edge percolation on product graphs $G\times K_2$. Here $G$ is any finite graph and $K_2$ consists of two vertices $\{0,1\}$ connected by an edge. Every edge in $G\times K_2$ is present with probability $p$ independent…
We study the activation process in undirected graphs known as bootstrap percolation: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it had at least r active neighbors, for a threshold r…
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent…
We introduce and study a non-oriented first passage percolation model having a property of statistical invariance by time reversal. This model is defined in a graph having directed edges and the passage times associated with each set of…