Dinamik Sosyal Ağ Analizi için Esnek Trioid Grafikleri

Abstract

Esnek trioid grafikleri, parametreleştirilmiş cebiri ve graf kuramını birleştirerek, değişen bağlamlar altında hem cebirsel yapı hem de ilişkisel bağlantısallık sergileyen sistemleri modellemek için kullanılır. Bu çalışma, söz konusu çerçeveyi dinamik sosyal ağ analizi alanına uygulamakta ve idempotent bir ağın yarı-kafes (semilattice) ayrışımının zamansal olarak kararlı topluluklar ürettiğini göstermektedir; burada idempotent elemanlar kalıcı etkileyiciler olarak işlev görür. Twitter verileri üzerinde gerçekleştirilen ampirik doğrulama, gerçek topluluk etiketleriyle %92 oranında uyum sağlamış ve Louvain (0.62), Infomap (0.65) ve dinamik stokastik blok modelleri (0.71) gibi geleneksel yöntemleri önemli ölçüde geride bırakmıştır. Ayrışım ayrıca hiyerarşik etki yapılarının varlığını ortaya koymakta olup, en üst düzey etkileyicilerin etkilerinin daha yavaş azaldığını göstermektedir. Bu bulgular, esnek trioid grafiklerinin bilimsel ve mühendislik alanlarında parametreleştirilmiş ilişkisel sistemlerin analizinde güçlü bir matematiksel araç olduğunu ortaya koymaktadır.

Keywords

• Esnek trioid grafikleri
• parametreleştirilmiş sistemler
• erişim kontrolü
• sosyal ağlar
• ayrışım algoritmaları.

Soft Trioid Graphs for Dynamic Social Network Analysis

Abstract

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.

Keywords

• Soft trioid graphs
• parametrized systems
• access control
• social networks
• decomposition algorithms.

References

