<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-interdisciplinary-mathematics</journal-id>
      <journal-title-group>
        <journal-title>Journal of Interdisciplinary Mathematics</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-012X</issn>
      <issn publication-format="print">0972-0502</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JIM-2821</article-id>
      <title-group>
        <article-title>Algebraic topology methods in network security</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Ganesh</surname>
            <given-names>D.</given-names>
          </name>
          <aff>Department of Computer Science and Engineering, Vardhaman College of Engineering, Hyderabad, Telangana, 501218, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Sudharsan</surname>
            <given-names>M.</given-names>
          </name>
          <aff>Presidency School of Information Science, Presidency University, Bengaluru, Karnataka, 560119, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Katharaj</surname>
            <given-names>I.</given-names>
          </name>
          <aff>Department of Mechanical Engineering, Faculty of Engineering and Technology, JAIN (Deemed-to-be University), Bangalore, Karnataka, 562112, India</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Ajani</surname>
            <given-names>Samir  N.</given-names>
          </name>
          <aff>School of Computer Science and Engineering, Ramdeobaba University (RBU), Nagpur, Maharashtra, 440013, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Sood</surname>
            <given-names>Saksham</given-names>
          </name>
          <aff>Centre of Research Impact and Outcome (CRIO), Chitkara University, Rajpura, Punjab, 140417, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Mishra</surname>
            <given-names>Rupesh</given-names>
          </name>
          <aff>Department of Computer Science and Engineering, Rungta College of Engineering and Technology, Rungta International Skills University, Bhilai, Chhattisgarh, 490024, India</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>10</issue>
      <fpage>3083</fpage>
      <lpage>3095</lpage>
      <pub-date date-type="pub">
        <day>27</day>
        <month>10</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>Attack surfaces are becoming dynamic, communications are increasingly encrypted and coordinated attacks are growing in complexity, creating more challenges for modern network security; traditional graph-based security solutions struggle to see the big picture and understand relationships among entities in the network. To secure the network an effective intrusion detection system, the authors propose a new model for Network Security–Persistent Homology-Based Network Security Model (PHNSM) which combines simplicial complex construction with homology computation, persistent homology, topological feature extraction, and graph neural networks-based threat classification. The proposed model is a multidimensional communication pattern, which is represented algebraically to be used for the effective identification of stealthy and distributed cyber-attacks in the global network, while maintaining the entire network function. Experimental evaluation is able to attain detection accuracy of 94.67%, precision of 94.18%, recall of 93.86%, F1-score of 94.02% and ROC-AUC of 96.08% and a 18.3% reduction in false-positive rate when compared to conventional graph-based security methods. The novelty is that the integration of persistent homology and deep topological learning for a cyber threat analysis with interpretation. The proposed framework provides mathematically sound, scalable and robust approach to anomaly detection, localization of attacks and large scale communication networks.</p>
      </abstract>
      <kwd-group>
        <kwd>Algebraic topology</kwd>
        <kwd>Persistent homology</kwd>
        <kwd>Network security</kwd>
        <kwd>Simplicial complexes</kwd>
        <kwd>Graph neural networks</kwd>
        <kwd>Intrusion detection</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
