GEOMETRIC PROBABILITIES GRAPH CONSTRUCTION FOR CYBERSECURITY PROCESS
Far East Journal of Mathematical Sciences (FJMS) · 16.07.2026 · 143 (8) · 2817-2829
DOI: 10.17654/0972087126157 ↗Kurz gefasst
Fachartikel in der Zeitschrift Far East Journal of Mathematical Sciences (FJMS), online erschienen am 16.07.2026. Verfasst von Michael Morabito und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
This paper proposes a geometry-driven framework for synthetic cybersecurity network analysis that integrates probabilistic graph construction, null-model validation, and inductive graph learning. The generated graphs encode local geometric constraints through intersection-based link probabilities, producing networks that depart systematically from Erdős-Rényi randomness while preserving comparable density. Overall, the study demonstrates that geometry-induced connectivity can yield interpretable, compact, and class-separable cybersecurity graphs. These findings support the use of geometric probability as a principled mechanism for synthetic network generation and as a useful benchmark for graph-based anomaly detection and learning.
Zitieren
APA
Morabito, M., Fusca, A., & Bosco, S. L. (2026). GEOMETRIC PROBABILITIES GRAPH CONSTRUCTION FOR CYBERSECURITY PROCESS. Far East Journal of Mathematical Sciences (FJMS), 143(8), 2817-2829. https://doi.org/10.17654/0972087126157
Vancouver
Morabito M, Fusca A, Bosco SL. GEOMETRIC PROBABILITIES GRAPH CONSTRUCTION FOR CYBERSECURITY PROCESS. Far East Journal of Mathematical Sciences (FJMS). 2026;143(8):2817-2829. doi:10.17654/0972087126157
BibTeX
@article{Morabito2026,
author = {Morabito, Michael and Fusca, Antonina and Bosco, Sabrina Lo},
title = {GEOMETRIC PROBABILITIES GRAPH CONSTRUCTION FOR CYBERSECURITY PROCESS},
journal = {Far East Journal of Mathematical Sciences (FJMS)},
year = {2026},
volume = {143},
number = {8},
pages = {2817--2829},
doi = {10.17654/0972087126157}
}
EUVIMED