Diffusion models are critical for spreading influence in social networks, as they contribute in estimating the potential reach of seed nodes, allowing for better evaluation of their goodness and effectiveness. This research aims to develop a diffusion model for weighted social networks, addressing a gap in traditional models that typically only consider the binary state of relationships between nodes. While existing models treat edges as simply existing or not, real-world social networks are inherently weighted, with edge weights reflecting the strength of the link between connecting nodes. To better capture these dynamics, we propose the Link Strength Diffusion (LiSt-D) model, which incorporates the strength of shared relation to determine the probability of diffusion between social actors. The LiSt-D model was tested on three real-world weighted social networks, Bitcoin Alpha, Bitcoin OTC, and Advogato, using seven heuristics to select the initial seed nodes. The findings showed that diffusion spread under LiSt-D covered 90% of the Bitcoin Alpha network, 84% of Bitcoin OTC, and 63% of the Advogato network. LiSt-D model captures the heterogeneity in the link-strength connecting nodes, and demonstrates early peak performance with high stability.
HanMLiY. Influence analysis: a survey of the state-of-the-art. Math Found Comput2018; 1: 201–253.
2.
LiKZhangLHuangH. Social influence analysis: models, methods, and evaluation. Engineering2018; 4: 40–46.
3.
PengSWangGXieD. Social influence analysis in social networking big data: opportunities and challenges. IEEE Netw2016; 31: 11–17.
4.
PengSZhouYCaoL, et al.Influence analysis in social networks: a survey. J Netw Comput Appl2018; 106: 17–32.
5.
LiDXuZMChakrabortyN, et al.Polarity related influence maximization in signed social networks. PloS one2014; 9: e102199.
6.
ShenCNishideRPiumartaI, et al.Influence maximization in signed social networks. In: Web Information Systems Engineering–WISE 2015: 16th International Conference, Part I 16, 2015, pp.399–414. 10.1007/978-3-319-26190-4_27
7.
LiangWShenCLiX, et al.Influence maximization in signed social networks with opinion formation. IEEE Access2019; 7: 68837–68852.
8.
ZareieASakellariouR. Influence maximization in social networks: a survey of behaviour-aware methods. Soc Netw Anal Min2023; 13: 78.
9.
BrownJJReingenPH. Social ties and word-of-mouth referral behavior. J Consum Res1987; 14: 350–362.
10.
GoldenbergJLibaiBMullerE. Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark Lett2001; 12: 211–223.
11.
DomingosPRichardsonM. Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, 2001, pp.57–66. 10.1145/502512.502525
12.
RichardsonMDomingosP. Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, 2002, pp.61–70. 10.1145/775047.775057
13.
KempeDKleinbergJTardosÉ. Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, 2003, pp.137–146. 10.1145/956750.956769
14.
Hosseini-PozvehMZamanifarKNaghsh-NilchiAR. Assessing information diffusion models for influence maximization in signed social networks. Expert Syst Appl2019; 119: 476–490.
15.
LiMWangXGaoK, et al.A survey on information diffusion in online social networks: models and methods. Information2017; 8: 18.
16.
LiYFanJWangY, et al.Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng2018; 30: 1852–1872.
17.
SaxenaBSaxenaVAnandN, et al.A Hurst-based diffusion model using time series characteristics for influence maximization in social networks. Expert Syst2023; 40: e13375.
18.
NewmanME. Spread of epidemic disease on networks. Phys Rev E2002; 66: 016128.
19.
SinghalMSaxenaB. Exploring the performance of diffusion models in weighted social networks. In: Proceedings of 2024 2nd International Conference on Disruptive Technologies (ICDT), 2024, pp.920–923. 10.1109/ICDT61202.2024.10489068
20.
NewmanMEJ. Analysis of weighted networks. Phys Rev E - Stat Nonlinear, Soft Matter Phys2004; 70: 056131–9.
21.
NewmanM. Networks. New York: Oxford University Press, 2018.
22.
BellingeriMBevacquaDSartoriF, et al.Considering weights in real social networks: a review. Front Phys2023; 11: 1152243.
23.
GranovetterMS. The strength of weak ties. AJS1973; 78: 1360–1380.
24.
SunJTangJ. A survey of models and algorithms for social influence analysis. In: AggarwalC (eds) Social network data analytics. Boston, MA: Springer, 2011, pp.177–214. 10.1007/978-1-4419-8462-3_7
25.
RenRSuLMengX, et al.A large-scale group decision making model based on trust relationship and social network updating. CMES-Comput Model Eng Sci2024; 138: 429–458.
26.
KrideraSKanavosA. Exploring trust dynamics in online social networks: a social network analysis perspective. Math Comput Appl2024; 29: 37.
JainLKataryaRSachdevaS. Opinion leaders for information diffusion using graph neural network in online social networks. ACM Trans Web2023; 17: 1–37.
29.
MehtaRMishraS. Trust exploitation in graph based social recommender systems: a survey. In: 2024 Second International Conference on Emerging Trends in Information Technology and Engineering (ICETITE), 2024, pp.1–9: IEEE.
30.
LezhninaEAKalininaEAKarpenkoVA, et al.Strategy for maximizing information influence in social networks. In: AIP Conference Proceedings (Vol. 3094, No. 1), AIP Publishing, 2024.
31.
HajarathaiahKEnduriMKAnamalamudiS, et al.Algorithms for finding influential people with mixed centrality in social networks. Arab J Sci Eng2023; 48: 10417–10428.
32.
PattanayakHSSaxenaBSinhaA. Influence maximization in social networks using community-diversified seed selection. J Complex Netw2024; 12: cnae008.
33.
AhajjamSBadirH. Identification of influential spreaders in complex networks using HybridRank algorithm. Sci Rep2018; 8: 11932.
34.
LiuJZhengJ. Identifying important nodes in complex networks based on extended degree and E-shell hierarchy decomposition. Sci Rep2023; 13: 3197.
35.
QiuLZhangJTianX. Ranking influential nodes in complex networks based on local and global structures. Applied Intelligence2021; 51: 4394–4407.
36.
KianianSRostamniaM. An efficient path-based approach for influence maximization in social networks. Expert Syst Appl2021; 167: 114168.
37.
XuWLuZWuW, et al.A novel approach to online social influence maximization. Soc Netw Anal Min2014; 4: 53.
38.
AghaeeZKianianS. Influence maximization algorithm based on reducing search space in the social networks. SN Appl Sci2020; 2: 2067.
39.
GeJShiLLWuY, et al.Human-driven dynamic community influence maximization in social media data streams. IEEE Access2020; 8: 162238–162251.
40.
ChenXZhaoYLiuG, et al.Efficient similarity-aware influence maximization in geo-social network. IEEE Trans Knowl Data Eng2020; 34: 4767–4780.
41.
QinXZhongCYangQ. An influence maximization algorithm based on community-topic features for dynamic social networks. IEEE Trans Netw Sci Eng2022; 9: 608–621.
42.
ZhangLKanL. Influence maximization based on snapshot prediction in dynamic online social networks. Mathematics2022; 10: 1341.
43.
SaxenaBKumarP. A node activity and connectivity-based model for influence maximization in social networks. Soc Netw Anal Min2019; 9: 40.
44.
SaxenaBSaxenaV. Towards establishing the effect of self-similarity on influence maximization in online social networks. Soc Netw Anal Min2020; 10: 35.
45.
KumarSPandaA. Identifying influential nodes in weighted complex networks using an improved WVoteRank approach. Appl Intell2022; 52: 1838–1852.
46.
ZhangJXChenDBDongQ, et al.Identifying a set of influential spreaders in complex networks. Sci Rep2016; 6: 27823.
47.
RaamakirtinanSLivingstonLMJ. Identifying influential spreaders in Complex networks by weighted vote ranking and hybrid methods. J Theor Appl Inform Technol2021; 99: 1642–1661.
48.
RaamakirtinanSLivingstonLMJ. Identifying influential spreaders in complex networks based on weighted mixed degree decomposition method. Wirel Pers Commun2022; 127: 2103–2119.
49.
YangFLiXXuY, et al.Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition. Phys Lett A2018; 382: 2361–2371.
50.
KumarSAggarwalNPandaBS. Identifying influential spreaders on a weighted network using HookeRank method. In: KrzhizhanovskayaV, et al. (ed.) Computational Science – ICCS 2020. ICCS 2020. Lecture Notes in Computer Science, vol 12137. Cham: Springer, 2020, pp.609–622. 10.1007/978-3-030-50371-0_45
51.
CarchioloVLongheuAMalgeriM, et al.Mutual influence of users credibility and news spreading in online social networks. Future Internet2021; 13: 107.
52.
ZhuXMaJSuX, et al.Information spreading on weighted multiplex social network. Complexity2019; 2019: 5920187.
53.
CantiniRMarozzoFMazzaS, et al.A weighted artificial bee colony algorithm for influence maximization. Online Social Networks and Media2021; 26: 100167.
54.
NamtirthaADuttaADuttaB. Weighted kshell degree neighborhood: a new method for identifying the influential spreaders from a variety of complex network connectivity structures. Expert Syst Appl2020; 139: 112859.
55.
LiuYWeiBDuY, et al.Identifying influential spreaders by weight degree centrality in complex networks. Chaos. Solitons & Fractals2016; 86: –7.
56.
RenJWangCLiuQ, et al.Identify influential spreaders in complex networks based on potential edge weights. Int J Innov Comput Inf Control2016; 12: 581–590.
57.
MajiG. Influential spreaders identification in complex networks with potential edge weight based k-shell degree neighborhood method. J Comput Sci2020; 39: 101055.
58.
[dataset] KumarSSpezzanoFSubrahmanianVS, et al.Edge weight prediction in weighted signed networks. In: Proceedings of 2016 IEEE 16th International Conference on Data Mining (ICDM), 2016, pp.221–230. 10.1109/ICDM.2016.0033
59.
[dataset] KunegisJ. Konect: the Koblenz network collection. In: Proceedings of the 22nd international conference on world wide web, 2013, pp.1343–1350. 10.1145/2487788.2488173
60.
[dataset] MassaPSalvettiMTomasoniD. Bowling alone and trust decline in social network sites. In: Proceedings of 2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, 2009, pp.658–663. 10.1109/DASC.2009.130
61.
FreemanLC. Centrality in social networks: conceptual clarification. Social Network: Critical Concepts in Sociology2002; 1: 238–263.
62.
BrandesU. A faster algorithm for betweenness centrality. J Math Sociol2001; 25: 163–177.
