A network reduction method inducing scale-free degree distribution

Nicolas Martin 1 Paolo Frasca 1 Carlos Canudas de Wit 1
1 NECS - Networked Controlled Systems
Inria Grenoble - Rhône-Alpes, GIPSA-DA - Département Automatique
Abstract : This paper deals with the problem of graph reduction towards a scale-free graph while preserving a consistency with the initial graph. This problem is formulated as a minimization problem and to this end we define a metric to measure the scale-freeness of a graph and another metric to measure the similarity between two graphs with different dimensions, based on spectral centrality. We also want to ensure that if the initial network is a flow network, the reduced network preserves this property. We explore the optimization problem and, based on the gained insights, we derive an algorithm allowing to find an approximate solution. Finally, the effectiveness of the algorithm is shown through a simulation on a Manhattan-like network.
Liste complète des métadonnées

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01632482
Contributor : Nicolas Martin <>
Submitted on : Thursday, April 19, 2018 - 2:46:18 PM
Last modification on : Friday, March 8, 2019 - 4:22:37 PM
Document(s) archivé(s) le : Tuesday, September 18, 2018 - 4:33:20 PM

File

ECC18_0364_FI.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01632482, version 3

Collections

Citation

Nicolas Martin, Paolo Frasca, Carlos Canudas de Wit. A network reduction method inducing scale-free degree distribution. 16th European Control Conference (ECC 2018), Jun 2018, Limassol, Cyprus. pp.1-6. ⟨hal-01632482v3⟩

Share

Metrics

Record views

165

Files downloads

179