%-------------------------------------------------------------------------------
% UF Sparse Matrix Collection, Tim Davis
% http://www.cise.ufl.edu/research/sparse/matrices/DIMACS10/preferentialAttachment
% name: DIMACS10/preferentialAttachment
% [DIMACS10 set: clustering/preferentialAttachment]
% id: 2575
% date: 2011
% author: H. Meyerhenke
% ed: H. Meyerhenke
% fields: name title A id date author ed kind notes
% kind: random undirected graph
%-------------------------------------------------------------------------------
% notes:
% DIMACS10 set: clustering/preferentialAttachment                    
% source: http://www.cc.gatech.edu/dimacs10/archive/clustering.shtml 
%                                                                    
% 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.                                        
%-------------------------------------------------------------------------------
