Naslov
Color-avoiding edge percolation on edge-colored network

Autori
Kadović, Andrea ; Zlatić, Vinko

Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, prošireni sažetak, znanstveni

Izvornik
CompleNet'17 : Programme with Abstracts / - , 2017, 97-97

Skup
CompleNet'17

Mjesto i datum
Dubrovnik, Hrvatska, 21.03.2017. - 24.03.2017

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
percolation ; complex network ; color graph ; avoiding vulnerabilities

Sažetak
An additional information on every network element, the color, remarkably affects not only on the network robustness, but also on the security on network. The connectivity of the vertex-colored network with color- vulnerabilities was recently described within the coloravoiding approach. In this paper we present the first result for the coloravoiding percolation of edges for the case when color is attributed to the edges, while vertices still retain their indistinguishability. Numerical find analytical calculations find results are shown for Poisson random graph in cases of uniform coloring for different number of colors find for heterogeneous coloring distribution when one or more colors are dominant. The color- avoiding percolation of colored edges on a random graphs has the same universality behaviour as in the vertex-coloring case.

Izvorni jezik
Engleski

Znanstvena područja
Fizika, Interdisciplinarne prirodne znanosti

POVEZANOST RADA