%-------------------------------------------------------------------------------
% UF Sparse Matrix Collection, Tim Davis
% http://www.cise.ufl.edu/research/sparse/matrices/Pajek/Reuters911
% name: Pajek/Reuters911
% [Pajek network: Reuters news, Sept 11 to Nov 15, 2001]
% id: 1517
% date: 2001
% author: S. Corman, T. Kuhn, R. Mcphee, K. Dooley
% ed: V. Batagelj, A. Mrvar
% fields: name title A id kind notes aux date author ed
% aux: Day nodename
% kind: undirected weighted graph sequence
%-------------------------------------------------------------------------------
% notes:
% ------------------------------------------------------------------------------
% Pajek network converted to sparse adjacency matrix for inclusion in UF sparse 
% matrix collection, Tim Davis.  For Pajek datasets, See V. Batagelj & A. Mrvar,
% http://vlado.fmf.uni-lj.si/pub/networks/data/.  This is the "Days" network.   
% ------------------------------------------------------------------------------
% The Reuters terror news network is based on all stories released during 66    
% consecutive days by the news agency Reuters concerning the September 11 attack
% on the U.S., beginning at 9:00 AM EST 9/11/01. The vertices of a network are  
% words (terms); there is an edge between two words iff they appear in the same 
% text unit (sentence). The weight of an edge is its frequency. The network has 
% n=13332 vertices (different words in the news) and m = 243447 edges, 50859    
% with value larger than 1. There are no loops in the network.                  
% Steven R. Corman, Timothy Kuhn, Robert D. Mcphee and Kevin J. Dooley          
% (2002): Studying Complex Discursive Systems: Centering Resonance Analysis of  
% Communication.                                                                
% ------------------------------------------------------------------------------
% When converted to a sparse adjacency matrix for the UF Sparse Matrix          
% Collection, Day{i} is the graph of the ith day.  The diagonal entry           
% Day{i}(k,k) is 1 if word k appears in any news on the ith day.  Note          
% that it may not appear in conjunction with other words in the same            
% sentence on that day.  The sum of nnz(tril(Day{i})) for i=1:66 is 243,447.    
% The overall matrix A is the sum of the Day{i} matrices.  A(i,j) is the number 
% of times words i and j appear in same sentence (for i not equal to j).  A(k,k)
% is the number of days the word k appears in any news report.                  
% Note that this network has been renamed to Reuters911 here.                   
% ------------------------------------------------------------------------------
%-------------------------------------------------------------------------------
