Abstract

The popularity of online social networks (OSNs) makes them attractive platforms to advertise products. Previous work on marketing in OSNs utilized older diffusion models that do not capture the interactions of modern OSNs and hence there is a need to develop a model that accounts for the interactions that occur in current OSNs. In this paper, we introduce a new model for information flow in online social networks that captures the sharing behavior exercised by users when they pass information from one online social network to their social circles in another network. We, then, formulate a problem of maximizing the marketing reach where the diversity of users’ other social networks is taken as a constraint. We also propose a greedy algorithm to solve the aforementioned optimization problem. Numerical results show that the proposed algorithm achieves better results than algorithms that are based on classical degree centrality metric and with comparable running time.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.