Large-scale network reduction towards scale-free structure - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Network Science and Engineering Année : 2019

Large-scale network reduction towards scale-free structure

Reduction de réseau grande échelle en une structure scale-free

Nicolas Martin
  • Fonction : Auteur
  • PersonId : 1031004
Paolo Frasca

Résumé

This paper deals with a particular problem of graph reduction. The reduced graph is aimed to have a particular structure, namely to be scale-free. To this end, we define a metric to measure the scale-freeness by measuring the difference between the degree distribution and the scale-free degree distribution. The reduction is made under constraints to preserve consistency with the initial graph. In particular, the reduced graph preserves the eigenvector centrality of the initial graph. We study the optimization problem and, based on the gained insights, we derive an algorithm allowing to find an approximate solution. We also show that, if the initial network is a flow network, it is possible to design the algorithm such that the output remains a flow network. Experimental results are then presented to optimally choose the parameters of the algorithm suggesting that, by tuning a parameter, it is possible to speed up the algorithm with a comparable efficiency. Finally, the algorithm is applied to an example of large physical network: the Grenoble urban traffic network.
Fichier principal
Vignette du fichier
Article_TNSE.pdf (7.71 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01885140 , version 1 (02-10-2018)

Identifiants

Citer

Nicolas Martin, Paolo Frasca, Carlos Canudas de Wit. Large-scale network reduction towards scale-free structure. IEEE Transactions on Network Science and Engineering, 2019, 6 (4), pp.711-723. ⟨10.1109/TNSE.2018.2871348⟩. ⟨hal-01885140⟩
148 Consultations
129 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More