Matrix: DIMACS10/smallworld
Description: DIMACS10 set: clustering/smallworld
(undirected graph drawing) |
Matrix properties | |
number of rows | 100,000 |
number of columns | 100,000 |
nonzeros | 999,996 |
# strongly connected comp. | 1 |
explicit zero entries | 0 |
nonzero pattern symmetry | symmetric |
numeric value symmetry | symmetric |
type | binary |
structure | symmetric |
Cholesky candidate? | no |
positive definite? | no |
author | H. Meyerhenke |
editor | H. Meyerhenke |
date | 2011 |
kind | random undirected graph |
2D/3D problem? | no |
Notes:
DIMACS10 set: clustering/smallworld source: http://www.cc.gatech.edu/dimacs10/archive/clustering.shtml This graph has been generated using the small world generator of the Boost Graph Library. Starting with a ring of 100000 vertices and 500000 edges, edges are rewired with a probability of 0.2 according to the random model of Watts and Strogatz (see Watts and Strogatz, "Collective Dynamics of Small-World Networks", Nature, 1998). Multiple edges are removed after the process.
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.