Abstract
Finding communities in structural networks (online social networks included) with sufficient accuracy is an important issue. We present a new method to identify communities that are in the same order of time complexity as the existing algorithms. In particular, we present an efficient algorithm using random walkers which, on a given network, generates a new network to better reveal the structures of the original network. We then use existing hierarchical clustering algorithms on the new network to find communities. We carry out simulations on both computer-generated data and the widely-used karate club data [10], and show that our algorithm can identify communities with much improved accuracy.
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.
Similar content being viewed by others
References
—. Six degrees of separation’s theory tested on facebook. Telegraph (August 17, 2011)
—. Six degrees of separation, Twitter style. Sysomos (April 30, 2010)
Barnett, E.: Facebook cuts six degrees of separation to four. Telegraph (November 22, 2011)
Burt, R.S.: Positions in networks. Social Forces 55(1), 93–122 (1976)
Fang, Z., Wang, J.: Efficient identifications of structural similarities for graphs. Journal of Combinatorial Optimization (May 2012), http://link.springer.com
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences 99(12), 7821–7826 (2002)
Kernighan, B.W., Lin, S.: An eflicient heuristic procedure for partitioning graphs. Bell System Technical Journal (1970)
Newman, M.E.J.: Detecting community structure in networks. The European Physical Journal B-Condensed Matter and Complex Systems 38(2), 321–330 (2004)
Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review EÂ 69(2), 026113 (2004)
Zachary, W.W.: An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 452–473 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Y., Wang, J., Liu, B., Liang, Q. (2013). Finding Network Communities Using Random Walkers with Improved Accuracy. In: Du, DZ., Zhang, G. (eds) Computing and Combinatorics. COCOON 2013. Lecture Notes in Computer Science, vol 7936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38768-5_73
Download citation
DOI: https://doi.org/10.1007/978-3-642-38768-5_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38767-8
Online ISBN: 978-3-642-38768-5
eBook Packages: Computer ScienceComputer Science (R0)