TR
EN
Soft Trioid Graphs for Dynamic Social Network Analysis
Öz
Soft trioid graphs integrate parameterized algebra with graph theory to model systems exhibiting both algebraic structure and relational connectivity under varying contexts. This paper applies the framework to dynamic social network analysis, demonstrating that semilattice decomposition of an idempotent network yields temporally stable com-munities, with idempotent elements serving as persistent influencers. Empirical valida-tion on Twitter data achieves 92% agreement with ground-truth community annotations, substantially outperforming traditional methods such as Louvain (0.62), Infomap (0.65) and dynamic stochastic block models (0.71). The decomposition further reveals hier-archical influence structures, with top-tier influencers exhibiting slow influence decay. These findings establish soft trioid graphs as a robust mathematical tool for analyzing parameterized relational systems across scientific and engineering domains.
Anahtar Kelimeler
Kaynakça
- [1]J. Aczél. Lectures on Functional Equations and Their Applications. Academic Press, New York, 1966
- [2] M. Akram, S. Nawaz. Operations on soft graphs, Fuzzy Information and Engineering, 7 (4), 423 – 449, (2003).
- [3]D. E. Bell, L. J. LaPadula., Secure computer systems: Mathematical Foundations, MITRE Corporation, (1973)
- [4]D. M. Blei, A. Y. Ng, M. I. Jordan. Latent Dirichlet allocation. Journal of Machine Learning Research, 3:993–1022, 2003
- [5]V. D. Blondel, J.-L. Guillaume, R. Lambiotte, E. Lefebvre. Fast unfolding of communities in large networks.
- [6]P. Holme, J. Saramaki., Temporary networks. Physics reports, 519(3), 97 - 125, (2012).
- [7]E. Katz, P. F. Lazarsfeld. Personal Influence: The Part Played by People in the Flow of Mass Communi-cations. Free Press, Glencoe, IL, 1955.
- [8]J. Leskovec, A. Krevl., SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data, (2014).
Ayrıntılar
Birincil Dil
İngilizce
Konular
Karar Desteği ve Grup Destek Sistemleri, Grup Teorisi ve Genellemeler, Matematiksel Mantık, Kümeler Teorisi, Kafesler ve Evrensel Cebir
Bölüm
Araştırma Makalesi
Yayımlanma Tarihi
27 Eylül 2026
Gönderilme Tarihi
8 Nisan 2026
Kabul Tarihi
25 Temmuz 2026
Yayımlandığı Sayı
Yıl 2026 Cilt: 38 Sayı: 3
APA
Oğuz, G., & Oluyori, D. A. (2026). Soft Trioid Graphs for Dynamic Social Network Analysis. International Journal of Advances in Engineering and Pure Sciences, 38(3), 480-503. https://doi.org/10.7240/jeps.1926004
AMA
1.Oğuz G, Oluyori DA. Soft Trioid Graphs for Dynamic Social Network Analysis. JEPS. 2026;38(3):480-503. doi:10.7240/jeps.1926004
Chicago
Oğuz, Gülay, ve David Adeyemi Oluyori. 2026. “Soft Trioid Graphs for Dynamic Social Network Analysis”. International Journal of Advances in Engineering and Pure Sciences 38 (3): 480-503. https://doi.org/10.7240/jeps.1926004.
EndNote
Oğuz G, Oluyori DA (01 Eylül 2026) Soft Trioid Graphs for Dynamic Social Network Analysis. International Journal of Advances in Engineering and Pure Sciences 38 3 480–503.
IEEE
[1]G. Oğuz ve D. A. Oluyori, “Soft Trioid Graphs for Dynamic Social Network Analysis”, JEPS, c. 38, sy 3, ss. 480–503, Eyl. 2026, doi: 10.7240/jeps.1926004.
ISNAD
Oğuz, Gülay - Oluyori, David Adeyemi. “Soft Trioid Graphs for Dynamic Social Network Analysis”. International Journal of Advances in Engineering and Pure Sciences 38/3 (01 Eylül 2026): 480-503. https://doi.org/10.7240/jeps.1926004.
JAMA
1.Oğuz G, Oluyori DA. Soft Trioid Graphs for Dynamic Social Network Analysis. JEPS. 2026;38:480–503.
MLA
Oğuz, Gülay, ve David Adeyemi Oluyori. “Soft Trioid Graphs for Dynamic Social Network Analysis”. International Journal of Advances in Engineering and Pure Sciences, c. 38, sy 3, Eylül 2026, ss. 480-03, doi:10.7240/jeps.1926004.
Vancouver
1.Gülay Oğuz, David Adeyemi Oluyori. Soft Trioid Graphs for Dynamic Social Network Analysis. JEPS. 01 Eylül 2026;38(3):480-503. doi:10.7240/jeps.1926004