Abstract
In this paper scalable method for cluster analysis based on random walks is presented. The main aim of the algorithm introduced in this paper is to detect dense subgraphs. Provided method has additional feature. It identifies groups of vertices which are responsible for information spreading among found clusters. The algorithm is sensitive to vertices assignment uncertainty. It distinguishes groups of nodes which form sparse clusters. These groups are mostly located in places crucial for information spreading so one can control signal propagation between separated dense subgraphs by using algorithm provided in this work.
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
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, C., Lin, S., Yu, P.S.: On influential node discovery in dynamic social networks. In: SDM, pp. 636–647 (2014)
Doerr, B., Fouz, M., Friedrich, T.: Why rumors spread fast in social networks. Communications of the ACM 55(6), 70–75 (2012)
Fortunato, S.: Community detection in graphs. Complex Networks and Systems Lagrange Laboratory ISI Foundation (2010)
Ju, C., Cao, J., Zhang, W., Ji, M.: Influential node control strategy for opinion evolution on social networks. Abstract and Applied Analysis, Article ID 689495 (2013)
Kempe, D., Kleinberg, J., Tardos, É.: Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127–1138. Springer, Heidelberg (2005)
Pons, P., Latapy, M.: Computing communities in large networks using random walks (2005)
Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. P10008 (2008)
Newman, M.E.J.: Modularity and community structure in networks. PNAS 103(23), 8577–8582 (2006)
Newman, M.: http://www-personal.umich.edu/mejn/netdata/
van Dongen, S.M.: Graph clustering by flow simulation. PhD thesis, Universiteit Utrecht (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Wojtasiewicz, M., Ciesielski, K. (2015). Identifying Bridges for Information Spread Control in Social Networks. In: Aiello, L., McFarland, D. (eds) Social Informatics. SocInfo 2014. Lecture Notes in Computer Science(), vol 8852. Springer, Cham. https://doi.org/10.1007/978-3-319-15168-7_48
Download citation
DOI: https://doi.org/10.1007/978-3-319-15168-7_48
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15167-0
Online ISBN: 978-3-319-15168-7
eBook Packages: Computer ScienceComputer Science (R0)