Related papers: Flooding in weighted sparse random graphs of activ…
Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…
The traditional node percolation map of directed networks is reanalyzed in terms of edges. In the percolated phase, edges can mainly organize into five distinct giant connected components, interfaces bridging the communication of nodes in…
We study the problem of wireless network resilience to node failures from a percolation-based perspective. In practical wireless networks, it is often the case that the failure probability of a node depends on its degree (number of…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
Experimental two-phase invasion percolation flow patterns were observed in hydrophobic micro-porous networks designed to model fuel cell specific porous media. In order to mimic the operational conditions encountered in the porous…
In many real network systems, nodes usually cooperate with each other and form groups, in order to enhance their robustness to risks. This motivates us to study a new type of percolation, group percolation, in interdependent networks under…
A model is presented for the gravity-driven flow of rainwater descending through the soil layer of a green roof, treated as a porous medium on a flat permeable surface representing an efficient drainage layer. A fully saturated zone is…
In this paper we study first-passage percolation in the configuration model with empirical degree distribution that follows a power-law with exponent $\tau \in (2,3)$. We assign independent and identically distributed (i.i.d.)\ weights to…
Consider that $u_0$ nodes are aware of some piece of data $d_0$. This note derives the expected time required for the data $d_0$ to be disseminated through-out a network of $n$ nodes, when communication between nodes evolves according to a…
A basic model of a dynamical distribution network is considered, modeled as a directed graph with storage variables corresponding to every vertex and flow inputs corresponding to every edge, subject to unknown but constant inflows and…
Flow through passive porous media is typically described in terms of a linear theory relating current fluxes and driving forces, in the presence of a prescribed heterogeneous permeability. However, many porous systems such as glacial…
To study gap acceptance behaviour one needs the distribution (or probability density function) of gaps in the opposing stream. Further, in these times of widespread availability of large computing powers, traffic simulation has emerged as a…
Markovian evolving graphs are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network…
Spreading processes on top of active dynamics provide a novel theoretical framework for capturing emerging collective behavior in living systems. I consider run-and-tumble dynamics coupled with coagulation/decoagulation reactions that lead…
We study the phenomenon of information propagation on mobile geometric scale-free random graphs, where vertices instantaneously pass on information to all other vertices in the same connected component. The graphs we consider are…
In 1999, Zhang proved that, for first passage percolation on the square lattice $\mathbb{Z}^2$ with i.i.d. non-negative edge weights, if the probability that the passage time distribution of an edge $P(t_e = 0) =1/2 $, the critical value…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. We consider the the path-loss plus fading model of wireless signal…
We make the first steps towards generalizing the theory of stochastic block models, in the sparse regime, towards a model where the discrete community structure is replaced by an underlying geometry. We consider a geometric random graph…
Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds…
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…