skip to main content
10.1145/3341161.3342922acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
short-paper

Seed investment bounds for viral marketing under generalized diffusion

Published: 15 January 2020 Publication History

Abstract

This paper attempts to provide viral marketeers guidance in terms of an investment level that could help capture some desired γ percentage of the market-share by some target time t with a desired level of confidence. To do this, we first introduce a diffusion model for social networks. A distance-dependent random graph is then considered as a model for the underlying social network, which we use to analyze the proposed diffusion model. Using the fact that vertices degrees have an almost Poisson distribution in distance-dependent random networks, we then provide a lower bound on the probability of the event that the time it takes for an idea (or a product, disease, etc.) to dominate a pre-specified γ percentage of a social network (denoted by Rγ) is smaller than some pre-selected target time t > 0, i.e., we find a lower bound on the probability of the event {Rγt}. Simulation results performed over a wide variety of networks, including random as well as real-world, are then provided to verify that our bound indeed holds in practice. The Kullback-Leibler divergence measure is used to evaluate performance of our lower bound over these groups of networks, and as expected, we note that for networks that deviate more from the Poisson degree distribution, our lower bound does worse.

References

[1]
Jennings Bryant and Dorina Miron. Theory and research in mass communication. Journal of Communication, 54(4):662--704, 2004.
[2]
Christophe Van Den Bulte, Gary L. Lilien, The Late Clifford Clogg, Jehoshua Eliashberg, Elihu Katz, and David Krackhardt. Medical innovation revisited: Social contagion versus marketing effort. American Journal of Sociology, pages 1409--1435, 2005.
[3]
Jie Tang, Jimeng Sun, Chi Wang, and Zi Yang. Social influence analysis in large-scale networks. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '09, pages 807--816, New York, NY, USA, 2009. ACM.
[4]
Wei Chen, Carlos Castillo, and Laks V. S. Lakshmanan. Information and influence propagation in social networks. pages 177--, 2013.
[5]
S. H. Strogatz. Exploring complex networks. Nature 410, 2001.
[6]
Réka Albert and Albert-László Barabási. Statistical mechanics of complex networks. Rev. Mod. Phys., 74:47--97, Jan 2002.
[7]
D. J. Watts and S. H. Strogatz. Collective dynamics of small-world networks. Nature 393, 1998.
[8]
L. A. N. Amaral, A. Scala, M. Barthélémy, and H. E. Stanley. Classes of small-world networks. Proceedings of the National Academy of Sciences, 97(21):11149--11152, 2000.
[9]
F. Liljeros, C. R. Edling, L. A. N. Ameral, H. E. Stanley and Y. Aberg. The web of human sexual contacts. Nature 411, 2001.
[10]
M. Girvan and M. E. J. Newman. Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12):7821--7826, 2002.
[11]
J. Abello, A. Buchsbaum and J. Westbrook. A functional approach to external graph algorithms. Proceedings of the 6th European Symposium on Algorithms, Springer, Berlin, 1998.
[12]
R. Albert, H. Jeong and A. L. Barabasi. Diameter of the world-wide web. Nature 401, 1999.
[13]
Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. On power-law relationships of the internet topology. SIGCOMM Comput. Commun. Rev., 29(4):251--262, August 1999.
[14]
Andrei Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan, Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, and Janet Wiener. Graph structure in the web. Comput. Netw., 33(1-6):309--320, June 2000.
[15]
H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai and A. L. Barabasi. The large-scale organization of metabolic networks. Nature 407, 2000.
[16]
H. Jeong, S. Mason, A. L. Barabasi and Z. N. Oltvai. Lethality and centrality in protein networks. Nature 411, 2001.
[17]
D. A. Fell and A. Wagner. The small world of metabolism. Nature Biotechnology 18, 2000.
[18]
R. J. Williams and N. D. Martinez. Simple rules yield complex food webs. Nature 404, 2000.
[19]
Jose M. Montoya and Ricard V. Sola. Small world patterns in food webs. Journal of Theoretical Biology, 214(3):405 -- 412, 2002.
[20]
David Kempe, Jon Kleinberg, and Eva Tardos. Influential Nodes in a Diffusion Model for Social Networks, pages 1127--1138. Springer Berlin Heidelberg, Berlin, Heidelberg, 2005.
[21]
David Kempe, Jon Kleinberg, and Éva Tardos. Maximizing the spread of influence through a social network. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '03, pages 137--146, New York, NY, USA, 2003. ACM.
[22]
MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly, Vahab Mirrokni, and Sina Sadeghian. On non-progressive spread of influence through social networks. Theoretical Computer Science, 550:36 -- 50, 2014.
[23]
Mohammadreza Samadi, Alexander Nikolaev, and Rakesh Nagi. A subjective evidence model for influence maximization in social networks. Omega, 59, Part B:263 -- 278, 2016.
[24]
B. Bollobas. Random graphs. Academic Press, Inc., 1985.
[25]
E. Bodine-Baron, B. Hassibi, and A. Wierman. Distance-dependent kronecker graphs for modeling social networks. IEEE Journal of Selected Topics in Signal Processing, 4(4), 2010.
[26]
Thomas M. Cover and Joy A. Thomas. Elements of Information Theory 2nd Edition. Wiley Series in Telecommunications and Signal Processing. Wiley-Interscience, July 2006.
[27]
R. M. Anderson and R. M. May. Infectious diseases of humans. Oxford University Press, 1991.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ASONAM '19: Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
August 2019
1228 pages
ISBN:9781450368681
DOI:10.1145/3341161
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

In-Cooperation

  • IEEE CS

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 January 2020

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. diffusion models
  2. influence maximization
  3. random graph models
  4. social networks
  5. viral marketing

Qualifiers

  • Short-paper

Conference

ASONAM '19
Sponsor:

Acceptance Rates

ASONAM '19 Paper Acceptance Rate 41 of 286 submissions, 14%;
Overall Acceptance Rate 116 of 549 submissions, 21%

Upcoming Conference

KDD '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media