Inverse model for network construction: (δ(G), I' (G)) -> G
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914917818302464 |
|---|---|
| author | Gao, Wei Chen, Yaojun Zhang, Hainan |
| author_facet | Gao, Wei Chen, Yaojun Zhang, Hainan |
| contents | The isolated toughness variant is a salient parameter for measuring the vulnerability of networks, which is inherently related to fractional factors (used to characterize the feasibility of data transmission). The combination of minimum degree and the corresponding tight bound of isolated toughness variant for fractional factors provide reference standards for network construction. However, previous advances only focused on how to select the optimal parameter criteria from Pareto front, without any suggestion for the construction of specific networks. To overcome this deficiency, this paper proposes an inverse model from $(δ(G),I'(G))$ to $G$, by means of evolutionary computing approach, we propose a novel inverse model to obtain the optimal solutions for candidate graphs. The main procedure is composed of pseudo-greedy acceleration, cross-mutation and diversity enhancement modules. The practicality of the algorithm is verified by means of pilot experiments. The code in this paper is made public on https://github.com/AizhEngHN/Inverse-model-for-network-construction-G-I-G-G. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_10847 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Inverse model for network construction: (δ(G), I' (G)) -> G Gao, Wei Chen, Yaojun Zhang, Hainan Combinatorics The isolated toughness variant is a salient parameter for measuring the vulnerability of networks, which is inherently related to fractional factors (used to characterize the feasibility of data transmission). The combination of minimum degree and the corresponding tight bound of isolated toughness variant for fractional factors provide reference standards for network construction. However, previous advances only focused on how to select the optimal parameter criteria from Pareto front, without any suggestion for the construction of specific networks. To overcome this deficiency, this paper proposes an inverse model from $(δ(G),I'(G))$ to $G$, by means of evolutionary computing approach, we propose a novel inverse model to obtain the optimal solutions for candidate graphs. The main procedure is composed of pseudo-greedy acceleration, cross-mutation and diversity enhancement modules. The practicality of the algorithm is verified by means of pilot experiments. The code in this paper is made public on https://github.com/AizhEngHN/Inverse-model-for-network-construction-G-I-G-G. |
| title | Inverse model for network construction: (δ(G), I' (G)) -> G |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2408.10847 |