Abstract
A new method for community discovery in a social network is presented. The proposed algorithm computes local maxima of an influence measure where influence of nodes is considered in both directions. A node has influence on others and a node is influenced by others. Network topology, and possible directed connections and unequal weights of nodes and links, are essential features of the model. Modeling can be adjusted by model parameters giving flexibility in various applications. Weaker connections give rise to more sub-communities where as stronger ties increase the cohesion of the community. The validity of the method is demonstrated by two different social networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Coscia, M., Giannotti, F., Pedreschi, D.: A classification for community discovery methods in complex networks. Stat. Anal. Data Min. 4(5), 512–546 (2011)
Freeman, L.C.: Centrality in social networks: conceptual clarification. Soc. Netw. 1, 215–239 (1979)
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. U S A. 99(12), 7821–7826 (2002)
Kempe, D., Kleinberg, J., Tardos, É.: Influential nodes in a diffusion model for social networks. In: Proceedings 32nd International Colloquium on Automata, Languages and Programming (2005)
Kernighan, B. W., Lin S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49 (1970)
Lancichinetti, A., Fortunato, S.: Community detection algorithms: a comparative analysis. Phys. Rev. E 80 (2009)
Lusseau, D.: The emergent properties of a dolphin social network. Proc. R. Soc. Lond. B Biol. Sci. 270, 186-188 (2003). (Newman M.E.J.: 271, 477–481 (2004))
Moreno, F., Min, B., Bo, L., Mari, R., Makse, H.A.: Collective influence algorithm to find influencers via optimal percolation in massively large social media. Sci. Rep. 6 (2016)
Newman, M.E.J.: Mixing patterns in networks. Phys. Rev. E 67(2) (2003)
Newman, M.E.J.: Detecting community structure in networks. Eur. Phys. J. B 38(2) (2004)
Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)
Newman, M.E.J.: Networks, An Introduction. Oxford University Press (2010)
Shen, H.-W., Cheng, X.-Q., Guo, J.-F.: Quantifying and identifying the overlapping community structure in networks. J. Stat. Mech. Theory Exp. (2009)
Shuo, L., Chai, B.: Discussion of the community detection algorithm based on statistical inference. Perspect. Sci. 7, 122–125 (2016)
Thakur, G.S., Tiwari, R., Thai, M.T., Chen, S.S., Dress, A.W.: Detection of local community structures in complex dynamic networks with random walks. IET Syst. Biol. 3(4), 266–278 (2009)
Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452–473 (1977)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Kuikka, V. (2018). Influence Spreading Model Used to Community Detection in Social Networks. In: Cherifi, C., Cherifi, H., Karsai, M., Musolesi, M. (eds) Complex Networks & Their Applications VI. COMPLEX NETWORKS 2017. Studies in Computational Intelligence, vol 689. Springer, Cham. https://doi.org/10.1007/978-3-319-72150-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-72150-7_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-72149-1
Online ISBN: 978-3-319-72150-7
eBook Packages: EngineeringEngineering (R0)