Computing centrality is a foundational concept in social networking that involves finding the most "central" or important nodes. In some biological networks, defining importance is difficult, which then creates challenges in finding an appropriate centrality algorithm. Through tests on three biological networks, the authors of this article demonstrate evident and balanced correlations with the results of these k algorithms. They also improve its speed through GPU parallelism. The results show iteration to be a powerful technique that can eliminate spatial bias among central nodes, increasing the level of agreement between algorithms with various importance definitions. GPU parallelism improves speed and makes iteration a tractable problem for larger networks. (publisher abstract modified)
Downloads
Similar Publications
- Discussion of the FTCOE’s Guidance Document on Considerations for Photographic Documentation in Sexual Assault Cases
- Raman Spectroscopy to Determine the Time Since Deposition of Heated Bloodstains
- Experimental Results on Data Analysis Algorithms for Extracting and Interpreting Edge Feature Data for Duct Tape and Textile Physical Fit Examinations