{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:34:55Z","timestamp":1757619295300,"version":"3.44.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T00:00:00Z","timestamp":1753228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T00:00:00Z","timestamp":1753228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100016379","name":"Universit\u00e4t Osnabr\u00fcck","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100016379","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>For studying intrusion detection data we consider data points referring to individual IP addresses and their connections. We build networks represented by graphs associated with those data points, such that vertices in a graph are constructed to denote the respective IP addresses, with the key property that attacked data points are part of the structure of the network. More precisely, this paper proposes a novel approach using simplicial complexes to model the desired network and the respective intrusions in terms of simplicial attributes, thus generalizing previous graph-based approaches. Applying adapted network centrality measures related to simplicial complexes yields patterns associated to vertices, which themselves contain a set of features. These are used to describe the attacked or the attacker vertices, respectively. Comparing this new strategy with classical concepts demonstrates the advantages of the presented approach using simplicial features for detecting and characterizing intrusions.<\/jats:p>","DOI":"10.1007\/s41109-025-00720-z","type":"journal-article","created":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T11:26:14Z","timestamp":1753269974000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simplicial complexes in network intrusion profiling: pattern construction through simplicial centralities"],"prefix":"10.1007","volume":"10","author":[{"given":"Mandala","family":"von Westenholz","sequence":"first","affiliation":[]},{"given":"Martin","family":"Atzmueller","sequence":"additional","affiliation":[]},{"given":"Tim","family":"R\u00f6mer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,23]]},"reference":[{"key":"720_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2020.102076","volume":"121","author":"G Akinwande","year":"2020","unstructured":"Akinwande G, Reitzner M (2020) Multivariate central limit theorems for random simplicial complexes. Adv Appl Math 121:102076","journal-title":"Adv Appl Math"},{"key":"720_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/widm.1144","volume":"5","author":"M Atzmueller","year":"2015","unstructured":"Atzmueller M (2015) Subgroup discovery. WIREs Data Min Knowl Discovery 5:35\u201349","journal-title":"WIREs Data Min Knowl Discovery"},{"key":"720_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0155-y","volume":"4","author":"M Atzmueller","year":"2019","unstructured":"Atzmueller M, Soldano H, Santini G, Bouthinon D (2019) MinerLSD: efficient mining of local patterns on attributed networks. Appl Netw Sci 4:1\u201333","journal-title":"Applied Network Science"},{"key":"720_CR4","doi-asserted-by":"crossref","unstructured":"Atzmueller M, Sylvester S, Kanawati R (2023) Exploratory and explanation-aware network intrusion profiling using subgroup discovery and complex network analysis. In: ACM international conference proceeding series pp 153\u2013158","DOI":"10.1145\/3590777.3590803"},{"key":"720_CR5","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s41468-017-0010-0","volume":"1","author":"O Bobrowski","year":"2018","unstructured":"Bobrowski O, Kahle M (2018) Topology of random geometric complexes: a survey. J Appl Comput Topol 1:331\u2013364","journal-title":"J Appl Comput Topol"},{"key":"720_CR6","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.socnet.2005.11.005","volume":"28","author":"SP Borgatti","year":"2006","unstructured":"Borgatti SP, Everett MG (2006) A graph-theoretic perspective on centrality. Soc Netw 28:466\u2013484","journal-title":"Soc Netw"},{"key":"720_CR7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.73.046131","volume":"73","author":"P Crepey","year":"2006","unstructured":"Crepey P, Alvarez FP, Barth\u00e9lemy M (2006) Epidemic variability in complex networks. Phys Rev E 73:046131","journal-title":"Phys Rev E"},{"key":"720_CR8","doi-asserted-by":"crossref","unstructured":"Diestel R (2025) Graph Theory, 6 edn Springer","DOI":"10.1007\/978-3-662-70107-2"},{"key":"720_CR9","unstructured":"Edelsbrunner H, Harer JL (2022) Computational topology: an introduction, American Mathematical Society"},{"key":"720_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2023.129083","volume":"626","author":"CG Fink","year":"2023","unstructured":"Fink CG et al (2023) A centrality measure for quantifying spread on weighted, directed networks. Physica A 626:129083","journal-title":"Physica A"},{"key":"720_CR11","doi-asserted-by":"publisher","first-page":"4931","DOI":"10.1090\/S0002-9947-04-03470-1","volume":"356","author":"S Gaubert","year":"2004","unstructured":"Gaubert S, Gunawardena J (2004) The Perron-Frobenius theorem for homogeneous, monotone functions. Trans Am Math Soc 356:4931\u20134950","journal-title":"Trans Am Math Soc"},{"key":"720_CR12","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1137\/0109045","volume":"9","author":"EN Gilbert","year":"1961","unstructured":"Gilbert EN (1961) Random plane networks. J Soc Indus Appl Math 9:533\u2013543","journal-title":"J Soc Indus Appl Math"},{"key":"720_CR13","doi-asserted-by":"crossref","unstructured":"Grosskreutz H, R\u00fcping S, Wrobel S (2008) Tight optimistic estimates for fast subgroup discovery. Joint European conference on machine learning and knowledge discovery in databases 440\u2013456","DOI":"10.1007\/978-3-540-87479-9_47"},{"key":"720_CR14","doi-asserted-by":"publisher","first-page":"297","DOI":"10.4310\/HHA.2020.v22.n1.a17","volume":"22","author":"J Grygierek","year":"2020","unstructured":"Grygierek J, Juhnke-Kubitzke M, Reitzner M, R\u00f6mer T, R\u00f6ndigs O (2020) Gigantic random simplicial complexes. Homology Homotopy Appl 22:297\u2013318","journal-title":"Homology Homotopy Appl"},{"key":"720_CR15","doi-asserted-by":"crossref","unstructured":"Hug D, Reitzner M (2016) Introduction to stochastic geometry. Stochastic analysis for Poisson point processes: Malliavin Calculus, Wiener-It\u00f4 chaos expansions and stochastic geometry 145\u2013184","DOI":"10.1007\/978-3-319-05233-5_5"},{"key":"720_CR16","doi-asserted-by":"publisher","first-page":"343","DOI":"10.4310\/HHA.2013.v15.n1.a17","volume":"15","author":"M Kahle","year":"2013","unstructured":"Kahle M, Meckes E (2013) Limit theorems for Betti numbers of random simplicial complexes. Homol Homotopy Appl 15:343\u2013374","journal-title":"Homol Homotopy Appl"},{"key":"720_CR17","doi-asserted-by":"crossref","unstructured":"Kosk R et al (2024) Deep spectral meshes: multi-frequency facial mesh processing with graph neural networks. arXiv preprint. arXiv:2402.10365","DOI":"10.3390\/electronics13040720"},{"key":"720_CR18","doi-asserted-by":"crossref","unstructured":"Kozlov D (2008) Combinatorial algebraic topology, Springer","DOI":"10.1007\/978-3-540-71962-5"},{"key":"720_CR19","doi-asserted-by":"crossref","unstructured":"Lemmens B, Nussbaum R (2012) Nonlinear Perron-Frobenius Theory, vol 189, Cambridge University Press","DOI":"10.1017\/CBO9781139026079"},{"key":"720_CR20","doi-asserted-by":"crossref","unstructured":"Li M (2018) An introduction to mathematical modeling of infectious diseases. Mathematics of Planet Earth, Springer International Publishing","DOI":"10.1007\/978-3-319-72122-4_1"},{"key":"720_CR21","unstructured":"Marisca I, Alippi C, Bianchi FM (2024) Graph-based Forecasting with Missing Data through Spatiotemporal Downsampling. arXiv preprint. arXiv:2402.10634"},{"key":"720_CR22","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/65.283931","volume":"8","author":"B Mukherjee","year":"1994","unstructured":"Mukherjee B, Heberlein LT, Levitt KN (1994) Network intrusion detection. IEEE Netw 8:26\u201341","journal-title":"IEEE Netw"},{"key":"720_CR23","doi-asserted-by":"crossref","unstructured":"Munkres JR (2018) Elements of algebraic topology (CRC press)","DOI":"10.1201\/9780429493911"},{"key":"720_CR24","unstructured":"Newman M (2018) Networks, Oxford university press"},{"key":"720_CR25","doi-asserted-by":"crossref","unstructured":"Penrose M (2003) Random geometric graphs, Vol.\u00a05, Oxford University Press","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"720_CR26","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.laa.2024.03.032","volume":"691","author":"M Reitzner","year":"2024","unstructured":"Reitzner M, R\u00f6mer T, von Westenholz M (2024) Covariance matrices of length power functionals of random geometric graphs-an asymptotic analysis. Linear Algebra Appl 691:151\u2013181","journal-title":"Linear Algebra Appl"},{"key":"720_CR27","unstructured":"Rosenberg J (2017) Security in embedded systems. Rugged Embedded Syst 3"},{"key":"720_CR28","volume":"382","author":"DH Serrano","year":"2020","unstructured":"Serrano DH, G\u00f3mez DS (2020) Centrality measures in simplicial complexes: applications of topological data analysis to network science. Appl Math Comput 382:125331","journal-title":"Appl Math Comput"},{"key":"720_CR29","doi-asserted-by":"crossref","unstructured":"Sommer R, Paxson V (2010) Outside the closed world: on using machine learning for network intrusion detection. 2010 IEEE symposium on security and privacy 305\u2013316","DOI":"10.1109\/SP.2010.25"},{"key":"720_CR30","unstructured":"Stanley RP (2007) Combinatorics and commutative algebra, vol\u00a041, Springer"},{"key":"720_CR31","doi-asserted-by":"crossref","unstructured":"Tang J et al (2023) Graphgpt: graph instruction tuning for large language models. arXiv preprint. arXiv:2310.13023","DOI":"10.1145\/3626772.3657775"},{"key":"720_CR32","doi-asserted-by":"crossref","unstructured":"Tirumala S, Valluri MR, Babu G (2019) A survey on cybersecurity awareness concerns, practices and conceptual measures. 2019 international conference on computer communication and informatics (ICCCI) 1\u20136","DOI":"10.1109\/ICCCI.2019.8821951"},{"key":"720_CR33","doi-asserted-by":"crossref","unstructured":"Walters R, Novak M (2021) Cyber security. Cyber security, artificial intelligence, data protection & the law 21\u201337","DOI":"10.1007\/978-981-16-1665-5_2"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00720-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-025-00720-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00720-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T19:39:32Z","timestamp":1757273972000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-025-00720-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,23]]},"references-count":33,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["720"],"URL":"https:\/\/doi.org\/10.1007\/s41109-025-00720-z","relation":{},"ISSN":["2364-8228"],"issn-type":[{"type":"electronic","value":"2364-8228"}],"subject":[],"published":{"date-parts":[[2025,7,23]]},"assertion":[{"value":"6 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors are not aware of any conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"35"}}