Related papers: Percolation properties of growing networks under a…
The explosive percolation problem on the complete graph is investigated via extensive numerical simulations. We obtain the cluster-size distribution at the moment when the cluster size heterogeneity becomes maximum. The distribution is…
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…
To investigate the network-growth rule dependence of certain geometric aspects of percolation clusters, we propose a generalized network-growth rule introducing a generalized parameter $q$ and we study the time evolution of the network. The…
The percolation threshold of the network model by Barabasi and Albert (BA-model) [Science 286, 509 (1999)] has thus far only been 'guessed' based on simulations and comparison with other models. Due to the still uncertain influence of…
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 study of percolation in so-called {\em nested subgraphs} implies a generalization of the concept of percolation since the results are not linked to specific graph process. Here the behavior of such graphs at criticallity is studied for…
Percolation theory can be used to describe the structural properties of complex networks using the generating function formulation. This mapping assumes that the network is locally tree-like and does not contain short-range loops between…
Percolation, the formation of a macroscopic connected component, is a key feature in the description of complex networks. The dynamical properties of a variety of systems can be understood in terms of percolation, including the robustness…
In Achlioptas processes, starting from an empty graph, in each step two potential edges are chosen uniformly at random, and using some rule one of them is selected and added to the evolving graph. The evolution of the rescaled size of the…
Formation and fragmentation of networks is typically studied using percolation theory, but most previous research has been restricted to studying a phase transition in cluster size, examining the emergence of a giant component. This…
In this paper we study the macroscopic conduction properties of large but finite binary networks with conducting bonds. By taking a combination of a spectral and an averaging based approach we derive asymptotic formulae for the conduction…
Based on the self-consistent equations of the order parameter $P_\infty$ and the mean cluster size $S$, we develop a novel self-consistent simulation (SCS) method for arbitrary percolation on the Bethe lattice (infinite homogeneous Cayley…
Franceschetti et al. have recently shown that per-node throughput in an extended, ad hoc wireless network with $\Theta(n)$ randomly distributed nodes and multihop routing can be increased from the $\Omega({1 \over \sqrt{n} \log n})$ scaling…
Percolation is perhaps the simplest example of a process exhibiting a phase transition and one of the most studied phenomena in statistical physics. The percolation transition is continuous if sites/bonds are occupied independently with the…
Percolation is a cornerstone concept in physics, providing crucial insights into critical phenomena and phase transitions. In this study, we adopt a kinetic perspective to reveal the scaling behaviors of higher-order gaps in the largest…
We analyze critical phenomena on networks generated as the union of hidden variables models (networks with any desired degree sequence) with arbitrary graphs. The resulting networks are general small-worlds similar to those a` la Watts and…
We investigate percolation transitions in a nonlocal network model numerically. In this model, each node has an exclusive partner and a link is forbidden between two nodes whose $r$-neighbors share any exclusive pair. The $r$-neighbor of a…
We provide arguments for the property of the degree-degree correlations of giant components formed by the percolation process on uncorrelated random networks. Using the generating functions, we derive a general expression for the…
Percolation is a fundamental concept that brought new understanding on the robustness properties of complex systems. Here we consider percolation on weakly interacting networks, that is, network layers coupled together by much less…
We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…