ACM Transactions on Mathematical Software (TOMS)
Sparse matrices in matlab: design and implementation
SIAM Journal on Matrix Analysis and Applications
Matrix market: a web resource for test matrix collections
Proceedings of the IFIP TC2/WG2.5 working conference on Quality of numerical software: assessment and enhancement
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
LAPACK Users' guide (third ed.)
LAPACK Users' guide (third ed.)
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Matlab guide
The degree sequence of a scale-free random graph process
Random Structures & Algorithms
Unravelling small world networks
Journal of Computational and Applied Mathematics - Special issue: Selected papers from the conference on computational and mathematical methods for science and engineering (CMMSE-2002) Alicante University, Spain, 20-25 september 2002
Spectral Segmentation with Multiscale Graph Decomposition
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Modeling interactome: scale-free or geometric?
Bioinformatics
Google's PageRank and Beyond: The Science of Search Engine Rankings
Google's PageRank and Beyond: The Science of Search Engine Rankings
A lock-and-key model for protein--protein interactions
Bioinformatics
The university of Florida sparse matrix collection
ACM Transactions on Mathematical Software (TOMS)
NLEVP: A Collection of Nonlinear Eigenvalue Problems
ACM Transactions on Mathematical Software (TOMS)
Data Mining and Knowledge Discovery
Accelerating the Arnoldi-Type Algorithm for the PageRank Problem and the ProteinRank Problem
Journal of Scientific Computing
Hi-index | 0.01 |
Large, sparse networks that describe complex interactions are a common feature across a number of disciplines, giving rise to many challenging matrix computational tasks. Several random graph models have been proposed that capture key properties of real-life networks. These models provide realistic, parametrized matrices for testing linear system and eigenvalue solvers. CONTEST (CONtrollable TEST matrices) is a random network toolbox for MATLAB that implements nine models. The models produce unweighted directed or undirected graphs; that is, symmetric or unsymmetric matrices with elements equal to zero or one. They have one or more parameters that affect features such as sparsity and characteristic pathlength and all can be of arbitrary dimension. Utility functions are supplied for rewiring, adding extra shortcuts and subsampling in order to create further classes of networks. Other utilities convert the adjacency matrices into real-valued coefficient matrices for naturally arising computational tasks that reduce to sparse linear system and eigenvalue problems.