engleski

Percolation Critical Behaviour of Colored Networks

Network has typically been abstracted to be a set of identical objects with identical kind of bonds in the studies of percolation on complex networks. Recently, it was shown that the colored network in which the color is an additional degree of freedom allocated to every either vertex or edge, is a more sensible representation of complex systems subject to different classes of vulnerabilities. On this poster we provide analytical and numerical evidence of a color affected mean-field critical behaviour for a class of networks. To the contrary, we also find that the critical behaviour stays topological (color independent) for networks defined with the power law degree distribution of exponent α ∈ <2, 3> ∪ <3, 4].

percolation ; phase transition on network ; color graph ; avoiding vulnerabilities

nije evidentirano