Related papers: Bond percolation on multiplex networks
We study the critical behavior of various geometrical and transport properties of percolation in 6 dimensions. By employing field theory and renormalization group methods we analyze fluctuation induced logarithmic corrections to scaling up…
Multiplex networks describe a large number of systems ranging from social networks to the brain. These multilayer structure encode information in their structure. This information can be extracted by measuring the correlations present in…
Over the past years, embedding learning on networks has shown tremendous results in link prediction tasks for complex systems, with a wide range of real-life applications. Learning a representation for each node in a knowledge graph allows…
We reveal large fluctuations in the response of real multiplex networks to random damage of nodes. These results indicate that the average response to random damage, traditionally considered in mean-field approaches to percolation, is a…
It has been recognized that many complex dynamical systems in the real world require a description in terms of multiplex networks, where a set of common, mutually connected nodes belong to distinct network layers and play a different role…
Modeling complex systems that consist of different types of objects leads to multilayer networks, where nodes in the different layers represent different kind of objects. Nodes are connected by edges, which have positive weights. A…
Percolation processes on random networks have been the subject of intense research activity over the last decades: the overall phenomenology of standard percolation on uncorrelated and unclustered topologies is well known. Still some…
Many real-world systems can be modeled as interconnected multilayer networks, namely a set of networks interacting with each other. Here we present a perturbative approach to study the properties of a general class of interconnected…
In this article, we investigate both site and bond percolation on a weighted planar stochastic lattice (WPSL) which is a multi-multifractal and whose dual is a scale-free network. The characteristic properties of percolation is that it…
Percolation on two-dimensional small-world networks has been proposed as a model for the spread of plant diseases. In this paper we give an analytic solution of this model using a combination of generating function methods and high-order…
The results of investigations of main characteristics of a one-dimensional percolation theory (percolation threshold, critical exponents of correlation radius and specific heat, and free energy) are presented for the problem of bonds and…
Complex networks display various types of percolation transitions. We show that the degree distribution and the degree-degree correlation alone are not sufficient to describe diverse percolation critical phenomena. This suggests that a…
We generalize the theory of k-core percolation on complex networks to k-core percolation on multiplex networks, where k=(k_a, k_b, ...). Multiplex networks can be defined as networks with a set of vertices but different types of edges, a,…
Percolation theory concerns the emergence of connected clusters that percolate through a networked system. Previous studies ignored the effect that a node outside the percolating cluster may actively induce its inside neighbours to exit the…
Percolation threshold of a network is the critical value such that when nodes or edges are randomly selected with probability below the value, the network is fragmented but when the probability is above the value, a giant component…
In this work, we study the percolation transition and large deviation properties of generalized canonical network ensembles. This new type of random networks might have a very rich complex structure, including high heterogeneous degree…
The bond-percolation properties of the Hanoi networks are analyzed with the renormalization group. Unlike scale-free networks, they are meant to provide an analytically tractable interpolation between finite dimensional, lattice-based…
We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant…
Bootstrap percolation is a well-known model to study the spreading of rumors, new products or innovations on social networks. The empirical studies show that community structure is ubiquitous among various social networks. Thus, studying…
Biased (degree-dependent) percolation was recently shown to provide new strategies for turning robust networks fragile and vice versa. Here we present more detailed results for biased edge percolation on scale-free networks. We assume a…