Abstract
Since the birth of digital social networks, management research focused upon the opportunities of social media marketing. A marketing campaign has the best success when it reaches the largest number of potential customers. It is, however, difficult to forecast in a precise way the number of contacts that you can reach with such an initiative.
We propose a representation of social networks that captures both the probability of forecasting a message to different agents, and the time span during which the message is sent out.
We study reachiability and coverage from the computational complexity viewpoint and show that they can be solved polynomially on deterministic machines.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bampo, M., Ewing, M.T., Mather, D.R., Stewart, D., Wallace, M.: The effects of the social structure of digital networks on viral marketing performance. Inf. Syst. Res. 19(3), 273–290 (2008)
Cristani, M., Fogoroasi, D., Tomazzoli, C.: Measuring homophily. In: CEUR Workshop - Proceedings, vol. 1748 (2016)
Cristani, M., Olivieri, F., Tomazzoli, C.: Viral experiments, vol. 1959 (2017)
Cristani, M., Tomazzoli, C., Olivieri, F.: Semantic social network analysis foresees message flows. In: ICAART - Proceedings, vol. 1, pp. 296–303 (2016)
Esmaeilpour, M., Aram, F.: Investigating the impact of viral message appeal and message credibility on consumer attitude toward the brand. Manag. Mark. 11(2), 470–483 (2016)
Gonsalves, J.N.C., Rodrigues, H.S., Monteiro, M.T.T.: A contribution of dynamical systems theory and epidemiological modeling to a viral marketing campaign. Adv. Intell. Syst. Comput. 557, 974–983 (2017)
Inaltekin, H., Chiang, M., Poor, H.V.: Average message delivery time for small-world networks in the continuum limit. IEEE Trans. Inf. Theory 56(9), 4447–4470 (2010)
Khan, S.K.A., Mondragon, R.J., Tokarchuk, L.N.: Lobby influence: opportunistic forwarding algorithm based on human social relationship patterns. In: PERCOM Workshops, pp. 211–216 (2012)
Lu, Z., Sagduyu, Y., Shi, Y.: Friendships in the air: integrating social links into wireless network modeling, routing, and analysis. In: INFOCOM - Proceedings, vol. 2016, pp. 322–327, September 2016
Scott, J.: Social network analysis: developments, advances, and prospects. Soc. Netw. Anal. Min. 1(1), 21–26 (2011)
Tomazzoli, C., Storti, S.F., Galazzo, I.B., Cristani, M., Menegaz, G.: The brain is a social network, vol. 1959 (2017)
Tseng, Y.-C., Ni, S.-Y., Chen, Y.-S., Sheu, J.-P.: The broadcast storm problem in a mobile ad hoc network. Wirel. Netw. 8(2–3), 153–167 (2002)
Zhu, Y., Zhang, H., Ji, Q.: How much delay has to be tolerated in a mobile social network? Int. J. Distrib. Sens. Netw. 2013, 1–8 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Cristani, M., Olivieri, F., Tomazzoli, C., Governatori, G. (2019). Sending Messages in Social Networks. In: Jezic, G., Chen-Burger, YH., Howlett, R., Jain, L., Vlacic, L., Šperka, R. (eds) Agents and Multi-Agent Systems: Technologies and Applications 2018. KES-AMSTA-18 2018. Smart Innovation, Systems and Technologies, vol 96. Springer, Cham. https://doi.org/10.1007/978-3-319-92031-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-92031-3_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-92030-6
Online ISBN: 978-3-319-92031-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)