Related papers: Branching process and homogeneization for epidemic…
We study a multi-type SIR epidemic process among a heterogeneous population that interacts through a network. When we base social contact on a random graph with given vertex degrees, we give limit theorems on the fraction of infected…
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 consider a one-dimensional diffusion process with coefficients that are periodic outside of a finite 'interface region'. The question investigated in this article is the limiting long time / large scale behaviour of such a process under…
We prove limit theorems for systems of interacting diffusions on sparse graphs. For example, we deduce a hydrodynamic limit and the propagation of chaos property for the stochastic Kuramoto model with interactions determined by…
Infectious pathogens often propagate by superspreading, which focusses onward transmission on disproportionately few infected individuals. At the same time, infector-infectee pairs tend to have more similar transmission potentials than…
We consider branching particle processes on discrete structures like the hypercube in a random fitness landscape (i.e., random branching/killing rates). The main question is about the location where the main part of the population sits at a…
In order to model random density-dependence in population dynamics, we construct the random analogue of the well-known logistic process in the branching process' framework. This density-dependence corresponds to intraspecific competition…
A random geometric graph $G(\mathcal{X}_n, r_n)$ is formed by taking a binomial process $\mathcal{X}_n$ as the set of vertices and joining any two distinct points with an edge if they lie within distance $r_n$ of each other. We investigate…
A new non-conservative stochastic reaction-diffusion system in which two families of random walks in two adjacent domains interact near the interface is introduced and studied in this paper. Such a system can be used to model the transport…
We study the network reconstruction problem for an epidemic reaction-diffusion. These models are an extension of deterministic, compartmental models to a graph setting, where the reactions within the nodes are coupled by a diffusion. We…
Finding the most powerful node in a dynamic random network, the largest set in a partition-valued stochastic process, or the largest family in an evolving population at a given time, can be a very difficult problem. This is particularly the…
We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…
Among the statistical tools for online information diffusion modeling, both epidemic models and Hawkes point processes are popular choices. The former originate from epidemiology, and consider information as a viral contagion which spreads…
We study propagation of avalanches in a certain excitable network. The model is a particular case of the one introduced in [23], and is mathematically equivalent to an endemic variation of the Reed-Frost epidemic model introduced in [27].…
A discrete time branching process where the offspring distribution is generation-dependent, and the number of reproductive individuals is controlled by a random mechanism is considered. This model is a Markov chain but, in general, the…
The time evolution of spatial fluctuations in inhomogeneous d-dimensional biological systems is analyzed. A single species continuous growth model, in which the population disperses via diffusion and convection is considered.…
We propose a model for epidemic spreading on a finite complex network with a restriction to at most one contamination per time step. Because of a highly discrete character of the process, the analysis cannot use the continous approximation,…
Reaction-diffusion processes can be adopted to model a large number of dynamics on complex networks, such as transport processes or epidemic outbreaks. In most cases, however, they have been studied from a fermionic perspective, in which…
Burstiness, the tendency of interaction events to be heterogeneously distributed in time, is critical to information diffusion in physical and social systems. However, an analytical framework capturing the effect of burstiness on generic…
Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…