Parallel algorithms for evaluating centrality indices in real-world networks

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2006, Pages 539-547

  Bader, David A ^a   Madduri, Kamesh ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CITATION NETWORKS; COMPLEX NETWORK ANALYSIS; LARGE SCALE NETWORKS; WEB GRAPHS;

BROADBAND NETWORKS; COMPUTER GRAPHICS; DATA STRUCTURES; MULTIPROCESSING SYSTEMS; NETWORK ARCHITECTURE; OPTIMIZATION; SOFTWARE PACKAGES;

PARALLEL ALGORITHMS;

EID: 34547438167     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2006.57     Document Type: Conference Paper

References (52)

1. D. Ajwani, R. Dementiev, and U. Meyer. A computational study of external-memory bfs algorithms. In Proc. 17th Ann. Symp. Discrete Algorithms (SODA-06), pages 601-610. ACM-SIAM, 2006.
2. Analytic Technologies. UCINET 6 social network analysis software, http://www.analytictech.com/ ucinet.htm.
3. D. Bader, G. Cong, and J. Feo. On the architectural requirements for efficient execution of graph algorithms. In Proc. 34th Int'l Conf. on Parallel Processing (ICPP), Oslo, Norway, June 2005.
4. D. Bader and K. Madduri. Designing multithreaded algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2. Technical report, Georgia Institute of Technology, Feb. 2006.
5. A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, October 1999.
6. V. Batagelj and A. Mrvar. Pajek - Program for large network analysis. Connections, 21(2):47-57, 1998.
7. A. Bavelas. Communication patterns in task oriented groups. J. Acoustical Soc. of America, 22:271-282, 1950.
8. U. Brandes. A faster algorithm for betweenness centrality. J. Mathematical Sociology, 25(2):163-177, 2001.
9. U. Brandes and T. Erlebach, editors. Network Analysis: Methodological Foundations, volume 3418 of Lecture Notes in Computer Science. Springer-Verlag, 2005.
10. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems, 30(1-7):107-117, 1998.
11. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web. Comp. Netw., 33(1-6):309-320, 2000.
12. N. Buckley and M. van Alstyne. Does email make white collar workers more productive. Technical report, University of Michigan, 2004.
13. D. Callaway, M. Newman, S. Strogatz, and D. Watts. Network robustness and fragility: percolation on random graphs. Physics Review Letters, 85:5468-5471, 2000.
14. L. Carter, J. Feo, and A. Snavely. Performance and programming experience on the Tera MTA. In Proc. SIAM Conf. on Parallel Processing for Scientific Computing, San Antonio, TX, Mar. 1999.
15. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In Proc. 4th SIAM Intl. Conf. on Data Mining, Florida, USA, Apr. 2004.
16. D. Cisic, B. Kesic, and L. Jakomin. Research of the power in the supply chain. International Trade, Economics Working Paper Archive EconWPA, April 2000.
17. T. Coffman, S. Greenblatt, and S. Marcus. Graph-based technologies for intelligence analysis. Communications of the ACM, 47(3):45-7, 2004.
18. R. Cohen, K. Erez, D. Ben-Avraham, and S. Havlin. Breakdown of the internet under intentional attack. Physics Review Letters, 86:3682-3685, 2001.
19. Cray Inc. The MTA-2 multithreaded architecture, http: //www.cray.com/products/systems/mta/.
20. A. del Sol, H. Fujihashi, and P. O'Meara. Topology of small-world networks of protein-protein complex structures. Bioinformatics, 21(8):1311-1315, 2005.
21. P. Doreian and L. Albert. Partitioning political actor networks: Some quantitative tools for analyzing qualitative networks. Quantitative Anthropology, 161:279-291, 1989.
22. D. Eppstein and J. Wang. Fast approximation of centrality. In Proc. 12th Ann. Symp. Discrete Algorithms (SODA-01), Washington, DC, 2001.
23. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On powerlaw relationships of the Internet topology. In Proc. ACM SIGCOMM, pages 251-262, 1999.
24. L. C. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40(1):35-41, 1977.
25. L. C. Freeman. The development of social network analysis: a study in the sociology of science. Booksurge Pub., 2004.
26. J.-L. Guillaume and M. Latapy. Bipartite graphs as models of complex networks. In Proc. 1st Int'l Workshop on Combinatorial and Algorithmic Aspects of Networking, 2004.
27. R. Guimera, S. Mossa, A. Turtschi, and L. Amaral. The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles. Proc. Nat. Academy of Sciences USA, 102(22):7794-7799, 2005.
28. D. R. Helman and J. JáJá. Prefix computations on symmetric multiprocessors. Journal of Parallel and Distributed Computing, 61(2):265-278, 2001.
29. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of American Statistical Association, 58:713-721, 1963.
30. H. Jeong, S. Mason, A.-L. Barabasi, and Z. Oltvai. Lethality and centrality in protein networks. Nature, 411:41, 2001.
31. V. Krebs. Mapping networks of terrorist cells. Connections, 24(3):43-52, 2002.
32. V. Krebs. InFlow 3.1 - Social network mapping software, 2005. http://www.orgnet.com.
33. F. Liljeros, C. R. Edling, L. A. N. Amaral, H. E. Stanley, and Y. Aberg. The web of human sexual contacts. Nature, 411:907, 2001.
34. Notredame CNet resources, http://www.nd.edu/ -networks.
35. M. Newman. Scientific collaboration networks: shortest paths, weighted networks and centrality. Physics Review E, 64, 2001.
36. M. Newman. The structure and function of complex networks. SIAM Review, 45(2): 167-256, 2003.
37. M. Newman, S. Strogatz, and D. Watts. Random graph models of social networks. Proceedings of the National Academy of Sciences USA, 99:2566-2572, 2002.
38. U. J. Nieminen. On the centrality in a directed graph. Social Science Research, 2:371-378, 1973.
39. PAJEK datasets. http://www.vlado.fmf.uni-lj. si/pub/networks/data/.
40. C. Palmer and J. Steffan. Generating network topologies that obey power laws. In Proc. ACM GLOBECOM, Nov. 2000.
41. J. Park, M. Penner, and V. Prasanna. Optimizing graph algorithms for improved cache performance. In Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2002), Fort Lauderdale, FL, Apr. 2002.
42. R. Pastor-Satorras and A. Vespignani. Epidemic spreading in scale-free networks. Physics Review Letters, 86:3200-3203, 2001.
43. J. Pinney, G. McConkey, and D. Westhead. Decomposition of biological networks using betweenness centrality. In Proc. Poster Session of the 9th Ann. Int'l Conf. on Research in Computational Molecular Biology (RECOMB 2004), Cambridge, MA, May 2005.
44. W. Richards. International network for social network analysis, 2005. http://www.insna.org.
45. W. Richards. Social network analysis software links, 2005. http://www.insna.org/INSNA/soft_ inf.html.
46. G. Sabidussi. The centrality index of a graph. Psychometrika, 31:581-603, 1966.
47. J. Scott. Social Network Analysis: A Handbook. SAGE Publications, 2000.
48. A. Shimbel. Structural parameters of communication networks. Mathematical Biophysics, 15:501-507, 1953.
49. University of Virginia. Oracle of Bacon, http://www. oracleofbacon.org.
50. S. Wasserman and K. Faust. Social Network Analysis: Methods and Applications. Cambridge Univ. Press, 1994.
51. D. Watts and S. Strogatz. Collective dynamics of small world networks. Nature, 393:440-442, 1998.
52. D. Zanette. Critical behavior of propagation on small-world networks. Physics Review E, 64, 2001.