A Hurst-based Diffusion Model using Time Series Characteristics for Influence Maximization in Social Networks
24 Feb 2023
TL;DR: In this article , the authors proposed a Time Series Characteristic based Hurst-based Diffusion Model (TSC-HDM) which calculates Hurst Exponent (H) based on the stationary or non-stationary characteristic of the time series.
read more
Abstract: Online Social Networks (OSNs) have grown exponentially in the last few years due to their applications in real life like marketing, recommendation systems, and social awareness campaigns. One of the most important research areas in this field is Influence Maximization (IM). IM pertains to finding methods to maximize the spread of information (or influence) across a social network. Previous works in IM have focused on using a pre-defined edge propagation probability or using the Hurst exponent (H) to identify which nodes to be activated. This is calculated on the basis of self-similarity in the time series depicting a user’s (node) past temporal interaction behaviour. In this work, we propose a Time Series Characteristic based Hurst-based Diffusion Model (TSC-HDM). The model calculates Hurst Exponent (H) based on the stationary or non-stationary characteristic of the time series. Furthermore, our model selects a handful of seed nodes and activates every seed node’s inactive successor only if H>0.5 . The process is continued until the activation of successor nodes is not possible. The proposed model was tested on 4 datasets - UC Irvine messages, Email EU-Core, Math Overflow 3, and Linux Kernel mailing list. We have also compared the results against 4 other Influence Maximisation models - Independent Cascade (IC), Weighted Cascade (WC), Trivalency (TV), and Hurst-based Influence Maximisation (HBIM). Our model achieves as much as 590% higher expected influence spread as compared to the other models. Moreover, our model attained 344% better average influence spread than other state-of-the-art models.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Maximum Ismail’s Second Entropy Formalism of Heavy-Tailed Queues with Hurst Exponent Heuristic Mean Queue Length Combined with Potential Applications of Hurst Exponent to Social Computing and Connected Health
Dr Ismail A Mageed
- 30 Jan 2024
TL;DR: Non-extensive maximum entropy formalism for heavy-tailed queues with Hurst exponent heuristic mean queue length combined with potential applications to social computing and connected health.
1
References
Long-Term Storage Capacity of Reservoirs
TL;DR: In this paper, a solution of the problem of determining the reservoir storage required on a given stream, to guarantee a given draft, is presented, where a long-time record of annual total...
6.2K
Mosaic organization of DNA nucleotides
Chung-Kang Peng,Chung-Kang Peng,Chung-Kang Peng,Sergey V. Buldyrev,Sergey V. Buldyrev,Sergey V. Buldyrev,Shlomo Havlin,Shlomo Havlin,Shlomo Havlin,Michael Simons,Michael Simons,Michael Simons,H. E. Stanley,H. E. Stanley,H. E. Stanley,Ary L. Goldberger,Ary L. Goldberger,Ary L. Goldberger +17 more
TL;DR: This work analyzes two classes of controls consisting of patchy nucleotide sequences generated by different algorithms--one without and one with long-range power-law correlations, finding that both types of sequences are quantitatively distinguishable by an alternative fluctuation analysis method.
Mining the network value of customers
Pedro Domingos,Matthew Richardson +1 more
- 26 Aug 2001
TL;DR: It is proposed to model also the customer's network value: the expected profit from sales to other customers she may influence to buy, the customers those may influence, and so on recursively, taking advantage of the availability of large relevant databases.
3.3K
Efficient influence maximization in social networks
Wei Chen,Yajun Wang,Siyu Yang +2 more
- 28 Jun 2009
TL;DR: Based on the results, it is believed that fine-tuned heuristics may provide truly scalable solutions to the influence maximization problem with satisfying influence spread and blazingly fast running time.
Scalable influence maximization for prevalent viral marketing in large-scale social networks
Wei Chen,Chi Wang,Yajun Wang +2 more
- 25 Jul 2010
TL;DR: The results from extensive simulations demonstrate that the proposed algorithm is currently the best scalable solution to the influence maximization problem and significantly outperforms all other scalable heuristics to as much as 100%--260% increase in influence spread.