Composed Influence Maximization in Social Networks

Smita Ghosh (), Jianming Zhu () and Weili Wu ()
Additional contact information
Smita Ghosh: The University of Texas at Dallas
Jianming Zhu: School of Engineering Science, University of Chinese Academy of Sciences
Weili Wu: The University of Texas at Dallas

A chapter in Nonlinear Combinatorial Optimization, 2019, pp 251-264 from Springer

Abstract: Abstract Influence maximization has been studied extensively in the literature. Its mathematical formulation is a monotone nondecreasing submodular maximization. However, when composed influence is considered, the corresponding problem becomes a nonsubmodular maximization. A composed influence results from a combination of at least two active members in the social network. To study this problem, a hypergraph model is introduced and hence different methodologies are involved.

Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-16194-1_11

Ordering information: This item can be ordered from
http://www.springer.com/9783030161941

DOI: 10.1007/978-3-030-16194-1_11

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().