In this paper we define a scale-free network based both on the preferential attachement parameter, of the Barabasi-Albert model, and on the new parameter of carrying capacity under a logistic growth. The main advantage is that by using this new parameter the network will grow as a set of communites each one with a limited number of nodes, each community with only one hub and a very little number of connections between communities, thus minimizing the number of links. With this model, which fulfills the 80–20 Pareto rule, we will also get an optimal designed network characterized by the limited cost of management.
On the Optimal Design of a Scale-Free Supply Network
Villecco F.
2023
Abstract
In this paper we define a scale-free network based both on the preferential attachement parameter, of the Barabasi-Albert model, and on the new parameter of carrying capacity under a logistic growth. The main advantage is that by using this new parameter the network will grow as a set of communites each one with a limited number of nodes, each community with only one hub and a very little number of connections between communities, thus minimizing the number of links. With this model, which fulfills the 80–20 Pareto rule, we will also get an optimal designed network characterized by the limited cost of management.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
