Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Thresholds as Mechanisms for Weighting Influence in the Linear Threshold Rank

  • Conference paper
  • First Online:
Social Networks Analysis and Mining (ASONAM 2024)

Abstract

Social networks are the natural space for the spreading of information and influence and have become a media themselves. Several models capturing that diffusion process have been proposed, most of them based on the Independent Cascade (IC) model or on the Linear Threshold (LT) model. The IC model is probabilistic while the LT model relies on the knowledge of an actor to be convinced, reflected in an associated individual threshold. Although the LT-based models contemplate an individual threshold for each actor in the network, the existing studies so far have always considered a threshold of 0.5 equal in all actors (i.e., a simple majority activation criterion).

Our main objective in this work is to start the study on how the dissemination of information on networks behaves when we consider other options for setting those thresholds and how many network actors end up being influenced by this dissemination. For doing so, we consider a recently introduced centrality measure based on the LT model, the Forward Linear Threshold Rank (FwLTR), which is the natural interpretation of the Linear Threshold Rank on directed networks.

We experimentally analyze the ranking properties for several networks in which the influence resistance threshold follows different schemes. Here we consider three different schemes: (1) uniform, in which all players have the same value; (2) random, where each player is assigned a threshold u.a.r. in a prescribed interval; and (3) determined by the value of another centrality measure on the actor. Our results show that the selection has a clear impact on the ranking, even quite significant and abrupt in some cases. We conclude that the social networks ranks that provide the best assignments for the individual thresholds are FwLTR and the well-known PageRank.

Supported by MCIN/AEI/10.13039/501100011033 under grant PID2020-112581GB-C21 (MOTION).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Infrastructure available at the Research& Development Lab (\(\backslash \)RDlab) of the Universitat Politècnica de Catalunya - BarcelonaTech.

  2. 2.

    Results for the remaining ones can be found in the Appendix.

  3. 3.

    How the thresholds are assigned according to the different centrality measures in each network can be seen in the Appendix.

References

  1. Arhachoui, N., Bautista, E., Danisch, M., Giovanidis, A.: A fast algorithm for ranking users by their influence in online social platforms. In: Proceedings of the 2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 526–533. Association for Computing Machinery (2022). https://doi.org/10.1109/ASONAM55673.2022.10068673

  2. Blesa, M., García-Rodríguez, P., Serna, M.: Forward and backward linear threshold ranks. In: Proceedings of the 2021 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 265–269. Association for Computing Machinery (2021). https://doi.org/10.1145/3487351.3488355

  3. Ceriani, L., Verme, P.: The origins of the Gini index: extracts from Variabilità e Mutabilità (1912) by Corrado Gini. J. Econ. Inequal. 10(3), 421–443 (2012)

    Article  MATH  Google Scholar 

  4. Chen, N.: On the approximability of influence in social networks. SIAM J. Discret. Math. 23(3), 1400–1415 (2009). https://doi.org/10.1137/08073617X

    Article  MathSciNet  MATH  Google Scholar 

  5. Freeman, L.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35–41 (1977)

    Article  MATH  Google Scholar 

  6. Gini, C.: Variabilitàe Mutuabilità. Contributo allo Studio delle Distribuzioni e delle Relazioni Statistiche. C, Cuppini (1912)

    Google Scholar 

  7. Goldenberg, J., Libai, B., Muller, E.: Using complex systems analysis to advance marketing theory development: modeling heterogeneity effects on new product growth through stochastic cellular automata. Acad. Market. Sci. Rev. 9(1) (2001)

    Google Scholar 

  8. Hasson, S.T., Akeel, E.: Influence maximization problem approach to model social networks. In: 2019 International Conference on Advanced Science and Engineering (ICOASE), pp. 135–140 (2019). https://doi.org/10.1109/ICOASE.2019.8723703

  9. Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 137–146 (2003)

    Google Scholar 

  10. Kempe, D., Kleinberg, J., Tardos, É.: Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127–1138. Springer, Heidelberg (2005). https://doi.org/10.1007/11523468_91

    Chapter  MATH  Google Scholar 

  11. Lorenz, M.O.: Methods of measuring the concentration of wealth. Publ. Am. Stat. Assoc. 9(70), 209–219 (1905). https://doi.org/10.2307/2276207

    Article  MATH  Google Scholar 

  12. Namtirtha, A., Dutta, A., Dutta, B., Sundararajan, A., Simmhan, Y.: Best influential spreaders identification using network global structural properties. Nat. - Sci. Rep. 11(2254) (2021). https://doi.org/10.1038/s41598-021-81614-9

  13. Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. In: The Web Conference. Stanford Digital Library (1999)

    Google Scholar 

  14. Riquelme, F., Gonzalez-Cantergiani, P., Molinero, X., Serna, M.: Centrality measures in social networks based on linear threshold model. Knowl.-Based Syst. 40, 92–102 (2017). https://doi.org/10.1016/j.knosys.2017.10.029

    Article  MATH  Google Scholar 

  15. Shakarian, P., Bhatnagar, A., Aleali, A., Shaabani, E., Guo, R.: The independent cascade and linear threshold models. In: Diffusion in Social Networks. SCS, pp. 35–48. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-23105-1_4

    Chapter  MATH  Google Scholar 

  16. Wan, Z., Mahajan, Y., Kang, B.W., Moore, T.J., Cho, J.H.: A survey on centrality metrics and their network resilience analysis. IEEE Access 9, 104773–104819 (2021). https://doi.org/10.1109/ACCESS.2021.3094196

    Article  MATH  Google Scholar 

  17. Zareie, A., Sakellariou, R.: Influence maximization in social networks: a survey of behaviour-aware methods. Soc. Netw. Anal. Min. 13(78) (2023). https://doi.org/10.1007/s13278-023-01078-9

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maria J. Blesa .

Editor information

Editors and Affiliations

Appendix

Appendix

Additional data supporting this work can be found at https://cs.upc.edu/~mjblesa/ASONAM.2024.

Rights and permissions

Reprints and permissions

Copyright information

© 2025 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Blesa, M.J., Dominguez-Besserer, A., Serna, M. (2025). Thresholds as Mechanisms for Weighting Influence in the Linear Threshold Rank. In: Aiello, L.M., Chakraborty, T., Gaito, S. (eds) Social Networks Analysis and Mining. ASONAM 2024. Lecture Notes in Computer Science, vol 15211. Springer, Cham. https://doi.org/10.1007/978-3-031-78541-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-78541-2_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-78540-5

  • Online ISBN: 978-3-031-78541-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics