Matrix: DIMACS10/preferentialAttachment

Description: DIMACS10 set: clustering/preferentialAttachment

DIMACS10/preferentialAttachment graph
(undirected graph drawing)


  • 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: 3 MB. Use UFget(2575) or UFget('DIMACS10/preferentialAttachment') in MATLAB.
  • download in Matrix Market format, file size: 2 MB.
  • download in Rutherford/Boeing format, file size: 2 MB.

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

    authorH. Meyerhenke
    editorH. Meyerhenke
    kindrandom undirected graph
    2D/3D problem?no


    DIMACS10 set: clustering/preferentialAttachment                    
    This graph has been generated following a preferential attachment  
    process (see Barabási and Albert, "Emergence of scaling in random  
    networks", Science, 1999). Starting with a clique of five vertices,
    the vertices are successively added to the graph. Each new vertex  
    chooses exactly five neighbors among the existing vertices, such   
    that the probability of choosing a particular vertex is            
    proportional to its degree. In our implementation, a vertex can    
    choose a neighbour only once, such that the resulting random graph 
    is guaranteed to be simple.                                        

    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.