IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v515y2019icp575-586.html
   My bibliography  Save this article

T×oneHop approach for dynamic influence maximization problem

Author

Listed:
  • Meng, Yanhong
  • Yi, Yunhui
  • Xiong, Fei
  • Pei, Changxing

Abstract

As many forms of social interactions are transient in nature, that is to say, the social network structure formed by relations between individuals evolves constantly. In practice, exploring influence maximization for product publicity and advertisement marking in dynamic networks is more challenging. Therefore, the research of dynamic influence maximization problem (DIMP) is indispensable. In this paper, we propose an efficient algorithm, T×oneHop approach, to solve the DIMP only by updating the nodes affected by the new adding seed node under the dynamic independent cascade model. It means that the seed set and pseudo-seed set always activate their neighbors within one hop in a signal snapshot graph whose total number is T. Consequently, the transfer process is similar to T×one hops of propagation in the static network. The experiment evaluations with three real social networks show that our method outperforms forward algorithm and weighted degree algorithm. In addition, our method precedes forward algorithm on running time. Finally, we find out that the common seed nodes number increases with the similarity of two consecutive snapshot graphs.

Suggested Citation

  • Meng, Yanhong & Yi, Yunhui & Xiong, Fei & Pei, Changxing, 2019. "T×oneHop approach for dynamic influence maximization problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 575-586.
    • Handle: RePEc:eee:phsmap:v:515:y:2019:i:c:p:575-586
    DOI: 10.1016/j.physa.2018.09.148
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437118312937
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2018.09.148?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Xiong, Xi & Li, Yuanyuan & Qiao, Shaojie & Han, Nan & Wu, Yue & Peng, Jing & Li, Binyong, 2018. "An emotional contagion model for heterogeneous social media with multiple behaviors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 490(C), pages 185-202.
    2. Deng, Lei & Liu, Yun & Xiong, Fei, 2013. "An opinion diffusion model with clustered early adopters," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(17), pages 3546-3554.
    3. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions," LIDAM Reprints CORE 341, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions - 1," LIDAM Reprints CORE 334, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Pietro Panzarasa & Tore Opsahl & Kathleen M. Carley, 2009. "Patterns and dynamics of users' behavior and interaction: Network analysis of an online community," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 60(5), pages 911-932, May.
    6. Zhenxiang Gao & Yan Shi & Shanzhi Chen, 2015. "Measures of node centrality in mobile social networks," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 26(09), pages 1-20.
    7. Liu, Jian-Guo & Li, Ren-De & Guo, Qiang & Zhang, Yi-Cheng, 2018. "Collective iteration behavior for online social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 499(C), pages 490-497.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Güney, Evren & Leitner, Markus & Ruthmair, Mario & Sinnl, Markus, 2021. "Large-scale influence maximization via maximal covering location," European Journal of Operational Research, Elsevier, vol. 289(1), pages 144-164.
    2. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
    3. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    4. Rad Niazadeh & Negin Golrezaei & Joshua Wang & Fransisca Susan & Ashwinkumar Badanidiyuru, 2023. "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization," Management Science, INFORMS, vol. 69(7), pages 3797-3817, July.
    5. Alexandre D. Jesus & Luís Paquete & Arnaud Liefooghe, 2021. "A model of anytime algorithm performance for bi-objective optimization," Journal of Global Optimization, Springer, vol. 79(2), pages 329-350, February.
    6. Bin Liu & Miaomiao Hu, 2022. "Fast algorithms for maximizing monotone nonsubmodular functions," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1655-1670, July.
    7. repec:dgr:rugsom:99a17 is not listed on IDEAS
    8. Lehmann, Daniel, 2020. "Quality of local equilibria in discrete exchange economies," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 141-152.
    9. Eric DuBois & Ashley Peper & Laura A. Albert, 2023. "Interdicting Attack Plans with Boundedly Rational Players and Multiple Attackers: An Adversarial Risk Analysis Approach," Decision Analysis, INFORMS, vol. 20(3), pages 202-219, September.
    10. Zhenning Zhang & Bin Liu & Yishui Wang & Dachuan Xu & Dongmei Zhang, 2022. "Maximizing a monotone non-submodular function under a knapsack constraint," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1125-1148, July.
    11. Zhenning Zhang & Donglei Du & Yanjun Jiang & Chenchen Wu, 2021. "Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint," Journal of Global Optimization, Springer, vol. 80(3), pages 595-616, July.
    12. Awi Federgruen & Nan Yang, 2008. "Selecting a Portfolio of Suppliers Under Demand and Supply Risks," Operations Research, INFORMS, vol. 56(4), pages 916-936, August.
    13. Chenggang Wang & Zengfu Wang & Xiong Xu & Yuhang Hao, 2021. "A balanced sensor scheduling for multitarget localization in a distributed multiple-input multiple-output radar network," International Journal of Distributed Sensor Networks, , vol. 17(7), pages 15501477211, July.
    14. Yanzhi Li & Zhicheng Liu & Chuchu Xu & Ping Li & Xiaoyan Zhang & Hong Chang, 2023. "Two-stage submodular maximization under curvature," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-16, March.
    15. Simon Bruggmann & Rico Zenklusen, 2019. "Submodular Maximization Through the Lens of Linear Programming," Management Science, INFORMS, vol. 44(4), pages 1221-1244, November.
    16. Xiaojuan Zhang & Qian Liu & Min Li & Yang Zhou, 2022. "Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3549-3574, December.
    17. Hans Kellerer & Vitaly A. Strusevich, 2016. "Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications," Annals of Operations Research, Springer, vol. 240(1), pages 39-94, May.
    18. Hyoshin (John) Park & Ali Haghani & Song Gao & Michael A. Knodler & Siby Samuel, 2018. "Anticipatory Dynamic Traffic Sensor Location Problems with Connected Vehicle Technologies," Service Science, INFORMS, vol. 52(6), pages 1299-1326, December.
    19. Shaojie Tang & Jing Yuan, 2023. "Beyond submodularity: a unified framework of randomized set selection with group fairness constraints," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-22, May.
    20. Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang, 2018. "A local search approximation algorithm for the uniform capacitated k-facility location problem," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 409-423, February.
    21. Goldengorin, Boris & Tijssen, Gert A. & Tso, Michael, 1999. "The maximization of submodular functions : old and new proofs for the correctness of the dichotomy algorithm," Research Report 99A17, University of Groningen, Research Institute SOM (Systems, Organisations and Management).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:515:y:2019:i:c:p:575-586. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.