Related papers: Minimal percolating sets for mutating infectious d…
We address the problem of computing a Minimal Dominating Set in highly dynamic distributed systems. We assume weak connectivity, i.e., the network may be disconnected at each time instant and topological changes are unpredictable. We make…
The event graph representation of temporal networks suggests that the connectivity of temporal structures can be mapped to a directed percolation problem. However, similar to percolation theory on static networks, this mapping is valid…
First passage percolation on $\mathbb{Z}^2$ is a model for describing the spread of an infection on the sites of the square lattice. The infection is spread via nearest neighbor sites and the time dynamic is specified by random passage…
We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree $k$. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks. We find that for any…
Metastability thresholds lie at the heart of bootstrap percolation theory. Yet proving precise lower bounds is notoriously hard. We show that for two of the most classical models, two-neighbour and Frob\"ose, upper bounds are sharp to…
We study the distributions of traveling length l and minimal traveling time t through two-dimensional percolation porous media characterized by long-range spatial correlations. We model the dynamics of fluid displacement by the convective…
K-core percolation is a fundamental dynamical process in complex networks with applications that span numerous real-world systems. Earlier studies focus primarily on random networks without spatial constraints and reveal intriguing…
In $r$-neighbour bootstrap percolation, vertices (sites) of a graph $G$ are infected, round-by-round, if they have $r$ neighbours already infected. Once infected, they remain infected. An initial set of infected sites is said to percolate…
The size and shape of the region affected by an outbreak is relevant to understand the dynamics of a disease and help to organize future actions to mitigate similar events. A simple extension of the SIR model is considered, where agents…
The $r$-neighbour bootstrap process on a graph $G$ begins with a set of infected vertices; subsequently, healthy vertices become infected once they have at least $r$ infected neighbours. The central extremal problem in bootstrap percolation…
We introduce a correlated static model and investigate a percolation transition. The model is a modification of the static model and is characterized by assortative degree-degree correlation. As one varies the edge density, the network…
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…
We study viral transmission in crowds via the short-ranged airborne pathway using a purely model-based approach. Our goal is two-pronged. Firstly, we illustrate with a concrete and pedagogical case study how to estimate the risks of new…
We study the temporal percolation properties of temporal networks by taking as a representative example the recently proposed activity driven network model [N. Perra et al., Sci. Rep. 2, 469 (2012)]. Building upon an analytical framework…
Contacts' temporal ordering and dynamics are crucial for understanding the transmission of infectious diseases. We introduce an interaction-driven model of an airborne disease over contact networks. We demonstrate our interaction-driven…
In this work, we study the evolution of the susceptible individuals during the spread of an epidemic modeled by the susceptible-infected-recovered (SIR) process spreading on the top of complex networks. Using an edge-based compartmental…
Percolation phenomena are pervasive in nature, ranging from capillary flow, crack propagation, ionic transport, fluid permeation, etc. Modeling percolation in highly-branched media requires the use of numerical solutions, as problems can…
We study a version of first passage percolation on $\mathbb{Z}^d$ where the random passage times on the edges are replaced by contact times represented by random closed sets on $\mathbb{R}$. Similarly to the contact process without…
We analyze a simple model of deterministic diffusion. The model consists of a one-dimensional periodic array of scatterers in which point particles move from cell to cell as defined by a piecewise linear map. The microscopic chaotic…
We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting demanded origin-destination nodes are removed if below a…