WorldWide Airports
Airports was obtained from the International Air Transportation Association (IATA). Each node represents an airport and each edge is a regular flight between two airports. Colors are assigned according to the coreness: vertices with coreness 1 are violet, and the maximum coreness vertices are red, following the rainbow color scale. The node degree scale is also displayed, showing the maximum degree of the network.




Autonomous System
AS is the autonomous system level of Internet network. Each node represents an autonomous system and each edge is a connection between two AS. The information was obtained by collected routes of Oregon routeviews project. Colors are assigned according to the coreness: vertices with coreness 1 are violet, and the maximum coreness vertices are red, following the rainbow color scale. The node degree scale is also displayed, showing the maximum degree of the network.




Autonomous System+
AS+ is the autonomous system level of Internet network. Each node represents an autonomous system and each edge is a connection between two AS. The information was obtained by collected routes of Oregon routeviews project, and enriched with a large quantity of links, and obtained using informations from peering relationships of the autonomous systems, is presented in Chen et al. 2002. Colors are assigned according to the coreness: vertices with coreness 1 are violet, and the maximum coreness vertices are red, following the rainbow color scale. The node degree scale is also displayed, showing the maximum degree of the network.




Autonomous System DIMES
AS is the autonomous system level of Internet network. Each node represents an autonomous system and each edge is a connection between two AS. This network was kindly provided by the Dimes project. Colors are assigned according to the coreness: vertices with coreness 1 are violet, and the maximum coreness vertices are red, following the rainbow color scale. The node degree scale is also displayed, showing the maximum degree of the network.




Scientific collaborations
CondMat: this network considers scientists who have authored manuscripts submitted to the eprint archive relative to condensed matter physics between 1995 and 1998. Scientists are identified with nodes and an edge exists between two scientists if they have coauthored at least one paper. This data was provided by Mark Newman, University of Michigan. Colors are assigned according to the coreness: vertices with coreness 1 are violet, and the maximum coreness vertices are red, following the rainbow color scale. The node degree scale is also displayed, showing the maximum degree of the network.




Internet routers
IR is the router level of Internet network. Each node represents a router and each edge is a link between two routers. The data corresponds to the paper of Govindan and Tangmunarunkit, Infocom 2000. Colors are assigned according to the coreness: vertices with coreness 1 are violet, and the maximum coreness vertices are red, following the rainbow color scale. The node degree scale is also displayed, showing the maximum degree of the network.




Internet routers CAIDA
IR_CAIDA is a router level map of Internet network. Each node represents a router and each edge is a link between two routers. The data corresponds to an exploration done at CAIDA organization. Colors are assigned according to the coreness: vertices with coreness 1 are violet, and the maximum coreness vertices are red, following the rainbow color scale. The node degree scale is also displayed, showing the maximum degree of the network.




World Wide Web
WWW is a portion of the web at .fr domain, with 1 million of pages. Each node represents a web page and each edge is an hyperlink between two pages. The data was provided by Fabien Mathieu, LIRMM at Montpellier, France. Colors are assigned according to the coreness: vertices with coreness 1 are violet, and the maximum coreness vertices are red, following the rainbow color scale. The node degree scale is also displayed, showing the maximum degree of the network.




Barabasi Albert
BA corresponds to the BarabásiAlbert model. considers growing networks according to the preferential attachment mechanism: each new node is connected to m already existing nodes chosen with a probability proportional to their starting degree. This network has 10000 nodes and m=2. Colors are assigned according to the coreness: vertices with coreness 1 are violet, and the maximum coreness vertices are red, following the rainbow color scale. The node degree scale is also displayed, showing the maximum degree of the network.




Barabasi Albert RND
RBA corresponds to the Barab´siAlbert model. considers growing networks according to the preferential attachment mechanism: each new node is connected to m already existing nodes chosen with a probability proportional to their starting degree. This network has 1000 nodes and varying m randomly between 1 and 10 (at each time step). Colors are assigned according to the coreness: vertices with coreness 1 are violet, and the maximum coreness vertices are red, following the rainbow color scale. The node degree scale is also displayed, showing the maximum degree of the network.




Extended FKP
Extended_FKP is an extension of the work of Fabrikant, Koutsoupias and Papadimitriou, Heuristically Optimized TradeOffs: A New Paradigm for Power Laws in the Internet model. This model of a growing network embedded in a twodimensional space is essentially based on a competition between distances in the Euclidean space and on the graph: a new node is connected to already existing nodes in a way to optimize a combination of its distance on the graph to a predefined "center" and the Euclidean length of the connections. We consider a network constructed along the lines of AlvarezHamelin and Scahbanel 2004, which has a scalefree distribution of connectivities P(k)~k^(a) with exponent a=2.4. Colors are assigned according to the coreness: vertices with coreness 1 are violet, and the maximum coreness vertices are red, following the rainbow color scale. The node degree scale is also displayed, showing the maximum degree of the network.




Random graph
Random graph corresponds to the ErdösRényi model, with 1000 nodes and an average degree equal to 10. In this model, an edge between two nodes has a probability of 0.01. Colors are assigned according to the coreness: vertices with coreness 1 are violet, and the maximum coreness vertices are red, following the rainbow color scale. The node degree scale is also displayed, showing the maximum degree of the network.



