{"language":[{"iso":"eng"}],"doi":"10.3390/e26080637","article_processing_charge":"Yes","date_created":"2024-09-08T22:01:11Z","has_accepted_license":"1","day":"01","quality_controlled":"1","oa_version":"Published Version","license":"https://creativecommons.org/licenses/by/4.0/","publication":"Entropy","file":[{"success":1,"creator":"dernst","file_id":"17948","date_created":"2024-09-09T09:01:12Z","checksum":"624a9e2c5b49d6c38b88b0f675467ba3","relation":"main_file","content_type":"application/pdf","date_updated":"2024-09-09T09:01:12Z","file_name":"2024_Entropy_Edelsbrunner.pdf","access_level":"open_access","file_size":8025139}],"file_date_updated":"2024-09-09T09:01:12Z","volume":26,"ddc":["510"],"intvolume":"        26","scopus_import":"1","month":"08","abstract":[{"lang":"eng","text":"Abstract\r\nMethods used in topological data analysis naturally capture higher-order interactions in point cloud data embedded in a metric space. This methodology was recently extended to data living in an information space, by which we mean a space measured with an information theoretical distance. One such setting is a finite collection of discrete probability distributions embedded in the probability simplex measured with the relative entropy (Kullback–Leibler divergence). More generally, one can work with a Bregman divergence parameterized by a different notion of entropy. While theoretical algorithms exist for this setup, there is a paucity of implementations for exploring and comparing geometric-topological properties of various information spaces. The interest of this work is therefore twofold. First, we propose the first robust algorithms and software for geometric and topological data analysis in information space. Perhaps surprisingly, despite working with Bregman divergences, our design reuses robust libraries for the Euclidean case. Second, using the new software, we take the first steps towards understanding the geometric-topological structure of these spaces. In particular, we compare them with the more familiar spaces equipped with the Euclidean and Fisher metrics."}],"publication_identifier":{"eissn":["1099-4300"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Edelsbrunner, H., Ölsböck, K., &#38; Wagner, H. (2024). Understanding higher-order interactions in information space. <i>Entropy</i>. MDPI. <a href=\"https://doi.org/10.3390/e26080637\">https://doi.org/10.3390/e26080637</a>","ista":"Edelsbrunner H, Ölsböck K, Wagner H. 2024. Understanding higher-order interactions in information space. Entropy. 26(8), 637.","mla":"Edelsbrunner, Herbert, et al. “Understanding Higher-Order Interactions in Information Space.” <i>Entropy</i>, vol. 26, no. 8, 637, MDPI, 2024, doi:<a href=\"https://doi.org/10.3390/e26080637\">10.3390/e26080637</a>.","chicago":"Edelsbrunner, Herbert, Katharina Ölsböck, and Hubert Wagner. “Understanding Higher-Order Interactions in Information Space.” <i>Entropy</i>. MDPI, 2024. <a href=\"https://doi.org/10.3390/e26080637\">https://doi.org/10.3390/e26080637</a>.","short":"H. Edelsbrunner, K. Ölsböck, H. Wagner, Entropy 26 (2024).","ieee":"H. Edelsbrunner, K. Ölsböck, and H. Wagner, “Understanding higher-order interactions in information space,” <i>Entropy</i>, vol. 26, no. 8. MDPI, 2024.","ama":"Edelsbrunner H, Ölsböck K, Wagner H. Understanding higher-order interactions in information space. <i>Entropy</i>. 2024;26(8). doi:<a href=\"https://doi.org/10.3390/e26080637\">10.3390/e26080637</a>"},"type":"journal_article","status":"public","pmid":1,"article_number":"637","date_updated":"2024-09-09T09:05:05Z","acknowledgement":"We thank Anton Nikitenko for first observing that the Wrap complex can be characterized as stated in Claim (ii) of the Wrap Complex Lemma, and Ondrej Draganov for correcting a critical mistake in one of our formulas in Section 2.","title":"Understanding higher-order interactions in information space","publication_status":"published","article_type":"original","publisher":"MDPI","oa":1,"year":"2024","_id":"17891","date_published":"2024-08-01T00:00:00Z","department":[{"_id":"HeEd"}],"external_id":{"pmid":["39202107"]},"author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"last_name":"Ölsböck","first_name":"Katharina","full_name":"Ölsböck, Katharina","id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4672-8297"},{"full_name":"Wagner, Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Hubert"}],"issue":"8","related_material":{"link":[{"url":"https://git.ista.ac.at/katharina.oelsboeck/wrap_2_3-public/","relation":"software"}]},"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"}}