A Network Reduction Method Inducing Scale-Free Degree Distribution

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.

[1]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[2]  Jacquelien M. A. Scherpen,et al.  Graph structure-preserving model reduction of linear network systems , 2016, 2016 European Control Conference (ECC).

[3]  S. Fortunato,et al.  Spectral centrality measures in complex networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Marián Boguñá,et al.  Navigating ultrasmall worlds in ultrashort time. , 2008, Physical review letters.

[5]  Avrim Blum,et al.  Foundations of Data Science , 2020 .

[6]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Leon Danon,et al.  Comparing community structure identification , 2005, cond-mat/0505245.

[8]  Antoine Girard,et al.  Clustered model reduction of positive directed networks , 2015, Autom..

[9]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[10]  Florian Dörfler,et al.  Kron Reduction of Graphs With Applications to Electrical Networks , 2011, IEEE Transactions on Circuits and Systems I: Regular Papers.

[11]  Arjan van der Schaft,et al.  Structure-preserving model reduction of physical network systems by clustering , 2014, 53rd IEEE Conference on Decision and Control.

[12]  Alessandro Vespignani,et al.  Immunization of complex networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .

[14]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[16]  L. Amaral,et al.  The web of human sexual contacts , 2001, Nature.

[17]  Franco Travostino,et al.  Grid networks : enabling grids with advanced communication technology , 2006 .

[18]  Ravindra K. Ahuja,et al.  Network Flows , 2011 .

[19]  W. Marsden.  I and J , 2012 .

[20]  Tatsuya Akutsu,et al.  Dominating scale-free networks with variable scaling exponent: heterogeneous networks are not difficult to control , 2012 .