Abstract
Social diffusion models have been extensively applied to study biological and social processes on a large scale. Previously two issues with these models were identified: understanding emerging dynamic properties of complex systems, and a high computational complexity of large-scale social simulations. Both these issues were tackled by abstraction techniques developed previously for social diffusion models with underlying random networks. In the paper it is shown that these techniques perform poorly on scale-free networks. To address this limitation, new model abstraction methods are proposed and evaluated for three network types: scale-free, regular and random. These methods are inspired by node centrality measures from the social networks area. The proposed methods increase the computational efficiency of the original model significantly (up to 40 times for regular networks).
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alur, R., Henzinger, T.A., Lafferriere, G., Pappas, G.J.: Discrete abstraction of hybrid systems. Proceedings of IEEE 88(7), 971–984 (2000)
Antoulas, A.C., Sorensen, D.C.: Approximation of large-scale dynamical systems: An overview. International Journal of Appl. Math. Comp. Sci. 11, 1093–1121 (2001)
Barabási, A.-L., Albert, R.: Emergence of Scaling in Random Networks. Science 286, 509–512 (1999)
Deffuant, G., Neau, D., Amblard, F., Weisbuch, G.: Mixing beliefs among interacting agents. Advances in Complex Systems 3, 87–98 (2001)
Hegselmann, R., Krause, U.: Opinion Dynamics and Bounded Confidence Models, Analysis and Simulation. Journal of Artificial Societies and Social Simulation 5(3) (2002)
Long, G., Yun-feng, C., Xu, C.: The evolution of opinions on scale-free networks. Frontiers of Physics in China 1(4), 506–509 (2006)
Macy, M., Kitts, J.A., Flache, A.: Polarization in Dynamic Networks: A Hopfield Model of Emergent Structure. In: Dynamic Social Network Modeling and Analysis, pp. 162–173. National Academies Press, Washington, DC (2003)
Opsahl, T., Agneessens, F., Skvoretz, J.: Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks 32(3), 245–251 (2010)
Parunak, H.V.D., Belding, T.C., Hilscher, R., Brueckner, S.: Modeling and Managing Collective Cognitive Convergence. In: Proceedings of AAMAS 2008, pp. 1505–1508. ACM Press (2008)
Rogers, E.M.: Diffusion of innovations. Free Press, New York (2003)
Sharpanskykh, A., Zia, K.: Grouping Behaviour in AmI-Enabled Crowd Evacuation. In: Novais, P., Preuveneers, D., Corchado, J.M. (eds.) ISAmI 2011. AISC, vol. 92, pp. 233–240. Springer, Heidelberg (2011)
Sharpanskykh, A., Treur, J.: Group Abstraction for Large-Scale Agent-Based Social Diffusion Models. In: Zhan, J., et al. (eds.) Proceedings of the 3rd International Conference on Social Computing, SocialCom 2011, pp. 830–837. IEEE Computer Society Press (2011)
Sharpanskykh, A., Treur, J.: Group Abstraction for Large-Scale Agent-Based Social Diffusion Models with Unaffected Agents. In: Kinny, D., Hsu, J.Y.-j., Governatori, G., Ghose, A.K. (eds.) PRIMA 2011. LNCS (LNAI), vol. 7047, pp. 129–142. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sharpanskykh, A. (2012). Managing the Complexity of Large-Scale Agent-Based Social Diffusion Models with Different Network Topologies. In: Anthony, P., Ishizuka, M., Lukose, D. (eds) PRICAI 2012: Trends in Artificial Intelligence. PRICAI 2012. Lecture Notes in Computer Science(), vol 7458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32695-0_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-32695-0_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32694-3
Online ISBN: 978-3-642-32695-0
eBook Packages: Computer ScienceComputer Science (R0)