Discontinuous percolation via suppression of neighboring clusters in a network
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911378232573952 |
|---|---|
| author | Cho, Young Sul |
| author_facet | Cho, Young Sul |
| contents | Our recent study on the Bethe lattice reported that a discontinuous percolation transition emerges as the number of occupied links increases and each node rewires its links to locally suppress the growth of neighboring clusters. However, since the Bethe lattice is a tree, a macroscopic cluster forms as an infinite spanning tree but does not contain a finite fraction of the nodes. In this paper, we study a bipartite network that can be regarded as a locally tree-like structure with long-range neighbors. In this network, each node in one of the two partitions is allowed to rewire its links to nodes in the other partition to suppress the growth of neighboring clusters. We observe a discontinuous percolation transition characterized by the emergence of a single macroscopic cluster containing a finite fraction of nodes, followed by critical behavior of the cluster size distribution. We also provide an analytical explanation of the underlying mechanism. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_02336 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Discontinuous percolation via suppression of neighboring clusters in a network Cho, Young Sul Disordered Systems and Neural Networks Statistical Mechanics Our recent study on the Bethe lattice reported that a discontinuous percolation transition emerges as the number of occupied links increases and each node rewires its links to locally suppress the growth of neighboring clusters. However, since the Bethe lattice is a tree, a macroscopic cluster forms as an infinite spanning tree but does not contain a finite fraction of the nodes. In this paper, we study a bipartite network that can be regarded as a locally tree-like structure with long-range neighbors. In this network, each node in one of the two partitions is allowed to rewire its links to nodes in the other partition to suppress the growth of neighboring clusters. We observe a discontinuous percolation transition characterized by the emergence of a single macroscopic cluster containing a finite fraction of nodes, followed by critical behavior of the cluster size distribution. We also provide an analytical explanation of the underlying mechanism. |
| title | Discontinuous percolation via suppression of neighboring clusters in a network |
| topic | Disordered Systems and Neural Networks Statistical Mechanics |
| url | https://arxiv.org/abs/2507.02336 |