Matrix: Pajek/ODLIS
Description: Pajek network: online dictionary of library & inf. sci
![]() |
![]() |
| (bipartite graph drawing) | (graph drawing of A+A') |
![]() |
![]() |
| Matrix properties | |
| number of rows | 2,909 |
| number of columns | 2,909 |
| nonzeros | 18,246 |
| # strongly connected comp. | 1,028 |
| explicit zero entries | 0 |
| nonzero pattern symmetry | 20% |
| numeric value symmetry | 20% |
| type | integer |
| structure | unsymmetric |
| Cholesky candidate? | no |
| positive definite? | no |
| author | J. Reitz |
| editor | V. Batagelj, A. Mrvar |
| date | 2000 |
| kind | directed multigraph |
| 2D/3D problem? | no |
| Additional fields | size and type |
| nodename | full 2909-by-79 |
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) | 36.3287 |
| min(svd(A)) | 0 |
| cond(A) | Inf |
| rank(A) | 1,959 |
| null space dimension | 950 |
| full numerical rank? | no |
| singular value gap | 2.69654e+12 |
| 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.