Related papers: Percolation in heterogeneous spatial networks with…
Robustness of two coupled networks system has been studied only for dependency coupling (S. Buldyrev et. al., Nature, 2010) and only for connectivity coupling (E. A. Leicht and R. M. D'Souza, arxiv:09070894). Here we study, using a…
Message passing, also known as belief propagation, is a versatile framework for analyzing models defined on graphs. Its most prototypical application is percolation; yet, the interpretation of the message passing formulation of percolation…
We consider propagation models that describe the spreading of an attribute, called "damage", through the nodes of a random network. In some systems, the average fraction of nodes that remain undamaged vanishes in the large system limit, a…
We introduce a model for dynamic networks, where the links or the strengths of the links change over time. We solve the model by mapping dynamic networks to the problem of directed percolation, where the direction corresponds to the…
The combination of the compactness of networks, featuring small diameters, and their complex architectures results in a variety of critical effects dramatically different from those in cooperative systems on lattices. In the last few years,…
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…
Percolation theory has been widely used to study phase transitions in complex networked systems. It has also successfully explained several macroscopic phenomena across different fields. Yet, the existent theoretical framework for…
Recently it has been demonstrated that the connectivity transition from microscopic connectivity to macroscopic connectedness, known as percolation, is generically announced by a cascade of microtransitions of the percolation order…
We study the percolation properties of the growing clusters model. In this model, a number of seeds placed on random locations on a lattice are allowed to grow with a constant velocity to form clusters. When two or more clusters eventually…
Understanding how network structure constrains and enables information processing is a central problem in the statistical mechanics of interacting systems. Here we study random networks across the structural percolation transition and…
This review article gives an overview of recent progress in the field of non-equilibrium phase transitions into absorbing states with long-range interactions. It focuses on two possible types of long-range interactions. The first one is to…
In a recent Letter, Yang et al. [Phys. Rev. Lett. 109, 258701 (2012)] introduced the concept of observability transitions: the percolation-like emergence of a macroscopic observable component in graphs in which the state of a fraction of…
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…
Triadic interactions are higher-order interactions that occur when a set of nodes affects the interaction between two other nodes. Examples of triadic interactions are present in the brain when glia modulate the synaptic signals among…
Recently, new results on percolation of interdependent networks have shown that the percolation transition can be first order. In this paper we show that, when considering antagonistic interactions between interacting networks, the…
Percolation theory is extensively studied in statistical physics and mathematics with applications in diverse fields. However, the research is focused on systems with only one type of links, connectivity links. We review a recently…
In real networks, the dependency between nodes is ubiquitous; however, the dependency is not always complete and homogeneous. In this paper, we propose a percolation model with weak and heterogeneous dependency; i.e., dependency strengths…
We review the recent fast progress in statistical physics of evolving networks. Interest has focused mainly on the structural properties of random complex networks in communications, biology, social sciences and economics. A number of giant…
We study the problem of the existence of a giant component in a random multipartite graph. We consider a random multipartite graph with $p$ parts generated according to a given degree sequence $n_i^{\mathbf{d}}(n)$ which denotes the number…
We present a simple model of network growth and solve it by writing down the dynamic equations for its macroscopic characteristics like the degree distribution and degree correlations. This allows us to study carefully the percolation…