{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:13:47Z","timestamp":1770916427521,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100018934","name":"Universit\u00e4t Greifswald","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100018934","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We encode graph profiles based on homomorphisms, injective homomorphisms, and embeddings as families of linear functionals. We show that these maps are compatible with the operations of their underlying combinatorial Hopf algebras. Furthermore, we give two alternative proofs that these Hopf algebras are all isomorphic to a polynomial Hopf algebra. The first is based on a classical result in the theory of Hopf algebras, while the second relies on maps that allow one to switch between the different profiles.<\/jats:p>","DOI":"10.1007\/s00373-025-02907-8","type":"journal-article","created":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T02:56:05Z","timestamp":1742612165000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph Profiles as Characters on Bicommutative Hopf Algebras"],"prefix":"10.1007","volume":"41","author":[{"given":"Diego","family":"Caudillo","sequence":"first","affiliation":[]},{"given":"Joscha","family":"Diehl","sequence":"additional","affiliation":[]},{"given":"Kurusch","family":"Ebrahimi-Fard","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7544-6736","authenticated-orcid":false,"given":"Emanuele","family":"Verri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,21]]},"reference":[{"key":"2907_CR1","unstructured":"Adamek, J., Herrlich, H., Strecker, G.E.: Abstract and concrete categories: the joy of cats (1990)"},{"issue":"1","key":"2907_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1112\/S0010437X0500165X","volume":"142","author":"M Aguiar","year":"2006","unstructured":"Aguiar, M., Bergeron, N., Sottile, F.: Combinatorial Hopf algebras and generalized Dehn\u2013Sommerville relations. Compos. Math. 142(1), 1\u201330 (2006)","journal-title":"Compos. Math."},{"key":"2907_CR3","doi-asserted-by":"crossref","unstructured":"Biau, G., Fermanian, A.: Learning with signatures. In: International Workshop on Functional and Operatorial Statistics, pp. 19\u201326. Springer (2020)","DOI":"10.1007\/978-3-030-47756-1_4"},{"issue":"2","key":"2907_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1093\/qmath\/29.2.159","volume":"29","author":"N Biggs","year":"1978","unstructured":"Biggs, N.: On cluster expansions in graph theory and physics. Q. J. Math. 29(2), 159\u2013173 (1978)","journal-title":"Q. J. Math."},{"key":"2907_CR5","doi-asserted-by":"crossref","unstructured":"Borgs, C., Chayes, J., Lov\u00e1sz, L., S\u00f3s, V.T., Vesztergombi, K.: Counting graph homomorphisms. In: Topics in Discrete Mathematics, pp. 315\u2013371. Springer (2006)","DOI":"10.1007\/3-540-33700-8_18"},{"key":"2907_CR6","unstructured":"Borie, N.: The Hopf algebra of graph invariants (2015). arXiv preprint arXiv:1511.05843"},{"key":"2907_CR7","unstructured":"Bravo-Hermsdorff, G., Gunderson, L.M, Maugis, P.-A., Priebe, C.E.: A principled (and practical) test for network comparison (2021). arXiv preprint arXiv:2107.11403"},{"issue":"4","key":"2907_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3186586","volume":"12","author":"M Bressan","year":"2018","unstructured":"Bressan, M., Chierichetti, F., Kumar, R., Leucci, S., Panconesi, A.: Motif counting beyond five nodes. ACM Trans. Knowl. Discov. Data (TKDD) 12(4), 1\u201325 (2018)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"2907_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77845-3","volume-title":"Classical Hopf Algebras and Their Applications","author":"P Cartier","year":"2021","unstructured":"Cartier, P., Patras, F.: Classical Hopf Algebras and Their Applications. Springer, Berlin (2021)"},{"key":"2907_CR10","unstructured":"Chevyrev, I., Oberhauser, H.: Signature moments to characterize laws of stochastic processes (2018). arXiv preprint arXiv:1810.10971"},{"key":"2907_CR11","doi-asserted-by":"crossref","unstructured":"Curticapean, R., Dell, H., Marx, D.: Homomorphisms are a good basis for counting small subgraphs. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 210\u2013223 (2017)","DOI":"10.1145\/3055399.3055502"},{"key":"2907_CR12","unstructured":"Diehl, J., Ebrahimi-Fard, K., Tapia, N.: Generalized iterated-sums signatures (2020). arXiv preprint arXiv:2012.04597"},{"key":"2907_CR13","first-page":"86","volume":"84","author":"J Diehl","year":"2020","unstructured":"Diehl, J., Ebrahimi-Fard, K., Tapia, N.: Iterated-sums signature, quasisymmetric functions and time series analysis. Sem. Lothar. Comb. B 84, 86 (2020)","journal-title":"Sem. Lothar. Comb. B"},{"key":"2907_CR14","volume-title":"Hopf Algebras in Combinatorics","author":"D Grinberg","year":"2020","unstructured":"Grinberg, D., Reiner, V.: Hopf Algebras in Combinatorics. Mathematisches Forschungsinstitut Oberwolfach gGmbH (2020)"},{"issue":"31","key":"2907_CR15","first-page":"1","volume":"20","author":"FJ Kir\u00e1ly","year":"2019","unstructured":"Kir\u00e1ly, F.J., Oberhauser, H.: Kernels for sequentially ordered data. J. Mach. Learn. Res. 20(31), 1\u201345 (2019)","journal-title":"J. Mach. Learn. Res."},{"issue":"3\u20134","key":"2907_CR16","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02280291","volume":"18","author":"L Lov\u00e1sz","year":"1967","unstructured":"Lov\u00e1sz, L.: Operations with structures. Acta Math. Acad. Sci. Hungar. 18(3\u20134), 321\u2013328 (1967)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"2907_CR17","volume-title":"Large Networks and Graph Limits","author":"L Lov\u00e1sz","year":"2012","unstructured":"Lov\u00e1sz, L.: Large Networks and Graph Limits, vol. 60. American Mathematical Soc., Providence (2012)"},{"issue":"2","key":"2907_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.4171\/rmi\/240","volume":"14","author":"TJ Lyons","year":"1998","unstructured":"Lyons, T.J.: Differential equations driven by rough signals. Revista Matem\u00e1tica Iberoamericana 14(2), 215\u2013310 (1998)","journal-title":"Revista Matem\u00e1tica Iberoamericana"},{"key":"2907_CR19","first-page":"365","volume":"5","author":"D Manchon","year":"2008","unstructured":"Manchon, D.: Hopf algebras in renormalisation. Handb. Algebra 5, 365\u2013427 (2008)","journal-title":"Handb. Algebra"},{"issue":"3","key":"2907_CR20","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1080\/10618600.2020.1736085","volume":"29","author":"P-AG Maugis","year":"2020","unstructured":"Maugis, P.-A.G., Olhede, S.C., Priebe, C.E., Wolfe, P.J.: Testing for equivalence of network distribution using subgraph counts. J. Comput. Graph. Stat. 29(3), 455\u2013465 (2020)","journal-title":"J. Comput. Graph. Stat."},{"issue":"5594","key":"2907_CR21","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"key":"2907_CR22","unstructured":"nlab: Category of simple graphs\u2014nlab"},{"key":"2907_CR23","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s00026-022-00578-3","volume":"26","author":"R Penaguiao","year":"2022","unstructured":"Penaguiao, R.: Pattern Hopf algebras. Ann. Comb. 26, 405\u2013451 (2022)","journal-title":"Ann. Comb."},{"issue":"2","key":"2907_CR24","doi-asserted-by":"publisher","first-page":"412","DOI":"10.4153\/CJM-1993-021-5","volume":"45","author":"WR Schmitt","year":"1993","unstructured":"Schmitt, W.R.: Hopf algebras of combinatorial structures. Can. J. Math. 45(2), 412\u2013428 (1993)","journal-title":"Can. J. Math."},{"issue":"3","key":"2907_CR25","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0022-4049(94)90105-8","volume":"96","author":"WR Schmitt","year":"1994","unstructured":"Schmitt, W.R.: Incidence Hopf algebras. J. Pure Appl. Algebra 96(3), 299\u2013330 (1994)","journal-title":"J. Pure Appl. Algebra"},{"issue":"1","key":"2907_CR26","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0022-4049(95)90925-B","volume":"101","author":"WR Schmitt","year":"1995","unstructured":"Schmitt, W.R.: Hopf algebra methods in graph theory. J. Pure Appl. Algebra 101(1), 77\u201390 (1995)","journal-title":"J. Pure Appl. Algebra"},{"key":"2907_CR27","doi-asserted-by":"publisher","first-page":"688","DOI":"10.2307\/1968214","volume":"32","author":"H Whitney","year":"1932","unstructured":"Whitney, H.: The coloring of graphs. Ann. Math. 32, 688\u2013718 (1932)","journal-title":"Ann. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02907-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02907-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02907-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:17:04Z","timestamp":1746253024000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02907-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,21]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2907"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02907-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,21]]},"assertion":[{"value":"23 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"48"}}