1. [1]J. Aczél. Lectures on Functional Equations and Their Applications. Academic Press, New York, 1966
2. [2] M. Akram, S. Nawaz. Operations on soft graphs, Fuzzy Information and Engineering, 7 (4), 423 – 449, (2003).
3. [3]D. E. Bell, L. J. LaPadula., Secure computer systems: Mathematical Foundations, MITRE Corporation, (1973)
4. [4]D. M. Blei, A. Y. Ng, M. I. Jordan. Latent Dirichlet allocation. Journal of Machine Learning Research, 3:993–1022, 2003
5. [5]V. D. Blondel, J.-L. Guillaume, R. Lambiotte, E. Lefebvre. Fast unfolding of communities in large networks.
6. [6]P. Holme, J. Saramaki., Temporary networks. Physics reports, 519(3), 97 - 125, (2012).
7. [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. [8]J. Leskovec, A. Krevl., SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data, (2014).

9. [9]J.-L. Loday., Dialgebras: in Dialgebras and Related Operads, Lecture Notes in Mathematics. 1763, 7 – 66, (2001).
10. [10]J.-L. Loday, M. O. Ronco., Trialgebras and families of polytopes, Contemporary Mathematics, 346, 369 – 398, (2004).
11. [11]P. K. Maji, R. Biswas, A. R. Roy., Soft set theory, Computers & Mathematics with Applications. 45 (4 - 5), 555 – 562, (2003).
12. [12]S. Maslov, K. Sneppen. Specificity and stability in topology of protein networks. Science, 296(5569):910–913, 2002. [13]C. Matias, V. Miele., Statistical clustering of temporal networks through a dynamic stochastic block model, Journal of the Royal Statistical Society: Series B, 79(4), 1119 – 1141, (2017). [14]D. Molodtsov. Soft set theory—First results. Computers & Mathematics with Applications, 37(4–5):19–31, 1999.
13. [15]P. S. Mostert, A. L. Shields. On the structure of semigroups on a compact manifold with boundary. Annals of Mathematics, 65 (1): 117 – 143, 1957.
14. [16]G. Oguz. Some notes on soft dimonoids, Stochastic Models in Computer Science, 3(1): 45 – 62, 2023.
15. [17]G. Oğuz, D. A. Oluyori, Soft Trioids. Preprint, 2026.
16. [18]G. Oğuz, D. A. Oluyori. Graph-theoretic structures in soft trioids. Preprint, 2026
17. [19]G. Oğuz, D. A. Oluyori., Soft Trioid graphs for multi-level secure access control, Preprint. (2026). [20]M. Rosvall, C. T. Bergstrom. Mapts of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences, 105 (4): 1118 – 1123, 2008.
18. [21]R. S. Sandhu, E. J. Coyne, H. L. Feinstein, C. E. Youman. Role-based access control models. IEEE Computer, 29(2): 38 – 47, 1996.
19. [22]R. K. Thumbakara, B. George. Soft graphs. General Mathematics Notes, 21(2):75–86, 2014.
20. [23]R. K. Thumbakara, B. George., Subdivision Graph, Power and Line Graph of a Soft Graph, Communications in Mathematica and Applications, 13 (1), 75 – 85, (2022). [24]A. V. Zhuchok. Semilattice decompositions of trioids. Bulletin of the Academy of Sciences of Moldova Mathematics, 1: 130 – 134, 2013. [25]A. V. Zhuchok., Trioids, Asian-European Journal of Mathematics, 8(4), Article ID 1550089, (2015). [26]N. Demirtaş, O. Dalkılıç. Bipolar fuzzy soft set theory applied to medical diagnosis. Turkish Journal of Mathematics and Computer Science, 16(2):314–324, 2024. [27]O. Dalkılıç. Decision-making approaches focusing on best parameter-object pair for soft set. Neural Com-puting and Applications, 37:14521–14539, 2025.
21. [28] M. Saqlain, M. Saeed, M.R. Ahmad, F. Smarandache. Generalization of TOPSIS for Neutrosophis Hypersoft set using Accuracy Function and Its Application. Neutrosophic Sets and Systems, 27, 131 – 137, (2019). [29] A. U. Rahman, M. Saeed, M. A. Mohammed, M. M. Jaber, B. Garcia-Zapirain. A Novel Fuzzy Parameterized Fuzzy Hypersoft Set and Riesz Summability Approach Based Decision Support System for Diagnosis of Heart Diseases, Diagnostics, 12 (7), 1546, (2022). https://doi.10.3390/diagnostics12071546
22. [30] O. Dalkilic, Innovative Decision-Making with VFP-Soft Sets: A Comparative Analysis with VFP-Soft Sets: A Comparative Analysis, Turkish Journal of Science & Technology, 20 (1), 109 – 119, (2025).
23. [31] O. Dalkilic, Berlirsizlik problemlerine yo ̈nelik yeni bir matematiksel yaklasim: VFPIFS-ku ̈me: A novel mathematical approach to uncertainty problems: VFPIFS-set. GUFBD/GUJS 12 (2), 614 – 623, (2022). DOI: 10.17714/gumusfenbil.870783
24. [32] N. Demitras, O. Dalkilic, Kiralama sektörünün gelişimine yönelik tasarlanan bir matematiksel model, El-Cezeri ̂s Journal of Science and Engineering, 8 (3), 1229 – 1242, (2021). DOI: 10.31202/ecjse.906148
25. [33] O. Dalkilic, Virtual Logic-Based Fuzzy Parameterized Fuzzy Hypersoft Sets: An Algorithmic Framework for Improved Decision-making, El-Cezeri ̂s Journal of Science and Engineering, 13 (2), 233 – 244, (2026). DOI: 10.31202/ecjse.176951
26. [34] N. Demitras, O. Dalkilic, Neutrosophic extension of N-soft set and similarity-based decision-making, Turk. J. Math. Comput. Sci., 13 (2), 294 – 309, (2021).
27. [35] N. Demitras, S. Hussain, O. Dalkilic, New Approaches of Inverse Soft Rough Sets and Their Applications in a Decision Making Problem, J. Appl. Math. & Informatics, 38 (3), 335 – 349, (2020). https://doi.org/10.14317/jami.2020.335
28. [36] N. Demitras, O. Dalkilic, Decomposition of Soft α-Continuity and Soft A-Continuity, Journal of New Theory, 31, 86 – 94, (2020). [37] B. Atay, Closeness and Residual Closeness of Lollipop Graphs and Line Graphs, Proceedings of IAM, 12 (2), 113 – 122, (2023).