CONTEST
CONTEST: A controllable test toolbox for MATLAB. 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.
This software is also peer reviewed by journal TOMS.
This software is also peer reviewed by journal TOMS.
Keywords for this software
References in zbMATH (referenced in 22 articles )
Showing results 1 to 20 of 22.
Sorted by year (- Boito, Paola; Eidelman, Yuli; Gemignani, Luca: Computing the reciprocal of a (\phi)-function by rational approximation (2022)
- Guo, Yongyan; Wu, Gang: A new lower bound on the size of the smallest vertex separator of a graph (2022)
- Higham, Nicholas J.; Mikaitis, Mantas: Anymatrix: an extensible MATLAB matrix collection (2022)
- Higham, Desmond J.; Mantzaris, Alexander V.: A network model for polarization of political opinion (2020)
- Arrigo, Francesca; Grindrod, Peter; Higham, Desmond J.; Noferini, Vanni: On the exponential generating function for non-backtracking walks (2018)
- Grindrod, Peter; Higham, Desmond J.; Noferini, Vanni: The deformed graph Laplacian and its applications to network centrality analysis (2018)
- Benzi, Michele; Simoncini, Valeria: Approximation of functions of large matrices with Kronecker structure (2017)
- Fenu, Caterina; Higham, Desmond J.: Block matrix formulations for evolving networks (2017)
- Fika, Paraskevi; Mitrouli, Marilena: Aitken’s method for estimating bilinear forms arising in applications (2017)
- Arrigo, Francesca; Benzi, Michele: Updating and downdating techniques for optimizing network communicability (2016)
- Arioli, Mario; Duff, Iain S.: Preconditioning linear least-squares problems by identifying a basis matrix (2015)
- Shao, Meiyue; Gao, Weiguo; Xue, Jungong: Aggressively truncated Taylor series method for accurate computation of exponentials of essentially nonnegative matrices (2014)
- Benzi, Michele; Kuhlemann, Verena: Chebyshev acceleration of the GeneRank algorithm (2013)
- Betcke, Timo; Higham, Nicholas J.; Mehrmann, Volker; Schröder, Christian; Tisseur, Françoise: NLEVP, a collection of nonlinear eigenvalue problems (2013)
- Fenu, C.; Martin, D.; Reichel, L.; Rodriguez, G.: Network analysis via partial spectral factorization and Gauss quadrature (2013)
- Wu, Gang; Xu, Wei; Zhang, Ying; Wei, Yimin: A preconditioned conjugate gradient algorithm for GeneRank with application to microarray data mining (2013)
- Wu, Gang; Zhang, Ying; Wei, Yimin: Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem (2013)
- Grindrod, Peter; Higham, Desmond J.: Models for evolving networks: with applications in telecommunication and online activities (2012)
- Davis, Timothy A.; Hu, Yifan: The University of Florida sparse matrix collection (2011)
- Benzi, Michele; Boito, Paola: Quadrature rule-based bounds for functions of adjacency matrices (2010)