Abstract
This paper aims to obtain a better characterization of “weak ties”, edges between communities in a network. Community detection has been, for the last decade, one of the major topics in network science, with applications ranging from e-commerce in social networks or web page characterizations, up to control and engineering problems. There are many methods, which characterize, how well a network is split into communities or clusters, and a set of methods, based on a wide range set of principles, have been designed to find such communities. In a network, where nodes and edges are characterized only by their topological properties, communities are characterized only by being densely internally connected by edges, while edges between communities are scarce. Usually, the most convenient method how to find the in-between edges is to use the community detection methods to find the communities and from them the edges between them. However, the sole characterization of these edges, “weak ties”, is missing. When such characterization is mentioned, typically it is based on high value of edge betweenness, i.e. number of shortest paths going through the edge. While this is mostly valid for networks characterized by a high modularity value, it is very often misleading. Search for a community detection resulting in maximum modularity value is an NP complete problem, and since the selection of weak ties characterizes the communities, their selection is an NP complete problem as well. One can only hope to find a good heuristic. In our paper, we show, to what extent the high edge betweenness characterization is misleading and we design a method, which better characterizes the “weak tie” edges.
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
Barabási, A.-L., Pósfai, M.: Network Science. Cambridge University Press, Cambridge (2016). See also http://barabasi.com/networksciencebook. Accessed 7 Apr 2017
Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech: Theory Exp. 2008, P10008 (2008)
Brandes, U., Delling, D., Gaertler, M., Görke, R., Hoefer, M., Nikoloski, Z., Wagner, D.: On modularity-NP-completeness and beyond. Faculty of Informatics, Universität Karlsruhe (TH), Technical report a 2006-19 (2006)
Brandes, U., Delling, D., Gaertler, M., Görke, R., Hoefer, M., Nikoloski, Z., Wagner, D.: On modularity clustering. IEEE Trans. Knowl. Data Eng. 20(2), 172–188 (2008)
Cao, H., Mo, R., Wan, N., Shang, F., Li, C., Zhang, D.: A subassembly identification method for truss structures manufacturing based on community detection. Assem. Autom. 35(3), 249–258 (2015)
Duijn, P.A., Klerks, P.P.: Social network analysis applied to criminal networks: recent developments in Dutch law enforcement. In: Masys, A.J. (ed.) Networks and Network Analysis for Defence and Security, pp. 121–159. Springer, Heidelberg (2014)
Friedman, E.J., Landsberg, A.S., Owen, J., Hsieh, W., Kam, L., Mukherjee, P.: Edge correlations in spatial networks. J. Complex Netw. 4(1), 1–14 (2016)
Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99, 7821–7826 (2002)
Giustolisi, O., Ridolfi, L.: A novel infrastructure modularity index for the segmentation of water distribution networks. Water Resour. Res. 50(10), 7648–7661 (2014)
Granovetter, M.S.: The strength of weak ties. Amer. J. Sociol. 78(6), 1360–1380 (1973)
Huraj, L., Siládi, V.: Authorization through trust chains in ad hoc grids. In: Proceedings of the 2009 Euro American Conference on Telematics and Information Systems: New Opportunities to Increase Digital Citizenship, p. 13. ACM (2009)
Korytar, M., Gabriska, D.: Integrated security levels and analysis of their implications to the maintenance. J. Appl. Math. Stat. Inf. 10(2), 33–42 (2014)
Liu, Y., Liu, T., Li, Q., Hu, X.: Power system black-start recovery subsystems partition based on improved CNM community detection algorithm. In: Shao F., Shu W., Tian, T. (eds.) Proceedings of the 2015 International Conference on Electric, Electronic and Control Engineering (ICEECE 2015), pp. 183–189. CRC Press (2015). Chapter 33
Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. U.S.A. 103(23), 8577–8696 (2006)
Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)
Qian, Y., Li, Y., Zhang, M., Ma, G., Lu, F.: Quantifying edge significance on maintaining global connectivity. Sci. Rep. 7, 45380 (2017)
Read, R.C., Wilson, R.J.: An Atlas of Graphs (Mathematics). Oxford University Press, Oxford (2005)
Schaub, M.T., Lehmann, J., Yaliraki, S.N., Barahona, M.: Structure of complex networks: quantifying edge-to-edge relations by failure-induced flow redistribution. Netw. Sci. 2(1), 66–89 (2014)
Šimon, M., Huraj, L., Čerňanský, M.: Performance evaluations of IPTables firewall solutions under DDoS attacks. J. Appl. Math. Stat. Inf. 11(2), 35–45 (2015)
Yeum, C.M., Dyke, S.J.: Vision-based automated crack detection for bridge inspection. Comput. Aided Civ. Infrastruct. Eng. 30(10), 759–770 (2015)
Acknowledgement
This research was supported by a grant SK-SRB-2016-0003 of Slovak Research and Development Agency.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Luptáková, I.D., Šimon, M., Pospíchal, J. (2019). Weak Ties and How to Find Them. In: Matoušek, R. (eds) Recent Advances in Soft Computing . MENDEL 2017. Advances in Intelligent Systems and Computing, vol 837. Springer, Cham. https://doi.org/10.1007/978-3-319-97888-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-97888-8_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-97887-1
Online ISBN: 978-3-319-97888-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)