CONTEST: A controllable test matrix toolbox for MATLAB

ACM Transactions on Mathematical Software

Volumn 35, Issue 4, 2009, Pages

  Taylor, Alan ^a   Higham, Desmond J ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

Clustering; Matrix computation; Preferential attachment; Random graph; Rewiring; Small world; Sparse matrix

Indexed keywords

CLUSTERING; MATRIX COMPUTATION; PREFERENTIAL ATTACHMENT; RANDOM GRAPH; REWIRING; SMALL-WORLD; SPARSE MATRIX;

EIGENVALUES AND EIGENFUNCTIONS; LARGE SCALE SYSTEMS; LINEAR SYSTEMS; MATLAB; MATRIX ALGEBRA; ONLINE SEARCHING;

GRAPH THEORY;

EID: 61349089223     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/1462173.1462175     Document Type: Article

References (65)

1. ABELLO, J., BUCHSBAUM, A., AND WESTBROOK, J. 1998. A functional approach to external graph algorithms. Lecture Notes in Computer Science, vol. 1461, 332-343.
2. ALBERT, R. AND BARABÁSI, A.-L. 2002. Statistical mechanics of complex networks. Rev. Modern Phys. 74, 47-97.
3. ALON, U. 2006. An Introduction to Systems Biology. Chapman and Hall/CRC, London.
4. ANDERSON, E., BAI, Z., BISCHOF, C., BLACKFORD, S., DEMMEL, J., DONGARRA, J., CROZ, J. D., GREENBAUM, A., HAMMARLING, S., MCKENNEY, A., AND SORENSEN, D. 1999.LAPACK Users' Guide, 3rd ed. SIAM, PA.
5. BARABÁSI, A.-L. AND ALBERT, R. 1999. Emergence of scaling in random networks. Sci. 286, 5439, 509-12.
6. BATAGELJ, V. AND BRANDES, U. 2005. Efficient generation of large random networks. Phys. Rev. E 71, 036113.
7. BOGINSKI, V., BUTENKO, S., AND PARDALOS, P. M. 2003. On structural properties of the market graph. In nnovations in Financial and Economic Networks A. Nagurney, Ed. Edward Elgar Publishers, 29-45.
8. BOISVEET, R., Pozo, R., REMINGTON, K., BAREETT, R., AND DONGAEEA, J. 1997. Matrix market: A Web resource for test matrix collections. In The Quality of Numerical Software: Assessment and Enhancement, R. Boisvert, Ed. Chapman and Hall, London, 125-137.
9. BOLLOBÁS, B. 1985. Random Graphs. Academic, London.
10. BOLLOBÁS, B., RIOEDAN, O., SPENCEE, J., AND TUSNÁDY, G. 2001. The degree sequence of a scale-free random graph process. Random Structures Algor. 18, 279-290.
11. BEODEE, A., KUMAE, R., MAGHOUL, F., RCAGHAVAN, P., RAJAGOPALAN, S., STATA, R., TOMKINS, A., AND WIENEE, J. 2000. Graph structure of the Web. Comput. Netw. 33, 309-320.
12. CHUNG, F. 1997. Spectral Graph Theory. American Mathematical Society, Providence, RI.
13. CONYON, M. J. AND MULDOON, M. R. 2006. The small world of corporate boards. J. Business Finance Account. 33, 1321-1343.
14. COUE, T., BENEZIT, F., AND SHI, J. 2005. Spectral segmentation with multiscale graph decomposition. In Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), vol. 2, 1124-1131.
15. DAVIS, T. 2007. The University of Florida sparse matrix collection. Tech. rep. CISE Department, REP-2007-298, University of Florida, USA.
16. DE SILVA, EAND STUMPF, M. 2005. Complex networks and simple models in biology. J. R. Soc. Interface 2, 419-430.
17. DE SILVA, E., THORNE, T., INGRAM, P., AGRAFIOT, I., SWIRE, J., WIUF, C., AND STUMPF, M. P. H. 2006. The effects of incomplete protein interaction data on structural and evolutionary inferences. BMC Biol. 4, 39.
18. DUFF, I. S., GEIMES, R. G., AND LEWIS, J. G. 1989. Sparse matrix test problems. ACM Trans. Math. Softw. 15, 1-14.
19. EEDÖS, PAND RENYI, A. 1959. On random graphs. Publ. Math. Debrecen 6, 290-297.
20. FAGIOLO, G. 2007. Clustering in complex directed networks. Phys. Rev. 76, 026107.
21. FALOUTSOS, M., FALOUTSOS, P., AND FALOUTSOS, C. 1999. On power-law relationships of the internet topology. Comput. Commun. Rev. 29, 251-262.
22. GILBEET, E. N. 1959. Random graphs. Ann. Math. Statist. 30, 1141-1144.
23. GILBEET, J. R., MOLEE, C., AND SCHEEIBEE, R. 1992. Sparse matrices in MATLAB: Design and implementation. SIAM J. Matrix Anal. Appl. 13, 333-356.
24. GEIMMETT, G. 1999. Percolation, 2nd ed. Springer.
25. GEINDEOD, P. 2002. Range-Dependent random graphs and their application to modeling large smal-world proteome datasets. Phys. Rev. E 66, 066702.
26. GEINDEOD, P., HIGHAM, D. J., AND KALNA, G. 2008. Periodic reordering. Tech. rep. 6, University of Strathclyde, Department of Mathematics.
27. HAN, J. D. H., DUPUY, D., BEETIN, N., CUSICK, M. E., AND M., V. 2005. Effect of sampling on topology predictions of protein-protein interaction networks. Nature Biotechnol. 23, 839-844.
28. HENDEICKSON, B. AND LELAND, R. 1994. The Chaco user's guide: Version 2.0. Tech. rep. SAND94-2692, Sandia National Laboratories, Albuquerque, NM.
29. HIGHAM, D. J. 2003. Unravelling small world networks. J. Comput. Appl. Math. 158, 61-74.
30. HIGHAM, D. J. 2005. Spectral reordering of a range-dependent weighted random graph. IMA J. Numer. Anal. 25, 443-457.
31. HIGHAM, D. J. AND HIGHAM, N. J. 2000. MATLAB Guide. Society for Industrial and Applied Mathematics, Philadelphia, PA.
32. HIGHAM, D. J., PEŽULJ, N., AND RAŠAJSKI, M. 2008. Fitting a geometric graph to a proteinprotein interaction network. Bioinf. 24, 1093-1099.
33. HU, Y. AND SCOTT, J. A. 2003. HSL-MC73: A fast multilevel Fiedler and profile reduction code. RAL-TR-2003-36, Numerical Analysis Group, Computational Science and Engineering Department, Rutherford Appleton Laboratory.
34. KAMPEE, L., BOZKUET, A., RYBACKI, K., GEISSLEE, A., GEEKEN, I., STEPHAN, K. E., AND KOTTEE, R. 2002. An introduction to CoCoMac-Online. The online-interface of the primate connectivity database CoCoMac. In Neuroscience Databases-A Practical Guide, R. Kötter, Ed. Kluwer Academic, Norwell, MA, 155-169.
35. KAUFFMAN, S. A. 1969. Metabolic stability and epigenesis in randomly constructed genetic nets. J. Theor. Biol. 22, 437-467.
36. KHANIN, R. AND WIT, E. 2006. How scale-free are gene networks? J. Comput. Biol. 13, 3, 810-818.
37. KISS, I. Z., GREEN, D. M., AND KAO, R. R. 2006. The network of sheep movements within Great Britain: Network properties and their implications for infectious disease spread. . Roy. Soc. Interface 3 669-677.
38. KLEINBERG, J. M. 2000. Navigation in a small world. Nature 406, 845.
39. LANGVILLE, A. N. AND MEYER, C. D. 2006. Google's Page Rank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton, NJ.
40. LOVÁSZ, L. 1996. Random walks on graphs: A survey. In Paul Erdös is Eighty, D. Miklós, V. T. Sós, and T. Szónyi, Eds. János Bolyai Mathematical Society, Budapest, 353-398.
41. MANGAN, S. AND ALON, U. 2003. Structure and function of the feed-forward loop network motif. Proc. Nat. Acad. Sci. 100, 11980-11985.
42. MANGAN, S., ZASLAVER, A., AND ALON, U. 2003. The coherent feedforward loop serves as a signsensitive delay element in transcription networks. J. Math. Biol. 334, 2, 197-204.
43. MILENKOVIC, T., LAI, J., AND PRZULJ, N. 2008. Graph Crunch: A tool for large network analyses. BMC Bioinf. 9, 70.
44. MILGRAM, S. 1967. The small world problem. Psychol. Today 2, 60-67.
45. MILO, R., ITZKOVITZ, S., KASHTAN, N., LEVITT, R., SHEN-ORR, S., AYZENSHTAT, I., SHEFFER, M., AND ALON, U. 2004. Superfamilies of evolved and designed networks. Sci. 303, 1538-1542.
46. MORRISON, J. L., BREITLING, R., HIGHAM, D. J., AND GILBERT, D. R. 2005. Generank: Using search engine technology for the analysis of microarray experiments. BMC Bioinf. 6, 233.
47. MORRISON, J. L., BREITLING, R., HIGHAM, D. J., AND GILBERT, D. R. 2006. A lock-and-key model for protein-protein interactions. Bioinf. 2, 2012-2019.
48. NEWMAN, M. E. J. 2004. Who is the best connected scientist? A study of scientific coauthorship networks. In Complex Networks, E. Ben-Nairn et al., Eds. Springer, 337-370.
49. NEWMAN, M. E. J., MOORE, C., AND WATTS, D. J. 2000. Mean-Field solution of the small-world network model. Phys. Rev. Lett. 84, 3201-3204.
50. NORRIS, J. R. 1997. Markov Chains. Cambridge University Press.
51. ONODY, R. N. AND DE CASTRO, P. A. 2004. Complex network study of Brazilian soccer players. Phys. Rev. E 70.
52. PAGE, L., BRIN, S., MOTWANI, R., AND WINOGRAD, T. 1998. The Page Rank citation ranking: Bringing order to the Web. Tech. rep., Stanford Digital Library Technologies Project.
53. PENROSE, M. 2003. Geometric Random Graphs. Oxford Univeristy Press.
54. PORTER, M. A., MUCHA, P. J., NEWMAN, M. E. J., AND WARMBRAND, C. M. 2005. A network analysis of committees in the United States House of Representatives. Proc. Nat. Acad. Sci. 102, 7057-7062.
55. PRŽULJ, N., CORNEIL, D. G., AND JURISICA, I. 2004. Modeling interactome: Scale-Free or geometric? Bioinf. 20, 18, 3508-3515.
56. PRŽULJ, N., CORNEIL, D. G., AND JURISICA, I. 2006. Efficient estimation of graphlet frequency distributions in protein-protein interaction networks. Bioinf. 22, 974-980.
57. PRK̈LJ, N. AND HIGHAM, D. J. 2006. Modeling protein-protein interaction networks via a stickiness index. J. Roy. Soc. Interface 3, 711-716.
58. SALATHÉ, M., MAY, R. M., AND BONHOEFFER, S. 2005. The evolution of network topology by selective removal. J. Roy. Soc. Interface 2, 533-536.
59. SPORNS, O. AND ZWI, J. D. 2004. The small world of the cerebral cortex. Neuroinf. 2, 145-162.
60. STUMPF, M. P. H., WIUF, C., AND MAY, R. M. 2005. Subnets of scale-free networks are not scale-free: Sampling properties of networks. Proc. Nat. Acad. Sci. 102, 4221-4224.
61. THOMAS, A., CANNINGS, R., MONK, N. A. M., AND CANNINGS, C. 2003. On the structure of protein-protein interaction networks. Biochem. Soc. Trans. 31, 1491-1496.
62. TITZ, B., SCHLESNER, M., AND UETZ, P. 2004. What do we learn from high-throughput protein interaction data? Expert Rev. Proteomics 1, 111-121.
63. WATTS, D. J. AND STROGATZ, S. H. 1998. Collective dynamics of 'small-world' networks. Nature 393, 440-442.
64. WILLIAMS, R. J., BERLOW, E. L., DUNNE, J. A., BAEABÁSI, A.-L., AND MAETINEZ, N. D. 2002. Two degrees of separation in complex food webs. Proc. Nat. Acad. Sci. 99, 12913-12916.
65. XENAEIOS, I., SALWINSKI, L., DUAN, X. J., HIGNEY, P., KIM, S. M., AND D., E. 2002. DIP, the database of interacting proteins: A research tool for studying cellular networks of protein interactions. Nucleic Acids Res. 30, 1, 303-305.