Matrix: Pajek/FA
Description: Pajek network: USF Free (word) Association Norms
(bipartite graph drawing) | (graph drawing of A+A') |
Matrix properties | |
number of rows | 10,617 |
number of columns | 10,617 |
nonzeros | 72,176 |
# strongly connected comp. | 5,764 |
explicit zero entries | 0 |
nonzero pattern symmetry | 23% |
numeric value symmetry | 1% |
type | real |
structure | unsymmetric |
Cholesky candidate? | no |
positive definite? | no |
author | USF |
editor | V. Batagelj |
date | 2006 |
kind | directed weighted graph |
2D/3D problem? | no |
Additional fields | size and type |
ps | full 10617-by-1 |
concreteness | full 10617-by-1 |
nodename | full 10617-by-19 |
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/. ------------------------------------------------------------------------------
SVD-based statistics: | |
norm(A) | 3.42358 |
min(svd(A)) | 0 |
cond(A) | Inf |
rank(A) | 5,018 |
null space dimension | 5,599 |
full numerical rank? | no |
singular value gap | 1.22052e+11 |
singular values (MAT file): | click here |
SVD method used: | s = svd (full (A)) ; |
status: | ok |
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.