co-appearences of characters in Les Miserables by Victor Hugo
Name lesmis
Group Newman
Matrix ID 2400
Num Rows 77
Num Cols 77
Nonzeros 508
Pattern Entries 508
Kind Undirected Weighted Graph
Symmetric Yes
Date 1993
Author D. Knuth
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 integer
SVD Statistics
Matrix Norm 6.502628e+01
Minimum Singular Value 8.623190e-17
Condition Number 7.540861e+17
Rank 64
Null Space Dimension 13
Full Numerical Rank? no
Download Singular Values MATLAB
Download MATLAB Rutherford Boeing Matrix Market
Network collection from M. Newman                                                                
The graph lesmis contains the weighted network of coappearances of         
characters in Victor Hugo's novel "Les Miserables".  Nodes represent       
characters as indicated by the labels and edges connect any pair of        
characters that appear in the same chapter of the book.  The values on the 
edges are the number of such coappearances.  The data on coappearances were
taken from D. E. Knuth, The Stanford GraphBase: A Platform for             
Combinatorial Computing, Addison-Wesley, Reading, MA (1993).