Abstract
Online social networks have continued to attract increased attention since the introduction of this concept nearly three decades ago. Consequently, a study about the workings of online social networks may help in understanding the structure of human society and the characteristics of generic complex networks. Over the past few years, interest in neighboring nodes, which are the number of nodes between any two nodes, the number of neighbors and how many triangles are present in a social network have produced the concepts of a six-degree separation (Milgram, Psychol Today 2(1):60–67, 1967; Backstrom et al., Proceedings of the 4th annual ACM web science conference, p 33–42, 2012), a heavy tail in the degree distribution (Barabási, Albert, Science 286(5439):509–512, 1999) and a high clustering coefficient (Luce, Perry, Psychometrika 14(2):95–116, 1949; Watts, Strogatz, Nature 393(6684):440–442, 1998; Amaral et al., Proc Natl Acad Sci USA 97(21):11149–11152, 2000). In a similar manner, researchers have also been curious about how many polygons are present in a given online social network. Although much effort has been expended (Dantzig et al., International symposium on theory of graphs, p 77–83, 1967; Kamae, IEEE Trans Circuit Theory 14(2):166–171, 1967; Gotlieb, Corneil, Commun ACM 10(12):780–783, 1967; Welch, J ACM 13(2):205–210, 1966; Tiernan, Commun ACM 13(12):722–726, 1970; Tarjan, SIAM J Comput 2(3):211–216, 1973; Johnson, SIAM J Comput 4:77–84, 1975; Mateti, Deo, SIAM J Comput 5(5):90–99, 1976; Marinari et al., Europhys Lett 73(3):301–307, 2005), studying this subject, the inability to enumerate polygons has stymied an in depth understanding of the properties of polygons in an online social network. In the study described in this paper, the estimated number of polygons in an online social network is revealed. It was found that in the current widely used online social networks, e.g., Facebook, Twitter, the number of polygons increases drastically when the length of a polygon is below a set value and then it decreases rapidly. The average length of the network polygons was calculated and it was found that online social networks contain a relatively large average length of polygons. Based on this perspective, a massive labyrinth of polygons would make the online social networks appear to be very complicated. To further investigate this area, a generalized clustering coefficient was explored. Results showed that the generalized clustering coefficient appeared to descend exponentially with the length of polygon and expeditiously approached zero. This result suggested that the polygons with large lengths should be ignored in many scenarios. Since the polygons with lengths greater than five appeared to have little impact on the network, the online social networks appeared to be less complex than anticipated. The polygon is one of the fundamental problems in graph theory and complex networks, so that the work reported here may be beneficial for many disciplines, including transportation [7], engineering [8], computer science [9,10,11,12,13,14,15,16], physics (Birmelé et al., Proceedings of the 24th annual ACM–SIAM symposium on discrete algorithms, p 1884–1896, 2013), sociology (Motter, Albert, Phys Today 65:43, 2012), epidemiology (Feld, Am J Sociol 96(6):1464–1477, 1991; Cohen et al., Phys Rev Lett 91(24):12343, 2002), psychology (Sun et al., Sci Rep 4(6188):5099–5099, 2014), biology (Feiler, Kleinbaum, Psychol Sci, 2015), medicine (Kincaid, Pilette, Comput Appl Biosci Cabios 8:267–273, 1992), geography (Kim et al., Lancet 386(9989):145–153, 2015), etc.
Similar content being viewed by others
References
Milgram, S.: The small world problem. Psychol. Today 2(1), 60–67 (1967)
Backstrom, L., Boldi, P., Rosa, M., Ugander, J., Vigna, S.: Four degrees of separation. In: Proceedings of the 4th Annual ACM Web Science Conference, pp 33–42 (2012)
Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
Luce, R.D., Perry, A.D.: A method of matrix analysis of group structure. Psychometrika 14(2), 95–116 (1949)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440–442 (1998)
Amaral, L.A., Scala, A., Barthelemy, M., Stanley, H.E.: Classes of small-world networks. Proc. Natl Acad. Sci. USA 97(21), 11149–11152 (2000)
Dantzig, G.B., Blattner, W.O., Rao, M.R.: Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem. In: International Symposium on Theory of Graphs, pp 77–83 (1967)
Kamae, T.: A systematic method of finding all directed circuits and enumerating all directed paths. IEEE Trans. Circuit Theory 14(2), 166–171 (1967)
Gotlieb, C.G., Corneil, D.G.: Algorithms for finding a fundamental set of cycles for an undirected linear graph. Commun. ACM 10(12), 780–783 (1967)
Welch, J.T.: A mechanical analysis of the cyclic structure of undirected linear graphs. J. ACM 13(2), 205–210 (1966)
Tiernan, J.C.: An efficient search algorithm to find the elementary circuits of a graph. Commun. ACM 13(12), 722–726 (1970)
Tarjan, R.: Enumeration of the elementary circuits of a directed graph. SIAM J. Comput. 2(3), 211–216 (1973)
Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM J. Comput. 4, 77–84 (1975)
Mateti, P., Deo, N.: On algorithms for enumerating all circuits of a graph. SIAM J. Comput. 5(5), 90–99 (1976)
Marinari, E., Monasson, R., Semerjian, G.: An algorithm for counting circuits: application to real-world and random graphs. Europhys. Lett. 73(3), 301–307 (2005)
Birmelé, E., Ferreira, R., Grossi, R, et al.: Optimal listing of cycles and st-paths in undirected graphs. In: Proceedings of the 24th Annual ACM–SIAM Symposium on Discrete Algorithms, pp 1884–1896 (2013)
Motter, A.E., Albert, R.: Networks in motion. Phys. Today 65, 43 (2012)
Feld, S.L.: Why your friends have more friends than you do. Am. J. Sociol. 96(6), 1464–1477 (1991)
Cohen, R., Benavraham, D., Havlin, S.: Efficient immunization of populations and computers. Phys. Rev. Lett. 91(24), 12343 (2002)
Sun, L., Axhausen, K.W., Lee, D.H., Cebrian, M.: Efficient detection of contagious outbreaks in massive metropolitan encounter networks. Sci. Rep. 4(6188), 5099–5099 (2014)
Feiler, D.C., Kleinbaum, A.M.: Popularity, similarity, and the network extraversion bias. Psychol. Sci. (2015). https://doi.org/10.1177/0956797615569580
Kincaid, D.T., Pilette, R.: Construction of simple pathways and simple cycles in ecosystems. Comput. Appl. Biosci. Cabios 8, 267–273 (1992)
Kim, D.A., et al.: Social network targeting to maximise population behaviour change: a cluster randomised controlled trial. Lancet 386(9989), 145–153 (2015)
Hambrey, M.J., et al.: Sedimentological, geomorphological and dynamic context of debris-mantled glaciers, Mount Everest (Sagarmatha) region, Nepal. Quat. Sci. Rev. 27(s 25–26), 2361–2389 (2008)
Tulczyjew, W.M.: The Legendre transformation. Ann. Inst. Henri Poincaré 27, 101–114 (1977)
Katsura, S., Takizawa, M.: Bethe lattice and the Bethe approximation. Prog. Theor. Phys. 51, 82–98 (1974)
Yedidia, J.S., Freeman, W.T., Weiss, Y.: Generalized belief propagation. NIPS 13, 689–695 (2000)
Marinari, E., Semerjian, G.: On the number of circuits in random graphs. J. Stat. Mech. Theory Exp. 2006, P06019 (2006)
Erdos, P., Renyi, A.: On random graphs I. Publ. Math. 6, 290–297 (1959)
SNAP Datasets. http://snap.stanford.edu/data. Accessed 30 Dec 2015
Acknowledgements
This work was supported by the Natural Science Foundation of China under grant nos. 71531012, 71601013 and 61762073, the Natural Science Foundation of Beijing under grant nos. 4172032 and 4174087, and the Scientific Research Project of Beijing Educational Committee under grand no. SQKM201710016002.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhou, X., Liang, X., Zhao, J. et al. Exploration of polygons in online social networks. Cluster Comput 22 (Suppl 2), 3841–3848 (2019). https://doi.org/10.1007/s10586-018-2434-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10586-018-2434-2