Abstract
This paper is part of an on-going programme in which we provide a logical study of social network formations. In the proposed setting, agent a will consider agent b as part of her network if the number of features (properties) on which they differ is small enough, given the constraints on the size of agent a’s ‘social space’. We import this idea about a limit on one’s social space from the cognitive science literature. In this context we study the creation of new networks and use the tools of Dynamic Epistemic Logic to model the updates of the networks. By providing a set of reduction axioms we are able to provide sound and complete axiomatizations for the logics studied in this paper.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Think, for example, how we establish conversations with relatively ‘distant’ acquaintances mostly only when our close friends are not around.
- 2.
See [7, Chap. 1] for more details on mathematical distances.
- 3.
In such case, and if no additional criteria is used to distinguish agents in the same layer, all of them should ‘stand together’: the decision of whether they will become part of a’s social network should be of a ‘either all or else none’ nature.
- 4.
Numbers over edges indicate distance. Edges in black are actual pairs in the social network relation, and dotted grey edges are shown only for distance information.
- 5.
More precisely, the formula states that there is at least one set of features \(\mathsf {P}'\), of size t, such that a and b differ in all features in \(\mathsf {P}'\) and coincide in all features in \(\mathsf {P}\setminus \mathsf {P}'\). There can be a most one such set; therefore the formula is true exactly when a and b differ in exactly t features.
- 6.
More precisely, the formula states that there are \(j_1, j_2 \in \{ 0, \ldots , \mathopen {\vert } \mathsf {P} \mathclose {\vert } \}\), with \(j_1 \le j_2\), such that \(j_1\) is the distance from a to \(b_1\), and \(j_2\) is the distance from a to \(b_2\).
- 7.
For an example, take a model with \(V(a) = \{ p,q,r \}\), \(V(b_1) = \{ q,r \}\) and \(V(b_2) =\) \(\{ p \}\). Then, \({ \textsc {dist}}^{\{ p,q,r \}}_{M}(a, b_1) = 1 < 2 = { \textsc {dist}}^{\{ p,q,r \}}_{M}(a, b_2)\), but nevertheless \({ \textsc {dist}}^{\{ p \}}_{M}(a, b_2) = 0 < 1 = { \textsc {dist}}^{\{ p \}}_{M}(a, b_1)\).
References
Smets, S., Velázquez-Quesada, F.R.: How to make friends: a logical approach to social group creation. In: Baltag, A., Seligman, J., Yamada, T. (eds.) LORI 2017. LNCS, vol. 10455, pp. 377–390. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-662-55665-8_26
Dunbar, R.I.M.: Neocortex size as a constraint on group size in primates. J. Hum. Evol. 22(6), 469–493 (1992)
Baltag, A., Christoff, Z., Rendsvig, R.K., Smets, S.: Dynamic epistemic logics of diffusion and prediction in social networks (extended abstract). In: Bonanno, G., van der Hoek, W., Perea, A. (eds.) Proceedings of LOFT 2016 (2016)
Seligman, J., Liu, F., Girard, P.: Logic in the community. In: Banerjee, M., Seth, A. (eds.) ICLA 2011. LNCS (LNAI), vol. 6521, pp. 178–188. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-18026-2_15
Liu, F., Seligman, J., Girard, P.: Logical dynamics of belief change in the community. Synthese 191(11), 2403–2431 (2014)
Christoff, Z., Hansen, J.U., Proietti, C.: Reflecting on social influence in networks. J. Logic Lang. Inf. 25(3–4), 299–333 (2016)
Deza, M.M., Deza, E.: Encyclopedia of Distances. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00234-2
Baltag, A., Moss, L.S., Solecki, S.: The logic of public announcements, common knowledge, and private suspicions. In: Gilboa, I. (ed.) Proceedings of TARK 1998, pp. 43–56. Kaufmann, San Franscisco (1998)
van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Synthese Library Series, vol. 337. Springer, The Netherlands (2008). https://doi.org/10.1007/978-1-4020-5839-4
van Benthem, J.: Logical Dynamics of Information and Interaction. Cambridge University Press, Cambridge (2011)
Roberts, S.G.B., Wilson, R., Fedurek, P., Dunbar, R.I.M.: Individual differences and personal social network size and structure. Pers. Individ. Differ. 44(4), 954–964 (2008)
Roberts, S.G.B., Dunbar, R.I.M., Pollet, T.V., Kuppens, T.: Exploring variation in active network size: constraints and ego characteristics. Social Netw. 31(2), 138–146 (2009)
Solaki, A., Terzopoulou, Z., Zhao, B.: Logic of closeness revision: challenging relations in social networks. In: Köllner, M., Ziai, R. (eds.) Proceedings of the ESSLLI 2016 Student Session, pp. 123–134 (2016)
Baltag, A., Smets, S.: A qualitative theory of dynamic interactive belief revision. In: Bonanno, G., van der Hoek, W., Wooldridge, M. (eds.) Logic and the Foundations of Game and Decision Theory (LOFT7). Texts in Logic and Games, vol. 3, pp. 13–60. Amsterdam University Press, Amsterdam (2008)
Ghosh, S., Velázquez-Quesada, F.R.: Agreeing to agree: reaching unanimity via preference dynamics based on reliable agents. In: Weiss, G., Yolum, P., Bordini, R.H., Elkind, E. (eds.) Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015, Istanbul, Turkey, 4–8 May 2015, pp. 1491–1499. ACM (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Smets, S., Velázquez-Quesada, F.R. (2018). The Creation and Change of Social Networks: A Logical Study Based on Group Size. In: Madeira, A., Benevides, M. (eds) Dynamic Logic. New Trends and Applications. DALI 2017. Lecture Notes in Computer Science(), vol 10669. Springer, Cham. https://doi.org/10.1007/978-3-319-73579-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-73579-5_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73578-8
Online ISBN: 978-3-319-73579-5
eBook Packages: Computer ScienceComputer Science (R0)