Matrix: Pajek/EAT_RS

Description: Pajek network: Edinburgh Associative Thesaurus (response-stimulus)

Pajek/EAT_RS graph Pajek/EAT_RS graph
(bipartite graph drawing) (graph drawing of A+A')

scc of Pajek/EAT_RS

  • Home page of the UF Sparse Matrix Collection
  • Matrix group: Pajek
  • Click here for a description of the Pajek 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: 988 KB. Use UFget(1461) or UFget('Pajek/EAT_RS') in MATLAB.
  • download in Matrix Market format, file size: 1 MB.
  • download in Rutherford/Boeing format, file size: 972 KB.

    Matrix properties
    number of rows23,219
    number of columns23,219
    # strongly connected comp.15,466
    explicit zero entries0
    nonzero pattern symmetry 12%
    numeric value symmetry 3%
    Cholesky candidate?no
    positive definite?no

    authorG. Kiss, C. Armstrong R. Milroy, J. Piper
    editorV. Batagelj
    kinddirected weighted graph
    2D/3D problem?no

    Additional fieldssize and type
    nodenamefull 23219-by-20


    Pajek network converted to sparse adjacency matrix for inclusion in UF sparse 
    matrix collection, Tim Davis.  For Pajek datasets, See V. Batagelj & A. Mrvar,                                
     EAT - The Edinburgh Associative Thesaurus /                                  
     The EAT is a database of word association norms.                             
     - Original EAT: George Kiss, Christine Armstrong,                            
     Robert Milroy and J.R.I. Piper (1968-1971).                                  
     - MRC Psycholinguistic Database Version modified by:                         
     Max Coltheart, S. James, J. Ramshaw, B.M. Philip,                            
     B. Reid, J. Benyon-Tinker and E. Doctor;                                     
     made available by: Philip Quinlan.                                           
     - The present version was re-structured and documented                       
     by Michael Wilson at the Rutherford Appleton Laboratory.                                                 
     transformed in Pajek format: V. Batagelj, 31. July 2003                      
    Regarding conversion for UF sparse matrix collection: in the original data    
    there are 325,624 weighted edges.  Of those only 32 edges are duplicates, and 
    all of them have identical edge weights as the edges they are duplicates of   
    These extraneous edges have been removed, since this this appears to be a     
    graph, not a multigraph.                                                      

    SVD-based statistics:
    null space dimension15,009
    full numerical rank?no
    singular value gap1.91875e+12

    singular values (MAT file):click here
    SVD method used:s = svd (full (A))

    Pajek/EAT_RS svd

    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.