A Game Theory Inspired Approach to Stable Core Decomposition on Weighted Networks

IEEE Transactions on Knowledge and Data Engineering

Volumn 28, Issue 5, 2016, Pages 1105-1117

  Basu, Srinka ^a   Maulik, Ujjwal ^a  

^a JADAVPUR UNIVERSITY   (India)

Author keywords

Complex network analysis; Core structures; Game Theory; Stable core; Voting mechanism; Weighted core; Weighted network

Indexed keywords

COMPLEX NETWORKS; HIERARCHICAL SYSTEMS;

CORE STRUCTURE; STABLE CORE; VOTING MECHANISM; WEIGHTED CORE; WEIGHTED NETWORKS;

GAME THEORY;

EID: 84963811765     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2015.2508817     Document Type: Article

References (53)

1. S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, D.-U. Hwang, "Complex networks: Structure and dynamics, " Phys. Rep., vol. 424, no. 45, pp. 175-308, 2006.
2. P. Hagmann, L. Cammoun, X. Gigandet, R. Meuli, C. J. Honey, V. J. Wedeen, O. Sporns, "Mapping the structural core of human cerebral cortex, " PLoS Biol., vol. 6, no. 7, p. 159, 2008.
3. M. Ekman, J. Derrfuss, M. Tittgemeyer, C. J. Fiebach, "Predicting errors from reconfiguration patterns in human brain networks, " Proc. Nat. Acad. Sci., vol. 109, no. 41, pp. 16 714-16 719, 2012.
4. R. Sharan, I. Ulitsky, R. Shamir, "Network-based prediction of protein function, " Molecular Syst. Biol., vol. 3, no. 1, 2007, Doi: 10. 1038/msb4100129.
5. G. D. Bader and C. W. Hogue, "An automated method for finding molecular complexes in large protein interaction networks, " BMC Bioinformat., vol. 4, no. 1, p. 2, 2003.
6. J.-H. Lin, Q. Guo, W.-Z. Dong, L.-Y. Tang, J.-G. Liu, "Identifying the node spreading influence with largest k-core values, " Phys. Lett. A, vol. 378, no. 45, pp. 3279-3284, 2014.
7. B. Corominas-Murtra, B. Fuchs, S. Thurner, "Detection of the elite structure in a virtual multiplex social system by means of a generalised k-core, " PloS One, vol. 9, no. 12, p. e112606, 2014.
8. C. Giatsidis, D. M. Thilikos, M. Vazirgiannis, "Evaluating cooperation in communities with the k-core structure, " in Proc. Int. Conf. Adv. Soc. Netw. Anal. Mining, 2011, pp. 87-93.
9. M. Newman, "The structure of scientific collaboration networks, " Proc. Nat. Acad. Sci., vol. 98, no. 2, pp. 404-409, 2001.
10. J. Moody, "The structure of a social science collaboration network: Disciplinary cohesion from 1963 to 1999, " Am. Sociol. Rev., vol. 69, no. 2, pp. 213-238, 2004.
11. S. Battiston, M. Puliga, R. Kaushik, P. Tasca, G. Caldarelli, "Debtrank: Too central to fail? Financial networks, the fed and systemic risk, " Sci. Rep., Nature publishing group, vol. 2, 2012, Doi: 10. 1038/srep00541.
12. J. I. Alvarez-Hamelin, L. Dall'Asta, A. Barrat, A. Vespignani, "k-core decomposition of internet graphs: Hierarchies, self-similarity and measurement biases, " arXiv preprint cs/0511007, 2005.
13. D. R. Wuellner, S. Roy, R. M. DSouza, "Resilience and rewiring of the passenger airline networks in the united states, " Phys. Rev. E, vol. 82, no. 5, p. 056101, 2010.
14. Z. Xiangyu, L. Feng, Y. Rui, Z. XueMin, M. Shengwei, Z. Zhen'an, L. Xiaomeng, "Identification of key transmission lines in power grid using modified k-core decomposition, " in Proc. 3rd Int. Conf. Elect. Power Energy Conversion Syst., 2013, pp. 1-6.
15. J. I. Alvarez-Hamelin, L. Dall'Asta, A. Barrat, A. Vespignani, "k-core decomposition: A tool for the visualization of large scale networks, " arXiv preprint cs/0504107, 2005.
16. S. B. Seidman, "Network structure and minimum degree, " Soc. Netw., vol. 5, no. 3, pp. 269-287, 1983.
17. M. Eidsaa and E. Almaas, "s-core network decomposition: A generalization of k-core analysis to weighted networks, " Phys. Rev. E, vol. 88, p. 062819, Dec. 2013.
18. S. Dorogovtsev, A. Goltsev, J. Mendes, "k-core organization of complex networks, " Phys. Rev. Lett., vol. 96, pp. 040 601-040 604, Feb 2006.
19. A. Adiga and A. Vullikanti, "How robust is the core of a network?" in Proc. Eur. Conf. Mach. Learn. Knowl. Discovery Databases, 2013, vol. 8188, pp. 541-556.
20. A. Garas, F. Schweitzer, S. Havlin, "A k-shell decomposition method for weighted networks, " New J. Phys., vol. 14, no. 8, p. 083030, 2012.
21. H. Alvari, S. Hashemi, A. Hamzeh, "Discovering overlapping communities in social networks: A novel game-theoretic approach, " AI Commun., vol. 26, no. 2, pp. 161-177, 2013.
22. S. H. Yook, H. Jeong, A.-L. Barab-asi, Y. Tu, "Weighted evolving networks, " Phys. Rev. Lett., vol. 86, pp. 5835-5838, 2001.
23. A. Barrat, M. Barth-elemy, A. Vespignani, "Weighted evolving networks: coupling topology and weight dynamics, " Phys. Rev. Lett., vol. 92, no. 22, p. 228701, 2004.
24. C. Aicher, A. Z. Jacobs, A. Clauset. (2013). Adapting the stochastic block model to edge-weighted networks. CoRR, vol. abs/1305. 5782, 2013 [Online]. Available: http://arxiv. org/abs/1305. 5782
25. R. G. Michael and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA, USA: Freeman, 1979.
26. D. Aloise, S. Cafieri, G. Caporossi, P. Hansen, S. Perron, L. Liberti, "Column generation algorithms for exact modularity maximization in networks, " Phys. Rev. E, vol. 82, pp. 046112-046120, 2010.
27. W. Chen, A. Dress, W. Yu, "Community structures of networks, " Math. Comput. Sci., vol. 1, no. 3, pp. 441-457, 2008.
28. J. Pattillo, N. Youssef, S. Butenko, "Clique relaxation models in social network analysis, " in Handbook Optimization in Complex Netw., New York. NY, USA: Springer, pp. 143-162, 2012.
29. V. Batagelj and M. Zaversnik. (2003). An o(m) algorithm for cores decomposition of networks. CoRR [Online]. cs. DS/0310049. Available: http://arxiv. org/abs/cs. DS/0310049
30. R.-H. Li, J. Yu, R. Mao, "Efficient core maintenance in large dynamic graphs, " IEEE Trans. Knowl. Data Eng., vol. 26, no. 10, pp. 2453-2465, Oct. 2014.
31. H. Jeong, S. P. Mason, A.-L. Barab-asi, Z. N. Oltvai, "Lethality and centrality in protein networks, " Nature, vol. 411, no. 6833, pp. 41-42, 2001.
32. R. Albert and A.-L. Barab-asi, "Statistical mechanics of complex networks, " Rev. Mod. Phys., vol. 74, pp. 47-97, Jan. 2002.
33. J. I. Alvarez-Hamelin, L. Dall'Asta, A. Barrat, A. Vespignani, "Large scale networks fingerprinting and visualization using the k-core decomposition, " in Proc. Adv. Neural Inf. Process. Syst., 2005, pp. 41-50.
34. G. D. Bader and C. W. Hogue, "An automated method for finding molecular complexes in large protein interaction networks, " BMC Bioinformat., vol. 4, no. 1, p. 2, 2003.
35. S. Wachi, K. Yoneda, R. Wu, "Interactome-transcriptome analysis reveals the high centrality of genes differentially expressed in lung cancer tissues, " Bioinformatics, vol. 21, no. 23, pp. 4205-4208, 2005.
36. M. Kitsak, L. K. Gallos, S. Havlin, F. Liljeros, L. Muchnik, H. E. Stanley, H. A. Makse, "Identification of influential spreaders in complex networks, " Nature Phys., vol. 6, no. 11, pp. 888-893, 2010.
37. D. Garcia, P. Mavrodiev, F. Schweitzer, "Social resilience in online communities: The autopsy of friendster, " in Proc. 1st ACM Conf. Online Soc. Netw., 2013, pp. 39-50.
38. J. Pattillo, A. Veremyev, S. Butenko, V. Boginski, "On the maximum quasi-clique problem, " Discrete Appl. Math., vol. 161, no. 12, pp. 244-257, 2013.
39. T. Uno, "An efficient algorithm for enumerating pseudo cliques, " in Proc. 18th Int. Conf. Algorithms Comput., 2007, vol. 4835, pp. 402-414.
40. J. Abello, M. Resende, S. Sudarsky, "Massive quasi-clique detection, " in LATIN 2002: Theoretical Informatics, S. Rajsbaum, Ed. Berlin, Germany: Springer, 2002, vol. 2286, pp. 598-612.
41. F. Mahdavi Pajouh, Z. Miao, B. Balasundaram, "A branchand-bound approach for maximum quasi-cliques, " Ann. Oper. Res., pp. 1-17, 2012.
42. C. Tsourakakis, F. Bonchi, A. Gionis, F. Gullo, M. Tsiarli, "Denser than the densest subgraph: Extracting optimal quasi-cliques with quality guarantees, " in Proc. 19th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2013, pp. 104-112.
43. J. M. Kleinberg, "Authoritative sources in a hyperlinked environment, " J. ACM, vol. 46, no. 5, pp. 604-632, 1999.
44. D. Wang, C. Song, A.-L. Barab-asi, "Quantifying long-term scientific impact, " Science, vol. 342, no. 6154, pp. 127-132, 2013.
45. H. Liao, R. Xiao, G. Cimini, M. Medo, "Network-driven reputation in online scientific communities, " PloS One, vol. 9, no. 12, p. e112022, 2014.
46. D. Gfeller, J.-C. Chappelier, P. De Los Rios, "Finding instabilities in the community structure of complex networks, " Phys. Rev. E, vol. 72, pp. 056 135-056 140, Nov. 2005.
47. L. Ana and A. Jain, "Robust data clustering, " in Proc. IEEE Comput. Soc. Conf. Comput. Vis. Pattern Recog., Jun. 2003, vol. 2, pp. II-128-II-133.
48. D. E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing. Reading, MA, USA: Addison-Wesley, 1993, vol. 37.
49. J. Kunegis, "Konect: The koblenz network collection, " in Proc. 22nd Int. Conf. World Wide Web Companion, 2013, pp. 1343-1350.
50. (2014, Oct. ). King james network dataset-KONECT[Online]. Available: http://konect. uni-koblenz. de/networks/moreno-names
51. T. Opsahl and P. Panzarasa, "Clustering in weighted networks, " Soc. Netw., vol. 31, no. 2, pp. 155-163, 2009.
52. N. Beebe. (2002). Nelson h. f. beebe's bibliographies page [Online]. Available: http://www. math. utah. edu/beebe/bibliographies. html
53. M. Newman, "Scientific collaboration networks ii. shortest paths, weighted networks, centrality, " Phys. Rev. E, vol. 64, pp. 016 132-016 138, Jun. 2001.