Newman/adjnoun

Common adjective and nouns in "David Copperfield"
Name adjnoun
Group Newman
Matrix ID 2389
Num Rows 112
Num Cols 112
Nonzeros 850
Pattern Entries 850
Kind Undirected Graph
Symmetric Yes
Date 2006
Author M. Newman
Editor M. Newman
Structural Rank
Structural Rank Full
Num Dmperm Blocks
Strongly Connect Components 1
Num Explicit Zeros 0
Pattern Symmetry 100%
Numeric Symmetry 100%
Cholesky Candidate no
Positive Definite no
Type binary
SVD Statistics
Matrix Norm 1.315016e+01
Minimum Singular Value 6.016966e-18
Condition Number 2.185514e+18
Rank 109
sprank(A)-rank(A)
Null Space Dimension 3
Full Numerical Rank? no
Download Singular Values MATLAB
Download MATLAB Rutherford Boeing Matrix Market
Notes 
Network collection from M. Newman                                          
http://www-personal.umich.edu/~mejn/netdata/                               
                                                                           
The graph adjnoun contains the network of common adjective and noun        
adjacencies for the novel "David Copperfield" by Charles Dickens, as       
described by M. Newman.  Nodes represent the most commonly occurring       
adjectives and nouns in the book.  Node values are 0 for adjectives and 1  
for nouns.  Edges connect any pair of words that occur in adjacent position
in the text of the book.  Please cite M. E. J. Newman, Finding community   
structure in networks using the eigenvectors of matrices, Preprint         
physics/0605087 (2006).