The Community for Technology Leaders
RSS Icon
Issue No.02 - Feb. (2013 vol.24)
pp: 288-300
Alberto Montresor , University of Trento, Trento
Francesco De Pellegrini , CREATE-NET, Trento
Daniele Miorandi , CREATE-NET, Trento
Several novel metrics have been proposed in recent literature in order to study the relative importance of nodes in complex networks. Among those, k-coreness has found a number of applications in areas as diverse as sociology, proteinomics, graph visualization, and distributed system analysis and design. This paper proposes new distributed algorithms for the computation of the k-coreness of a network, a process also known as k-core decomposition. This technique 1) allows the decomposition, over a set of connected machines, of very large graphs, when size does not allow storing and processing them on a single host, and 2) enables the runtime computation of k-cores in “live” distributed systems. Lower bounds on the algorithms complexity are given, and an exhaustive experimental analysis on real-world data sets is provided.
Computational modeling, Peer to peer computing, Arrays, Protocols, Optimization, Proteins, Measurement, bulk synchronous parallel, k-Core decomposition, graph analysis
Alberto Montresor, Francesco De Pellegrini, Daniele Miorandi, "Distributed k-Core Decomposition", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 2, pp. 288-300, Feb. 2013, doi:10.1109/TPDS.2012.124
[1] A. Montresor, F. De Pellegrini, and D. Miorandi, "Brief Announcement: Distributed $k$ -Core Decomposition," Proc. 30th Ann. ACM SIGACT-SIGOPS Symp. Principles of Distributed Computing (PODC), pp. 207-208, June 2011.
[2] L. Freeman, "Centrality in Social Networks: Conceptual Clarification," Social Networks, no. 1, pp. 215-239, 1978.
[3] M. Newman, "The Structure and Function of Complex Networks," SIAM Rev., vol. 45, pp. 167-256, 2003.
[4] S. Seidman, "Network Structure and Minimum Degree," Social Networks, vol. 5, no. 3, pp. 269-287, 1983.
[5] V. Batagelj and M. Zaveršnik, "Fast Algorithms for Determining (Generalized) Core Groups in Social Networks," Advances in Data Analysis and Classification, vol. 5, pp. 129-145, 2011.
[6] J.I. Alvarez-Hamelin, L. Dall'Asta, A. Barrat, and A. Vespignani, "Large Scale Networks Fingerprinting and Visualization Using the $k$ -Core Decomposition," Proc. Advances in Neural Information Processing Systems 18, pp. 41-50, 2006.
[7] G. Bader and C. Hogue, "Analyzing Yeast Protein-Protein Interaction Data Obtained from Different Sources," Nature Biotechnology, vol. 20, no. 10, pp. 991-997, 2002.
[8] H. Zhang, H. Zhao, W. Cai, J. Liu, and W. Zhou, "Using the K-Core Decomposition to Analyze the Static Structure of Large-Scale Software Systems," The J. Supercomputing, vol. 53, pp. 352-369, 2010.
[9] S.N. Dorogovtsev, A.V. Goltsev, and J.F.F. Mendes, "k-Core Organization of Complex Networks," Physical Rev. Letters, vol. 96, p. 4, 2006.
[10] M. Kitsak, L.K. Gallos, S. Havlin, F. Liljeros, L. Muchnik, H. Stanley, and H. Makse, "Identification of Influential Spreaders in Complex Networks," Nature Physics, vol. 6, pp. 888-893, Nov. 2010.
[11] J.A. Patel, I. Gupta, and N. Contractor, "JetStream: Achieving Predictable Gossip Dissemination by Leveraging Social Network Principles," Proc. Int'l Symp. Network Computing and Applications (NCA '06), pp. 32-39, 2006.
[12] G. Malewicz, M.H. Austern, A.J. Bik, J.C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski, "Pregel: A System for Large-Scale Graph Processing," Proc. 28th ACM Symp. Principles of Distributed Computing (PODC '09), 2009.
[13] A. Lumsdaine, D. Gregor, B. Hendrickson, and J.W. Berry, "Challenges in Parallel Graph Processing," Parallel Processing Letters, vol. 17, pp. 5-20, 2007.
[14] J. Dean and S. Ghemawat, "MapReduce: Simplified Data Processing on Large Clusters," Comm. ACM, vol. 51, pp. 107-113, Jan. 2008.
[15] L.G. Valiant, "A Bridging Model for Parallel Computation," Comm. ACM, vol. 33, pp. 103-111, Aug. 1990.
[16] A.V. Gerbessiotis and L.G. Valiant, "Direct Bulk-Synchronous Parallel Algorithms," J. Parallel Distributed Computing, vol. 22, no. 2, pp. 251-267, Aug. 1994.
[17] T. Cheatham, A. Fahmy, D. Stefanescu, and L. Valiant, "Bulk Synchronous Parallel Computing-A Paradigm for Transportable Software," Proc. 28th Hawaii Int'l Conf. System Sciences, vol. 2, pp. 268-275, Jan. 1995.
[18] R. Lichtenwalter and N. Chawla, "DisNet: A Framework for Distributed Graph Computation," Proc. Int'l Conf. Advances in Social Networks Analysis and Mining (ASONAM), pp. 263-270, Jul. 2011.
[19] P. Stutz, A. Bernstein, and W. Cohen, "Signal/Collect: Graph Algorithms for the (Semantic) Web," Proc. Ninth Int'l Conf. Semantic Web (ISWC '10), pp. 764-780, 2010.
[20] E. Krepska, T. Kielmann, W. Fokkink, and H. Bal, "A High-Level Framework for Distributed Processing of Large-Scale Graphs," Proc. 12th Int'l Conf. Distributed Computing and Networking, pp. 155-166, 2011.
[21] E. Cáceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. Song, "Efficient Parallel Graph Algorithms for Coarse Grained Multicomputers and Bsp," Proc. 24th Int'l Colloquium Automata, Languages and Programming, P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, eds, pp. 390-400, 1997.
[22] M. Najork, D. Fetterly, A. Halverson, K. Kenthapadi, and S. Gollapudi, "Of Hammers and Nails: An Empirical Comparison of Three Paradigms for Processing Large Graphs," Proc. ACM Int'l Conf. Web Search and Data Mining (WSDM), 2012.
[23] J. Cheng, Y. Ke, S. Chu, and M. Ozsu, "Efficient Core Decomposition in Massive Networks," Proc. IEEE 27th Int'l Conf. Data Eng. (ICDE '11), pp. 51-62, Apr. 2011.
[24] M. Jelasity, A. Montresor, and O. Babaoglu, "Gossip-Based Aggregation in Large Dynamic Networks," ACM Trans. Computer Systems, vol. 23, no. 1, pp. 219-252, Aug. 2005.
[25] A. Montresor and M. Jelasity, "PeerSim: A Scalable P2P Simulator," Proc. Ninth Int'l Conf. Peer-to-Peer (P2P '09), pp. 99-100, Sept. 2009.
[26] A. Sala, L. Cao, C. Wilson, R. Zablit, H. Zheng, and B.Y. Zhao, "Measurement-Calibrated Graph Models for Social Network Experiments," Proc. 19th Int'l Conf. World Wide Web (WWW '10), pp. 861-870, 2010.
[27] S. Seo, E.J. Yoon, J.-H. Kim, S. Jin, J.-S. Kim, and S. Maeng, "HAMA: An Efficient Matrix Computation with the Mapreduce Framework," Proc. IEEE Second Int'l Conf. Cloud Computing Technology and Science (CloudCom '10), pp. 721-726, Nov. 2010.
[28] "GoldenOrb Web Site," http:/, 2012.
[29] "Giraph Web Site," http://incubator.apache.orggiraph/, 2012.
35 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool