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

Computational models for commercial advertisements in social networks

Author

Listed:
  • Atdag, Samet
  • Bingol, Haluk O.

Abstract

Identifying noteworthy spreaders in a network is essential for understanding the spreading process and controlling the reach of the spread in the network. The nodes that are holding more intrinsic power to extend the reach of the spread are important due to demand for various applications such as viral marketing, controlling rumor spreading or getting a better understanding of spreading of the diseases. As an application of viral marketing, maximization of the reach with a fixed budget is a fundamental requirement in the advertising business. Distributing a fixed number of promotional items for maximizing the viral reach can leverage influencer detection methods. For detecting such “influencer” nodes, there are local metrics such as degree centrality (mostly used as in-degree centrality) or global metrics such as k-shell decomposition or eigenvector centrality. All the methods can rank graphs but they all have limitations and there is still no de-facto method for influencer detection in the domain.

Suggested Citation

  • Atdag, Samet & Bingol, Haluk O., 2021. "Computational models for commercial advertisements in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 572(C).
    • Handle: RePEc:eee:phsmap:v:572:y:2021:i:c:s0378437121001886
    DOI: 10.1016/j.physa.2021.125916
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437121001886
    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.2021.125916?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. Linyuan Lü & Yi-Cheng Zhang & Chi Ho Yeung & Tao Zhou, 2011. "Leaders in Social Networks, the Delicious Case," PLOS ONE, Public Library of Science, vol. 6(6), pages 1-9, June.
    2. Zhaoyi Li & Fei Xiong & Ximeng Wang & Hongshu Chen & Xi Xiong, 2019. "Topological Influence-Aware Recommendation on Social Networks," Complexity, Hindawi, vol. 2019, pages 1-12, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Meliksah Turker & Haluk O. Bingol, 2023. "Multi-layer network approach in modeling epidemics in an urban town," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 96(2), pages 1-13, February.

    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. Xing Tang & Qiguang Miao & Shangshang Yu & Yining Quan, 2016. "A Data-Based Approach to Discovering Multi-Topic Influential Leaders," PLOS ONE, Public Library of Science, vol. 11(7), pages 1-14, July.
    2. Syed Raza Bashir & Shaina Raza & Vojislav B. Misic, 2023. "BERT4Loc: BERT for Location—POI Recommender System," Future Internet, MDPI, vol. 15(6), pages 1-19, June.
    3. Chaocheng He & Jiang Wu & Qingpeng Zhang, 2021. "Characterizing research leadership on geographically weighted collaboration network," Scientometrics, Springer;Akadémiai Kiadó, vol. 126(5), pages 4005-4037, May.
    4. Xipeng Liu & Xinmiao Li, 2024. "Unbiased evaluation of ranking algorithms applied to the Chinese green patents citation network," Scientometrics, Springer;Akadémiai Kiadó, vol. 129(6), pages 2999-3021, June.
    5. Wu, Yali & Dong, Ang & Ren, Yuanguang & Jiang, Qiaoyong, 2023. "Identify influential nodes in complex networks: A k-orders entropy-based method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 632(P1).
    6. Wang, Zhixiao & Zhao, Ya & Xi, Jingke & Du, Changjiang, 2016. "Fast ranking influential nodes in complex networks using a k-shell iteration factor," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 171-181.
    7. Gong Kai & Kang Li, 2018. "A New K-Shell Decomposition Method for Identifying Influential Spreaders of Epidemics on Community Networks," Journal of Systems Science and Information, De Gruyter, vol. 6(4), pages 366-375, August.
    8. Qu, Hongbo & Song, Yu-Rong & Li, Ruqi & Li, Min, 2023. "GNR: A universal and efficient node ranking model for various tasks based on graph neural networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 632(P2).
    9. Xu, Shuqi & Mariani, Manuel Sebastian & Lü, Linyuan & Medo, Matúš, 2020. "Unbiased evaluation of ranking metrics reveals consistent performance in science and technology citation data," Journal of Informetrics, Elsevier, vol. 14(1).
    10. Xiaojie Wang & Xue Zhang & Chengli Zhao & Dongyun Yi, 2016. "Maximizing the Spread of Influence via Generalized Degree Discount," PLOS ONE, Public Library of Science, vol. 11(10), pages 1-16, October.
    11. Teqi Dai & Tiantian Ding & Qingfang Liu & Bingxin Liu, 2022. "Node Centrality Comparison between Bus Line and Passenger Flow Networks in Beijing," Sustainability, MDPI, vol. 14(22), pages 1-14, November.
    12. Zhong, Li-Xin & Xu, Wen-Juan & Shi, Yong-Dong & Qiu, Tian, 2013. "Coupled dynamics of mobility and pattern formation in optional public goods games," Chaos, Solitons & Fractals, Elsevier, vol. 47(C), pages 18-26.
    13. Young-Ho Eom & Pablo Aragón & David Laniado & Andreas Kaltenbrunner & Sebastiano Vigna & Dima L Shepelyansky, 2015. "Interactions of Cultures and Top People of Wikipedia from Ranking of 24 Language Editions," PLOS ONE, Public Library of Science, vol. 10(3), pages 1-27, March.
    14. Yupeng Li & Zhaotong Wang & Xiaoyu Zhong & Fan Zou, 2019. "Identification of influential function modules within complex products and systems based on weighted and directed complex networks," Journal of Intelligent Manufacturing, Springer, vol. 30(6), pages 2375-2390, August.
    15. Yao, Yao & Li, Yuanyuan & Xiong, Xi & Wu, Yue & Lin, Honggang & Ju, Shenggen, 2020. "An interactive propagation model of multiple information in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 537(C).
    16. Cai Gao & Xin Lan & Xiaoge Zhang & Yong Deng, 2013. "A Bio-Inspired Methodology of Identifying Influential Nodes in Complex Networks," PLOS ONE, Public Library of Science, vol. 8(6), pages 1-11, June.
    17. Zan, Yongli, 2018. "DSIR double-rumors spreading model in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 110(C), pages 191-202.
    18. Huang, Chuangxia & Deng, Yunke & Yang, Xiaoguang & Cao, Jinde & Yang, Xin, 2021. "A network perspective of comovement and structural change: Evidence from the Chinese stock market," International Review of Financial Analysis, Elsevier, vol. 76(C).
    19. Zhao, Shuying & Sun, Shaowei, 2023. "Identification of node centrality based on Laplacian energy of networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    20. Zhou, Ming-Yang & Xiong, Wen-Man & Wu, Xiang-Yang & Zhang, Yu-Xia & Liao, Hao, 2018. "Overlapping influence inspires the selection of multiple spreaders in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 508(C), pages 76-83.

    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:572:y:2021:i:c:s0378437121001886. 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.