TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover

Journal of Discrete Mathematical Sciences and Cryptography

(Since 1998)
Hybrid ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

CiteScore 2025: 2.7 (Q1)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Taru Online First Current IssueSpecial IssuesBrowse all Issues
Journal of Discrete Mathematical Sciences and Cryptography
Open Access Research Article

Graph-theoretic and geometric methods for social network influence analysis

, , , , * ,

* Corresponding author · click or hover a name for details

pp. 1875–1885Vol. 28Issue 5-BAugust 2025DOI: 10.47974/JDMSC-2364 Crossmark XML
Received:
05 Nov 2024
Published Online:
30 Aug 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2364
Pages:
1875–1885

Abstract

The growing role we play in influencing and being influenced by those around us, for better or worse, underscores the importance of having proven ways to analyze and model the propagation of influence. The use of such techniques or traditional graph theoretic approaches alone do not capture the complex, non-linear nature of many real-world social networks. In response to this problem, in this paper we present a new framework combining graph and geometry approaches for full analysis of social network influence. We mix traditional centrality statistics like degree, betweenness, clustering coefficients, with more sophisticated lower-level geometric features, such as geodesics and curvature analysis obtained at the price of using Riemannian geometry. This Hybrid model also allows us to infer the key players who provide us with further detailed information about the structural strength and interaction of a network. Drawing on geometric characteristics, our approach successfully captures correlation of nonlinear effect, resulting in more accurate influence spread estimation. We use the real-world social network data to conduct a case study and show that the proposed framework not only enhances the effectiveness of critical node-oriented attacks in target identification but also leads to a more accurate discovery of bottlenecks and weakly connected regions. The presented method alleviates the difficulties of the established techniques by providing a mathematically structured, yet computationally efficient framework that provides interpretability offered from graph theory with the level of detail from geometric analysis. This work can inform targeted marketing, misinformation control and community behavior dynamics, and lends novel insights to the study of influence dynamics in social networks more broadly.

Keywords

Social network analysisGraph theoryRiemannian geometryCentrality measuresCurvature analysisGeodesic paths

Subject Classifications

05C82

References

[1] W. Chen, S.-H. Teng, and H. Zhang, “A systematic framework and characterization of influence‑based network centrality,” IEEE Trans. Netw. Sci. Eng., vol. 7, no. 3, pp. 1390–1403 (Jul.–Sep. 2020).
[2] S. T. Smith, E. K. Kao, D. C. Shah, O. Simek, and D. B. Rubin, “Influence estimation on social media networks using causal inference,” in Proc. IEEE Stat. Sign. Process. Workshop (SSP), Warwick, UK,  pp. 149–153 (Jun. 2018).
[3] A. Ghasemian and N. A. Christakis, “The enmity paradox: negative ties and their impact on social networks,” preprint, arXiv:2304.10076 (Apr. 2023).
[4] J. H. Fowler and N. A. Christakis, “Friends of friends: are indirect connections in social networks relevant?” Proc. R. Soc. B, vol. 282, no. 1805 (2014), Art. no. 20142223.
[5] M. Ben Sliman and R. Kohli, “The extended directed friendship paradox in social networks,” J. Complex Netw., vol. 8, no. 4, cnaa024 (2020).
[6] V. Gupta, P. Dass, and R. Arora, “Pendulating or resonating? A case of echo‑chambers in Twitter,” J. Discrete Math. Sci. Cryptogr., vol. 25, no. 1, pp. 231–240 (Jan. 2022).
[7] K. Zhang, Y. Zhou, H. Long, C. Wang, H. Hong, and S. M. Armaghan, “Toward identifying influential nodes in complex networks using semi‑local centrality metrics,” J. King Saud Univ. – Comput. Inf. Sci., vol. 35, no. 10, Art. no. 101798 (Oct. 2023).
[8] Y. Xiao, Y. Chen, H. Zhang, X. Zhu, Y. Yang, and X. Zhu, “A new semi‑local centrality for identifying influential nodes based on local average shortest path with extended neighborhood,” Artif. Intell. Rev., vol. 57, Art. 115 (Apr. 2024), doi:10.1007/s10462-024-10725-2.
[9] S. Esfandiari and S. M. Fakhrahmad, “Mining influential spreaders in complex networks by an effective combination of the degree and K‑shell,” IEEE Access, vol. 12, pp. 173775–173791 (2024).
[10] A. Ullah, J. Sheng, B. Wang, S. U. Din, and N. Khan, “Leveraging neighborhood and path information for influential spreaders recognition in complex networks,” J. Intell. Inf. Syst. (2023), doi:10.1007/s10844-023-00822-z.

Views: 286Downloads: 93Citations: 0