[{"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-065-7"]},"day":"02","page":"96","supervisor":[{"orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","first_name":"Bernd","last_name":"Bickel"}],"department":[{"_id":"GradSch"},{"_id":"BeBi"}],"degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/AT-ISTA-20276","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","ec_funded":1,"_id":"20276","title":"Design and control of deformable structures: From PCB lighting displays to elastomer robots","alternative_title":["ISTA Thesis"],"article_processing_charge":"No","has_accepted_license":"1","tmp":{"image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"file":[{"content_type":"application/pdf","file_id":"20284","date_created":"2025-09-03T10:40:52Z","file_name":"2025-Bhargava-Manas-Thesis.pdf","file_size":161436245,"creator":"mbhargav","checksum":"5baf8ca46c86a94fc8380ff1007aabd4","access_level":"open_access","success":1,"relation":"main_file","date_updated":"2025-09-03T10:40:52Z"},{"access_level":"closed","date_updated":"2025-09-04T09:22:29Z","relation":"source_file","content_type":"application/x-zip-compressed","file_id":"20285","date_created":"2025-09-03T13:18:05Z","file_name":"manas_phd_thesis_source_files.zip","file_size":198831315,"checksum":"66878fafbc0074f88ddd18f24a9fc647","creator":"mbhargav"}],"doi":"10.15479/AT-ISTA-20276","project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"oa":1,"corr_author":"1","author":[{"orcid":"0009-0007-6138-6890","full_name":"Bhargava, Manas","id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425","last_name":"Bhargava","first_name":"Manas"}],"date_updated":"2026-10-02T11:13:08Z","status":"public","OA_place":"publisher","type":"dissertation","language":[{"iso":"eng"}],"abstract":[{"text":"Complex 3D shapes can be created by morphing flat 2D configurations. Such deformations\r\neither preserve the intrinsic material geometry (e.g., folding paper) or modify it through\r\nlocalized contraction. Once transformed, the 3D shape can be further controlled to achieve a\r\ntarget functionality. A key challenge is to take the material specifications and the actuation\r\nprocess as input to automatically design the target 3D shape and its functionality. This thesis\r\npresents two novel computational pipelines for the design and control of shape-morphing\r\nstructures used to create functional prototypes.\r\nThe first pipeline borrows from the art of origami to fold paper into intricate shapes and\r\napplies this principle to make 3D lighting displays. We introduce, PCBend a computational\r\ndesign approach that covers a surface with individually addressable RGB LEDs, effectively\r\nforming a low-resolution surface by folding rigid printed circuit boards (PCBs). We optimize\r\ncut patterns on PCBs to act as hinges and co-design LED placement, circuit routing, and\r\nfabrication constraints to produce PCB blueprints. The PCBs are fabricated using automated\r\nstandard manufacturing services with LEDs embedded on them. Finally, the fabricated PCBs\r\nare cut along the contour and folded onto a 3D-printed support. The 3D lighting display is\r\nthen controlled to display complex surface light patterns.\r\nCreating 3D shapes through folding is only possible if their planar configuration, called ”unfolding” exists without any distortion or overlap. Existing methods often permit distortion\r\nor require multiple patches, which are unsuitable for fabrication pipelines that rely on folding\r\nnon-stretchable materials. We reinforce such fabrication pipelines by providing a geometric\r\nrelaxation to the problem, where the input shape is modified to admit overlap-free unfolding.\r\nThe second fabrication pipeline extends shape morphing to soft robotics by emulating nature’s\r\nblueprint of distributed actuation. Inspired by vertebrates, we build musculoskeletal robots\r\nusing modular active actuators, employing Liquid Crystal Elastomers (LCEs) as shrinkable\r\nartificial muscles integrated with 3D-printed bones. The chemical composition of LCEs is\r\naltered to enable untethered actuation through infrared radiation, allowing active control of\r\nindividual muscles and their corresponding bones. The combined motion of individual bones\r\ndefines the robot’s overall shape and functionality. Our proposed system significantly expands\r\nboth the design and control spaces of soft robots, which we harness using our computational\r\ndesign tools. We build several physical robots that exhibit complex shape morphing and varied\r\nterrain navigation, showcasing the versatility of our pipeline.\r\nThis thesis explores applications ranging from intricate light patterns displayed on 3D shapes\r\nformed by folding rigid PCBs to untethered robots that use contractile muscles to exhibit\r\nshape morphing and locomotion. Through these examples, the thesis highlights how computational design and distributed actuation, integrated with novel materials, can transform\r\npassive structures into functional prototypes.","lang":"eng"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"13049","status":"public"},{"relation":"part_of_dissertation","id":"20286","status":"public"},{"id":"18565","relation":"part_of_dissertation","status":"public"}]},"publisher":"Institute of Science and Technology Austria","ddc":["000"],"month":"09","date_published":"2025-09-02T00:00:00Z","license":"https://creativecommons.org/licenses/by-nc/4.0/","doi_confirm":"1","oa_version":"Published Version","citation":{"short":"M. Bhargava, Design and Control of Deformable Structures: From PCB Lighting Displays to Elastomer Robots, Institute of Science and Technology Austria, 2025.","mla":"Bhargava, Manas. <i>Design and Control of Deformable Structures: From PCB Lighting Displays to Elastomer Robots</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20276\">10.15479/AT-ISTA-20276</a>.","chicago":"Bhargava, Manas. “Design and Control of Deformable Structures: From PCB Lighting Displays to Elastomer Robots.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20276\">https://doi.org/10.15479/AT-ISTA-20276</a>.","apa":"Bhargava, M. (2025). <i>Design and control of deformable structures: From PCB lighting displays to elastomer robots</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20276\">https://doi.org/10.15479/AT-ISTA-20276</a>","ieee":"M. Bhargava, “Design and control of deformable structures: From PCB lighting displays to elastomer robots,” Institute of Science and Technology Austria, 2025.","ista":"Bhargava M. 2025. Design and control of deformable structures: From PCB lighting displays to elastomer robots. Institute of Science and Technology Austria.","ama":"Bhargava M. Design and control of deformable structures: From PCB lighting displays to elastomer robots. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20276\">10.15479/AT-ISTA-20276</a>"},"publication_status":"published","date_created":"2025-09-02T14:48:39Z","year":"2025","acknowledgement":"Financial support was provided by the European Research Council (ERC) under grant agreement No 715767 - MATERIALIZABLE: Intelligent fabrication-oriented Computational Design\r\nand Modeling that I gratefully acknowledge.\r\n","file_date_updated":"2025-09-04T09:22:29Z"},{"file_date_updated":"2025-04-16T09:06:45Z","intvolume":"        44","acknowledgement":"Researchers from INRIA received support from the DORNELL Inria Challenge. Silvia Sellán acknowledges support from NSERC Vanier Doctoral Scholarship and an MIT SoE Postdoctoral Fellowship for Engineering Excellence.","article_number":"e15269","isi":1,"publication_status":"published","publication":"Computer Graphics Forum","date_created":"2024-11-19T09:14:32Z","year":"2025","citation":{"ista":"Bhargava M, Schreck C, Freire M, Hugron PA, Lefebvre S, Sellán S, Bickel B. 2025. Mesh simplification for unfolding. Computer Graphics Forum. 44(1), e15269.","ieee":"M. Bhargava <i>et al.</i>, “Mesh simplification for unfolding,” <i>Computer Graphics Forum</i>, vol. 44, no. 1. Wiley, 2025.","ama":"Bhargava M, Schreck C, Freire M, et al. Mesh simplification for unfolding. <i>Computer Graphics Forum</i>. 2025;44(1). doi:<a href=\"https://doi.org/10.1111/cgf.15269\">10.1111/cgf.15269</a>","short":"M. Bhargava, C. Schreck, M. Freire, P.A. Hugron, S. Lefebvre, S. Sellán, B. Bickel, Computer Graphics Forum 44 (2025).","mla":"Bhargava, Manas, et al. “Mesh Simplification for Unfolding.” <i>Computer Graphics Forum</i>, vol. 44, no. 1, e15269, Wiley, 2025, doi:<a href=\"https://doi.org/10.1111/cgf.15269\">10.1111/cgf.15269</a>.","chicago":"Bhargava, Manas, Camille Schreck, M. Freire, P. A. Hugron, S. Lefebvre, S. Sellán, and Bernd Bickel. “Mesh Simplification for Unfolding.” <i>Computer Graphics Forum</i>. Wiley, 2025. <a href=\"https://doi.org/10.1111/cgf.15269\">https://doi.org/10.1111/cgf.15269</a>.","apa":"Bhargava, M., Schreck, C., Freire, M., Hugron, P. A., Lefebvre, S., Sellán, S., &#38; Bickel, B. (2025). Mesh simplification for unfolding. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.15269\">https://doi.org/10.1111/cgf.15269</a>"},"oa_version":"Published Version","date_published":"2025-02-01T00:00:00Z","publisher":"Wiley","ddc":["006"],"month":"02","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20276"}]},"abstract":[{"lang":"eng","text":"We present a computational approach for unfolding 3D shapes isometrically into the plane as a single patch without overlapping triangles. This is a hard, sometimes impossible, problem, which existing methods are forced to soften by allowing for map distortions or multiple patches. Instead, we propose a geometric relaxation of the problem: We modify the input shape until it admits an overlap‐free unfolding. We achieve this by locally displacing vertices and collapsing edges, guided by the unfolding process. We validate our algorithm quantitatively and qualitatively on a large dataset of complex shapes and show its proficiency by fabricating real shapes from paper."}],"OA_place":"publisher","type":"journal_article","quality_controlled":"1","status":"public","scopus_import":"1","OA_type":"hybrid","date_updated":"2026-10-02T11:13:08Z","author":[{"id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425","full_name":"Bhargava, Manas","first_name":"Manas","last_name":"Bhargava","orcid":"0009-0007-6138-6890"},{"full_name":"Schreck, Camille","id":"2B14B676-F248-11E8-B48F-1D18A9856A87","last_name":"Schreck","first_name":"Camille"},{"full_name":"Freire, M.","last_name":"Freire","first_name":"M."},{"full_name":"Hugron, P. A.","first_name":"P. A.","last_name":"Hugron"},{"first_name":"S.","last_name":"Lefebvre","full_name":"Lefebvre, S."},{"full_name":"Sellán, S.","last_name":"Sellán","first_name":"S."},{"full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385"}],"corr_author":"1","issue":"1","oa":1,"doi":"10.1111/cgf.15269","keyword":["fabrication","single patch unfolding","mesh simplification"],"researchdata_availability":"no","tmp":{"image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"file":[{"content_type":"video/mp4","date_created":"2024-11-19T09:23:20Z","file_id":"18567","file_size":36999751,"file_name":"Mesh_Simplification_For_Unfolding_cgf_submission_supplemental_video.mp4","creator":"mbhargav","checksum":"34acdd9bfbe43f00eb6c7656afef3ac6","access_level":"open_access","success":1,"date_updated":"2024-11-19T09:23:20Z","relation":"main_file"},{"success":1,"date_updated":"2025-04-16T09:06:45Z","relation":"main_file","access_level":"open_access","file_size":5188265,"file_name":"2025_CompGraphicsForum_Bhargava.pdf","checksum":"efb06b01bae37f470954601bc004374d","creator":"dernst","content_type":"application/pdf","date_created":"2025-04-16T09:06:45Z","file_id":"19576"}],"volume":44,"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","das_tickbox":"0","article_type":"original","external_id":{"isi":["001357046100001"],"arxiv":["2408.06944"]},"title":"Mesh simplification for unfolding","_id":"18565","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.1111/cgf.15269","supplementarymaterial":"yes","department":[{"_id":"GradSch"},{"_id":"BeBi"}],"arxiv":1,"day":"01","publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]}},{"corr_author":"1","doi":"10.15479/10.15479/at-ista-19759","oa":1,"file":[{"content_type":"application/pdf","file_id":"19829","date_created":"2025-06-10T18:11:05Z","file_size":3578077,"file_name":"ThesisFinal.pdf","checksum":"e5108e759014e2a9020c973c778fafc9","creator":"bprach","access_level":"open_access","relation":"main_file","date_updated":"2025-06-10T18:11:05Z"},{"date_updated":"2025-06-10T18:14:03Z","relation":"source_file","access_level":"closed","creator":"bprach","checksum":"51bf6c11fb6d8a9f8010b458c600a83f","file_size":74894357,"file_name":"ThesisFinal.zip","date_created":"2025-06-10T18:14:03Z","file_id":"19830","content_type":"application/x-zip-compressed"}],"has_accepted_license":"1","alternative_title":["ISTA Thesis"],"article_processing_charge":"No","title":"Robust image classification with 1-Lipschitz networks","_id":"19759","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","fulldoi":"https://doi.org/10.15479/10.15479/at-ista-19759","degree_awarded":"PhD","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"supervisor":[{"last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"publication_identifier":{"issn":["2663-337X"]},"page":"84","day":"30","file_date_updated":"2025-06-10T18:14:03Z","year":"2025","date_created":"2025-05-28T16:20:48Z","publication_status":"published","citation":{"short":"B. Prach, Robust Image Classification with 1-Lipschitz Networks, Institute of Science and Technology Austria, 2025.","apa":"Prach, B. (2025). <i>Robust image classification with 1-Lipschitz networks</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/10.15479/at-ista-19759\">https://doi.org/10.15479/10.15479/at-ista-19759</a>","chicago":"Prach, Bernd. “Robust Image Classification with 1-Lipschitz Networks.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/10.15479/at-ista-19759\">https://doi.org/10.15479/10.15479/at-ista-19759</a>.","mla":"Prach, Bernd. <i>Robust Image Classification with 1-Lipschitz Networks</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/10.15479/at-ista-19759\">10.15479/10.15479/at-ista-19759</a>.","ama":"Prach B. Robust image classification with 1-Lipschitz networks. 2025. doi:<a href=\"https://doi.org/10.15479/10.15479/at-ista-19759\">10.15479/10.15479/at-ista-19759</a>","ieee":"B. Prach, “Robust image classification with 1-Lipschitz networks,” Institute of Science and Technology Austria, 2025.","ista":"Prach B. 2025. Robust image classification with 1-Lipschitz networks. Institute of Science and Technology Austria."},"oa_version":"Published Version","doi_confirm":"1","date_published":"2025-05-30T00:00:00Z","publisher_comment":"In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not\r\nendorse any of ISTA's products or services. Internal or personal use of this\r\nmaterial is permitted. If interested in reprinting/republishing IEEE copyrighted material for advertising or promotional\r\npurposes or for creating new collective works for resale or redistribution, please go to\r\nhttp://www.ieee.org/publications_standards/publications/rights/rights_link.html to learn how to obtain a License from\r\nRightsLink.  If applicable, University Microfilms and/or ProQuest Library, or the Archives of Canada may supply single copies of the dissertation.","month":"05","ddc":["000"],"publisher":"Institute of Science and Technology Austria","abstract":[{"text":"Despite generating remarkable results in various computer vision tasks, deep learning comes\r\nwith some surprising shortcomings. For example, tiny perturbations, often imperceptible to\r\nthe human eye, can completely change the predictions of image classifiers. Despite a decade\r\nof research, the field has made limited progress in developing image classifiers that are both\r\naccurate and robust. This thesis aims to address this gap.\r\nAs our first contribution, we aim to simplify the process of training certifiably robust image\r\nclassifiers. We do this by designing a convolutional layer that does not require executing an\r\niterative procedure in every forward pass, but relies on an explicit bound instead. We also\r\npropose a loss function that allows optimizing for a particular margin more precisely.\r\nNext, we provide an overview and comparison of various methods that create robust image\r\nclassifiers by constraining the Lipschitz constant. This is important since generally longer\r\ntraining times and more parameters improve the performance of robust classifiers, making it\r\nchallenging to determine the most practical and effective methods from existing literature.\r\nIn 1-Lipschitz classification, the performance of current methods is still much worse than what\r\nwe expect on the simple tasks we consider. Therefore, we next investigate potential causes of\r\nthis shortcoming. We first consider the role of the activation function. We prove a theoretical\r\nshortcoming of the commonly used activation function, and provide an alternative without it.\r\nHowever this theoretical improvement does barely translate to the empirical performance of\r\nrobust classifiers, suggesting a different bottleneck.\r\nTherefore, in the final chapter, we study how the performance depends on the amount of\r\ntraining data. We prove that in the worst case, we might require far more data to train a\r\nrobust classifier compared to a normal one. We furthermore find that the amount of training\r\ndata is a key determinant of the performance current methods achieve on popular datasets.\r\nAdditionally, we show that linear subspaces exist with tiny data variance, and yet we can\r\nstill train very accurate classifiers after projecting into those subspaces. This shows that on\r\nthe datasets considered, enforcing robustness in classification makes the task strictly more\r\nchallenging.\r\n\r\n","lang":"eng"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"15039"},{"status":"public","relation":"part_of_dissertation","id":"11839"},{"id":"18874","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"17426","relation":"part_of_dissertation"}]},"language":[{"iso":"eng"}],"type":"dissertation","OA_place":"publisher","status":"public","date_updated":"2026-10-02T11:16:04Z","author":[{"first_name":"Bernd","last_name":"Prach","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","full_name":"Prach, Bernd"}]},{"publication_status":"published","year":"2025","date_created":"2025-10-12T22:01:26Z","publication":"2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops","date_published":"2025-06-15T00:00:00Z","publisher":"IEEE","month":"06","citation":{"ama":"Prach B, Lampert C. Intriguing properties of robust classification. In: <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i>. IEEE; 2025:660-669. doi:<a href=\"https://doi.org/10.1109/CVPRW67362.2025.00071\">10.1109/CVPRW67362.2025.00071</a>","ieee":"B. Prach and C. Lampert, “Intriguing properties of robust classification,” in <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i>, Nashville, TN, United States, 2025, pp. 660–669.","ista":"Prach B, Lampert C. 2025. Intriguing properties of robust classification. 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. CVPR: Conference on Computer Vision and Pattern Recognition, 660–669.","apa":"Prach, B., &#38; Lampert, C. (2025). Intriguing properties of robust classification. In <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i> (pp. 660–669). Nashville, TN, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPRW67362.2025.00071\">https://doi.org/10.1109/CVPRW67362.2025.00071</a>","mla":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i>, IEEE, 2025, pp. 660–69, doi:<a href=\"https://doi.org/10.1109/CVPRW67362.2025.00071\">10.1109/CVPRW67362.2025.00071</a>.","chicago":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” In <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i>, 660–69. IEEE, 2025. <a href=\"https://doi.org/10.1109/CVPRW67362.2025.00071\">https://doi.org/10.1109/CVPRW67362.2025.00071</a>.","short":"B. Prach, C. Lampert, in:, 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, IEEE, 2025, pp. 660–669."},"oa_version":"Preprint","quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"related_material":{"record":[{"id":"18874","relation":"earlier_version","status":"public"}]},"abstract":[{"text":"Despite extensive research since the community learned about adversarial examples 10 years ago, we still do not know how to train high-accuracy classifiers that are guaranteed to be robust to small perturbations of their inputs. Previous works often argued that this might be because no classifier exists that is robust and accurate at the same time. However, in computer vision this assumption does not match reality where humans are usually accurate and robust on most tasks of interest. We offer an alternative explanation and show that in certain settings robust generalization is only possible with unrealistically large amounts of data. Specifically, we find a setting where a robust classifier exists, it is easy to learn an accurate classifier, yet it requires an exponential amount of data to learn a robust classifier. Based on this theoretical result, we evaluate the influence of the amount of training data on datasets such as CIFAR10. Our findings indicate that the the amount of training data is the main factor determining the robust performance. Furthermore we show that that there are low magnitude directions in the data which are useful for non-robust generalization but are not available for robust classifiers. This implies that robust classification is a strictly harder tasks than normal classification, thereby providing an explanation why robust classification requires more data.","lang":"eng"}],"OA_place":"repository","type":"conference","author":[{"last_name":"Prach","first_name":"Bernd","full_name":"Prach, Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425"},{"last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"OA_type":"green","scopus_import":"1","date_updated":"2026-10-02T11:15:42Z","oa":1,"doi":"10.1109/CVPRW67362.2025.00071","corr_author":"1","conference":{"end_date":"2025-06-12","name":"CVPR: Conference on Computer Vision and Pattern Recognition","location":"Nashville, TN, United States","start_date":"2025-06-11"},"article_processing_charge":"No","external_id":{"arxiv":["2412.04245"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2412.04245"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Intriguing properties of robust classification","_id":"20455","publication_identifier":{"eissn":["2160-7516"],"issn":["2160-7508"],"isbn":["9798331599942"]},"arxiv":1,"page":"660-669","day":"15","fulldoi":"https://doi.org/10.1109/CVPRW67362.2025.00071","department":[{"_id":"ChLa"}]},{"publication_status":"published","date_created":"2025-04-29T09:39:34Z","year":"2025","file_date_updated":"2025-04-30T15:49:16Z","acknowledgement":"The project in Chapter 2 has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme under grant agreement No. 638176. The project in Chapter 3 was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA). The project in Chapter 4 has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreements No 78818 Alpha and No 638176). It was also partially supported by the DFG Collaborative Research Center TRR 109, 'Discretization in Geometry and Dynamics', through grant no. I02979-N35 of the Austrian Science Fund (FWF). Thank you for providing funds to support my work.","date_published":"2025-04-29T00:00:00Z","publisher":"Institute of Science and Technology Austria","ddc":["519","006"],"month":"04","oa_version":"Published Version","citation":{"ama":"Synak P. Methods for fluid simulation, surface tracking, and statistics of non-manifold structures. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19630\">10.15479/AT-ISTA-19630</a>","ieee":"P. Synak, “Methods for fluid simulation, surface tracking, and statistics of non-manifold structures,” Institute of Science and Technology Austria, 2025.","ista":"Synak P. 2025. Methods for fluid simulation, surface tracking, and statistics of non-manifold structures. Institute of Science and Technology Austria.","short":"P. Synak, Methods for Fluid Simulation, Surface Tracking, and Statistics of Non-Manifold Structures, Institute of Science and Technology Austria, 2025.","apa":"Synak, P. (2025). <i>Methods for fluid simulation, surface tracking, and statistics of non-manifold structures</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-19630\">https://doi.org/10.15479/AT-ISTA-19630</a>","chicago":"Synak, Peter. “Methods for Fluid Simulation, Surface Tracking, and Statistics of Non-Manifold Structures.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-19630\">https://doi.org/10.15479/AT-ISTA-19630</a>.","mla":"Synak, Peter. <i>Methods for Fluid Simulation, Surface Tracking, and Statistics of Non-Manifold Structures</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19630\">10.15479/AT-ISTA-19630</a>."},"status":"public","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"8135","status":"public"},{"id":"8384","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"17219","status":"public"}]},"abstract":[{"lang":"eng","text":"This thesis consists of three chapters, each corresponding to one publication. While each of these projects tackles a topic in a different area of research, they all share a common thread in the type of topological structure they handle - a partition of space into volumes separated by interfaces that meet in non-manifold junctions.\r\n\r\nIn Chapter 2, we study clusters of soap bubbles from a simulation perspective. In particular, we develop a surface-only algorithm that couples large scale motion and shape deformation of soap bubble clusters with the small scale evolution of the thin film's thickness, which is responsible for visual phenomena like surface vortices, Newton's interference patterns, capillary waves, and deformation-dependent rupturing of films in a foam. We model film thickness as a reduced degree of freedom in the Navier-Stokes equations and from them derive three sets of equations governing normal and tangential motion of the soap film surface, as well as the evolution of the thin film thickness. We discretize these equations on a non-manifold triangle mesh, extending and adapting operators to handle complex topology. We also present an incompressible fluid solver for 2.5D films and an advection algorithm for convecting fields across non-manifold surface junctions. Our simulations enhance bubble solvers with additional effects caused by convection, rippling, draining, and evaporation of the thin film.\r\n\r\nIn Chapter 3, we introduce a multi-material non-manifold mesh-based surface tracking algorithm that converts mesh defects, such as overlaps, self-intersections, and inversions into topological changes. Our algorithm generalizes prior work on manifold surface tracking with topological changes: it preserves surface features like mesh-based methods, and it robustly handles topological changes like level set methods. Our method also offers improved efficiency and robustness over the state of the art. We demonstrate the effectiveness of the approach on a range of examples, including complex soap film simulations, such as those presented in Chapter 2, but with an order of magnitude more interacting bubbles than what we could achieve before, and Boolean unions of non-manifold meshes consisting of millions of triangles.\r\n\r\nLastly, in Chapter 4, we utilize developments in the theory of random geometric complexes facilitated by observations from Discrete Morse theory. We survey the methods and results obtained with this new approach, and discuss some of its shortcomings. We use simulations to illustrate the results and to form conjectures, getting numerical estimates for combinatorial, topological, and geometric properties of weighted and unweighted Delaunay mosaics, their dual Voronoi tessellations, and the Alpha and Wrap complexes contained in the mosaics."}],"OA_place":"publisher","type":"dissertation","author":[{"first_name":"Peter","last_name":"Synak","id":"331776E2-F248-11E8-B48F-1D18A9856A87","full_name":"Synak, Peter"}],"date_updated":"2026-10-02T11:19:03Z","project":[{"_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020"},{"grant_number":"101045083","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"},{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","name":"Alpha Shape Theory Extended","call_identifier":"H2020"},{"call_identifier":"H2020","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"}],"oa":1,"doi":"10.15479/AT-ISTA-19630","file":[{"content_type":"application/x-zip-compressed","date_created":"2025-04-30T14:02:25Z","file_id":"19633","file_size":60670543,"file_name":"Thesis_source_Heiss_Synak.zip","creator":"cchlebak","checksum":"f00b519c27529daa0c3b2d4102b4fa7b","access_level":"closed","relation":"source_file","date_updated":"2025-04-30T14:02:25Z"},{"file_size":21319043,"file_name":"Thesis_PDFA_Heiss_Synak.pdf","checksum":"6e40a2fd3b1b881af1385670854a682e","creator":"cchlebak","content_type":"application/pdf","file_id":"19634","date_created":"2025-04-30T14:02:42Z","relation":"main_file","date_updated":"2025-04-30T15:49:16Z","access_level":"open_access"}],"corr_author":"1","article_processing_charge":"No","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ec_funded":1,"title":"Methods for fluid simulation, surface tracking, and statistics of non-manifold structures","_id":"19630","supervisor":[{"orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J","first_name":"Christopher J","last_name":"Wojtan"}],"day":"29","page":"106","publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/AT-ISTA-19630","acknowledged_ssus":[{"_id":"ScienComp"}],"department":[{"_id":"ChWo"},{"_id":"GradSch"}]},{"author":[{"orcid":"0000-0002-3121-3100","last_name":"Ishida","first_name":"Sadashige","full_name":"Ishida, Sadashige","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425"}],"date_updated":"2026-10-02T11:17:04Z","status":"public","type":"dissertation","OA_place":"publisher","related_material":{"record":[{"id":"12431","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"20580"},{"relation":"part_of_dissertation","id":"17361","status":"public"},{"status":"public","id":"12846","relation":"part_of_dissertation"}]},"abstract":[{"text":"The space of codimension-2 shapes, such as curves in 3D and surfaces in 4D, is an infinite-dimensional manifold. This thesis explores geometric structures and dynamics on this space, with emphasis on their implications for physics, particularly hydrodynamics.\r\n\r\nOur investigation ranges from theoretical studies of infinite-dimensional symplectic and prequantum geometry to numerical computation of the time evolution of shapes. The thesis presents four main contributions.\r\n\r\nIn the first part, we introduce implicit representations of codimension-2 shapes using a class of complex-valued functions, and prove that the space of these implicit representations forms a prequantum bundle over the codimension-2 shape space. This reveals a new geometric interpretation of the canonical symplectic structure on the codimension-2 shape space.\r\n\r\nIn the second part, we use implicit representations to develop a simulation method for the dynamics of space curves. To handle chaotic systems such as vortex filaments in hydrodynamics, we exploit the infinite degrees of freedom, hidden in both the configuration and dynamics of implicit representations.\r\n\r\nIn the third part, we introduce new symplectic structures on the space of space curves, which generalize the only previously known symplectic structure on this space, allowing for new Hamiltonian dynamics of space curves.\r\n\r\nIn the fourth part, we apply a symplectic viewpoint to a differential geometric problem with practical applications. We derive a new area formula for spherical polygons via prequantization. ","lang":"eng"}],"language":[{"iso":"eng"}],"month":"10","ddc":["516"],"publisher":"Institute of Science and Technology Austria","license":"https://creativecommons.org/licenses/by/4.0/","date_published":"2025-10-31T00:00:00Z","citation":{"chicago":"Ishida, Sadashige. “Symplectic-Prequantum Structures and Dynamics on the Codimension-2 Shape Space.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20551\">https://doi.org/10.15479/AT-ISTA-20551</a>.","mla":"Ishida, Sadashige. <i>Symplectic-Prequantum Structures and Dynamics on the Codimension-2 Shape Space</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20551\">10.15479/AT-ISTA-20551</a>.","apa":"Ishida, S. (2025). <i>Symplectic-prequantum structures and dynamics on the codimension-2 shape space</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20551\">https://doi.org/10.15479/AT-ISTA-20551</a>","short":"S. Ishida, Symplectic-Prequantum Structures and Dynamics on the Codimension-2 Shape Space, Institute of Science and Technology Austria, 2025.","ista":"Ishida S. 2025. Symplectic-prequantum structures and dynamics on the codimension-2 shape space. Institute of Science and Technology Austria.","ieee":"S. Ishida, “Symplectic-prequantum structures and dynamics on the codimension-2 shape space,” Institute of Science and Technology Austria, 2025.","ama":"Ishida S. Symplectic-prequantum structures and dynamics on the codimension-2 shape space. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20551\">10.15479/AT-ISTA-20551</a>"},"oa_version":"Published Version","date_created":"2025-10-27T10:28:52Z","year":"2025","publication_status":"published","acknowledgement":"Projects contained in this thesis were financially supported in part by the\r\nEuropean Research Council with grants 1. ERC Consolidator Grant 101045083 CoDiNA,\r\nand 2. the European Union’s Horizon 2020 research and innovation programme under grant\r\nagreement No. 638176.","file_date_updated":"2025-11-10T08:45:05Z","page":"141","day":"31","publication_identifier":{"isbn":["978-3-99078-070-1"],"issn":["2663-337X"]},"supervisor":[{"orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J","first_name":"Christopher J","last_name":"Wojtan"},{"full_name":"Chern, Albert","first_name":"Albert","last_name":"Chern"}],"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"acknowledged_ssus":[{"_id":"CampIT"}],"fulldoi":"https://doi.org/10.15479/AT-ISTA-20551","degree_awarded":"PhD","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ec_funded":1,"_id":"20551","title":"Symplectic-prequantum structures and dynamics on the codimension-2 shape space","alternative_title":["ISTA Thesis"],"article_processing_charge":"No","has_accepted_license":"1","file":[{"access_level":"open_access","date_updated":"2025-11-01T18:26:14Z","relation":"source_file","date_created":"2025-11-01T18:26:14Z","file_id":"20583","content_type":"application/zip","checksum":"4eef80afcb67691cbb6549c4756fa534","creator":"sishida","file_size":72487812,"file_name":"Thesis_tex.zip"},{"relation":"main_file","date_updated":"2025-11-10T08:45:05Z","success":1,"access_level":"open_access","checksum":"1e5a557900bf2dce01966b211b15d0fe","creator":"sishida","file_size":8945141,"file_name":"Thesis_Sadashige_Ishida_PDFA.pdf","date_created":"2025-11-10T08:45:05Z","file_id":"20623","content_type":"application/pdf"}],"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)"},"doi":"10.15479/AT-ISTA-20551","oa":1,"project":[{"_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020"},{"_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083"}],"corr_author":"1"},{"file_date_updated":"2025-08-28T14:47:12Z","acknowledgement":"Funding sources The works included in this thesis were partially supported by:\r\n• Austrian Science Fund (FWF), grants 10.55776/COE12 and No RiSE/SHiNE S11407,\r\n• French Agence Nationale de la Recherche (ANR), grants ANR-21-CE40-0020 (CONVERGENCE) and ANR-20-CE40-0002 (GrHyDy),\r\n• Fondation Mathématique Jaques Hadamard, grant PGMO RSG 2018-0031H,\r\n• European Research Council (ERC), Consolidator grant 863818 (ForM-SMArt),\r\n• Agencia Nacional de Investigación y Desarrollo (ANID Chile), grant ACT210005,\r\n• Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt Chile), grant 1220174,\r\n• Comisión Nacional de Investigación Científica y Tecnológica (CONICYT Chile), grant\r\nPII 20150140,\r\n• Evaluation-orientation de la Coopération Scientifique and Comisión Nacional de Investigación Científica y Tecnológica (ECOS-CONICYT), grant C15E03,\r\n• European Cooperation in Science and Technology (E-COST), grants CA16228 - European\r\nNetwork for Game Theory (GAMENET) and E-COST-GRANT-CA16228-c5a69859.\r\n","publication_status":"published","date_created":"2025-08-27T14:00:13Z","year":"2025","oa_version":"Published Version","citation":{"short":"R.J. Saona Urmeneta, Robustness of Solutions in Game Theory: Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games, Institute of Science and Technology Austria, 2025.","chicago":"Saona Urmeneta, Raimundo J. “Robustness of Solutions in Game Theory: Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20234\">https://doi.org/10.15479/AT-ISTA-20234</a>.","mla":"Saona Urmeneta, Raimundo J. <i>Robustness of Solutions in Game Theory: Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20234\">10.15479/AT-ISTA-20234</a>.","apa":"Saona Urmeneta, R. J. (2025). <i>Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20234\">https://doi.org/10.15479/AT-ISTA-20234</a>","ista":"Saona Urmeneta RJ. 2025. Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games. Institute of Science and Technology Austria.","ieee":"R. J. Saona Urmeneta, “Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games,” Institute of Science and Technology Austria, 2025.","ama":"Saona Urmeneta RJ. Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20234\">10.15479/AT-ISTA-20234</a>"},"doi_confirm":"1","date_published":"2025-08-27T00:00:00Z","publisher":"Institute of Science and Technology Austria","month":"08","ddc":["519"],"language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"9311","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"19508"},{"id":"17037","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"18266","status":"public"}]},"abstract":[{"text":"Game Theory is the mathematical formalization of social dynamics - systems where agents interact over time and the evolution of the state of the system depends on the decisions of every player. \r\nThis thesis takes the perspective of a single player and focuses on what they can guarantee in the worst case over the behavior of other players.\r\nIn other words, we consider that the objective of every other player in the game is exactly the opposite to the player.\r\nWe focus on sustained interactions over time, where the players repeatedly obtain quantitative rewards over time, and they are interested in maximizing their long-term performance.\t\r\nFormally, this thesis focuses on zero-sum games with the liminf average objective.\r\nTwo fundamental questions that Game Theory aims to answer are the following.\r\n\r\n1. How much can a player guarantee to obtain after the interaction?\r\n\r\n2. How to act in order to obtain the previously mentioned guarantee?\r\n\r\nThese questions are formalized by the concepts of \"value\" and \"optimal strategies\". \t\r\nWe study their properties on games that exhibit one or more of the following properties. \r\n\r\n1. Partial Observation: \r\nthe players can not perfectly observe the current state of the system during the game. We consider the model of (finite) Partially Observable Markov Decision Processes and prove that finite-memory strategies are sufficient to approximately guarantee the value.\r\n\r\n2. Perturbed Description: \r\nthe formal description of the game is perturbed by a small parameter.\r\nWe consider the model of (finite) Perturbed Matrix Games, and provide algorithms to check various robustness properties and to compute the parameterized value and optimal strategies.\r\n\r\n3. Stochastic Transitions: \r\nthe actions of the players determine the behavior of the evolution of the system, described as a probability distribution over the next state.\r\nWe consider the model of (finite) Perturbed Stochastic Games and provide formulas for the marginal value.\r\n\r\n4. Infinite States: \r\nthe system can be in infinitely many states.\r\nWe consider the model of Random Dynamic Games on a class of infinite graphs, prove the existence of the value, and quantify the concentration of finite-horizon values.","lang":"eng"}],"OA_place":"publisher","type":"dissertation","status":"public","date_updated":"2026-10-02T11:30:08Z","author":[{"orcid":"0000-0001-5103-038X","last_name":"Saona Urmeneta","first_name":"Raimundo J","full_name":"Saona Urmeneta, Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425"}],"corr_author":"1","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407","call_identifier":"FWF"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"name":"Bilateral Artificial Intelligence (Chatterjee)","grant_number":"COE12","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee"}],"oa":1,"doi":"10.15479/AT-ISTA-20234","file":[{"file_id":"20240","date_created":"2025-08-28T14:47:07Z","content_type":"application/pdf","creator":"rsaonaur","checksum":"394a651f7de7085e509ef856ffe7bd97","file_name":"2025_Saona_Raimundo_Thesis.pdf","file_size":1503623,"access_level":"open_access","date_updated":"2025-08-28T14:47:07Z","relation":"main_file","success":1},{"access_level":"closed","relation":"source_file","date_updated":"2025-08-28T14:47:12Z","content_type":"application/zip","date_created":"2025-08-28T14:47:12Z","file_id":"20241","file_name":"2025_Saona_Raimundo_Thesis.zip","file_size":622747,"creator":"rsaonaur","checksum":"09fb2633e66aac80433d373f4180c5b4"}],"has_accepted_license":"1","alternative_title":["ISTA Thesis"],"article_processing_charge":"No","title":"Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games","_id":"20234","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"fulldoi":"https://doi.org/10.15479/AT-ISTA-20234","degree_awarded":"PhD","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"supervisor":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"}],"publication_identifier":{"issn":["2663-337X"]},"page":"125","day":"27"},{"volume":50,"article_processing_charge":"No","article_type":"original","external_id":{"isi":["001184648000001"]},"das_tickbox":"0","issue":"1","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"doi":"10.1287/moor.2023.0297","researchdata_availability":"unclear","fulldoi":"https://doi.org/10.1287/moor.2023.0297","supplementarymaterial":"unclear","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"day":"01","publication_identifier":{"issn":["0364-765X"],"eissn":["1526-5471"]},"page":"482-505","title":"Marginal values of a stochastic game","_id":"17037","ec_funded":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"None","citation":{"ieee":"L. Attia, M. Oliu-Barton, and R. J. Saona Urmeneta, “Marginal values of a stochastic game,” <i>Mathematics of Operations Research</i>, vol. 50, no. 1. Institute for Operations Research and the Management Sciences, pp. 482–505, 2025.","ista":"Attia L, Oliu-Barton M, Saona Urmeneta RJ. 2025. Marginal values of a stochastic game. Mathematics of Operations Research. 50(1), 482–505.","ama":"Attia L, Oliu-Barton M, Saona Urmeneta RJ. Marginal values of a stochastic game. <i>Mathematics of Operations Research</i>. 2025;50(1):482-505. doi:<a href=\"https://doi.org/10.1287/moor.2023.0297\">10.1287/moor.2023.0297</a>","short":"L. Attia, M. Oliu-Barton, R.J. Saona Urmeneta, Mathematics of Operations Research 50 (2025) 482–505.","mla":"Attia, Luc, et al. “Marginal Values of a Stochastic Game.” <i>Mathematics of Operations Research</i>, vol. 50, no. 1, Institute for Operations Research and the Management Sciences, 2025, pp. 482–505, doi:<a href=\"https://doi.org/10.1287/moor.2023.0297\">10.1287/moor.2023.0297</a>.","chicago":"Attia, Luc, Miquel Oliu-Barton, and Raimundo J Saona Urmeneta. “Marginal Values of a Stochastic Game.” <i>Mathematics of Operations Research</i>. Institute for Operations Research and the Management Sciences, 2025. <a href=\"https://doi.org/10.1287/moor.2023.0297\">https://doi.org/10.1287/moor.2023.0297</a>.","apa":"Attia, L., Oliu-Barton, M., &#38; Saona Urmeneta, R. J. (2025). Marginal values of a stochastic game. <i>Mathematics of Operations Research</i>. Institute for Operations Research and the Management Sciences. <a href=\"https://doi.org/10.1287/moor.2023.0297\">https://doi.org/10.1287/moor.2023.0297</a>"},"date_published":"2025-02-01T00:00:00Z","month":"02","publisher":"Institute for Operations Research and the Management Sciences","isi":1,"acknowledgement":"This work was supported by Fondation CFM pour la Recherche; the European Research Council [Grant ERC-CoG-863818 (ForM-SMArt)]; and Agence Nationale de la Recherche [Grant ANR-21-CE40-0020].","intvolume":"        50","year":"2025","date_created":"2024-05-22T11:41:14Z","publication":"Mathematics of Operations Research","publication_status":"published","date_updated":"2026-10-02T11:29:44Z","OA_type":"closed access","scopus_import":"1","author":[{"full_name":"Attia, Luc","last_name":"Attia","first_name":"Luc"},{"first_name":"Miquel","last_name":"Oliu-Barton","full_name":"Oliu-Barton, Miquel"},{"id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","full_name":"Saona Urmeneta, Raimundo J","first_name":"Raimundo J","last_name":"Saona Urmeneta","orcid":"0000-0001-5103-038X"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"20234","status":"public"}]},"abstract":[{"lang":"eng","text":"Zero-sum stochastic games are parameterized by payoffs, transitions, and possibly a discount rate. In this article, we study how the main solution concepts, the discounted and undiscounted values, vary when these parameters are perturbed. We focus on the marginal values, introduced by Mills in 1956 in the context of matrix games—that is, the directional derivatives of the value along any fixed perturbation. We provide a formula for the marginal values of a discounted stochastic game. Further, under mild assumptions on the perturbation, we provide a formula for their limit as the discount rate vanishes and for the marginal values of an undiscounted stochastic game. We also show, via an example, that the two latter differ in general."}],"language":[{"iso":"eng"}],"type":"journal_article","status":"public","quality_controlled":"1"},{"publication_status":"published","year":"2025","date_created":"2025-02-18T01:41:27Z","file_date_updated":"2025-02-18T14:25:59Z","acknowledgement":"I am grateful to the European Research Council (ERC) [10.3030/801770] and Austrian\r\nScience Fund (FWF) [10.55776/F1004] for funding my research and to the Physical\r\nReview journals for publishing it. I also want to thank the VCQ (previously CoQuS) and\r\nIQOQI for organizing wonderful networking events for the physics community in Vienna\r\nand Innsbruck, respectively. Moreover, I thank Austrian Science Fund (FWF) for the\r\ncontinuous support for quantum research.","date_published":"2025-02-18T00:00:00Z","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","publisher":"Institute of Science and Technology Austria","ddc":["539","535","541"],"month":"02","citation":{"short":"M. Maslov, Emergent Physics of Rotating Quantum Impurities in Many-Body Environments, Institute of Science and Technology Austria, 2025.","mla":"Maslov, Mikhail. <i>Emergent Physics of Rotating Quantum Impurities in Many-Body Environments</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/at:ista:19048\">10.15479/at:ista:19048</a>.","chicago":"Maslov, Mikhail. “Emergent Physics of Rotating Quantum Impurities in Many-Body Environments.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/at:ista:19048\">https://doi.org/10.15479/at:ista:19048</a>.","apa":"Maslov, M. (2025). <i>Emergent physics of rotating quantum impurities in many-body environments</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:19048\">https://doi.org/10.15479/at:ista:19048</a>","ista":"Maslov M. 2025. Emergent physics of rotating quantum impurities in many-body environments. Institute of Science and Technology Austria.","ieee":"M. Maslov, “Emergent physics of rotating quantum impurities in many-body environments,” Institute of Science and Technology Austria, 2025.","ama":"Maslov M. Emergent physics of rotating quantum impurities in many-body environments. 2025. doi:<a href=\"https://doi.org/10.15479/at:ista:19048\">10.15479/at:ista:19048</a>"},"oa_version":"Published Version","status":"public","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"10845","status":"public"},{"id":"7933","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"18087"}]},"abstract":[{"lang":"eng","text":"Rotations are found in physics problems at all scales: from spatial motion of celestial bodies, to transitions between quantum states of atoms and molecules. Mathematically, they represent a fundamental class of transformations and symmetries. Unlike spatial displacements, rotational transformations in three-dimensional space  are non-commutative: the result of applying a sequence of rotations depends on the order of these operations. This feature makes the emergent physics that involves rotations rather intricate, but instrumental for studies of highly-interconnected many-body systems. In the presence of an environment, rotational properties of an object change, due to the interaction with particles of the environment. Owing to the complexity of this interaction, it can be engineered to exhibit certain properties of interest. In this Thesis, we examine several scenarios of how the rotational behavior of an impurity can be modified by interactions with its environment."}],"OA_place":"publisher","type":"dissertation","author":[{"orcid":"0000-0003-4074-2570","full_name":"Maslov, Mikhail","id":"2E65BB0E-F248-11E8-B48F-1D18A9856A87","last_name":"Maslov","first_name":"Mikhail"}],"date_updated":"2026-10-02T11:36:24Z","oa":1,"project":[{"call_identifier":"H2020","grant_number":"801770","name":"Angulon: physics and applications of a new quasiparticle","_id":"2688CF98-B435-11E9-9278-68D0E5697425"},{"_id":"7c040762-9f16-11ee-852c-dd79eeee4ab3","name":"Coherent Optical Metrology Beyond Electric-Dipole-Allowed Transitions","grant_number":"F100403"}],"doi":"10.15479/at:ista:19048","file":[{"file_name":"thesis_Maslov.pdf","file_size":7779825,"checksum":"5822a4dd31724c512b37c658af1787ab","creator":"mmaslov","content_type":"application/pdf","file_id":"19061","date_created":"2025-02-18T14:25:59Z","relation":"main_file","date_updated":"2025-02-18T14:25:59Z","access_level":"open_access"},{"creator":"mmaslov","checksum":"89bdce4774406d26ceca88a8bbcd6a9a","file_size":14453726,"file_name":"thesis_Maslov_source.zip","file_id":"19062","date_created":"2025-02-18T14:25:59Z","content_type":"application/zip","date_updated":"2025-02-18T14:25:59Z","relation":"source_file","access_level":"open_access"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)"},"corr_author":"1","article_processing_charge":"No","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ec_funded":1,"title":"Emergent physics of rotating quantum impurities in many-body environments","_id":"19048","supervisor":[{"last_name":"Lemeshko","first_name":"Mikhail","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802"}],"publication_identifier":{"issn":["2663-337X"]},"page":"86","day":"18","fulldoi":"https://doi.org/10.15479/at:ista:19048","degree_awarded":"PhD","acknowledged_ssus":[{"_id":"CampIT"},{"_id":"E-Lib"},{"_id":"SSU"}],"department":[{"_id":"GradSch"},{"_id":"MiLe"}]},{"article_processing_charge":"No","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","oa":1,"doi":"10.15479/AT-ISTA-20147","project":[{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"file":[{"relation":"source_file","date_updated":"2025-09-10T08:19:51Z","access_level":"closed","file_name":"2025_Sarac_NaciEge_Thesis.zip","file_size":8884801,"creator":"esarac","checksum":"0f3015f1db36576a23d8d669afb60b41","content_type":"application/x-zip-compressed","file_id":"20200","date_created":"2025-08-21T09:40:28Z"},{"content_type":"application/pdf","file_id":"20201","date_created":"2025-08-21T09:40:34Z","file_name":"2025_Sarac_NaciEge_Thesis.pdf","file_size":2955584,"checksum":"332ed2fe61f580641664ec3f05d30f14","creator":"esarac","access_level":"open_access","success":1,"date_updated":"2025-08-21T09:40:34Z","relation":"main_file"}],"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)"},"corr_author":"1","supervisor":[{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"publication_identifier":{"issn":["2663-337X"]},"page":"149","day":"07","fulldoi":"https://doi.org/10.15479/AT-ISTA-20147","degree_awarded":"PhD","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"ec_funded":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"A monitoring-oriented theory and classification of quantitative specifications","_id":"20147","date_published":"2025-08-07T00:00:00Z","publisher":"Institute of Science and Technology Austria","ddc":["000"],"publisher_comment":"In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not\r\nendorse any of ISTA's products or services. Internal or personal use of this\r\nmaterial is permitted. If interested in reprinting/republishing IEEE copyrighted material for advertising or promotional\r\npurposes or for creating new collective works for resale or redistribution, please go to\r\nhttp://www.ieee.org/publications_standards/publications/rights/rights_link.html to learn how to obtain a License from\r\nRightsLink.  If applicable, University Microfilms and/or ProQuest Library, or the Archives of Canada may supply single copies of the dissertation.","month":"08","oa_version":"Published Version","citation":{"apa":"Sarac, N. E. (2025). <i>A monitoring-oriented theory and classification of quantitative specifications</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20147\">https://doi.org/10.15479/AT-ISTA-20147</a>","chicago":"Sarac, Naci E. “A Monitoring-Oriented Theory and Classification of Quantitative Specifications.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20147\">https://doi.org/10.15479/AT-ISTA-20147</a>.","mla":"Sarac, Naci E. <i>A Monitoring-Oriented Theory and Classification of Quantitative Specifications</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20147\">10.15479/AT-ISTA-20147</a>.","short":"N.E. Sarac, A Monitoring-Oriented Theory and Classification of Quantitative Specifications, Institute of Science and Technology Austria, 2025.","ama":"Sarac NE. A monitoring-oriented theory and classification of quantitative specifications. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20147\">10.15479/AT-ISTA-20147</a>","ieee":"N. E. Sarac, “A monitoring-oriented theory and classification of quantitative specifications,” Institute of Science and Technology Austria, 2025.","ista":"Sarac NE. 2025. A monitoring-oriented theory and classification of quantitative specifications. Institute of Science and Technology Austria."},"doi_confirm":"1","publication_status":"published","year":"2025","date_created":"2025-08-07T15:57:57Z","file_date_updated":"2025-09-10T08:19:51Z","acknowledgement":"This work was supported in part by the Austrian Science Fund (FWF)\r\nunder grant Z211-N23 (Wittgenstein Award) and the ERC-2020-AdG 101020093.\r\n","author":[{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E","first_name":"Naci E","last_name":"Sarac"}],"date_updated":"2026-10-02T11:44:51Z","status":"public","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"11775"},{"relation":"part_of_dissertation","id":"13140","status":"deleted"},{"status":"public","id":"19741","relation":"part_of_dissertation"},{"id":"19643","relation":"part_of_dissertation","status":"deleted"},{"status":"public","relation":"part_of_dissertation","id":"13221"},{"id":"9356","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"20342"},{"status":"public","id":"17634","relation":"part_of_dissertation"}]},"abstract":[{"text":"Quantitative properties offer a framework for specifying and verifying system behaviors beyond the traditional boolean perspective. For example, while a boolean property may specify whether a server eventually grants every request it receives, a quantitative one may map each server execution to its average response time. This quantitative view is relatively well-studied in the context of static verification. However, although such properties often appear in practice as performance or robustness measures in a dynamic verification context, a general theoretical framework for their analysis and classification from a monitoring perspective is still missing.\r\n\r\nIn this thesis, we aim to develop such a framework that takes resource-precision tradeoffs of monitors as a central consideration. We present the first theory of monitorability for quantitative properties where monitors can be naturally approximate and compared regarding their precision and resource use. In particular, we show that additional monitor resources such as registers or states lead to strictly better approximations for some properties. To enable such analyses in a machine-model independent way, we describe an abstract notion of monitors that can be instantiated with concrete models of monitors. Within this framework, we study how abstract monitors behave and identify classes of properties amenable to approximate monitoring with resource-precision considerations. We then extend the boolean safety-liveness dichotomy and safety-progress hierarchy to the quantitative setting with a monitoring perspective. In particular, we prove that every property is the pointwise minimum of a safety property and a liveness property, and properties that are both safe and co-safe can be approximately monitored arbitrarily precisely using only finitely many states. We also study the classes of quantitative properties definable by finite-state quantitative automata and provide algorithms for deciding their safety or liveness as well as their safety-liveness decompositions. Finally, we present the first general-purpose tool for automating the analysis, verification, and monitoring of quantitative automata.\r\n\r\n\r\n","lang":"eng"}],"OA_place":"publisher","type":"dissertation"},{"publisher":"Springer Nature","month":"01","ddc":["004"],"date_published":"2025-01-01T00:00:00Z","oa_version":"Published Version","citation":{"chicago":"Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem and Discrete Convexity.” <i>Mathematical Programming</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s10107-024-02064-5\">https://doi.org/10.1007/s10107-024-02064-5</a>.","mla":"Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem and Discrete Convexity.” <i>Mathematical Programming</i>, vol. 209, Springer Nature, 2025, pp. 279–322, doi:<a href=\"https://doi.org/10.1007/s10107-024-02064-5\">10.1007/s10107-024-02064-5</a>.","apa":"Dvorak, M., &#38; Kolmogorov, V. (2025). Generalized minimum 0-extension problem and discrete convexity. <i>Mathematical Programming</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10107-024-02064-5\">https://doi.org/10.1007/s10107-024-02064-5</a>","short":"M. Dvorak, V. Kolmogorov, Mathematical Programming 209 (2025) 279–322.","ieee":"M. Dvorak and V. Kolmogorov, “Generalized minimum 0-extension problem and discrete convexity,” <i>Mathematical Programming</i>, vol. 209. Springer Nature, pp. 279–322, 2025.","ista":"Dvorak M, Kolmogorov V. 2025. Generalized minimum 0-extension problem and discrete convexity. Mathematical Programming. 209, 279–322.","ama":"Dvorak M, Kolmogorov V. Generalized minimum 0-extension problem and discrete convexity. <i>Mathematical Programming</i>. 2025;209:279-322. doi:<a href=\"https://doi.org/10.1007/s10107-024-02064-5\">10.1007/s10107-024-02064-5</a>"},"publication_status":"published","date_created":"2021-09-27T10:48:23Z","publication":"Mathematical Programming","year":"2025","intvolume":"       209","isi":1,"acknowledgement":"We thank the anonymous reviewers for their careful reading of our manuscript and their many insightful comments and suggestions. Open access funding provided by Institute of Science and Technology (IST Austria).","file_date_updated":"2025-04-16T09:36:08Z","author":[{"id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","full_name":"Dvorak, Martin","first_name":"Martin","last_name":"Dvorak","orcid":"0000-0001-5293-214X"},{"last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","OA_type":"hybrid","date_updated":"2026-10-02T11:45:16Z","quality_controlled":"1","status":"public","OA_place":"publisher","type":"journal_article","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Given a fixed finite metric space (V,μ), the {\\em minimum 0-extension problem}, denoted as 0-Ext[μ], is equivalent to the following optimization problem: minimize function of the form minx∈Vn∑ifi(xi)+∑ijcijμ(xi,xj) where cij,cvi are given nonnegative costs and fi:V→R are functions given by fi(xi)=∑v∈Vcviμ(xi,v). The computational complexity of 0-Ext[μ] has been recently established by Karzanov and by Hirai: if metric μ is {\\em orientable modular} then 0-Ext[μ] can be solved in polynomial time, otherwise 0-Ext[μ] is NP-hard. To prove the tractability part, Hirai developed a theory of discrete convex functions on orientable modular graphs generalizing several known classes of functions in discrete convex analysis, such as L♮-convex functions. We consider a more general version of the problem in which unary functions fi(xi) can additionally have terms of the form cuv;iμ(xi,{u,v}) for {u,v}∈F, where set F⊆(V2) is fixed. We extend the complexity classification above by providing an explicit condition on (μ,F) for the problem to be tractable. In order to prove the tractability part, we generalize Hirai's theory and define a larger class of discrete convex functions. It covers, in particular, another well-known class of functions, namely submodular functions on an integer lattice. Finally, we improve the complexity of Hirai's algorithm for solving 0-Ext on orientable modular graphs.\r\n"}],"das_tickbox":"0","article_type":"original","external_id":{"arxiv":["2109.10203"],"isi":["001176563300001"]},"article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","volume":209,"researchdata_availability":"no","file":[{"creator":"dernst","checksum":"25d9bd490719b45eca84f4d93a06c69f","file_size":839510,"file_name":"2025_MathProgramming_Dvorak.pdf","file_id":"19578","date_created":"2025-04-16T09:36:08Z","content_type":"application/pdf","date_updated":"2025-04-16T09:36:08Z","relation":"main_file","success":1,"access_level":"open_access"}],"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)"},"doi":"10.1007/s10107-024-02064-5","oa":1,"keyword":["minimum 0-extension problem","metric labeling problem","discrete metric spaces","metric extensions","computational complexity","valued constraint satisfaction problems","discrete convex analysis","L-convex functions"],"corr_author":"1","arxiv":1,"day":"01","page":"279-322","publication_identifier":{"issn":["0025-5610"],"eissn":["1436-4646"]},"department":[{"_id":"GradSch"},{"_id":"VlKo"}],"fulldoi":"https://doi.org/10.1007/s10107-024-02064-5","supplementarymaterial":"no","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"10045","title":"Generalized minimum 0-extension problem and discrete convexity"},{"scopus_import":"1","OA_type":"hybrid","date_updated":"2026-10-02T11:48:46Z","author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner"},{"orcid":"0000-0002-0659-3201","first_name":"Anton","last_name":"Nikitenko","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","full_name":"Nikitenko, Anton"}],"OA_place":"publisher","type":"journal_article","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The approximation of a circle with the edges of a fine square grid distorts the perimeter by a factor about 4/Pi. We prove that this factor is the same on average (in the ergodic sense) for approximations of any rectifiable curve by the edges of any non-exotic Delaunay mosaic (known as Voronoi path), and extend the results to all dimensions, generalizing Voronoi paths to Voronoi scapes."}],"quality_controlled":"1","status":"public","oa_version":"Published Version","citation":{"ista":"Edelsbrunner H, Nikitenko A. 2025. Average and expected distortion of Voronoi paths and scapes. Discrete &#38; Computational Geometry. 73, 490–499.","ieee":"H. Edelsbrunner and A. Nikitenko, “Average and expected distortion of Voronoi paths and scapes,” <i>Discrete &#38; Computational Geometry</i>, vol. 73. Springer Nature, pp. 490–499, 2025.","ama":"Edelsbrunner H, Nikitenko A. Average and expected distortion of Voronoi paths and scapes. <i>Discrete &#38; Computational Geometry</i>. 2025;73:490-499. doi:<a href=\"https://doi.org/10.1007/s00454-024-00660-y\">10.1007/s00454-024-00660-y</a>","mla":"Edelsbrunner, Herbert, and Anton Nikitenko. “Average and Expected Distortion of Voronoi Paths and Scapes.” <i>Discrete &#38; Computational Geometry</i>, vol. 73, Springer Nature, 2025, pp. 490–99, doi:<a href=\"https://doi.org/10.1007/s00454-024-00660-y\">10.1007/s00454-024-00660-y</a>.","chicago":"Edelsbrunner, Herbert, and Anton Nikitenko. “Average and Expected Distortion of Voronoi Paths and Scapes.” <i>Discrete &#38; Computational Geometry</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00454-024-00660-y\">https://doi.org/10.1007/s00454-024-00660-y</a>.","apa":"Edelsbrunner, H., &#38; Nikitenko, A. (2025). Average and expected distortion of Voronoi paths and scapes. <i>Discrete &#38; Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-024-00660-y\">https://doi.org/10.1007/s00454-024-00660-y</a>","short":"H. Edelsbrunner, A. Nikitenko, Discrete &#38; Computational Geometry 73 (2025) 490–499."},"publisher":"Springer Nature","ddc":["510"],"month":"03","date_published":"2025-03-01T00:00:00Z","pmid":1,"intvolume":"        73","acknowledgement":"The authors thank Ranita Biswas and Tatiana Ezubova for the collaboration on computational experiments that motivated the work reported in this paper. The authors also thank Daniel Bonnema for proofreading and noticing an issue with the original proof of Lemma 4.3.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, Grant No. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35.","isi":1,"file_date_updated":"2025-04-23T07:31:32Z","publication_status":"published","publication":"Discrete & Computational Geometry","date_created":"2024-06-16T22:01:07Z","year":"2025","department":[{"_id":"HeEd"}],"supplementarymaterial":"no","fulldoi":"https://doi.org/10.1007/s00454-024-00660-y","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"page":"490-499","day":"01","arxiv":1,"_id":"17149","title":"Average and expected distortion of Voronoi paths and scapes","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ec_funded":1,"volume":73,"has_accepted_license":"1","das_tickbox":"0","external_id":{"pmid":["39974750"],"arxiv":["2012.03350"],"isi":["001238566200004"]},"article_type":"original","article_processing_charge":"Yes (via OA deal)","corr_author":"1","researchdata_availability":"no","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)"},"file":[{"relation":"main_file","date_updated":"2025-04-23T07:31:32Z","success":1,"access_level":"open_access","checksum":"ffb0c818222138f9f113f4bbea41e834","creator":"dernst","file_size":283443,"file_name":"2025_DiscreteComputGeom_EdelsbrunnerHe.pdf","date_created":"2025-04-23T07:31:32Z","file_id":"19610","content_type":"application/pdf"}],"oa":1,"doi":"10.1007/s00454-024-00660-y","project":[{"call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Mathematics, Computer Science","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF"}]},{"date_created":"2026-02-16T15:48:42Z","year":"2025","publication":"Computational Geometry","publication_status":"published","article_number":"102186","acknowledgement":"A preliminary version of this note has been published in the proceedings of the 31st International Symposium on Graph Drawing and Network Visualization, Palermo, 2023. The authors would like to thank the anonymous referees for their valuable comments.","intvolume":"       129","date_published":"2025-12-01T00:00:00Z","month":"12","publisher":"Elsevier","citation":{"short":"J. Pach, M. Saghafian, P. Schnider, Computational Geometry 129 (2025).","apa":"Pach, J., Saghafian, M., &#38; Schnider, P. (2025). Decomposition of geometric graphs into star-forests. <i>Computational Geometry</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2025.102186\">https://doi.org/10.1016/j.comgeo.2025.102186</a>","chicago":"Pach, János, Morteza Saghafian, and Patrick Schnider. “Decomposition of Geometric Graphs into Star-Forests.” <i>Computational Geometry</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.comgeo.2025.102186\">https://doi.org/10.1016/j.comgeo.2025.102186</a>.","mla":"Pach, János, et al. “Decomposition of Geometric Graphs into Star-Forests.” <i>Computational Geometry</i>, vol. 129, 102186, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2025.102186\">10.1016/j.comgeo.2025.102186</a>.","ama":"Pach J, Saghafian M, Schnider P. Decomposition of geometric graphs into star-forests. <i>Computational Geometry</i>. 2025;129. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2025.102186\">10.1016/j.comgeo.2025.102186</a>","ieee":"J. Pach, M. Saghafian, and P. Schnider, “Decomposition of geometric graphs into star-forests,” <i>Computational Geometry</i>, vol. 129. Elsevier, 2025.","ista":"Pach J, Saghafian M, Schnider P. 2025. Decomposition of geometric graphs into star-forests. Computational Geometry. 129, 102186."},"oa_version":"Preprint","status":"public","quality_controlled":"1","related_material":{"record":[{"id":"15012","relation":"earlier_version","status":"public"}]},"abstract":[{"text":"We solve a problem of Dujmović and Wood (2007) by showing that a complete convex geometric graph on n vertices cannot be decomposed into fewer than n - 1 star-forests, each consisting of noncrossing edges. This bound is clearly tight. We also discuss similar questions for abstract graphs.","lang":"eng"}],"language":[{"iso":"eng"}],"type":"journal_article","OA_place":"repository","author":[{"full_name":"Pach, János","first_name":"János","last_name":"Pach"},{"first_name":"Morteza","last_name":"Saghafian","id":"f86f7148-b140-11ec-9577-95435b8df824","full_name":"Saghafian, Morteza"},{"full_name":"Schnider, Patrick","last_name":"Schnider","first_name":"Patrick"}],"date_updated":"2026-10-02T11:50:58Z","OA_type":"green","oa":1,"doi":"10.1016/j.comgeo.2025.102186","corr_author":"1","article_processing_charge":"No","external_id":{"arxiv":["2306.13201"]},"article_type":"original","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2306.13201"}],"volume":129,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Decomposition of geometric graphs into star-forests","_id":"21253","arxiv":1,"publication_identifier":{"issn":["0925-7721"]},"day":"01","fulldoi":"https://doi.org/10.1016/j.comgeo.2025.102186","department":[{"_id":"HeEd"}]},{"article_processing_charge":"No","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","keyword":["topological data analysis","chromatic point set","alpha complex","persistent homology","six pack","sheaf","microlocal discrete Morse","injective resolution","collapse","knot","discrete Morse theory"],"doi":"10.15479/at:ista:18979","project":[{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","grant_number":"Z00342","call_identifier":"FWF"}],"oa":1,"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)"},"file":[{"content_type":"application/zip","date_created":"2025-01-31T16:58:30Z","file_id":"18983","file_name":"Thesis.zip","file_size":11899491,"creator":"odragano","checksum":"af6567e5d35e5eb330b8925ae37f1998","access_level":"closed","date_updated":"2025-01-31T16:58:30Z","relation":"source_file"},{"file_name":"Thesis.pdf","file_size":8857514,"checksum":"c3fef68e35b9dc2020b2ca6006da6343","creator":"odragano","content_type":"application/pdf","date_created":"2025-02-04T16:22:07Z","file_id":"19000","relation":"main_file","date_updated":"2025-02-04T16:22:07Z","access_level":"open_access"}],"corr_author":"1","supervisor":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"}],"day":"03","page":"140","publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/at:ista:18979","department":[{"_id":"GradSch"},{"_id":"HeEd"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","title":"Structures and computations in topological data analysis","_id":"18979","date_published":"2025-02-03T00:00:00Z","month":"02","ddc":["514","004"],"publisher":"Institute of Science and Technology Austria","citation":{"ista":"Draganov O. 2025. Structures and computations in topological data analysis. Institute of Science and Technology Austria.","ieee":"O. Draganov, “Structures and computations in topological data analysis,” Institute of Science and Technology Austria, 2025.","ama":"Draganov O. Structures and computations in topological data analysis. 2025. doi:<a href=\"https://doi.org/10.15479/at:ista:18979\">10.15479/at:ista:18979</a>","chicago":"Draganov, Ondrej. “Structures and Computations in Topological Data Analysis.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/at:ista:18979\">https://doi.org/10.15479/at:ista:18979</a>.","mla":"Draganov, Ondrej. <i>Structures and Computations in Topological Data Analysis</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/at:ista:18979\">10.15479/at:ista:18979</a>.","apa":"Draganov, O. (2025). <i>Structures and computations in topological data analysis</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18979\">https://doi.org/10.15479/at:ista:18979</a>","short":"O. Draganov, Structures and Computations in Topological Data Analysis, Institute of Science and Technology Austria, 2025."},"oa_version":"Published Version","date_created":"2025-01-31T17:04:40Z","year":"2025","publication_status":"published","file_date_updated":"2025-02-04T16:22:07Z","acknowledgement":"The research presented in this thesis was funded with the Wittgenstein Prize,\r\nAustrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative Research\r\nCenter TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF),\r\ngrant no. I 02979-N35.\r\n","author":[{"first_name":"Ondrej","last_name":"Draganov","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","full_name":"Draganov, Ondrej","orcid":"0000-0003-0464-3823"}],"date_updated":"2026-10-02T11:57:00Z","status":"public","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"15091"},{"status":"public","id":"18981","relation":"part_of_dissertation"}]},"abstract":[{"text":"Topological Data Analysis (TDA) is a discipline utilizing the mathematical field of topology to study data, most prominently collections of point sets. This thesis summarizes three projects related to computations in TDA.\r\n\r\nThe first one establishes a variant of TDA for chromatic point sets, where each point is given a color. For example, we are given positions of cells within a tumor microenvironment, and color the cancerous cells red, and the immune cells blue.\r\n\r\nThe aim is then to give a quantitative description of how the two or more sets of points spatially interact. Building on image, kernel and cokernel variants of persistent homology, we suggest six-packs of persistent diagrams as such a descriptor.\r\n\r\nWe describe a construction of a chromatic alpha complex, which enables  efficient computation of several variants of the six-packs. We give topological descriptions of natural subcomplexes of the chromatic alpha complex, and show that the radii of the simplices form a discrete Morse function. Finally, we provide an implementation of the presented chromatic TDA pipeline.\r\n\r\nThe second part aims to translate a powerful tool of sheaf theory to elementary terms using labeled matrices. The goal is to enable their use in computational settings. We show that derived categories of sheaves over finite posets have, up to isomorphism, unique objects---minimal injective resolutions---and give a concrete algorithm to compute them. We further describe simple algorithms to compute derived pushforwards and pullbacks for monotonic maps, and their proper variants for inclusions, and demonstrate their tractability by providing an implementation. Finally, we suggest a discrete definition of microsupport and show desirable properties inspired by discrete Morse theory.\r\n\r\nIn the last part, we present a collection of observations about collapses. We give a characterization of collapsibility in terms of unitriangular submatrices of the boundary matrix, a cotree-tree decomposition, and the optimal solution to a variant of the Procrustes problem. We establish relation between dual collapses and relative Morse theory and pose several open questions. Finally, focusing on complexes embedded in the three-dimensional Euclidean space, we describe a relation between the collapsibility and the triviality of a polygonal knot.","lang":"eng"}],"language":[{"iso":"eng"}],"type":"dissertation","OA_place":"publisher"},{"citation":{"ieee":"A. Brown and O. Draganov, “Discrete microlocal Morse theory,” <i>Journal of Pure and Applied Algebra</i>, vol. 229, no. 10. Elsevier, 2025.","ista":"Brown A, Draganov O. 2025. Discrete microlocal Morse theory. Journal of Pure and Applied Algebra. 229(10), 108068.","ama":"Brown A, Draganov O. Discrete microlocal Morse theory. <i>Journal of Pure and Applied Algebra</i>. 2025;229(10). doi:<a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">10.1016/j.jpaa.2025.108068</a>","short":"A. Brown, O. Draganov, Journal of Pure and Applied Algebra 229 (2025).","chicago":"Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” <i>Journal of Pure and Applied Algebra</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">https://doi.org/10.1016/j.jpaa.2025.108068</a>.","mla":"Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” <i>Journal of Pure and Applied Algebra</i>, vol. 229, no. 10, 108068, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">10.1016/j.jpaa.2025.108068</a>.","apa":"Brown, A., &#38; Draganov, O. (2025). Discrete microlocal Morse theory. <i>Journal of Pure and Applied Algebra</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">https://doi.org/10.1016/j.jpaa.2025.108068</a>"},"oa_version":"Published Version","publisher":"Elsevier","month":"10","ddc":["510"],"date_published":"2025-10-01T00:00:00Z","intvolume":"       229","article_number":"108068","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35","file_date_updated":"2025-12-30T07:55:08Z","publication_status":"published","publication":"Journal of Pure and Applied Algebra","year":"2025","date_created":"2025-09-10T05:40:09Z","scopus_import":"1","OA_type":"hybrid","date_updated":"2026-10-02T11:57:00Z","author":[{"id":"70B7FDF6-608D-11E9-9333-8535E6697425","full_name":"Brown, Adam","first_name":"Adam","last_name":"Brown"},{"orcid":"0000-0003-0464-3823","first_name":"Ondrej","last_name":"Draganov","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","full_name":"Draganov, Ondrej"}],"OA_place":"publisher","type":"journal_article","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"18981"}]},"abstract":[{"text":"We establish several results combining discrete Morse theory and microlocal sheaf theory in the setting of finite posets and simplicial complexes. Our primary tool is a computationally tractable description of the bounded derived category of sheaves on a poset with the Alexandrov topology. We prove that each bounded complex of sheaves on a finite poset admits a unique (up to isomorphism of complexes) minimal injective resolution, and we provide algorithms for computing minimal injective resolution of an injective complex, as well as several useful functors between derived categories of sheaves. For the constant sheaf on a simplicial complex, we give asymptotically tight bounds on the complexity of computing the minimal injective resolution using those algorithms. Our main result is a novel definition of the discrete microsupport of a bounded complex of sheaves on a finite poset. We detail several foundational properties of the discrete microsupport, as well as a microlocal generalization of the discrete homological Morse theorem and Morse inequalities.","lang":"eng"}],"quality_controlled":"1","status":"public","PlanS_conform":"1","volume":229,"has_accepted_license":"1","external_id":{"arxiv":["2209.14993"]},"article_type":"original","article_processing_charge":"Yes (via OA deal)","issue":"10","corr_author":"1","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)"},"file":[{"file_size":3090836,"file_name":"2025_JourPureAppliedAlgebra_Brown.pdf","creator":"dernst","checksum":"39bcad462278c9322ef810af7db67f56","content_type":"application/pdf","file_id":"20886","date_created":"2025-12-30T07:55:08Z","success":1,"relation":"main_file","date_updated":"2025-12-30T07:55:08Z","access_level":"open_access"}],"project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended"},{"call_identifier":"FWF","name":"Mathematics, Computer Science","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"}],"oa":1,"doi":"10.1016/j.jpaa.2025.108068","department":[{"_id":"HeEd"}],"fulldoi":"https://doi.org/10.1016/j.jpaa.2025.108068","publication_identifier":{"issn":["0022-4049"]},"arxiv":1,"day":"01","_id":"20323","title":"Discrete microlocal Morse theory","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"external_id":{"arxiv":["2404.15205"],"isi":["001611557000018"]},"article_type":"original","article_processing_charge":"Yes","has_accepted_license":"1","volume":30,"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)"},"file":[{"date_updated":"2025-11-04T07:34:05Z","relation":"main_file","success":1,"access_level":"open_access","creator":"dernst","checksum":"67858edbd74658fe38955fa1216f2f18","file_size":278078,"file_name":"2025_ElectronJourProbab_Brigati.pdf","file_id":"20596","date_created":"2025-11-04T07:34:05Z","content_type":"application/pdf"}],"oa":1,"doi":"10.1214/25-ECP717","project":[{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"},{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"corr_author":"1","publication_identifier":{"eissn":["1083-589X"]},"arxiv":1,"day":"25","department":[{"_id":"JaMa"}],"fulldoi":"https://doi.org/10.1214/25-ECP717","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"_id":"20591","title":"Heat flow, log-concavity, and Lipschitz transport maps","month":"09","ddc":["500"],"publisher":"Institute of Mathematical Statistics","date_published":"2025-09-25T00:00:00Z","citation":{"apa":"Brigati, G., &#38; Pedrotti, F. (2025). Heat flow, log-concavity, and Lipschitz transport maps. <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/25-ECP717\">https://doi.org/10.1214/25-ECP717</a>","mla":"Brigati, Giovanni, and Francesco Pedrotti. “Heat Flow, Log-Concavity, and Lipschitz Transport Maps.” <i>Electronic Communications in Probability</i>, vol. 30, 71, Institute of Mathematical Statistics, 2025, doi:<a href=\"https://doi.org/10.1214/25-ECP717\">10.1214/25-ECP717</a>.","chicago":"Brigati, Giovanni, and Francesco Pedrotti. “Heat Flow, Log-Concavity, and Lipschitz Transport Maps.” <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics, 2025. <a href=\"https://doi.org/10.1214/25-ECP717\">https://doi.org/10.1214/25-ECP717</a>.","short":"G. Brigati, F. Pedrotti, Electronic Communications in Probability 30 (2025).","ama":"Brigati G, Pedrotti F. Heat flow, log-concavity, and Lipschitz transport maps. <i>Electronic Communications in Probability</i>. 2025;30. doi:<a href=\"https://doi.org/10.1214/25-ECP717\">10.1214/25-ECP717</a>","ieee":"G. Brigati and F. Pedrotti, “Heat flow, log-concavity, and Lipschitz transport maps,” <i>Electronic Communications in Probability</i>, vol. 30. Institute of Mathematical Statistics, 2025.","ista":"Brigati G, Pedrotti F. 2025. Heat flow, log-concavity, and Lipschitz transport maps. Electronic Communications in Probability. 30, 71."},"oa_version":"Published Version","publication":"Electronic Communications in Probability","date_created":"2025-11-02T23:01:35Z","year":"2025","publication_status":"published","article_number":"71","acknowledgement":"This research was funded in part by the Austrian Science Fund (FWF) project 10.55776/F65 and by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 101034413. The authors thank Professors Jean Dolbeault, Jan Maas, and Nikita Simonov for many useful comments, and Professors Kazuhiro Ishige, Asuka Takatsu, and Yair Shenfeld for inspiring interactions.","isi":1,"intvolume":"        30","file_date_updated":"2025-11-04T07:34:05Z","author":[{"full_name":"Brigati, Giovanni","id":"63ff57e8-1fbb-11ee-88f2-f558ffc59cf1","last_name":"Brigati","first_name":"Giovanni"},{"first_name":"Francesco","last_name":"Pedrotti","id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c","full_name":"Pedrotti, Francesco"}],"DOAJ_listed":"1","date_updated":"2026-10-02T12:20:37Z","scopus_import":"1","OA_type":"gold","PlanS_conform":"1","status":"public","quality_controlled":"1","type":"journal_article","OA_place":"publisher","abstract":[{"lang":"eng","text":"In this paper we derive estimates for the Hessian of the logarithm (log-Hessian) for solutions to the heat equation. For initial data in the form of log-Lipschitz perturbation of strongly log-concave measures, the log-Hessian admits an explicit, uniform (in space) lower bound. This yields a new estimate for the Lipschitz constant of a transport map pushing forward the standard Gaussian to a measure in this class. On the other hand, we show that assuming only fast decay of the tails of the initial datum does not suffice to guarantee uniform log-Hessian upper bounds."}],"related_material":{"record":[{"status":"public","id":"17353","relation":"earlier_version"}]},"language":[{"iso":"eng"}]},{"month":"06","publisher":"Institute of Mathematical Statistics","date_published":"2025-06-01T00:00:00Z","citation":{"ama":"Khudiakova K, Maas J, Pedrotti F. L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. <i>The Annals of Applied Probability</i>. 2025;35(3):1913-1940. doi:<a href=\"https://doi.org/10.1214/25-aap2162\">10.1214/25-aap2162</a>","ieee":"K. Khudiakova, J. Maas, and F. Pedrotti, “L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model,” <i>The Annals of Applied Probability</i>, vol. 35, no. 3. Institute of Mathematical Statistics, pp. 1913–1940, 2025.","ista":"Khudiakova K, Maas J, Pedrotti F. 2025. L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. The Annals of Applied Probability. 35(3), 1913–1940.","short":"K. Khudiakova, J. Maas, F. Pedrotti, The Annals of Applied Probability 35 (2025) 1913–1940.","apa":"Khudiakova, K., Maas, J., &#38; Pedrotti, F. (2025). L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. <i>The Annals of Applied Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/25-aap2162\">https://doi.org/10.1214/25-aap2162</a>","chicago":"Khudiakova, Kseniia, Jan Maas, and Francesco Pedrotti. “L∞-Optimal Transport of Anisotropic Log-Concave Measures and Exponential Convergence in Fisher’s Infinitesimal Model.” <i>The Annals of Applied Probability</i>. Institute of Mathematical Statistics, 2025. <a href=\"https://doi.org/10.1214/25-aap2162\">https://doi.org/10.1214/25-aap2162</a>.","mla":"Khudiakova, Kseniia, et al. “L∞-Optimal Transport of Anisotropic Log-Concave Measures and Exponential Convergence in Fisher’s Infinitesimal Model.” <i>The Annals of Applied Probability</i>, vol. 35, no. 3, Institute of Mathematical Statistics, 2025, pp. 1913–40, doi:<a href=\"https://doi.org/10.1214/25-aap2162\">10.1214/25-aap2162</a>."},"oa_version":"Preprint","publication":"The Annals of Applied Probability","year":"2025","date_created":"2025-07-21T08:13:54Z","publication_status":"published","isi":1,"acknowledgement":"This research was funded in part by the Austrian Science Fund (FWF) project 10.55776/F65 and the Austrian Academy of Science, DOC fellowship nr. 26293.","intvolume":"        35","author":[{"orcid":"0000-0002-6246-1465","full_name":"Khudiakova, Kseniia","id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","last_name":"Khudiakova","first_name":"Kseniia"},{"orcid":"0000-0002-0845-1338","last_name":"Maas","first_name":"Jan","full_name":"Maas, Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pedrotti","first_name":"Francesco","full_name":"Pedrotti, Francesco","id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c"}],"date_updated":"2026-10-02T12:20:10Z","OA_type":"green","scopus_import":"1","status":"public","quality_controlled":"1","type":"journal_article","OA_place":"repository","abstract":[{"lang":"eng","text":"We prove upper bounds on the L∞-Wasserstein distance from optimal transport between strongly log-concave probability densities and log-Lipschitz perturbations. In the simplest setting, such a bound amounts to a transport-information inequality involving the L∞-Wasserstein metric and the relative L∞-Fisher information. We show that this inequality can be sharpened significantly in situations where the involved densities are anisotropic. Our proof is based on probabilistic techniques using Langevin dynamics. As an application of these results, we obtain sharp exponential rates of convergence in Fisher’s infinitesimal model from quantitative genetics, generalising recent results by Calvez, Poyato, and Santambrogio in dimension 1 to arbitrary dimensions."}],"related_material":{"record":[{"status":"public","id":"17352","relation":"earlier_version"}]},"language":[{"iso":"eng"}],"article_type":"original","external_id":{"arxiv":["2402.04151"],"isi":["001523520000012"]},"article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2402.04151","open_access":"1"}],"volume":35,"oa":1,"doi":"10.1214/25-aap2162","project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"},{"name":"The impact of deleterious mutations on small populations","grant_number":"26293","_id":"34d33d68-11ca-11ed-8bc3-ec13763c0ca8"}],"issue":"3","corr_author":"1","day":"01","arxiv":1,"publication_identifier":{"issn":["1050-5164"]},"page":"1913-1940","department":[{"_id":"JaMa"}],"fulldoi":"https://doi.org/10.1214/25-aap2162","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"20050","title":"L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model"},{"project":[{"name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"},{"name":"Design Principles of Branching Morphogenesis","grant_number":"851288","call_identifier":"H2020","_id":"05943252-7A3F-11EA-A408-12923DDC885E"},{"_id":"9B861AAC-BA93-11EA-9121-9846C619BF3A","name":"NOMIS Fellowship Program"}],"doi":"10.1101/2025.10.15.682552","oa":1,"tmp":{"image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"corr_author":"1","article_processing_charge":"No","external_id":{"biorxivid":["2025.10.15.682552"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2025.10.15.682552"}],"ec_funded":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","biorxivid":1,"title":"Non-canonical cytokinesis driven by mechanical uncoupling via nematic flows and adhesion-based invagination","_id":"22807","day":"15","fulldoi":"https://doi.org/10.1101/2025.10.15.682552","department":[{"_id":"EdHa"},{"_id":"CaHe"}],"date_created":"2026-09-04T12:32:21Z","year":"2025","publication":"bioRxiv","publication_status":"draft","acknowledgement":"We are grateful to the members of the Hannezo and Heisenberg groups for discussions and technical advice. We also thank the Imaging and Optics Facility and the Lab Support Facility at ISTA for their continuous support. Y.I.L. acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skodowska-Curie Grant Agreement No. 101034413. The research was supported by funding to C.-P.H. from the NOMIS Foundation (Project ID 1.844) and to E.H. from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 851288).","date_published":"2025-10-15T00:00:00Z","month":"10","oa_version":"Preprint","citation":{"short":"X. Tong, Y.I. Li, J. Schelle, E.B. Hannezo, C.-P.J. Heisenberg, BioRxiv (n.d.).","apa":"Tong, X., Li, Y. I., Schelle, J., Hannezo, E. B., &#38; Heisenberg, C.-P. J. (n.d.). Non-canonical cytokinesis driven by mechanical uncoupling via nematic flows and adhesion-based invagination. <i>bioRxiv</i>. <a href=\"https://doi.org/10.1101/2025.10.15.682552\">https://doi.org/10.1101/2025.10.15.682552</a>","chicago":"Tong, Xin, Yuting I Li, Joséphine Schelle, Edouard B Hannezo, and Carl-Philipp J Heisenberg. “Non-Canonical Cytokinesis Driven by Mechanical Uncoupling via Nematic Flows and Adhesion-Based Invagination.” <i>BioRxiv</i>, n.d. <a href=\"https://doi.org/10.1101/2025.10.15.682552\">https://doi.org/10.1101/2025.10.15.682552</a>.","mla":"Tong, Xin, et al. “Non-Canonical Cytokinesis Driven by Mechanical Uncoupling via Nematic Flows and Adhesion-Based Invagination.” <i>BioRxiv</i>, doi:<a href=\"https://doi.org/10.1101/2025.10.15.682552\">10.1101/2025.10.15.682552</a>.","ama":"Tong X, Li YI, Schelle J, Hannezo EB, Heisenberg C-PJ. Non-canonical cytokinesis driven by mechanical uncoupling via nematic flows and adhesion-based invagination. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2025.10.15.682552\">10.1101/2025.10.15.682552</a>","ista":"Tong X, Li YI, Schelle J, Hannezo EB, Heisenberg C-PJ. Non-canonical cytokinesis driven by mechanical uncoupling via nematic flows and adhesion-based invagination. bioRxiv, <a href=\"https://doi.org/10.1101/2025.10.15.682552\">10.1101/2025.10.15.682552</a>.","ieee":"X. Tong, Y. I. Li, J. Schelle, E. B. Hannezo, and C.-P. J. Heisenberg, “Non-canonical cytokinesis driven by mechanical uncoupling via nematic flows and adhesion-based invagination,” <i>bioRxiv</i>. ."},"status":"public","abstract":[{"text":"Cleavage - the series of rapid cell divisions that follow fertilization - marks the onset of metazoan development and represents a deeply conserved evolutionary process. Across animals, two principal modes exist: complete (holoblastic) and incomplete (meroblastic) cleavage. While holoblastic cleavage resembles conventional cytokinesis both in vitro and in vivo, the mechanisms underlying meroblastic cleavage have remained poorly understood. Using zebrafish embryos as a model, we show that meroblastic cleavage proceeds through a distinct two-step mechanism. The process begins with the assembly and contraction of a large, arc-shaped actomyosin cable. However, this contractile event alone is insufficient to complete division. A second phase, driven by cadherin-mediated membrane adhesion, is required to invaginate the furrow ridge. Strikingly, this transition depends on mechanical uncoupling of the contractile cable from the surrounding cortex. We demonstrate that such uncoupling arises from an active nematic instability, which both enhances contractility along the cable and generates actin depletion zones that relieve lateral connections. Together, these findings reveal that meroblastic cleavage is governed not by a single actomyosin-based event but by a sequential interplay between cytoskeletal contraction and cadherin-dependent adhesion, highlighting a mechanism fundamentally distinct from canonical cytokinesis.","lang":"eng"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"22804","status":"public"}]},"language":[{"iso":"eng"}],"type":"preprint","OA_place":"repository","author":[{"full_name":"Tong, Xin","id":"50F65CDC-AA30-11E9-A72B-8A12E6697425","last_name":"Tong","first_name":"Xin"},{"full_name":"Li, Yuting I","id":"ee7a5ca8-8b71-11ed-b662-b3341c05b7eb","last_name":"Li","first_name":"Yuting I"},{"full_name":"Schelle, Joséphine","last_name":"Schelle","first_name":"Joséphine"},{"orcid":"0000-0001-6005-1561","last_name":"Hannezo","first_name":"Edouard B","full_name":"Hannezo, Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566"}],"date_updated":"2026-10-05T08:56:09Z","OA_type":"green"},{"oa":1,"doi":"10.1103/5xd9-4tjj","project":[{"name":"Tribocharge: a multi-scale approach to an enduring problem in physics","grant_number":"949120","call_identifier":"H2020","_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa"},{"call_identifier":"H2020","grant_number":"805041","name":"Organization of CLoUdS, and implications of Tropical  cyclones and for the Energetics of the tropics, in current and waRming climate","_id":"629205d8-2b32-11ec-9570-e1356ff73576"}],"file":[{"file_size":1761373,"file_name":"2025_PhysReviewLetters_Stoellner.pdf","checksum":"a5f76b1230cc7b039ecd0dbd6f99e775","creator":"dernst","content_type":"application/pdf","file_id":"20717","date_created":"2025-12-01T08:19:46Z","success":1,"date_updated":"2025-12-01T08:19:46Z","relation":"main_file","access_level":"open_access"}],"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)"},"corr_author":"1","issue":"21","article_processing_charge":"Yes (via OA deal)","article_type":"original","external_id":{"arxiv":["2507.17591"]},"has_accepted_license":"1","volume":135,"ec_funded":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","title":"Using optical tweezers to simultaneously trap, charge, and measure the charge of a microparticle in air","_id":"20705","arxiv":1,"publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"day":"21","fulldoi":"https://doi.org/10.1103/5xd9-4tjj","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"department":[{"_id":"ZhAl"},{"_id":"CaMu"},{"_id":"ScWa"}],"publication_status":"published","publication":"Physical Review Letters","year":"2025","date_created":"2025-11-30T23:02:07Z","file_date_updated":"2025-12-01T08:19:46Z","intvolume":"       135","acknowledgement":"We thank Todor Asenov and Abdulhamid Baghdadi for their outstanding technical support and Dr. Michael Gleichweit and Mercede Azizbaig Mohajer for the helpful discussions. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreements No. 949120 and No. 805041) and the Swiss National Science Foundation (SNSF, Project No. 200021-236446). This research was supported by the Scientific Service Units of the Institute of Science and Technology Austria (ISTA) through resources provided by the Miba Machine Shop and the Scientific Computing service unit.","article_number":"218202","date_published":"2025-11-21T00:00:00Z","publisher":"American Physical Society","month":"11","ddc":["530","550"],"oa_version":"Published Version","citation":{"short":"A. Stöllner, I.C. Lenton, A. Volosniev, J. Millen, R. Shibuya, H. Ishii, D. Rak, Z. Alpichshev, G. David, R. Signorell, C.J. Muller, S.R. Waitukaitis, Physical Review Letters 135 (2025).","apa":"Stöllner, A., Lenton, I. C., Volosniev, A., Millen, J., Shibuya, R., Ishii, H., … Waitukaitis, S. R. (2025). Using optical tweezers to simultaneously trap, charge, and measure the charge of a microparticle in air. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/5xd9-4tjj\">https://doi.org/10.1103/5xd9-4tjj</a>","mla":"Stöllner, Andrea, et al. “Using Optical Tweezers to Simultaneously Trap, Charge, and Measure the Charge of a Microparticle in Air.” <i>Physical Review Letters</i>, vol. 135, no. 21, 218202, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/5xd9-4tjj\">10.1103/5xd9-4tjj</a>.","chicago":"Stöllner, Andrea, Isaac C Lenton, Artem Volosniev, James Millen, Renjiro Shibuya, Hisao Ishii, Dmytro Rak, et al. “Using Optical Tweezers to Simultaneously Trap, Charge, and Measure the Charge of a Microparticle in Air.” <i>Physical Review Letters</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/5xd9-4tjj\">https://doi.org/10.1103/5xd9-4tjj</a>.","ama":"Stöllner A, Lenton IC, Volosniev A, et al. Using optical tweezers to simultaneously trap, charge, and measure the charge of a microparticle in air. <i>Physical Review Letters</i>. 2025;135(21). doi:<a href=\"https://doi.org/10.1103/5xd9-4tjj\">10.1103/5xd9-4tjj</a>","ista":"Stöllner A, Lenton IC, Volosniev A, Millen J, Shibuya R, Ishii H, Rak D, Alpichshev Z, David G, Signorell R, Muller CJ, Waitukaitis SR. 2025. Using optical tweezers to simultaneously trap, charge, and measure the charge of a microparticle in air. Physical Review Letters. 135(21), 218202.","ieee":"A. Stöllner <i>et al.</i>, “Using optical tweezers to simultaneously trap, charge, and measure the charge of a microparticle in air,” <i>Physical Review Letters</i>, vol. 135, no. 21. American Physical Society, 2025."},"status":"public","quality_controlled":"1","PlanS_conform":"1","language":[{"iso":"eng"}],"related_material":{"link":[{"relation":"press_release","description":"News on ISTA website","url":"https://ista.ac.at/en/news/trapping-particles-to-explain-lightning/"}],"record":[{"id":"23033","relation":"dissertation_contains","status":"public"}]},"abstract":[{"lang":"eng","text":"Optical tweezers are widely used as a highly sensitive tool to measure forces on micron-scale particles. One such application is the measurement of the electric charge of a particle, which can be done with high precision in liquids, air, or vacuum. We experimentally investigate how the trapping laser itself can electrically charge such a particle, in our case a ∼1  μ⁢m SiO2 sphere in air. We model the charging mechanism as a two-photon process which reproduces the experimental data with high fidelity."}],"OA_place":"publisher","type":"journal_article","author":[{"first_name":"Andrea","last_name":"Stöllner","id":"4bdcf7f6-eb97-11eb-a6c2-9981bbdc3bed","full_name":"Stöllner, Andrea","orcid":"0000-0002-0464-8440"},{"id":"a550210f-223c-11ec-8182-e2d45e817efb","full_name":"Lenton, Isaac C","first_name":"Isaac C","last_name":"Lenton","orcid":"0000-0002-5010-6984"},{"orcid":"0000-0003-0393-5525","first_name":"Artem","last_name":"Volosniev","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","full_name":"Volosniev, Artem"},{"first_name":"James","last_name":"Millen","full_name":"Millen, James"},{"full_name":"Shibuya, Renjiro","first_name":"Renjiro","last_name":"Shibuya"},{"full_name":"Ishii, Hisao","first_name":"Hisao","last_name":"Ishii"},{"id":"70313b46-47c2-11ec-9e88-cd79101918fe","full_name":"Rak, Dmytro","first_name":"Dmytro","last_name":"Rak"},{"orcid":"0000-0002-7183-5203","full_name":"Alpichshev, Zhanybek","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","last_name":"Alpichshev","first_name":"Zhanybek"},{"full_name":"David, Grégory","last_name":"David","first_name":"Grégory"},{"full_name":"Signorell, Ruth","last_name":"Signorell","first_name":"Ruth"},{"first_name":"Caroline J","last_name":"Muller","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","full_name":"Muller, Caroline J","orcid":"0000-0001-5836-5350"},{"first_name":"Scott R","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176"}],"scopus_import":"1","OA_type":"hybrid","date_updated":"2026-10-09T11:09:09Z"},{"oa_version":"Published Version","citation":{"mla":"Serin, Emin, et al. “Generating Synthetic Task-Based Brain Fingerprints for Population Neuroscience Using Deep Learning.” <i>Communications Biology</i>, vol. 8, 1572, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1038/s42003-025-09158-6\">10.1038/s42003-025-09158-6</a>.","chicago":"Serin, Emin, Kerstin Ritter, Gunter Schumann, Tobias Banaschewski, Andre Marquand, Henrik Walter, George Ogoh, et al. “Generating Synthetic Task-Based Brain Fingerprints for Population Neuroscience Using Deep Learning.” <i>Communications Biology</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1038/s42003-025-09158-6\">https://doi.org/10.1038/s42003-025-09158-6</a>.","apa":"Serin, E., Ritter, K., Schumann, G., Banaschewski, T., Marquand, A., Walter, H., … Schumann, G. (2025). Generating synthetic task-based brain fingerprints for population neuroscience using deep learning. <i>Communications Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s42003-025-09158-6\">https://doi.org/10.1038/s42003-025-09158-6</a>","short":"E. Serin, K. Ritter, G. Schumann, T. Banaschewski, A. Marquand, H. Walter, G. Ogoh, B.C. Stahl, R. Brandlistuen, T. Schikowski, A.H. Young, Y. Xinyang, Z. Zhang, K. Agunbiade, D. Chen, S. Desrivières, N. Clinton, P. Thompson, V. Köhler, A. Schwalber, V.D. Calhoun, X. Chang, Y. Zhang, Y. Li, Y. Dai, J. Yuan, Y. Xia, T. Jia, P. Renner, S. Hese, B. Spanlang, C. Pearmund, A.P. Athanasiadis, S. Petkoski, V. Jirsa, K. Schmitt, J.H. Wilbertz, M. Patraskaki, P. Sommer, S. Heilmann-Heimbach, C.M. Mathey, A.J. Miller, I. Claus, M.M. Nöthen, P. Hoffmann, A.J. Forstner, A. Pastor, J. Gallego, R. Itatani, F. Eiroa-Orosa, G. Feixas, M. Slater, G. Novarino, S.J. Böttger, M. Tschorn, M. Rapp, H. Ask, R. Kjelkenes, S. Fernandez, D. Van Der Meer, L.T. Westlye, O.A. Andreassen, R. Aden, B. Seefried, F. Nees, M. Neidhart, A. Stringaris, E. Schwarz, N. Holz, H. Tost, A. Meyer-Lindenberg, N. Christmann, K. Janson, K. Schepanski, T. Schütz, U.H. Taron, R. Eils, J.C. Roy, T.A. Lett, H. Kebir, E. Polemiti, E. Hitchen, M. Jentsch, E. Serin, A. Bernas, N. Vaidya, S. Twardziok, M. Ralser, A. Heinz, G. Schumann, Communications Biology 8 (2025).","ista":"Serin E, Ritter K, Schumann G, Banaschewski T, Marquand A, Walter H, Ogoh G, Stahl BC, Brandlistuen R, Schikowski T, Young AH, Xinyang Y, Zhang Z, Agunbiade K, Chen D, Desrivières S, Clinton N, Thompson P, Köhler V, Schwalber A, Calhoun VD, Chang X, Zhang Y, Li Y, Dai Y, Yuan J, Xia Y, Jia T, Renner P, Hese S, Spanlang B, Pearmund C, Athanasiadis AP, Petkoski S, Jirsa V, Schmitt K, Wilbertz JH, Patraskaki M, Sommer P, Heilmann-Heimbach S, Mathey CM, Miller AJ, Claus I, Nöthen MM, Hoffmann P, Forstner AJ, Pastor A, Gallego J, Itatani R, Eiroa-Orosa F, Feixas G, Slater M, Novarino G, Böttger SJ, Tschorn M, Rapp M, Ask H, Kjelkenes R, Fernandez S, Van Der Meer D, Westlye LT, Andreassen OA, Aden R, Seefried B, Nees F, Neidhart M, Stringaris A, Schwarz E, Holz N, Tost H, Meyer-Lindenberg A, Christmann N, Janson K, Schepanski K, Schütz T, Taron UH, Eils R, Roy JC, Lett TA, Kebir H, Polemiti E, Hitchen E, Jentsch M, Serin E, Bernas A, Vaidya N, Twardziok S, Ralser M, Heinz A, Schumann G. 2025. Generating synthetic task-based brain fingerprints for population neuroscience using deep learning. Communications Biology. 8, 1572.","ieee":"E. Serin <i>et al.</i>, “Generating synthetic task-based brain fingerprints for population neuroscience using deep learning,” <i>Communications Biology</i>, vol. 8. Springer Nature, 2025.","ama":"Serin E, Ritter K, Schumann G, et al. Generating synthetic task-based brain fingerprints for population neuroscience using deep learning. <i>Communications Biology</i>. 2025;8. doi:<a href=\"https://doi.org/10.1038/s42003-025-09158-6\">10.1038/s42003-025-09158-6</a>"},"date_published":"2025-12-01T00:00:00Z","pmid":1,"publisher":"Springer Nature","ddc":["570"],"month":"12","file_date_updated":"2025-11-24T09:12:19Z","intvolume":"         8","acknowledgement":"Funded by the European Union (Grant agreement No 101057429). Complementary funding was received by UK Research and Innovation (UKRI) under the UK government’s Horizon Europe funding guarantee (10131373 and 10038599) and the National Key R&D Program of Ministry of Science and Technology of China (MOST 2023YFE0199700). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union, the European Health and Digital Executive Agency (HADEA), UKRI or MOST. Neither the European Union nor HADEA nor UKRI nor MOST can be held responsible for them. This work has also been supported by a Grant from the German Research Foundation to the ENIGMA task-based fMRI Working Group (DFG ER 724/4–1, WA 1539/11–1). Data used in this study were provided in part by the Human Connectome Project, WU-Minn Consortium (principal investigators: D. Van Essen and K. Ugurbil; grant number 1U54MH091657), funded by the 16 National Institutes of Health (NIH) institutes and centers supporting the NIH Blueprint for Neuroscience Research, and by the McDonnell Center for Systems Neuroscience at Washington University. Additionally, this research utilized data obtained from UK Biobank, a large-scale biomedical database. Open Access funding enabled and organized by Projekt DEAL.","article_number":"1572","isi":1,"publication_status":"published","year":"2025","date_created":"2025-11-23T23:01:38Z","publication":"Communications Biology","OA_type":"gold","scopus_import":"1","date_updated":"2026-10-12T11:59:45Z","DOAJ_listed":"1","author":[{"full_name":"Serin, Emin","first_name":"Emin","last_name":"Serin"},{"full_name":"Ritter, Kerstin","last_name":"Ritter","first_name":"Kerstin"},{"full_name":"Schumann, Gunter","first_name":"Gunter","last_name":"Schumann"},{"full_name":"Banaschewski, Tobias","first_name":"Tobias","last_name":"Banaschewski"},{"full_name":"Marquand, Andre","first_name":"Andre","last_name":"Marquand"},{"first_name":"Henrik","last_name":"Walter","full_name":"Walter, Henrik"},{"full_name":"Ogoh, George","first_name":"George","last_name":"Ogoh"},{"full_name":"Stahl, Bernd Carsten","last_name":"Stahl","first_name":"Bernd Carsten"},{"first_name":"Ragnhild","last_name":"Brandlistuen","full_name":"Brandlistuen, Ragnhild"},{"full_name":"Schikowski, Tamara","last_name":"Schikowski","first_name":"Tamara"},{"first_name":"Allan H.","last_name":"Young","full_name":"Young, Allan H."},{"full_name":"Xinyang, Yu","first_name":"Yu","last_name":"Xinyang"},{"full_name":"Zhang, Zuo","first_name":"Zuo","last_name":"Zhang"},{"last_name":"Agunbiade","first_name":"Kofoworola","full_name":"Agunbiade, Kofoworola"},{"first_name":"Di","last_name":"Chen","full_name":"Chen, Di"},{"first_name":"Sylvane","last_name":"Desrivières","full_name":"Desrivières, Sylvane"},{"full_name":"Clinton, Nicholas","last_name":"Clinton","first_name":"Nicholas"},{"full_name":"Thompson, Paul","last_name":"Thompson","first_name":"Paul"},{"first_name":"Venessa","last_name":"Köhler","full_name":"Köhler, Venessa"},{"first_name":"Ameli","last_name":"Schwalber","full_name":"Schwalber, Ameli"},{"full_name":"Calhoun, Vince D.","first_name":"Vince D.","last_name":"Calhoun"},{"first_name":"Xiao","last_name":"Chang","full_name":"Chang, Xiao"},{"last_name":"Zhang","first_name":"Yanqing","full_name":"Zhang, Yanqing"},{"first_name":"Yuzhu","last_name":"Li","full_name":"Li, Yuzhu"},{"last_name":"Dai","first_name":"Yuxiang","full_name":"Dai, Yuxiang"},{"first_name":"Jiacan","last_name":"Yuan","full_name":"Yuan, Jiacan"},{"full_name":"Xia, Yunman","first_name":"Yunman","last_name":"Xia"},{"last_name":"Jia","first_name":"Tianye","full_name":"Jia, Tianye"},{"full_name":"Renner, Paul","last_name":"Renner","first_name":"Paul"},{"last_name":"Hese","first_name":"Sören","full_name":"Hese, Sören"},{"full_name":"Spanlang, Bernhard","last_name":"Spanlang","first_name":"Bernhard"},{"full_name":"Pearmund, Charlie","first_name":"Charlie","last_name":"Pearmund"},{"full_name":"Athanasiadis, Anastasios Polykarpos","last_name":"Athanasiadis","first_name":"Anastasios Polykarpos"},{"full_name":"Petkoski, Spase","last_name":"Petkoski","first_name":"Spase"},{"full_name":"Jirsa, Viktor","last_name":"Jirsa","first_name":"Viktor"},{"last_name":"Schmitt","first_name":"Karen","full_name":"Schmitt, Karen"},{"first_name":"Johannes H.","last_name":"Wilbertz","full_name":"Wilbertz, Johannes H."},{"full_name":"Patraskaki, Myrto","last_name":"Patraskaki","first_name":"Myrto"},{"full_name":"Sommer, Peter","last_name":"Sommer","first_name":"Peter"},{"last_name":"Heilmann-Heimbach","first_name":"Stefanie","full_name":"Heilmann-Heimbach, Stefanie"},{"full_name":"Mathey, Carina M.","last_name":"Mathey","first_name":"Carina M."},{"first_name":"Abigail J.","last_name":"Miller","full_name":"Miller, Abigail J."},{"full_name":"Claus, Isabelle","first_name":"Isabelle","last_name":"Claus"},{"full_name":"Nöthen, Markus M.","last_name":"Nöthen","first_name":"Markus M."},{"last_name":"Hoffmann","first_name":"Per","full_name":"Hoffmann, Per"},{"last_name":"Forstner","first_name":"Andreas J.","full_name":"Forstner, Andreas J."},{"last_name":"Pastor","first_name":"Alvaro","full_name":"Pastor, Alvaro"},{"full_name":"Gallego, Jaime","last_name":"Gallego","first_name":"Jaime"},{"full_name":"Itatani, Reiya","last_name":"Itatani","first_name":"Reiya"},{"full_name":"Eiroa-Orosa, Francisco","last_name":"Eiroa-Orosa","first_name":"Francisco"},{"full_name":"Feixas, Guillem","last_name":"Feixas","first_name":"Guillem"},{"first_name":"Mel","last_name":"Slater","full_name":"Slater, Mel"},{"first_name":"Gaia","last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178"},{"first_name":"Sarah Jane","last_name":"Böttger","full_name":"Böttger, Sarah Jane"},{"first_name":"Mira","last_name":"Tschorn","full_name":"Tschorn, Mira"},{"full_name":"Rapp, Michael","first_name":"Michael","last_name":"Rapp"},{"last_name":"Ask","first_name":"Helga","full_name":"Ask, Helga"},{"full_name":"Kjelkenes, Rikka","last_name":"Kjelkenes","first_name":"Rikka"},{"full_name":"Fernandez, Sara","first_name":"Sara","last_name":"Fernandez"},{"first_name":"Dennis","last_name":"Van Der Meer","full_name":"Van Der Meer, Dennis"},{"full_name":"Westlye, Lars T.","last_name":"Westlye","first_name":"Lars T."},{"first_name":"Ole A.","last_name":"Andreassen","full_name":"Andreassen, Ole A."},{"full_name":"Aden, Rieke","first_name":"Rieke","last_name":"Aden"},{"full_name":"Seefried, Beke","last_name":"Seefried","first_name":"Beke"},{"full_name":"Nees, Frauke","first_name":"Frauke","last_name":"Nees"},{"full_name":"Neidhart, Maja","last_name":"Neidhart","first_name":"Maja"},{"full_name":"Stringaris, Argyris","first_name":"Argyris","last_name":"Stringaris"},{"first_name":"Emanuel","last_name":"Schwarz","full_name":"Schwarz, Emanuel"},{"full_name":"Holz, Nathalie","first_name":"Nathalie","last_name":"Holz"},{"first_name":"Heike","last_name":"Tost","full_name":"Tost, Heike"},{"first_name":"Andreas","last_name":"Meyer-Lindenberg","full_name":"Meyer-Lindenberg, Andreas"},{"full_name":"Christmann, Nina","last_name":"Christmann","first_name":"Nina"},{"full_name":"Janson, Karina","last_name":"Janson","first_name":"Karina"},{"first_name":"Kerstin","last_name":"Schepanski","full_name":"Schepanski, Kerstin"},{"full_name":"Schütz, Tatjana","last_name":"Schütz","first_name":"Tatjana"},{"full_name":"Taron, Ulrike Helene","first_name":"Ulrike Helene","last_name":"Taron"},{"full_name":"Eils, Roland","first_name":"Roland","last_name":"Eils"},{"full_name":"Roy, Jean Charles","first_name":"Jean Charles","last_name":"Roy"},{"first_name":"Tristram A.","last_name":"Lett","full_name":"Lett, Tristram A."},{"full_name":"Kebir, Hedi","first_name":"Hedi","last_name":"Kebir"},{"full_name":"Polemiti, Elli","last_name":"Polemiti","first_name":"Elli"},{"full_name":"Hitchen, Esther","last_name":"Hitchen","first_name":"Esther"},{"first_name":"Marcel","last_name":"Jentsch","full_name":"Jentsch, Marcel"},{"first_name":"Emin","last_name":"Serin","full_name":"Serin, Emin"},{"full_name":"Bernas, Antoine","first_name":"Antoine","last_name":"Bernas"},{"first_name":"Nilakshi","last_name":"Vaidya","full_name":"Vaidya, Nilakshi"},{"full_name":"Twardziok, Sven","last_name":"Twardziok","first_name":"Sven"},{"full_name":"Ralser, Markus","last_name":"Ralser","first_name":"Markus"},{"full_name":"Heinz, Andreas","first_name":"Andreas","last_name":"Heinz"},{"full_name":"Schumann, Gunter","last_name":"Schumann","first_name":"Gunter"}],"language":[{"iso":"eng"}],"abstract":[{"text":"Task-based functional magnetic resonance imaging (fMRI) reveals individual differences in neural correlates of cognition but faces scalability challenges due to cognitive demands, protocol variability, and limited task coverage in large datasets. Here, we propose DeepTaskGen, a deep-learning approach that synthesizes non-acquired task-based contrast maps from resting-state (rs-) fMRI. We validate this approach using the Human Connectome Project lifespan data, then generate 47 contrast maps from 7 different cognitive tasks for over 20,000 individuals from UK Biobank. DeepTaskGen outperforms several benchmarks in generating synthetic task-contrast maps, achieving superior reconstruction performance while retaining inter-individual variation essential for biomarker development. We further show comparable or superior predictive performance of synthetic maps relative to actual maps and rs-connectomes across diverse demographic, cognitive, and clinical variables. This approach facilitates the study of individual differences and the generation of task-related biomarkers by enabling the generation of arbitrary functional cognitive tasks from readily available rs-fMRI data.","lang":"eng"}],"related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1038/s42003-026-10937-y"}]},"OA_place":"publisher","type":"journal_article","quality_controlled":"1","status":"public","PlanS_conform":"1","volume":8,"has_accepted_license":"1","article_processing_charge":"Yes","external_id":{"isi":["001614464000001"],"pmid":["41238730"]},"article_type":"original","doi":"10.1038/s42003-025-09158-6","oa":1,"file":[{"date_created":"2025-11-24T09:12:19Z","file_id":"20675","content_type":"application/pdf","creator":"dernst","checksum":"b8b3c1abe7048a09b920082a37e786a5","file_size":1588155,"file_name":"2025_CommunicationsBiology_Serin.pdf","access_level":"open_access","relation":"main_file","date_updated":"2025-11-24T09:12:19Z","success":1}],"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)"},"fulldoi":"https://doi.org/10.1038/s42003-025-09158-6","department":[{"_id":"GaNo"}],"publication_identifier":{"eissn":["2399-3642"]},"day":"01","title":"Generating synthetic task-based brain fingerprints for population neuroscience using deep learning","_id":"20662","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}]