Related papers: Percolation properties of growing networks under a…
Bootstrap percolation provides an emblematic instance of phase behavior characterised by an abrupt transition with diverging critical fluctuations. This unusual hybrid situation generally occurs in particle systems in which the occupation…
We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks…
A random growth lattice filling model of percolation with touch and stop growth rule is developed and studied numerically on a two dimensional square lattice. Nucleation centers are continuously added one at a time to the empty sites and…
Multiparticle production at high energies is described in terms of color strings stretched between the projectile and target. As the string density increases, overlap in the transverse plane leads to cluster formation. At some critical…
A new site percolation model, directed spiral percolation (DSP), under both directional and rotational (spiral) constraints is studied numerically on the square lattice. The critical percolation threshold $p_c\approx 0.655$ is found between…
The percolation phase transition in complex network systems attracts much attention and has numerous applications in various research fields. Finite size effects smooth the transition and make it difficult to predict the critical point of…
We investigate the growth of connectivity in a network. In our model, starting with a set of disjoint nodes, links are added sequentially. Each link connects two nodes, and the connection rate governing this random process is proportional…
A two parameter percolation model with nucleation and growth of finite clusters is developed taking the initial seed concentration \rho and a growth parameter g as two tunable parameters. Percolation transition is determined by the final…
We study the distribution of finite clusters in slightly supercritical ($p \downarrow p_c$) Bernoulli bond percolation on transitive nonamenable graphs, proving in particular that if $G$ is a transitive nonamenable graph satisfying the…
Many interdependent, real-world infrastructures involve interconnections between different communities or cities. Here we study if and how the effects of such interconnections can be described as an external field for interdependent…
We propose a maximally disassortative (MD) network model which realizes a maximally negative degree-degree correlation, and study its percolation transition to discuss the effect of a strong degree-degree correlation on the percolation…
In this paper we study the small-world network model of Watts and Strogatz, which mimics some aspects of the structure of networks of social interactions. We argue that there is one non-trivial length-scale in the model, analogous to the…
We study the synchronization transition in scale-free networks that display power-law asymptotic behaviors in their degree distributions. The critical coupling strength and the order-parameter critical exponent derived by the mean field…
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p=n^{-alpha} and alpha=alpha(n) is bounded away from 0. We show…
We analyse the scaling of the weights added by invasion percolation on a branching process tree. This process is a paradigm model of self-organised criticality, where criticality is approach without a prespecified parameter. In this paper,…
We analyze the betweenness centrality (BC) of nodes in large complex networks. In general, the BC is increasing with connectivity as a power law with an exponent $\eta$. We find that for trees or networks with a small loop density $\eta=2$…
We introduce a general $(k,l)$ clique community, which consists of adjacent $k$-cliques sharing at least $l$ vertices with $k-1 \ge l \ge 1$. The emergence of a giant $(k,l)$ clique community indicates a $(k,l)$ clique percolation, which is…
When real networks are considered, coupled networks with connectivity and feedback-dependency links are not rare but more general. Here we develop a mathematical framework and study numerically and analytically percolation of interacting…
We simulate the two-dimensional XY model in the flow representation by a worm-type algorithm, up to linear system size $L=4096$, and study the geometric properties of the flow configurations. As the coupling strength $K$ increases, we…
We show that to correctly describe the position of the critical line in the Kauffman random boolean networks one must take into account percolation phenomena underlying the process of damage spreading. For this reason, since the issue of…