Related papers: Cumulative Merging Percolation: A long-range perco…
The one-dimensional contact process is analyzed by a cluster approximation. In this approach, the hierarchy of rate equations for the densities of finite length empty intervals are truncated under the assumption that adjacent intervals are…
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…
We investigate irreversible aggregation processes driven by a source of small mass clusters. In the spatially homogeneous situation, a well-mixed system is consists of clusters of various masses whose concentrations evolve according to an…
Recently, a hybrid percolation transitions (HPT) that exhibits both a discontinuous transition and critical behavior at the same transition point has been observed in diverse complex systems. In spite of considerable effort to develop the…
Model merging is an effective strategy to merge multiple models for enhancing model performances, and more efficient than ensemble learning as it will not introduce extra computation into inference. However, limited research explores if the…
Relationship between agents can be conveniently represented by graphs. When these relationships have different modalities, they are better modelled by multilayer graphs where each layer is associated with one modality. Such graphs arise…
In recent years, many variants of percolation have been used to study network structure and the behavior of processes spreading on networks. These include bond percolation, site percolation, $k$-core percolation, bootstrap percolation, the…
Clustering and degree correlations are ubiquitous in real-world complex networks. Yet, understanding their role in critical phenomena remains a challenge for theoretical studies. Here, we provide the exact solution of site percolation in a…
An efficient MCMC algorithm is presented to cluster the nodes of a network such that nodes with similar role in the network are clustered together. This is known as block-modelling or block-clustering. The model is the stochastic blockmodel…
How a complex network is connected crucially impacts its dynamics and function. Percolation, the transition to extensive connectedness upon gradual addition of links, was long believed to be continuous but recent numerical evidence on…
We study the percolation in coupled networks with both inner-dependency and inter-dependency links, where the inner- and inter-dependency links represent the dependencies between nodes in the same or different networks, respectively. We…
The emergence of mutual knowledge is a major cognitive mechanism for the robustness of complex socio technical systems. It has been extensively studied from an ethnomethodological point of view and empirically reproduced by multi agent…
Explosive percolation in a network is a phase transition where a large portion of nodes becomes connected with an addition of a small number of edges. Although extensively studied in random network models and reconstructed real networks,…
Percolation is one of the simplest and nicest models in probability theory/statistical mechanics which exhibits critical phenomena. Dynamical percolation is a model where a simple time dynamics is added to the (ordinary) percolation model.…
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…
Correlations are known to play a crucial role in determining the structure of complex networks. Here we study how their presence affects the computation of the percolation threshold in random hypergraphs. In order to mimic the correlation…
A simple, discrete, parametric model is proposed to describe conditional (correlated) deposition of particles on a surface and formation of a connecting (percolating) cluster. The surface changes spontaneously its properties (phase…
We propose a simple model unifying two major approaches to the analysis of large multicomponent systems: interacting particle systems (IPS) and couple map lattices (CML) and show that in the weak interaction limit depending on fine…
In this paper, we present a framework for the analysis of self-organized distributed coalition formation process for spectrum sharing in interference channel for large-scale ad hoc networks. In this approach, we use the concept of coalition…
We investigate the onset of the discontinuous percolation transition in small-world hyperbolic networks by studying the systems-size scaling of the typical largest cluster approaching the transition, $p\nearrow p_{c}$. To this end, we…