SNAP Datasets: Stanford large network dataset collection, 2014. ,
Graph summarization methods and applications: A survey, ACM Computing Surveys (CSUR), vol.51, issue.3, p.62, 2018. ,
Clustered model reduction of positive directed networks, Automatica, vol.59, pp.238-247, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01276233
Structure-preserving model reduction of physical network systems by clustering, IEEE 53rd Annual Conference on, pp.4434-4440, 2014. ,
Kron reduction of graphs with applications to electrical networks, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.60, issue.1, pp.150-163, 2013. ,
Graph structure-preserving model reduction of linear network systems, Control Conference (ECC), pp.1970-1975, 2016. ,
Spectral coarse graining of complex networks, Physical review letters, vol.99, issue.3, p.38701, 2007. ,
On random graphs, i, Publicationes Mathematicae (Debrecen), vol.6, pp.290-297, 1959. ,
Emergence of scaling in random networks, science, vol.286, issue.5439, pp.509-512, 1999. ,
The large-scale organization of metabolic networks, Nature, vol.407, issue.6804, pp.651-654, 2000. ,
The web of human sexual contacts, Nature, vol.411, issue.6840, pp.907-908, 2001. ,
Modeling the internet's large-scale topology, Proceedings of the National Academy of Sciences, vol.99, issue.21, pp.13-382, 2002. ,
Scale-free characteristics of random networks: the topology of the world-wide web, Physica A: statistical mechanics and its applications, vol.281, issue.1, pp.69-77, 2000. ,
A general theory of bibliometric and other cumulative advantage processes, Journal of the Association for Information Science and Technology, vol.27, issue.5, pp.292-306, 1976. ,
, Statistical studies of networks of scientific papers, Statistical Association Methods for Mechanized Documentation: Symposium Proceedings, vol.269, p.187, 1965.
The structure and function of complex networks, SIAM review, vol.45, issue.2, pp.167-256, 2003. ,
Structural properties of scale-free networks, p.85, 2003. ,
Sustaining the internet with hyperbolic mapping, Nature communications, vol.1, p.62, 2010. ,
Navigating ultrasmall worlds in ultrashort time, Physical review letters, vol.102, issue.5, p.58701, 2009. ,
Epidemics and immunization in scale-free networks, pp.111-130, 2005. ,
Dominating scale-free networks with variable scaling exponent: heterogeneous networks are not difficult to control, New Journal of Physics, vol.14, issue.7, p.73005, 2012. ,
Foundations of data science, Vorabversion eines Lehrbuchs, 2016. ,
The pagerank citation ranking: Bringing order to the web, 1999. ,
Are we connected ? Optimal determination of source-destination connectivity in random networks, IEEE/ACM Transactions on Networking, vol.25, issue.2, pp.751-764, 2017. ,
Determining sourcedestination connectivity in uncertain networks: Modeling and solutions, IEEE/ACM Transactions on Networking, vol.25, issue.6, pp.3237-3252, 2017. ,
, , 2014.
A recursive algorithm for computing steady state probabilities, IIIS, 2010. ,
The origin and spread of the grid-pattern town, Geographical Review, vol.36, issue.1, pp.105-120, 1946. ,
Grid networks: enabling grids with advanced communication technology, 2006. ,
, The geometric structure of the brain fiber pathways, vol.335, pp.1628-1634, 2012.
Comparing community structure identification, Journal of Statistical Mechanics: Theory and Experiment, issue.09, p.9008, 2005. ,
Community detection in graphs, Physics reports, vol.486, issue.3, pp.75-174, 2010. ,
Grenoble traffic lab: An experimental platform for advanced traffic monitoring and forecasting, IEEE Control Systems, vol.35, issue.3, pp.23-39, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01059126
A driver node selection strategy for minimizing the control energy in complex networks, IFAC-PapersOnLine, vol.50, issue.1, pp.8309-8314, 2017. ,
, (a) The initial graph. Background colors indicate the final partition obtained via the algorithm (b) The reduced graph issued from the partition. The size of the nodes represents the in-degree of each node and the color matches
, Initial, final and target in-degree distributions in logarithmic scales. (d) Initial, final and target out-degree distributions in logarithmic scales
, Output of the Grenoble urban traffic network reduction. A video showing the evolution of the algorithm step-by-step of a similar simulation is available at