From Color-Avoiding to Color-Favored Percolation in Diluted Lattices
We study the problem of color-avoiding and color-favored percolation in a network, i.e., the problem of finding a path that avoids a certain number of colors, associated with vulnerabilities of nodes or links, or is attracted by them. We investigate here regular (mainly directed) lattices with a fra...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-08-01
|
| Series: | Future Internet |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-5903/12/8/139 |
| _version_ | 1797557199014199296 |
|---|---|
| author | Michele Giusfredi Franco Bagnoli |
| author_facet | Michele Giusfredi Franco Bagnoli |
| author_sort | Michele Giusfredi |
| collection | DOAJ |
| description | We study the problem of color-avoiding and color-favored percolation in a network, i.e., the problem of finding a path that avoids a certain number of colors, associated with vulnerabilities of nodes or links, or is attracted by them. We investigate here regular (mainly directed) lattices with a fractions of links removed (hence the term “diluted”). We show that this problem can be formulated as a self-organized critical problem, in which the asymptotic phase space can be obtained in one simulation. The method is particularly effective for certain “convex” formulations, but can be extended to arbitrary problems using multi-bit coding. We obtain the phase diagram for some problem related to color-avoiding percolation on directed models. We also show that the interference among colors induces a paradoxical effect in which color-favored percolation is permitted where standard percolation for a single color is impossible. |
| first_indexed | 2024-03-10T17:13:59Z |
| format | Article |
| id | doaj.art-3f915c4100c842c683398e5d066f951e |
| institution | Directory Open Access Journal |
| issn | 1999-5903 |
| language | English |
| last_indexed | 2024-03-10T17:13:59Z |
| publishDate | 2020-08-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Future Internet |
| spelling | doaj.art-3f915c4100c842c683398e5d066f951e2023-11-20T10:33:47ZengMDPI AGFuture Internet1999-59032020-08-0112813910.3390/fi12080139From Color-Avoiding to Color-Favored Percolation in Diluted LatticesMichele Giusfredi0Franco Bagnoli1Department of Physics and Astronomy and CSDC, University of Florence, via G. Sansone 1, 50019 Sesto Fiorentino, ItalyDepartment of Physics and Astronomy and CSDC, University of Florence, via G. Sansone 1, 50019 Sesto Fiorentino, ItalyWe study the problem of color-avoiding and color-favored percolation in a network, i.e., the problem of finding a path that avoids a certain number of colors, associated with vulnerabilities of nodes or links, or is attracted by them. We investigate here regular (mainly directed) lattices with a fractions of links removed (hence the term “diluted”). We show that this problem can be formulated as a self-organized critical problem, in which the asymptotic phase space can be obtained in one simulation. The method is particularly effective for certain “convex” formulations, but can be extended to arbitrary problems using multi-bit coding. We obtain the phase diagram for some problem related to color-avoiding percolation on directed models. We also show that the interference among colors induces a paradoxical effect in which color-favored percolation is permitted where standard percolation for a single color is impossible.https://www.mdpi.com/1999-5903/12/8/139percolationdirected percolationmulti-graphscolor-avoiding percolation |
| spellingShingle | Michele Giusfredi Franco Bagnoli From Color-Avoiding to Color-Favored Percolation in Diluted Lattices Future Internet percolation directed percolation multi-graphs color-avoiding percolation |
| title | From Color-Avoiding to Color-Favored Percolation in Diluted Lattices |
| title_full | From Color-Avoiding to Color-Favored Percolation in Diluted Lattices |
| title_fullStr | From Color-Avoiding to Color-Favored Percolation in Diluted Lattices |
| title_full_unstemmed | From Color-Avoiding to Color-Favored Percolation in Diluted Lattices |
| title_short | From Color-Avoiding to Color-Favored Percolation in Diluted Lattices |
| title_sort | from color avoiding to color favored percolation in diluted lattices |
| topic | percolation directed percolation multi-graphs color-avoiding percolation |
| url | https://www.mdpi.com/1999-5903/12/8/139 |
| work_keys_str_mv | AT michelegiusfredi fromcoloravoidingtocolorfavoredpercolationindilutedlattices AT francobagnoli fromcoloravoidingtocolorfavoredpercolationindilutedlattices |