Matrix: SNAP/wiki-Talk

Description: Wikipedia talk (communication) network

SNAP/wiki-Talk graph SNAP/wiki-Talk graph
(bipartite graph drawing) (graph drawing of A+A')

scc of SNAP/wiki-Talk

  • Home page of the UF Sparse Matrix Collection
  • Matrix group: SNAP
  • Click here for a description of the SNAP 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: 13 MB. Use UFget(2291) or UFget('SNAP/wiki-Talk') in MATLAB.
  • download in Matrix Market format, file size: 17 MB.
  • download in Rutherford/Boeing format, file size: 17 MB.

    Matrix properties
    number of rows2,394,385
    number of columns2,394,385
    # strongly connected comp.2,281,879
    explicit zero entries0
    nonzero pattern symmetry 14%
    numeric value symmetry 14%
    Cholesky candidate?no
    positive definite?no

    authorJ. Leskovec, D. Huttenlocher, J. Kleinberg
    editorJ. Leskovec
    kinddirected graph
    2D/3D problem?no


    Networks from SNAP (Stanford Network Analysis Platform) Network Data Sets,     
    Jure Leskovec                         
    email jure at                                                  
    Wikipedia Talk network                                                         
    Dataset information                                                            
    Wikipedia is a free encyclopedia written collaboratively by volunteers around  
    the world. Each registered user has a talk page, that she and other users can  
    edit in order to communicate and discuss updates to various articles on        
    Wikipedia. Using the latest complete dump of Wikipedia page edit history (from 
    January 3 2008) we extracted all user talk page changes and created a network. 
    The network contains all the users and discussion from the inception of        
    Wikipedia till January 2008. Nodes in the network represent Wikipedia users and
    a directed edge from node i to node j represents that user i at least once     
    edited a talk page of user j.                                                  
    Dataset statistics                                                             
    Nodes   2394385                                                                
    Edges   5021410                                                                
    Nodes in largest WCC    2388953 (0.998)                                        
    Edges in largest WCC    5018445 (0.999)                                        
    Nodes in largest SCC    111881 (0.047)                                         
    Edges in largest SCC    1477893 (0.294)                                        
    Average clustering coefficient  0.1958                                         
    Number of triangles     9203519                                                
    Fraction of closed triangles    -0.09476                                       
    Diameter (longest shortest path)    9                                          
    90-percentile effective diameter    4                                          
    Source (citation)                                                              
    J. Leskovec, D. Huttenlocher, J. Kleinberg. Signed Networks in Social Media.   
    CHI 2010.                                                                      
    J. Leskovec, D. Huttenlocher, J. Kleinberg. Predicting Positive and Negative   
    Links in Online Social Networks. WWW 2010.                                     
    File    Description                                                            
    Wiki-Talk.txt.gz    Wikipedia talk graph till January 2008                     

    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.