Matrix: SNAP/as-Skitter
Description: Internet topology graph, from traceroutes run daily in 2005
|
| (undirected graph drawing) |
 |
| Matrix properties | |
| number of rows | 1,696,415 |
| number of columns | 1,696,415 |
| nonzeros | 22,190,596 |
| # strongly connected comp. | 756 |
| explicit zero entries | 0 |
| nonzero pattern symmetry | symmetric |
| numeric value symmetry | symmetric |
| type | binary |
| structure | symmetric |
| Cholesky candidate? | no |
| positive definite? | no |
| author | J. Leskovec, J. Kleinberg and C. Faloutsos |
| editor | J. Leskovec |
| date | 2005 |
| kind | undirected graph |
| 2D/3D problem? | no |
Notes:
Networks from SNAP (Stanford Network Analysis Platform) Network Data Sets,
Jure Leskovec http://snap.stanford.edu/data/index.html
email jure at cs.stanford.edu
Autonomous systems by Skitter
Dataset information
Internet topology graph. From traceroutes run daily in 2005 -
http://www.caida.org/tools/measurement/skitter. From several scattered sources
to million destinations. 1.7 million nodes, 11 million edges.
Dataset statistics
Nodes 1696415
Edges 11095298
Nodes in largest WCC 1694616 (0.999)
Edges in largest WCC 11094209 (1.000)
Nodes in largest SCC 1694616 (0.999)
Edges in largest SCC 11094209 (1.000)
Average clustering coefficient 0.2963
Number of triangles 28769868
Fraction of closed triangles 0.005387
Diameter (longest shortest path) 25
90-percentile effective diameter 5.9
Source (citation)
J. Leskovec, J. Kleinberg and C. Faloutsos. Graphs over Time: Densification
Laws, Shrinking Diameters and Possible Explanations. ACM SIGKDD International
Conference on Knowledge Discovery and Data Mining (KDD), 2005.
Files
File Description
as-skitter.txt.gz AS from traceroutes run daily in 2005 by skitter
For a description of the statistics displayed above, click here.
Maintained by Tim Davis, last updated 12-Mar-2014.
Matrix pictures by cspy, a MATLAB function in the CSparse package.
Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.