Abstract
In this paper, we study the evolution of a social graph structure under the leverage of various projects performed by self-organizing teams. Suppose we have a group of specialists with different skills. Some of the team members are acquainted with each other, which is expressed by a social graph. We assume that each project requires a variety of skills, therefore the group members form teams in order to have at least one specialist with each skill required for the project. As a result of work on the project, all team members get acquainted with each other, which changes the social graph. In this paper, a model is proposed for this process. Properties and characteristics of the model have been studied analytically and via computer simulation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bhadra, S., Ferreira, A.: Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks. In: Pierre, S., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2003. LNCS, vol. 2865, pp. 259–270. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-39611-6_23
Clementi, A., et al.: Rumor spreading in random evolving graphs. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 325–336. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40450-4_28
Dykhuis, N., Cohen, P., Chang, Y.H.: Simulating team formation in social networks, pp. 244–253, September 2013. https://doi.org/10.1109/SocialCom.2013.42
Ferreira, A.: On models and algorithms for dynamic communication networks: the case for evolving graphs. In: Proceedings of the ALGOTEL, January 2002
Huo, W., Tsotras, V.: Efficient temporal shortest path queries on evolving social graphs. In: ACM International Conference Proceeding Series, June 2014. https://doi.org/10.1145/2618243.2618282
Jarry, A., Lotker, Z.: Connectivity in evolving graph with geometric properties, pp. 24–30, January 2004. https://doi.org/10.1145/1022630.1022635
Kossinets, G.: Origins of homophily in an evolving social network. Am. J. Sociol. 115, 405–450 (2009). https://doi.org/10.1086/599247
Palla, G., Barabasi, A.L., Vicsek, T.: Quantifying social group evolution. Nature 446, 664–667 (2007). https://doi.org/10.1038/nature05670
Peltomäki, M., Alava, M.: Correlations in bipartite collaboration networks. J. Stat. Mech. Theory Exp. 2006 (2005). https://doi.org/10.1088/1742-5468/2006/01/P01010
Ren, C., Lo, E., Kao, B., Zhu, X., Cheng, R., Cheung, D.W.: Efficient processing of shortest path queries in evolving graph sequences. Inf. Syst. 70, 18–31 (2017). https://doi.org/10.1016/j.is.2017.05.004. http://www.sciencedirect.com/science/article/pii/S0306437916303374. Advances in databases and Information Systems
Ugander, J., Karrer, B., Backstrom, L., Marlow, C.: The anatomy of the Facebook social graph. arXiv preprint 1111.4503, November 2011
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Samonenko, I., Voznesenskaya, T. (2021). The Influence of Self-organizing Teams on the Structure of the Social Graph. In: Kalenkova, A., Lozano, J.A., Yavorskiy, R. (eds) Tools and Methods of Program Analysis. TMPA 2019. Communications in Computer and Information Science, vol 1288. Springer, Cham. https://doi.org/10.1007/978-3-030-71472-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-71472-7_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-71471-0
Online ISBN: 978-3-030-71472-7
eBook Packages: Computer ScienceComputer Science (R0)