Matrix: Pajek/WorldCities
Description: Pajek network: world city network
![]() |
| (bipartite graph drawing) |
![]() |
![]() |
| Matrix properties | |
| number of rows | 315 |
| number of columns | 100 |
| nonzeros | 7,518 |
| structural full rank? | yes |
| structural rank | 100 |
| # of blocks from dmperm | 1 |
| # strongly connected comp. | 3 |
| explicit zero entries | 0 |
| nonzero pattern symmetry | 0% |
| numeric value symmetry | 0% |
| type | integer |
| structure | rectangular |
| Cholesky candidate? | no |
| positive definite? | no |
| author | P. Taylor, G. Gatalano |
| editor | V. Batagelj |
| date | 2004 |
| kind | weighted bipartite graph |
| 2D/3D problem? | no |
| Additional fields | size and type |
| service | full 100-by-1 |
| colname | full 100-by-19 |
| rowname | full 315-by-18 |
| servicecode | full 6-by-22 |
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/. ------------------------------------------------------------------------------ World Cities and Services - two-mode network http://www.lboro.ac.uk/gawc/datasets/da11.html Transformed in Pajek format by V. Batagelj, March 20, 2006 city-by-service matrix. service codes: 1 - accountancy 2 - advertising 3 - banking/finance 4 - insurance 5 - law 6 - management consultancy
| SVD-based statistics: | |
| norm(A) | 149.296 |
| min(svd(A)) | 2.26207 |
| cond(A) | 65.9999 |
| rank(A) | 100 |
| sprank(A)-rank(A) | 0 |
| null space dimension | 0 |
| full numerical rank? | yes |
| 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.