Abstract
AbstractThis paper introduces a comprehensive logical framework to reason about threshold-driven diffusion and threshold-driven link change in social networks. It considers both monotonic dynamics, where agents can only adopt new features and create new connections, and non-monotonic dynamics, where agents may also abandon features or cut ties. Three types of operators are combined: one capturing diffusion only, one capturing link change only, and one capturing both at the same time. We first characterise the models on which diffusion of a unique feature and link change stabilise, whilst discussing salient properties of stable models with multiple spreading features. Second, we show that our operators (and any combination of them) are irreplaceable, in the sense that the sequences of model updates expressed by a combination of operators cannot always be expressed using any other operators. Finally, we analyse classes of models on which some operators can be replaced.
Funder
Nederlandse Organisatie voor Wetenschappelijk Onderzoek
Publisher
Springer Science and Business Media LLC
Reference77 articles.
1. Acemoglu, D., M. A. Dahleh, I. Lobel, and A. Ozdaglar, Bayesian Learning in Social Networks, 02142, 2010.
2. Acemoglu, D., and A. Ozdaglar, Opinion dynamics and learning in social networks, Dynamic Games and Applications 1(1): 3–49, 2011. https://doi.org/10.1007/s13235-010-0004-1.
3. Alkemade, F., and C. Castaldi, Strategies for the diffusion of innovations on social networks, Computational Economics 25(1): 3–23, 2005. https://doi.org/10.1007/s10614-005-6245-1.
4. Alvim, M. S., B. Amorim, S. Knight, S. Quintero, and F. Valencia, A multi-agent model for polarization under confirmation bias in social networks, in K. Peters, and T. A. C. Willemse, (eds.), Formal Techniques for Distributed Objects, Components, And Systems, Springer, Cham, 2021, pp. 22–41. https://doi.org/10.1007/978-3-030-78089-0_2.
5. Azimipour, S., and P. Naumov, Lighthouse principle for diffusion in social networks, Journal of Applied Logic 5(1): 97–120, 2018.