Matrix: Newman/hep-th
Description: collaboration network, preprints in high-energy physics, www.arxiv.org
![]() |
| (undirected graph drawing) |
![]() |
![]() |
| Matrix properties | |
| number of rows | 8,361 |
| number of columns | 8,361 |
| nonzeros | 31,502 |
| # strongly connected comp. | 1,332 |
| explicit zero entries | 0 |
| nonzero pattern symmetry | symmetric |
| numeric value symmetry | symmetric |
| type | real |
| structure | symmetric |
| Cholesky candidate? | no |
| positive definite? | no |
| author | M. Newman |
| editor | M. Newman |
| date | 2001 |
| kind | undirected weighted graph |
| 2D/3D problem? | no |
| Additional fields | size and type |
| nodename | full 8361-by-24 |
Notes:
Network collection from M. Newman
http://www-personal.umich.edu/~mejn/netdata/
The grapu hep-th contains the collaboration network of scientists
posting preprints on the high-energy theory archive at www.arxiv.org,
1995-1999, as compiled by M. Newman. The network is weighted, with weights
assigned as described in the original papers. Please cite, as appropriate,
one or more of:
M. E. J. Newman, The structure of scientific collaboration networks,
Proc. Natl. Acad. Sci. USA 98, 404-409 (2001).
M. E. J. Newman, Scientific collaboration networks: I. Network
construction and fundamental results, Phys. Rev. E 64, 016131 (2001).
M. E. J. Newman, Scientific collaboration networks: II. Shortest paths,
weighted networks, and centrality, Phys. Rev. E 64, 016132 (2001).
| SVD-based statistics: | |
| norm(A) | 40.5189 |
| min(svd(A)) | 1.72951e-50 |
| cond(A) | 2.3428e+51 |
| rank(A) | 7,101 |
| null space dimension | 1,260 |
| full numerical rank? | no |
| singular value gap | 1.55908e+06 |
| 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.