Neighbor-induced damage percolation
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916721844027392 |
|---|---|
| author | Cirigliano, Lorenzo Castellano, Claudio |
| author_facet | Cirigliano, Lorenzo Castellano, Claudio |
| contents | We consider neighbor-induced damage percolation, a model describing systems where the inactivation of some elements may damage their neighboring active ones, making them unusable. We present an exact solution for the size of the giant usable component (GUC) and the giant damaged component (GDC) in uncorrelated random graphs. We show that, even for strongly heterogeneous distributions, the GUC always appears at a finite threshold and its formation is characterized by homogeneous mean-field percolation critical exponents. The threshold is a nonmonotonic function of connectivity: robustness is maximized by networks with finite optimal average degree. We also show that, if the average degree is large enough, a damaged phase appears, characterized by the existence of a GDC, bounded by two distinct percolation transitions. The birth and the dismantling of the GDC are characterized by standard percolation critical exponents in networks, except for the dismantling in scale-free networks where new critical exponents are found. Numerical simulations on regular lattices in D = 2 show that the existence of a GDC depends not only on the spatial dimension but also on the lattice coordination number. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_03026 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Neighbor-induced damage percolation Cirigliano, Lorenzo Castellano, Claudio Disordered Systems and Neural Networks Statistical Mechanics We consider neighbor-induced damage percolation, a model describing systems where the inactivation of some elements may damage their neighboring active ones, making them unusable. We present an exact solution for the size of the giant usable component (GUC) and the giant damaged component (GDC) in uncorrelated random graphs. We show that, even for strongly heterogeneous distributions, the GUC always appears at a finite threshold and its formation is characterized by homogeneous mean-field percolation critical exponents. The threshold is a nonmonotonic function of connectivity: robustness is maximized by networks with finite optimal average degree. We also show that, if the average degree is large enough, a damaged phase appears, characterized by the existence of a GDC, bounded by two distinct percolation transitions. The birth and the dismantling of the GDC are characterized by standard percolation critical exponents in networks, except for the dismantling in scale-free networks where new critical exponents are found. Numerical simulations on regular lattices in D = 2 show that the existence of a GDC depends not only on the spatial dimension but also on the lattice coordination number. |
| title | Neighbor-induced damage percolation |
| topic | Disordered Systems and Neural Networks Statistical Mechanics |
| url | https://arxiv.org/abs/2505.03026 |