Matrix: DIMACS10/smallworld

Description: DIMACS10 set: clustering/smallworld

DIMACS10/smallworld graph
(undirected graph drawing)


DIMACS10/smallworld

  • Home page of the UF Sparse Matrix Collection
  • Matrix group: DIMACS10
  • Click here for a description of the DIMACS10 group.
  • Click here for a list of all matrices
  • Click here for a list of all matrix groups
  • download as a MATLAB mat-file, file size: 1 MB. Use UFget(2576) or UFget('DIMACS10/smallworld') in MATLAB.
  • download in Matrix Market format, file size: 1 MB.
  • download in Rutherford/Boeing format, file size: 1 MB.

    Matrix properties
    number of rows100,000
    number of columns100,000
    nonzeros999,996
    # strongly connected comp.1
    explicit zero entries0
    nonzero pattern symmetrysymmetric
    numeric value symmetrysymmetric
    typebinary
    structuresymmetric
    Cholesky candidate?no
    positive definite?no

    authorH. Meyerhenke
    editorH. Meyerhenke
    date2011
    kindrandom 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.