Related papers: Long-range competition on the torus
In complex social systems encoded as hypergraphs, higher-order (i.e., group) interactions taking place among more than two individuals are represented by hyperedges. One of the higher-order correlation structures native to hypergraphs is…
When three species compete cyclically in a well-mixed, stochastic system of $N$ individuals, extinction is known to typically occur at times scaling as the system size $N$. This happens, for example, in rock-paper-scissors games or…
We study spreading processes in temporal graphs, i. e., graphs whose connections change over time. These processes naturally model real-world phenomena such as infectious diseases or information flows. More precisely, we investigate how…
It is known that the limiting behavior of the contact process strongly depends upon the geometry of the graph on which particles evolve: while the contact process on the regular lattice exhibits only two phases, the process on homogeneous…
This paper examines the mechanisms of coherent structure interactions in spatially evolving turbulent free shear layers at different values of the velocity ratio parameter {\lambda}=$(U_1-U_2)/(U_1+U_2)$, where $U_1$ and $U_2 (\leq U_1)$…
A two-type version of the frog model on $\mathbb{Z}^d$ is formulated, where active type $i$ particles move according to lazy random walks with probability $p_i$ of jumping in each time step ($i=1,2$). Each site is independently assigned a…
The spread in time of a mutation through a population is studied analytically and computationally in fully-connected networks and on spatial lattices. The time, t_*, for a favourable mutation to dominate scales with population size N as…
Diffusion of information in networks is at the core of many problems in AI. Common examples include the spread of ideas and rumors as well as marketing campaigns. Typically, information diffuses at a non-linear rate, for example, if markets…
We study the susceptible-infected-recovered (SIR) epidemic on a random graph chosen uniformly over all graphs with certain critical, heavy-tailed degree distributions. For this model, each vertex infects all its susceptible neighbors and…
We study the spread of an infection on top of a moving population. The environment evolves as a zero range process on the integer lattice starting in equilibrium. At time zero, the set of infected particles is composed by those which are on…
We investigate a discrete-time two-strain symbiotic epidemic model on complex networks with both random and long-range interactions. Our analysis examines how the co-infection recovery rate ($\mu$), the long-range decay exponent ($\alpha$),…
We investigate the effect on survival and coexistence of introducing forest fire epidemics to a certain two-species competition model. The model is an extension of the one introduced by Durrett and Remenik [DR09], who studied a discrete…
We consider the $d$-neighbor bootstrap percolation process on the $d$-dimensional torus, with vertex set $V=\{1,\cdots,n\}^d$ and edge set $\{xy:\sum_{i=1}^d|x_i-y_i (\text{mod} \; n)|=1\}$. We determine the percolation time up to a…
Source detection (SD) is the task of finding the origin of a spreading process in a network. Algorithms for SD help us combat diseases, misinformation, pollution, and more, and have been studied by physicians, physicists, sociologists, and…
We study how the spread of computer viruses, worms, and other self-replicating malware is affected by the logical topology of the network over which they propagate. We consider a model in which each host can be in one of 3 possible states -…
We study the problem of parameter estimation based on infection data from an epidemic outbreak on a graph. We assume that successive infections occur via contagion; i.e., transmissions can only spread across existing directed edges in the…
Suppose that a cascade (e.g., an epidemic) spreads on an unknown graph, and only the infection times of vertices are observed. What can be learned about the graph from the infection times caused by multiple distinct cascades? Most of the…
The epidemic process on a graph is considered for which infectious contacts occur at rate which depends on whether a susceptible is infected for the first time or not. We show that the Vasershtein coupling extends if and only if secondary…
We consider a model in which agents of different species move over a complex network, are subject to reproduction and compete for resources. The complementary roles of competition and diffusion produce a variety of fixed points, whose…
We study the susceptible-infective-recovered (SIR) epidemic on a random graph chosen uniformly subject to having given vertex degrees. In this model infective vertices infect each of their susceptible neighbours, and recover, at a constant…