{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T06:40:36Z","timestamp":1764139236902,"version":"3.46.0"},"reference-count":23,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T00:00:00Z","timestamp":1764115200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Comput. Neurosci."],"abstract":"<jats:p>\n                    In algebraic topology, a\n                    <jats:italic>k<\/jats:italic>\n                    -dimensional simplex is defined as a convex polytope consisting of\n                    <jats:italic>k<\/jats:italic>\n                    + 1 vertices. If spatial dimensionality is not considered, it corresponds to the complete graph with\n                    <jats:italic>k<\/jats:italic>\n                    + 1 vertices in graph theory. The alternating sum of the number of simplices across dimensions yields a topological invariant known as the Euler characteristic, which has gained significant attention due to its widespread application in fields such as topology, homology theory, complex systems, and biology. The most common method for calculating the Euler characteristic is through simplicial decomposition and the Euler\u2013Poincar\u00e9 formula. In this study, we introduce a new \u201csubgraph\u201d polynomial, termed the simplex polynomial, and explore some of its properties. Using those properties, we provide a new method for computing the Euler characteristic and prove the existence of the Euler characteristic as an arbitrary integer by constructing the corresponding simplicial complex structure. When the Euler characteristic is 1, we determined a class of corresponding simplicial complex structures. Moreover, for three common network structures, we present the recurrence relations for their simplex polynomials and their corresponding Euler characteristics. Finally, at the end of this study, three basic questions are raised for the interested readers to study deeply.\n                  <\/jats:p>","DOI":"10.3389\/fncom.2025.1685586","type":"journal-article","created":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T06:35:35Z","timestamp":1764138935000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Simplex polynomial in complex networks and its applications to compute the Euler characteristic"],"prefix":"10.3389","volume":"19","author":[{"given":"Zhaoyang","family":"Wang","sequence":"first","affiliation":[]},{"given":"Xianghui","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Haixing","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"1965","published-online":{"date-parts":[[2025,11,26]]},"reference":[{"key":"B1","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1017\/S0305004100077422","article-title":"Homotopy Theory","volume":"60","author":"Adams","year":"1964","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"B2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41562-020-01024-1","article-title":"Evolutionary dynamics of higher-order interactions in social networks","volume":"5","author":"Alvarez-Rodriguez","year":"2021","journal-title":"Nat. Hum. Behav."},{"key":"B3","doi-asserted-by":"publisher","first-page":"2992","DOI":"10.1109\/TSP.2020.2981920","article-title":"Topological signal processing over simplicial complexes","volume":"68","author":"Barbarossa","year":"2021","journal-title":"IEEE Trans. Signal Proc."},{"key":"B4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/DSW.2018.8439885","article-title":"\u201cLearning from signals defined over simplicial complexes,\u201d","author":"Barbarossa","year":"2018","journal-title":"2018 IEEE Data Science Workshop"},{"key":"B5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2020.05.004","article-title":"Networks beyond pairwise interactions: structure and dynamics","volume":"874","author":"Battiston","year":"2020","journal-title":"Phys. Rep."},{"key":"B6","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1137\/21M1414024","article-title":"What are higher-order networks?","volume":"65","author":"Bick","year":"2023","journal-title":"SIAM Rev"},{"key":"B7","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1906.09068","article-title":"Simplex2Vec embeddings for community detection in simplicial complexes","author":"Billings","year":"2019","journal-title":"arXiv:1906.09068"},{"key":"B8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2023.04.002","article-title":"The structure and dynamics of networks with higher order interactions","volume":"1018","author":"Boccaletti","year":"2023","journal-title":"Phys. Rep.: A Rev. Sec. Phys. Lett. (Sec. C)"},{"key":"B9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.48550\/arXiv.1207.6437","article-title":"Statistical topological data analysis using persistence landscapes","volume":"16","author":"Bubenik","year":"2015","journal-title":"JMLR"},{"key":"B10","first-page":"17","article-title":"Linear arboricity of graphs embedded in a surface of non-negative Euler characteristic","volume":"12","author":"Chen","year":"2018","journal-title":"J. Shandong Univ. (Nat. Sci.)"},{"key":"B11","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","article-title":"Resolution limit in community detection","volume":"104","author":"Fortunato","year":"2006","journal-title":"Proc. Natl. Acad. Sci. U. S. A."},{"key":"B12","first-page":"313","article-title":"On clique polynomials","volume":"18","author":"Hajiabolhassan","year":"1998","journal-title":"Australas. J. Comb"},{"key":"B13","volume-title":"Homology Theory: An Introduction to Algebraic Topology","author":"Hilton","year":"1967"},{"key":"B14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0012-365X(94)90163-5","article-title":"Clique polynomials and independent set polynomials of graphs","volume":"982","author":"Hoede","year":"1991","journal-title":"Disc. Math."},{"key":"B15","unstructured":"The independence polynomial of a graph - a survey\n          \n          \n            \n              Levit\n              V. E.\n            \n            \n              Mandrescu\n              E.\n            \n          \n          ArXiv abs\/ 0904.4819\n          \n          2009"},{"key":"B16","unstructured":"Medina\n              D. T.\n            \n            \n              Jimenez\n              K. S.\n            \n          \n          Algebraic Topology for Data Analysis\n          \n          2021"},{"key":"B17","unstructured":"Raoul\n              B.\n            \n            \n              Loring\n              T. W.\n            \n          \n          Differential Forms in Algebraic Topology\n          \n          2009"},{"key":"B18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-030-91374-8_12","author":"Schaub","year":"2022","journal-title":"Signal Processing on Simplicial Complexes, in Higher-Order Systems"},{"key":"B19","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1093\/nsr\/nwz050","article-title":"Totally homogeneous networks","volume":"6","author":"Shi","year":"2019","journal-title":"Nat. Sci. Rev."},{"key":"B20","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/MCAS.2012.2237145","article-title":"Searching for optimal network topology with best possible synchronizability","volume":"13","author":"Shi","year":"2013","journal-title":"Circ. Syst. Mag. IEEE"},{"key":"B21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/MSP.2012.2235192","article-title":"The emerging field of signal processing on graphs: extending high-dimensional data analysis to networks and other irregular domains","volume":"30","author":"Shuman","year":"2013","journal-title":"IEEE Signal Proc. Mag."},{"key":"B22","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10827-017-0672-6","article-title":"Cliques and cavities in the human connectome","volume":"44","author":"Sizemore","year":"2018","journal-title":"J. Comp. Neurosci."},{"key":"B23","first-page":"164","volume-title":"Introduction to Graph Theory, 2nd Edn","author":"West","year":"2017"}],"container-title":["Frontiers in Computational Neuroscience"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fncom.2025.1685586\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T06:35:38Z","timestamp":1764138938000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fncom.2025.1685586\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,26]]},"references-count":23,"alternative-id":["10.3389\/fncom.2025.1685586"],"URL":"https:\/\/doi.org\/10.3389\/fncom.2025.1685586","relation":{},"ISSN":["1662-5188"],"issn-type":[{"value":"1662-5188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,26]]},"article-number":"1685586"}}