Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3201064.3201075acmconferencesArticle/Chapter ViewAbstractPublication PageswebsciConference Proceedingsconference-collections
research-article
Public Access

Uncovering the Nucleus of Social Networks

Published: 15 May 2018 Publication History

Abstract

Many social network studies have focused on identifying communities through clustering or partitioning a large social network into smaller parts. While community structure is important in social network analysis, relatively little attention has been paid to the problem of "core structure'' analysis in many social networks. Intuitively, one may expect that many social networks possess some sort of a "core'' which holds various parts of the network (or constituent "communities'' ) together. We believe that it is just as important to uncover and extract the "core'' structure -- referred to as the "nucleus'' in this paper -- of a social network as to identify its community structure. In this paper, we propose a scalable and effective procedure to uncover the "nucleus'' of social networks by building upon and generalizing ideas from the existing k-shell decomposition approach. We employ our approach to uncover the nucleus in several example communication, collaboration, interaction, location-based and online social networks. Our methodology is very scalable and can also be applied to massive networks (hundreds million nodes and billion edges).

References

[1]
{n. d.}. Pretty Good Privacy network dataset -- KONECT.
[2]
{n. d.}. Stanford Large Network Dataset Collection. https://snap.stanford.edu/ data/.
[3]
2016. DNC emails co-recipients network dataset -- KONECT. http://konect.
[4]
2016. Facebook friendships network dataset -- KONECT. http://konect.
[5]
2016. Jazz musicians network dataset -- KONECT. http://konect.uni-koblenz.de/ networks/arenas-jazz.
[6]
Yong-Yeol Ahn, James P Bagrow, and Sune Lehmann. 2010. Link communities reveal multiscale complexity in networks. Nature 466, 7307 (2010), 761--764.
[7]
José Ignacio Alvarez-Hamelin, Luca Dall'Asta, Alain Barrat, and Alessandro Vespignani. 2005. K-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases. arXiv preprint cs/0511007 (2005).
[8]
J Ignacio Alvarez-Hamelin, Luca Dall'Asta, Alain Barrat, and Alessandro Vespignani. 2006. Large scale networks fingerprinting and visualization using the k-core decomposition. In Advances in neural information processing systems. 41--50.
[9]
Reid Andersen, Fan Chung, and Kevin Lang. 2006. Local graph partitioning using pagerank vectors. In Foundations of Computer Science, 2006. FOCS'06. 47th Annual IEEE Symposium on. IEEE, 475--486.
[10]
Vladimir Batagelj and Matjaž Zaveršnik. 2002. Generalized cores. arXiv preprint cs/0202039 (2002).
[11]
Marian Boguna, Romualdo Pastor-Satorras, Albert Diaz-Guilera, and Alex Arenas. 2004. Models of Social Networks based on Social Distance Attachment. Phys. Rev. E 70, 5 (2004), 056122.
[12]
Phillip Bonacich. 1987. Power and centrality: A family of measures. American journal of sociology 92, 5 (1987), 1170--1182.
[13]
Stephen P Borgatti and Martin G Everett. 2000. Models of core/periphery structures. Social networks 21, 4 (2000), 375--395.
[14]
Ulrik Brandes. 2001. A faster algorithm for betweenness centrality. Journal of mathematical sociology 25, 2 (2001), 163--177.
[15]
Shai Carmi, Shlomo Havlin, Scott Kirkpatrick, Yuval Shavitt, and Eran Shir. 2007. A model of Internet topology using k-shell decomposition. Proceedings of the National Academy of Sciences 104, 27 (2007), 11150--11154.
[16]
Marcio Rosa Da Silva, Hongwu Ma, and An-Ping Zeng. 2008. Centrality, network capacity, and modularity as parameters to analyze the core-periphery structure in metabolic networks. Proc. IEEE 96, 8 (2008), 1411--1420.
[17]
Fabio Della Rossa, Fabio Dercole, and Carlo Piccardi. 2013. Profiling coreperiphery network structure by random walkers. Scientific reports 3 (2013), 1467.
[18]
Patrick Doreian. 1985. Structural equivalence in a psychology journal network. Journal of the American Society for Information Science 36, 6 (1985), 411--417.
[19]
Braulio Dumba, Golshan Golnari, and Zhi-Li Zhang. 2016. Analysis of a Reciprocal Network Using Google+: Structural Properties and Evolution. In International Conference on Computational Social Networks. Springer, 14--26.
[20]
Braulio Dumba and Zhi-Li Zhang. 2016. Unfolding the Core Structure of the Reciprocal Graph of a Massive Online Social Network. In International Conference on Combinatorial Optimization and Applications. Springer, 763--771.
[21]
Maksym Gabielkov, Ashwin Rao, and Arnaud Legout. 2014. Studying social networks at scale: macroscopic anatomy of the twitter social graph. In ACM SIGMETRICS Performance Evaluation Review, Vol. 42. ACM, 277--288.
[22]
Jing Gao, Feng Liang, Wei Fan, Chi Wang, Yizhou Sun, and Jiawei Han. 2010. On community outliers and their efficient detection in information networks. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 813--822.
[23]
Antonios Garas, Panos Argyrakis, Céline Rozenblat, Marco Tomassini, and Shlomo Havlin. 2010. Worldwide spreading of economic crisis. New journal of Physics 12, 11 (2010), 113043.
[24]
Antonios Garas, Frank Schweitzer, and Shlomo Havlin. 2012. A k-shell decomposition method for weighted networks. New Journal of Physics 14, 8 (2012), 083030.
[25]
Pablo M. Gleiser and Leon Danon. 2003. Community Structure in Jazz. Advances in Complex Systems 6, 4 (2003), 565--573.
[26]
Roberto Gonzalez, Ruben Cuevas, Reza Motamedi, Reza Rejaie, and Angel Cuevas. 2013. Google+ or google-?: dissecting the evolution of the new osn in its first year. In Proceedings of the 22nd international conference on World Wide Web. ACM, 483--494.
[27]
Petter Holme. 2005. Core-periphery organization of complex networks. Physical Review E 72, 4 (2005), 046111.
[28]
Maksim Kitsak, Lazaros K Gallos, Shlomo Havlin, Fredrik Liljeros, Lev Muchnik, H Eugene Stanley, and Hernán A Makse. 2010. Identification of influential spreaders in complex networks. Nature physics 6, 11 (2010), 888--893.
[29]
Jerome Kunegis. 2013. KONECT -- The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion. 1343--1350. http://userpages.unikoblenz.de/~kunegis/paper/kunegis-koblenz-network-collection.pdf
[30]
Jure Leskovec, Kevin J Lang, Anirban Dasgupta, and Michael W Mahoney. 2008. Statistical properties of community structure in large social and information networks. In Proceedings of the 17th international conference on World Wide Web. ACM, 695--704.
[31]
Julian J McAuley, Luciano da Fontoura Costa, and Tibério S Caetano. 2007. Richclub phenomenon across complex network hierarchies. Applied Physics Letters 91, 8 (2007), 084103.
[32]
Daniele Miorandi and Francesco De Pellegrini. 2010. K-shell decomposition for dynamic complex networks. In Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 2010 Proceedings of the 8th International Symposium on. IEEE, 488--496.
[33]
Alan Mislove, Massimiliano Marcon, Krishna P Gummadi, Peter Druschel, and Bobby Bhattacharjee. 2007. Measurement and analysis of online social networks. In Proceedings of the 7th ACM SIGCOMM conference on Internet measurement. ACM, 29--42.
[34]
Mark Newman. 2010. Networks: an introduction. Oxford university press.
[35]
Mark EJ Newman. 2004. Detecting community structure in networks. The European Physical Journal B-Condensed Matter and Complex Systems 38, 2 (2004), 321--330.
[36]
Mark EJ Newman. 2004. Fast algorithm for detecting community structure in networks. Physical review E 69, 6 (2004), 066133.
[37]
Mark EJ Newman. 2006. Finding community structure in networks using the eigenvectors of matrices. Physical review E 74, 3 (2006), 036104.
[38]
Spiros Papadimitriou, Jimeng Sun, Christos Faloutsos, and S Yu Philip. 2008. Hierarchical, parameter-free community discovery. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 170--187.
[39]
M Puck Rombach, Mason A Porter, James H Fowler, and Peter J Mucha. 2014. Core-periphery structure in networks. SIAM Journal on Applied mathematics 74, 1 (2014), 167--190.
[40]
Martin Rosvall and Carl T Bergstrom. 2007. An information-theoretic framework for resolving community structure in complex networks. Proceedings of the National Academy of Sciences 104, 18 (2007), 7327--7331.
[41]
Diego F Rueda, Eusebi Calle, and Jose L Marzo. 2017. Robustness comparison of 15 real telecommunication networks: Structural and centrality measurements. Journal of Network and Systems Management 25, 2 (2017), 269--289.
[42]
Gert Sabidussi. 1966. The centrality index of a graph. Psychometrika 31, 4 (1966), 581--603.
[43]
Murray Shanahan and Mark Wildie. 2012. Knotty-centrality: finding the connective core of a complex network. PLoS One 7, 5 (2012), e36579.
[44]
Georgos Siganos, Sudhir Leslie Tauro, and Michalis Faloutsos. 2006. Jellyfish: A conceptual model for the as internet topology. Journal of Communications and Networks 8, 3 (2006), 339--350.
[45]
Lei Tang and Huan Liu. 2010. Community detection and mining in social media. Synthesis lectures on data mining and knowledge discovery 2, 1 (2010), 1--137.
[46]
Bimal Viswanath, Alan Mislove, Meeyoung Cha, and Krishna P. Gummadi. 2009. On the Evolution of User Interaction in Facebook. In Proc. Workshop on Online Social Networks. 37--42.
[47]
Liaoruo Wang, John Hopcroft, Jing He, Hongyu Liang, and Supasorn Suwajanakorn. 2013. Extracting the core structure of social networks using (α, β )communities. Internet Mathematics 9, 1 (2013), 58--81.
[48]
Bo Wei, Jie Liu, Daijun Wei, Cai Gao, and Yong Deng. 2015. Weighted k-shell decomposition for complex networks based on potential edge weights. Physica A: Statistical Mechanics and its Applications 420 (2015), 277--283.
[49]
Jaewon Yang and Jure Leskovec. 2012. Structure and overlaps of communities in networks. arXiv preprint arXiv:1205.6228 (2012).
[50]
Tianbao Yang, Rong Jin, Yun Chi, and Shenghuo Zhu. 2009. Combining link and content for community detection: a discriminative approach. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 927--936.
[51]
Shi Zhou and Raúl J Mondragón. 2004. The rich-club phenomenon in the Internet topology. IEEE Communications Letters 8, 3 (2004), 180--182.

Cited By

View all
  • (2019)Random Spatial Network Models for Core-Periphery StructureProceedings of the Twelfth ACM International Conference on Web Search and Data Mining10.1145/3289600.3290976(366-374)Online publication date: 30-Jan-2019
  • (2019)Node differentiation protection concerning model of localized attack on real networksPhysica A: Statistical Mechanics and its Applications10.1016/j.physa.2019.04.183Online publication date: Apr-2019

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
WebSci '18: Proceedings of the 10th ACM Conference on Web Science
May 2018
399 pages
ISBN:9781450355636
DOI:10.1145/3201064
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 May 2018

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. k-shell decomposition
  2. network core
  3. social network

Qualifiers

  • Research-article

Funding Sources

Conference

WebSci '18
Sponsor:
WebSci '18: 10th ACM Conference on Web Science
May 27 - 30, 2018
Amsterdam, Netherlands

Acceptance Rates

WebSci '18 Paper Acceptance Rate 30 of 113 submissions, 27%;
Overall Acceptance Rate 245 of 933 submissions, 26%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)50
  • Downloads (Last 6 weeks)9
Reflects downloads up to 20 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2019)Random Spatial Network Models for Core-Periphery StructureProceedings of the Twelfth ACM International Conference on Web Search and Data Mining10.1145/3289600.3290976(366-374)Online publication date: 30-Jan-2019
  • (2019)Node differentiation protection concerning model of localized attack on real networksPhysica A: Statistical Mechanics and its Applications10.1016/j.physa.2019.04.183Online publication date: Apr-2019

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media