--- OA_place: publisher _id: '20276' abstract: - lang: eng 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." 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" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Manas full_name: Bhargava, Manas id: FF8FA64C-AA6A-11E9-99AD-50D4E5697425 last_name: Bhargava orcid: 0009-0007-6138-6890 citation: ama: 'Bhargava M. Design and control of deformable structures: From PCB lighting displays to elastomer robots. 2025. doi:10.15479/AT-ISTA-20276' apa: 'Bhargava, M. (2025). Design and control of deformable structures: From PCB lighting displays to elastomer robots. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20276' chicago: 'Bhargava, Manas. “Design and Control of Deformable Structures: From PCB Lighting Displays to Elastomer Robots.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20276.' 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.' mla: 'Bhargava, Manas. Design and Control of Deformable Structures: From PCB Lighting Displays to Elastomer Robots. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20276.' short: 'M. Bhargava, Design and Control of Deformable Structures: From PCB Lighting Displays to Elastomer Robots, Institute of Science and Technology Austria, 2025.' corr_author: '1' date_created: 2025-09-02T14:48:39Z date_published: 2025-09-02T00:00:00Z date_updated: 2026-10-02T11:13:08Z day: '02' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: BeBi doi: 10.15479/AT-ISTA-20276 doi_confirm: '1' ec_funded: 1 file: - access_level: open_access checksum: 5baf8ca46c86a94fc8380ff1007aabd4 content_type: application/pdf creator: mbhargav date_created: 2025-09-03T10:40:52Z date_updated: 2025-09-03T10:40:52Z file_id: '20284' file_name: 2025-Bhargava-Manas-Thesis.pdf file_size: 161436245 relation: main_file success: 1 - access_level: closed checksum: 66878fafbc0074f88ddd18f24a9fc647 content_type: application/x-zip-compressed creator: mbhargav date_created: 2025-09-03T13:18:05Z date_updated: 2025-09-04T09:22:29Z file_id: '20285' file_name: manas_phd_thesis_source_files.zip file_size: 198831315 relation: source_file file_date_updated: 2025-09-04T09:22:29Z fulldoi: https://doi.org/10.15479/AT-ISTA-20276 has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc/4.0/ month: '09' oa: 1 oa_version: Published Version page: '96' project: - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' publication_identifier: isbn: - 978-3-99078-065-7 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '13049' relation: part_of_dissertation status: public - id: '20286' relation: part_of_dissertation status: public - id: '18565' relation: part_of_dissertation status: public status: public supervisor: - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 title: 'Design and control of deformable structures: From PCB lighting displays to elastomer robots' 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) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '18565' 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.' 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 article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Manas full_name: Bhargava, Manas id: FF8FA64C-AA6A-11E9-99AD-50D4E5697425 last_name: Bhargava orcid: 0009-0007-6138-6890 - first_name: Camille full_name: Schreck, Camille id: 2B14B676-F248-11E8-B48F-1D18A9856A87 last_name: Schreck - first_name: M. full_name: Freire, M. last_name: Freire - first_name: P. A. full_name: Hugron, P. A. last_name: Hugron - first_name: S. full_name: Lefebvre, S. last_name: Lefebvre - first_name: S. full_name: Sellán, S. last_name: Sellán - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 citation: ama: Bhargava M, Schreck C, Freire M, et al. Mesh simplification for unfolding. Computer Graphics Forum. 2025;44(1). doi:10.1111/cgf.15269 apa: Bhargava, M., Schreck, C., Freire, M., Hugron, P. A., Lefebvre, S., Sellán, S., & Bickel, B. (2025). Mesh simplification for unfolding. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.15269 chicago: Bhargava, Manas, Camille Schreck, M. Freire, P. A. Hugron, S. Lefebvre, S. Sellán, and Bernd Bickel. “Mesh Simplification for Unfolding.” Computer Graphics Forum. Wiley, 2025. https://doi.org/10.1111/cgf.15269. ieee: M. Bhargava et al., “Mesh simplification for unfolding,” Computer Graphics Forum, vol. 44, no. 1. Wiley, 2025. 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. mla: Bhargava, Manas, et al. “Mesh Simplification for Unfolding.” Computer Graphics Forum, vol. 44, no. 1, e15269, Wiley, 2025, doi:10.1111/cgf.15269. short: M. Bhargava, C. Schreck, M. Freire, P.A. Hugron, S. Lefebvre, S. Sellán, B. Bickel, Computer Graphics Forum 44 (2025). corr_author: '1' das_tickbox: '0' date_created: 2024-11-19T09:14:32Z date_published: 2025-02-01T00:00:00Z date_updated: 2026-10-02T11:13:08Z day: '01' ddc: - '006' department: - _id: GradSch - _id: BeBi doi: 10.1111/cgf.15269 external_id: arxiv: - '2408.06944' isi: - '001357046100001' file: - access_level: open_access checksum: 34acdd9bfbe43f00eb6c7656afef3ac6 content_type: video/mp4 creator: mbhargav date_created: 2024-11-19T09:23:20Z date_updated: 2024-11-19T09:23:20Z file_id: '18567' file_name: Mesh_Simplification_For_Unfolding_cgf_submission_supplemental_video.mp4 file_size: 36999751 relation: main_file success: 1 - access_level: open_access checksum: efb06b01bae37f470954601bc004374d content_type: application/pdf creator: dernst date_created: 2025-04-16T09:06:45Z date_updated: 2025-04-16T09:06:45Z file_id: '19576' file_name: 2025_CompGraphicsForum_Bhargava.pdf file_size: 5188265 relation: main_file success: 1 file_date_updated: 2025-04-16T09:06:45Z fulldoi: https://doi.org/10.1111/cgf.15269 has_accepted_license: '1' intvolume: ' 44' isi: 1 issue: '1' keyword: - fabrication - single patch unfolding - mesh simplification language: - iso: eng month: '02' oa: 1 oa_version: Published Version publication: Computer Graphics Forum publication_identifier: eissn: - 1467-8659 issn: - 0167-7055 publication_status: published publisher: Wiley quality_controlled: '1' related_material: record: - id: '20276' relation: dissertation_contains status: public researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: yes title: Mesh simplification for unfolding 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) type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 44 year: '2025' ... --- OA_place: publisher _id: '19759' abstract: - lang: eng 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" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Bernd full_name: Prach, Bernd id: 2D561D42-C427-11E9-89B4-9C1AE6697425 last_name: Prach citation: ama: Prach B. Robust image classification with 1-Lipschitz networks. 2025. doi:10.15479/10.15479/at-ista-19759 apa: Prach, B. (2025). Robust image classification with 1-Lipschitz networks. Institute of Science and Technology Austria. https://doi.org/10.15479/10.15479/at-ista-19759 chicago: Prach, Bernd. “Robust Image Classification with 1-Lipschitz Networks.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/10.15479/at-ista-19759. 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. mla: Prach, Bernd. Robust Image Classification with 1-Lipschitz Networks. Institute of Science and Technology Austria, 2025, doi:10.15479/10.15479/at-ista-19759. short: B. Prach, Robust Image Classification with 1-Lipschitz Networks, Institute of Science and Technology Austria, 2025. corr_author: '1' date_created: 2025-05-28T16:20:48Z date_published: 2025-05-30T00:00:00Z date_updated: 2026-10-02T11:16:04Z day: '30' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: ChLa doi: 10.15479/10.15479/at-ista-19759 doi_confirm: '1' file: - access_level: open_access checksum: e5108e759014e2a9020c973c778fafc9 content_type: application/pdf creator: bprach date_created: 2025-06-10T18:11:05Z date_updated: 2025-06-10T18:11:05Z file_id: '19829' file_name: ThesisFinal.pdf file_size: 3578077 relation: main_file - access_level: closed checksum: 51bf6c11fb6d8a9f8010b458c600a83f content_type: application/x-zip-compressed creator: bprach date_created: 2025-06-10T18:14:03Z date_updated: 2025-06-10T18:14:03Z file_id: '19830' file_name: ThesisFinal.zip file_size: 74894357 relation: source_file file_date_updated: 2025-06-10T18:14:03Z fulldoi: https://doi.org/10.15479/10.15479/at-ista-19759 has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: '84' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria 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." related_material: record: - id: '15039' relation: part_of_dissertation status: public - id: '11839' relation: part_of_dissertation status: public - id: '18874' relation: part_of_dissertation status: public - id: '17426' relation: part_of_dissertation status: public status: public supervisor: - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 title: Robust image classification with 1-Lipschitz networks type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- OA_place: repository OA_type: green _id: '20455' abstract: - lang: eng 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. article_processing_charge: No arxiv: 1 author: - first_name: Bernd full_name: Prach, Bernd id: 2D561D42-C427-11E9-89B4-9C1AE6697425 last_name: Prach - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Prach B, Lampert C. Intriguing properties of robust classification. In: 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. IEEE; 2025:660-669. doi:10.1109/CVPRW67362.2025.00071' apa: 'Prach, B., & Lampert, C. (2025). Intriguing properties of robust classification. In 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (pp. 660–669). Nashville, TN, United States: IEEE. https://doi.org/10.1109/CVPRW67362.2025.00071' chicago: Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” In 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 660–69. IEEE, 2025. https://doi.org/10.1109/CVPRW67362.2025.00071. ieee: B. Prach and C. Lampert, “Intriguing properties of robust classification,” in 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 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.' mla: Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, IEEE, 2025, pp. 660–69, doi:10.1109/CVPRW67362.2025.00071. short: B. Prach, C. Lampert, in:, 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, IEEE, 2025, pp. 660–669. conference: end_date: 2025-06-12 location: Nashville, TN, United States name: 'CVPR: Conference on Computer Vision and Pattern Recognition' start_date: 2025-06-11 corr_author: '1' date_created: 2025-10-12T22:01:26Z date_published: 2025-06-15T00:00:00Z date_updated: 2026-10-02T11:15:42Z day: '15' department: - _id: ChLa doi: 10.1109/CVPRW67362.2025.00071 external_id: arxiv: - '2412.04245' fulldoi: https://doi.org/10.1109/CVPRW67362.2025.00071 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2412.04245 month: '06' oa: 1 oa_version: Preprint page: 660-669 publication: 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops publication_identifier: eissn: - 2160-7516 isbn: - '9798331599942' issn: - 2160-7508 publication_status: published publisher: IEEE quality_controlled: '1' related_material: record: - id: '18874' relation: earlier_version status: public scopus_import: '1' status: public title: Intriguing properties of robust classification type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: publisher _id: '19630' 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." acknowledged_ssus: - _id: ScienComp 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. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Peter full_name: Synak, Peter id: 331776E2-F248-11E8-B48F-1D18A9856A87 last_name: Synak citation: ama: Synak P. Methods for fluid simulation, surface tracking, and statistics of non-manifold structures. 2025. doi:10.15479/AT-ISTA-19630 apa: Synak, P. (2025). Methods for fluid simulation, surface tracking, and statistics of non-manifold structures. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-19630 chicago: Synak, Peter. “Methods for Fluid Simulation, Surface Tracking, and Statistics of Non-Manifold Structures.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-19630. 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. mla: Synak, Peter. Methods for Fluid Simulation, Surface Tracking, and Statistics of Non-Manifold Structures. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-19630. short: P. Synak, Methods for Fluid Simulation, Surface Tracking, and Statistics of Non-Manifold Structures, Institute of Science and Technology Austria, 2025. corr_author: '1' date_created: 2025-04-29T09:39:34Z date_published: 2025-04-29T00:00:00Z date_updated: 2026-10-02T11:19:03Z day: '29' ddc: - '519' - '006' degree_awarded: PhD department: - _id: ChWo - _id: GradSch doi: 10.15479/AT-ISTA-19630 ec_funded: 1 file: - access_level: closed checksum: f00b519c27529daa0c3b2d4102b4fa7b content_type: application/x-zip-compressed creator: cchlebak date_created: 2025-04-30T14:02:25Z date_updated: 2025-04-30T14:02:25Z file_id: '19633' file_name: Thesis_source_Heiss_Synak.zip file_size: 60670543 relation: source_file - access_level: open_access checksum: 6e40a2fd3b1b881af1385670854a682e content_type: application/pdf creator: cchlebak date_created: 2025-04-30T14:02:42Z date_updated: 2025-04-30T15:49:16Z file_id: '19634' file_name: Thesis_PDFA_Heiss_Synak.pdf file_size: 21319043 relation: main_file file_date_updated: 2025-04-30T15:49:16Z fulldoi: https://doi.org/10.15479/AT-ISTA-19630 has_accepted_license: '1' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: '106' project: - _id: 2533E772-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '638176' name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales' - _id: 34bc2376-11ca-11ed-8bc3-9a3b3961a088 grant_number: '101045083' name: Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 2533E772-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '638176' name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales' - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '8135' relation: part_of_dissertation status: public - id: '8384' relation: part_of_dissertation status: public - id: '17219' relation: part_of_dissertation status: public status: public supervisor: - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 title: Methods for fluid simulation, surface tracking, and statistics of non-manifold structures type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2025' ... --- OA_place: publisher _id: '20551' abstract: - lang: eng 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. " acknowledged_ssus: - _id: CampIT 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." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Sadashige full_name: Ishida, Sadashige id: 6F7C4B96-A8E9-11E9-A7CA-09ECE5697425 last_name: Ishida orcid: 0000-0002-3121-3100 citation: ama: Ishida S. Symplectic-prequantum structures and dynamics on the codimension-2 shape space. 2025. doi:10.15479/AT-ISTA-20551 apa: Ishida, S. (2025). Symplectic-prequantum structures and dynamics on the codimension-2 shape space. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20551 chicago: Ishida, Sadashige. “Symplectic-Prequantum Structures and Dynamics on the Codimension-2 Shape Space.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20551. ieee: 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. mla: Ishida, Sadashige. Symplectic-Prequantum Structures and Dynamics on the Codimension-2 Shape Space. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20551. short: S. Ishida, Symplectic-Prequantum Structures and Dynamics on the Codimension-2 Shape Space, Institute of Science and Technology Austria, 2025. corr_author: '1' date_created: 2025-10-27T10:28:52Z date_published: 2025-10-31T00:00:00Z date_updated: 2026-10-02T11:17:04Z day: '31' ddc: - '516' degree_awarded: PhD department: - _id: GradSch - _id: ChWo doi: 10.15479/AT-ISTA-20551 ec_funded: 1 file: - access_level: open_access checksum: 4eef80afcb67691cbb6549c4756fa534 content_type: application/zip creator: sishida date_created: 2025-11-01T18:26:14Z date_updated: 2025-11-01T18:26:14Z file_id: '20583' file_name: Thesis_tex.zip file_size: 72487812 relation: source_file - access_level: open_access checksum: 1e5a557900bf2dce01966b211b15d0fe content_type: application/pdf creator: sishida date_created: 2025-11-10T08:45:05Z date_updated: 2025-11-10T08:45:05Z file_id: '20623' file_name: Thesis_Sadashige_Ishida_PDFA.pdf file_size: 8945141 relation: main_file success: 1 file_date_updated: 2025-11-10T08:45:05Z fulldoi: https://doi.org/10.15479/AT-ISTA-20551 has_accepted_license: '1' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: '141' project: - _id: 2533E772-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '638176' name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales' - _id: 34bc2376-11ca-11ed-8bc3-9a3b3961a088 grant_number: '101045083' name: Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena publication_identifier: isbn: - 978-3-99078-070-1 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '12431' relation: part_of_dissertation status: public - id: '20580' relation: part_of_dissertation status: public - id: '17361' relation: part_of_dissertation status: public - id: '12846' relation: part_of_dissertation status: public status: public supervisor: - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 - first_name: Albert full_name: Chern, Albert last_name: Chern title: Symplectic-prequantum structures and dynamics on the codimension-2 shape space 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) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2025' ... --- OA_place: publisher _id: '20234' abstract: - lang: eng 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." 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" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Raimundo J full_name: Saona Urmeneta, Raimundo J id: BD1DF4C4-D767-11E9-B658-BC13E6697425 last_name: Saona Urmeneta orcid: 0000-0001-5103-038X citation: ama: 'Saona Urmeneta RJ. Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games. 2025. doi:10.15479/AT-ISTA-20234' apa: 'Saona Urmeneta, R. J. (2025). Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20234' 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. https://doi.org/10.15479/AT-ISTA-20234.' 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.' 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.' mla: '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, doi:10.15479/AT-ISTA-20234.' 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.' corr_author: '1' date_created: 2025-08-27T14:00:13Z date_published: 2025-08-27T00:00:00Z date_updated: 2026-10-02T11:30:08Z day: '27' ddc: - '519' degree_awarded: PhD department: - _id: GradSch - _id: KrCh doi: 10.15479/AT-ISTA-20234 doi_confirm: '1' ec_funded: 1 file: - access_level: open_access checksum: 394a651f7de7085e509ef856ffe7bd97 content_type: application/pdf creator: rsaonaur date_created: 2025-08-28T14:47:07Z date_updated: 2025-08-28T14:47:07Z file_id: '20240' file_name: 2025_Saona_Raimundo_Thesis.pdf file_size: 1503623 relation: main_file success: 1 - access_level: closed checksum: 09fb2633e66aac80433d373f4180c5b4 content_type: application/zip creator: rsaonaur date_created: 2025-08-28T14:47:12Z date_updated: 2025-08-28T14:47:12Z file_id: '20241' file_name: 2025_Saona_Raimundo_Thesis.zip file_size: 622747 relation: source_file file_date_updated: 2025-08-28T14:47:12Z fulldoi: https://doi.org/10.15479/AT-ISTA-20234 has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '125' project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '9311' relation: part_of_dissertation status: public - id: '19508' relation: part_of_dissertation status: public - id: '17037' relation: part_of_dissertation status: public - id: '18266' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X title: 'Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games' type: dissertation user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_type: closed access _id: '17037' 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. 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]. article_processing_charge: No article_type: original author: - first_name: Luc full_name: Attia, Luc last_name: Attia - first_name: Miquel full_name: Oliu-Barton, Miquel last_name: Oliu-Barton - first_name: Raimundo J full_name: Saona Urmeneta, Raimundo J id: BD1DF4C4-D767-11E9-B658-BC13E6697425 last_name: Saona Urmeneta orcid: 0000-0001-5103-038X citation: ama: Attia L, Oliu-Barton M, Saona Urmeneta RJ. Marginal values of a stochastic game. Mathematics of Operations Research. 2025;50(1):482-505. doi:10.1287/moor.2023.0297 apa: Attia, L., Oliu-Barton, M., & Saona Urmeneta, R. J. (2025). Marginal values of a stochastic game. Mathematics of Operations Research. Institute for Operations Research and the Management Sciences. https://doi.org/10.1287/moor.2023.0297 chicago: Attia, Luc, Miquel Oliu-Barton, and Raimundo J Saona Urmeneta. “Marginal Values of a Stochastic Game.” Mathematics of Operations Research. Institute for Operations Research and the Management Sciences, 2025. https://doi.org/10.1287/moor.2023.0297. ieee: L. Attia, M. Oliu-Barton, and R. J. Saona Urmeneta, “Marginal values of a stochastic game,” Mathematics of Operations Research, 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. mla: Attia, Luc, et al. “Marginal Values of a Stochastic Game.” Mathematics of Operations Research, vol. 50, no. 1, Institute for Operations Research and the Management Sciences, 2025, pp. 482–505, doi:10.1287/moor.2023.0297. short: L. Attia, M. Oliu-Barton, R.J. Saona Urmeneta, Mathematics of Operations Research 50 (2025) 482–505. das_tickbox: '0' date_created: 2024-05-22T11:41:14Z date_published: 2025-02-01T00:00:00Z date_updated: 2026-10-02T11:29:44Z day: '01' department: - _id: GradSch - _id: KrCh doi: 10.1287/moor.2023.0297 ec_funded: 1 external_id: isi: - '001184648000001' fulldoi: https://doi.org/10.1287/moor.2023.0297 intvolume: ' 50' isi: 1 issue: '1' language: - iso: eng month: '02' oa_version: None page: 482-505 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: Mathematics of Operations Research publication_identifier: eissn: - 1526-5471 issn: - 0364-765X publication_status: published publisher: Institute for Operations Research and the Management Sciences quality_controlled: '1' related_material: record: - id: '20234' relation: dissertation_contains status: public researchdata_availability: unclear scopus_import: '1' status: public supplementarymaterial: unclear title: Marginal values of a stochastic game type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 50 year: '2025' ... --- OA_place: publisher _id: '19048' 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.' acknowledged_ssus: - _id: CampIT - _id: E-Lib - _id: SSU 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." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Mikhail full_name: Maslov, Mikhail id: 2E65BB0E-F248-11E8-B48F-1D18A9856A87 last_name: Maslov orcid: 0000-0003-4074-2570 citation: ama: Maslov M. Emergent physics of rotating quantum impurities in many-body environments. 2025. doi:10.15479/at:ista:19048 apa: Maslov, M. (2025). Emergent physics of rotating quantum impurities in many-body environments. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:19048 chicago: Maslov, Mikhail. “Emergent Physics of Rotating Quantum Impurities in Many-Body Environments.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/at:ista:19048. ieee: M. Maslov, “Emergent physics of rotating quantum impurities in many-body environments,” Institute of Science and Technology Austria, 2025. ista: Maslov M. 2025. Emergent physics of rotating quantum impurities in many-body environments. Institute of Science and Technology Austria. mla: Maslov, Mikhail. Emergent Physics of Rotating Quantum Impurities in Many-Body Environments. Institute of Science and Technology Austria, 2025, doi:10.15479/at:ista:19048. short: M. Maslov, Emergent Physics of Rotating Quantum Impurities in Many-Body Environments, Institute of Science and Technology Austria, 2025. corr_author: '1' date_created: 2025-02-18T01:41:27Z date_published: 2025-02-18T00:00:00Z date_updated: 2026-10-02T11:36:24Z day: '18' ddc: - '539' - '535' - '541' degree_awarded: PhD department: - _id: GradSch - _id: MiLe doi: 10.15479/at:ista:19048 ec_funded: 1 file: - access_level: open_access checksum: 5822a4dd31724c512b37c658af1787ab content_type: application/pdf creator: mmaslov date_created: 2025-02-18T14:25:59Z date_updated: 2025-02-18T14:25:59Z file_id: '19061' file_name: thesis_Maslov.pdf file_size: 7779825 relation: main_file - access_level: open_access checksum: 89bdce4774406d26ceca88a8bbcd6a9a content_type: application/zip creator: mmaslov date_created: 2025-02-18T14:25:59Z date_updated: 2025-02-18T14:25:59Z file_id: '19062' file_name: thesis_Maslov_source.zip file_size: 14453726 relation: source_file file_date_updated: 2025-02-18T14:25:59Z fulldoi: https://doi.org/10.15479/at:ista:19048 has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-sa/4.0/ month: '02' oa: 1 oa_version: Published Version page: '86' project: - _id: 2688CF98-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '801770' name: 'Angulon: physics and applications of a new quasiparticle' - _id: 7c040762-9f16-11ee-852c-dd79eeee4ab3 grant_number: F100403 name: Coherent Optical Metrology Beyond Electric-Dipole-Allowed Transitions publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '10845' relation: part_of_dissertation status: public - id: '7933' relation: part_of_dissertation status: public - id: '18087' relation: part_of_dissertation status: public status: public supervisor: - first_name: Mikhail full_name: Lemeshko, Mikhail id: 37CB05FA-F248-11E8-B48F-1D18A9856A87 last_name: Lemeshko orcid: 0000-0002-6990-7802 title: Emergent physics of rotating quantum impurities in many-body environments tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2025' ... --- OA_place: publisher _id: '20147' abstract: - lang: eng 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" 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" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Naci E full_name: Sarac, Naci E id: 8C6B42F8-C8E6-11E9-A03A-F2DCE5697425 last_name: Sarac citation: ama: Sarac NE. A monitoring-oriented theory and classification of quantitative specifications. 2025. doi:10.15479/AT-ISTA-20147 apa: Sarac, N. E. (2025). A monitoring-oriented theory and classification of quantitative specifications. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20147 chicago: Sarac, Naci E. “A Monitoring-Oriented Theory and Classification of Quantitative Specifications.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20147. 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. mla: Sarac, Naci E. A Monitoring-Oriented Theory and Classification of Quantitative Specifications. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20147. short: N.E. Sarac, A Monitoring-Oriented Theory and Classification of Quantitative Specifications, Institute of Science and Technology Austria, 2025. corr_author: '1' date_created: 2025-08-07T15:57:57Z date_published: 2025-08-07T00:00:00Z date_updated: 2026-10-02T11:44:51Z day: '07' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: ToHe doi: 10.15479/AT-ISTA-20147 doi_confirm: '1' ec_funded: 1 file: - access_level: closed checksum: 0f3015f1db36576a23d8d669afb60b41 content_type: application/x-zip-compressed creator: esarac date_created: 2025-08-21T09:40:28Z date_updated: 2025-09-10T08:19:51Z file_id: '20200' file_name: 2025_Sarac_NaciEge_Thesis.zip file_size: 8884801 relation: source_file - access_level: open_access checksum: 332ed2fe61f580641664ec3f05d30f14 content_type: application/pdf creator: esarac date_created: 2025-08-21T09:40:34Z date_updated: 2025-08-21T09:40:34Z file_id: '20201' file_name: 2025_Sarac_NaciEge_Thesis.pdf file_size: 2955584 relation: main_file success: 1 file_date_updated: 2025-09-10T08:19:51Z fulldoi: https://doi.org/10.15479/AT-ISTA-20147 has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '149' project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: Formal methods for the design and analysis of complex systems - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria 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." related_material: record: - id: '11775' relation: part_of_dissertation status: public - id: '13140' relation: part_of_dissertation status: deleted - id: '19741' relation: part_of_dissertation status: public - id: '19643' relation: part_of_dissertation status: deleted - id: '13221' relation: part_of_dissertation status: public - id: '9356' relation: part_of_dissertation status: public - id: '20342' relation: part_of_dissertation status: public - id: '17634' relation: part_of_dissertation status: public status: public supervisor: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 title: A monitoring-oriented theory and classification of quantitative specifications 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) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '10045' 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" 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). article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Martin full_name: Dvorak, Martin id: 40ED02A8-C8B4-11E9-A9C0-453BE6697425 last_name: Dvorak orcid: 0000-0001-5293-214X - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov citation: ama: Dvorak M, Kolmogorov V. Generalized minimum 0-extension problem and discrete convexity. Mathematical Programming. 2025;209:279-322. doi:10.1007/s10107-024-02064-5 apa: Dvorak, M., & Kolmogorov, V. (2025). Generalized minimum 0-extension problem and discrete convexity. Mathematical Programming. Springer Nature. https://doi.org/10.1007/s10107-024-02064-5 chicago: Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem and Discrete Convexity.” Mathematical Programming. Springer Nature, 2025. https://doi.org/10.1007/s10107-024-02064-5. ieee: M. Dvorak and V. Kolmogorov, “Generalized minimum 0-extension problem and discrete convexity,” Mathematical Programming, 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. mla: Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem and Discrete Convexity.” Mathematical Programming, vol. 209, Springer Nature, 2025, pp. 279–322, doi:10.1007/s10107-024-02064-5. short: M. Dvorak, V. Kolmogorov, Mathematical Programming 209 (2025) 279–322. corr_author: '1' das_tickbox: '0' date_created: 2021-09-27T10:48:23Z date_published: 2025-01-01T00:00:00Z date_updated: 2026-10-02T11:45:16Z day: '01' ddc: - '004' department: - _id: GradSch - _id: VlKo doi: 10.1007/s10107-024-02064-5 external_id: arxiv: - '2109.10203' isi: - '001176563300001' file: - access_level: open_access checksum: 25d9bd490719b45eca84f4d93a06c69f content_type: application/pdf creator: dernst date_created: 2025-04-16T09:36:08Z date_updated: 2025-04-16T09:36:08Z file_id: '19578' file_name: 2025_MathProgramming_Dvorak.pdf file_size: 839510 relation: main_file success: 1 file_date_updated: 2025-04-16T09:36:08Z fulldoi: https://doi.org/10.1007/s10107-024-02064-5 has_accepted_license: '1' intvolume: ' 209' isi: 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 language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 279-322 publication: Mathematical Programming publication_identifier: eissn: - 1436-4646 issn: - 0025-5610 publication_status: published publisher: Springer Nature quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: no title: Generalized minimum 0-extension problem and discrete convexity 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) type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 209 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '17149' 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. 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." article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Anton full_name: Nikitenko, Anton id: 3E4FF1BA-F248-11E8-B48F-1D18A9856A87 last_name: Nikitenko orcid: 0000-0002-0659-3201 citation: ama: Edelsbrunner H, Nikitenko A. Average and expected distortion of Voronoi paths and scapes. Discrete & Computational Geometry. 2025;73:490-499. doi:10.1007/s00454-024-00660-y apa: Edelsbrunner, H., & Nikitenko, A. (2025). Average and expected distortion of Voronoi paths and scapes. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-024-00660-y chicago: Edelsbrunner, Herbert, and Anton Nikitenko. “Average and Expected Distortion of Voronoi Paths and Scapes.” Discrete & Computational Geometry. Springer Nature, 2025. https://doi.org/10.1007/s00454-024-00660-y. ieee: H. Edelsbrunner and A. Nikitenko, “Average and expected distortion of Voronoi paths and scapes,” Discrete & Computational Geometry, vol. 73. Springer Nature, pp. 490–499, 2025. ista: Edelsbrunner H, Nikitenko A. 2025. Average and expected distortion of Voronoi paths and scapes. Discrete & Computational Geometry. 73, 490–499. mla: Edelsbrunner, Herbert, and Anton Nikitenko. “Average and Expected Distortion of Voronoi Paths and Scapes.” Discrete & Computational Geometry, vol. 73, Springer Nature, 2025, pp. 490–99, doi:10.1007/s00454-024-00660-y. short: H. Edelsbrunner, A. Nikitenko, Discrete & Computational Geometry 73 (2025) 490–499. corr_author: '1' das_tickbox: '0' date_created: 2024-06-16T22:01:07Z date_published: 2025-03-01T00:00:00Z date_updated: 2026-10-02T11:48:46Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.1007/s00454-024-00660-y ec_funded: 1 external_id: arxiv: - '2012.03350' isi: - '001238566200004' pmid: - '39974750' file: - access_level: open_access checksum: ffb0c818222138f9f113f4bbea41e834 content_type: application/pdf creator: dernst date_created: 2025-04-23T07:31:32Z date_updated: 2025-04-23T07:31:32Z file_id: '19610' file_name: 2025_DiscreteComputGeom_EdelsbrunnerHe.pdf file_size: 283443 relation: main_file success: 1 file_date_updated: 2025-04-23T07:31:32Z fulldoi: https://doi.org/10.1007/s00454-024-00660-y has_accepted_license: '1' intvolume: ' 73' isi: 1 language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: 490-499 pmid: 1 project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: Mathematics, Computer Science - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication: Discrete & Computational Geometry publication_identifier: eissn: - 1432-0444 issn: - 0179-5376 publication_status: published publisher: Springer Nature quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: no title: Average and expected distortion of Voronoi paths and scapes 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) type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 73 year: '2025' ... --- OA_place: repository OA_type: green _id: '21253' abstract: - lang: eng 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. 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. article_number: '102186' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: János full_name: Pach, János last_name: Pach - first_name: Morteza full_name: Saghafian, Morteza id: f86f7148-b140-11ec-9577-95435b8df824 last_name: Saghafian - first_name: Patrick full_name: Schnider, Patrick last_name: Schnider citation: ama: Pach J, Saghafian M, Schnider P. Decomposition of geometric graphs into star-forests. Computational Geometry. 2025;129. doi:10.1016/j.comgeo.2025.102186 apa: Pach, J., Saghafian, M., & Schnider, P. (2025). Decomposition of geometric graphs into star-forests. Computational Geometry. Elsevier. https://doi.org/10.1016/j.comgeo.2025.102186 chicago: Pach, János, Morteza Saghafian, and Patrick Schnider. “Decomposition of Geometric Graphs into Star-Forests.” Computational Geometry. Elsevier, 2025. https://doi.org/10.1016/j.comgeo.2025.102186. ieee: J. Pach, M. Saghafian, and P. Schnider, “Decomposition of geometric graphs into star-forests,” Computational Geometry, vol. 129. Elsevier, 2025. ista: Pach J, Saghafian M, Schnider P. 2025. Decomposition of geometric graphs into star-forests. Computational Geometry. 129, 102186. mla: Pach, János, et al. “Decomposition of Geometric Graphs into Star-Forests.” Computational Geometry, vol. 129, 102186, Elsevier, 2025, doi:10.1016/j.comgeo.2025.102186. short: J. Pach, M. Saghafian, P. Schnider, Computational Geometry 129 (2025). corr_author: '1' date_created: 2026-02-16T15:48:42Z date_published: 2025-12-01T00:00:00Z date_updated: 2026-10-02T11:50:58Z day: '01' department: - _id: HeEd doi: 10.1016/j.comgeo.2025.102186 external_id: arxiv: - '2306.13201' fulldoi: https://doi.org/10.1016/j.comgeo.2025.102186 intvolume: ' 129' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2306.13201 month: '12' oa: 1 oa_version: Preprint publication: Computational Geometry publication_identifier: issn: - 0925-7721 publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '15012' relation: earlier_version status: public status: public title: Decomposition of geometric graphs into star-forests type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 129 year: '2025' ... --- OA_place: publisher _id: '18979' abstract: - lang: eng 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." 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" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Ondrej full_name: Draganov, Ondrej id: 2B23F01E-F248-11E8-B48F-1D18A9856A87 last_name: Draganov orcid: 0000-0003-0464-3823 citation: ama: Draganov O. Structures and computations in topological data analysis. 2025. doi:10.15479/at:ista:18979 apa: Draganov, O. (2025). Structures and computations in topological data analysis. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18979 chicago: Draganov, Ondrej. “Structures and Computations in Topological Data Analysis.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/at:ista:18979. ieee: O. Draganov, “Structures and computations in topological data analysis,” Institute of Science and Technology Austria, 2025. ista: Draganov O. 2025. Structures and computations in topological data analysis. Institute of Science and Technology Austria. mla: Draganov, Ondrej. Structures and Computations in Topological Data Analysis. Institute of Science and Technology Austria, 2025, doi:10.15479/at:ista:18979. short: O. Draganov, Structures and Computations in Topological Data Analysis, Institute of Science and Technology Austria, 2025. corr_author: '1' date_created: 2025-01-31T17:04:40Z date_published: 2025-02-03T00:00:00Z date_updated: 2026-10-02T11:57:00Z day: '03' ddc: - '514' - '004' degree_awarded: PhD department: - _id: GradSch - _id: HeEd doi: 10.15479/at:ista:18979 file: - access_level: closed checksum: af6567e5d35e5eb330b8925ae37f1998 content_type: application/zip creator: odragano date_created: 2025-01-31T16:58:30Z date_updated: 2025-01-31T16:58:30Z file_id: '18983' file_name: Thesis.zip file_size: 11899491 relation: source_file - access_level: open_access checksum: c3fef68e35b9dc2020b2ca6006da6343 content_type: application/pdf creator: odragano date_created: 2025-02-04T16:22:07Z date_updated: 2025-02-04T16:22:07Z file_id: '19000' file_name: Thesis.pdf file_size: 8857514 relation: main_file file_date_updated: 2025-02-04T16:22:07Z fulldoi: https://doi.org/10.15479/at:ista:18979 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 language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '140' project: - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: Mathematics, Computer Science publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '15091' relation: part_of_dissertation status: public - id: '18981' relation: part_of_dissertation status: public status: public supervisor: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 title: Structures and computations in topological data analysis 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) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2025' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '20323' abstract: - lang: eng 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. 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 article_number: '108068' article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Adam full_name: Brown, Adam id: 70B7FDF6-608D-11E9-9333-8535E6697425 last_name: Brown - first_name: Ondrej full_name: Draganov, Ondrej id: 2B23F01E-F248-11E8-B48F-1D18A9856A87 last_name: Draganov orcid: 0000-0003-0464-3823 citation: ama: Brown A, Draganov O. Discrete microlocal Morse theory. Journal of Pure and Applied Algebra. 2025;229(10). doi:10.1016/j.jpaa.2025.108068 apa: Brown, A., & Draganov, O. (2025). Discrete microlocal Morse theory. Journal of Pure and Applied Algebra. Elsevier. https://doi.org/10.1016/j.jpaa.2025.108068 chicago: Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” Journal of Pure and Applied Algebra. Elsevier, 2025. https://doi.org/10.1016/j.jpaa.2025.108068. ieee: A. Brown and O. Draganov, “Discrete microlocal Morse theory,” Journal of Pure and Applied Algebra, 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. mla: Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” Journal of Pure and Applied Algebra, vol. 229, no. 10, 108068, Elsevier, 2025, doi:10.1016/j.jpaa.2025.108068. short: A. Brown, O. Draganov, Journal of Pure and Applied Algebra 229 (2025). corr_author: '1' date_created: 2025-09-10T05:40:09Z date_published: 2025-10-01T00:00:00Z date_updated: 2026-10-02T11:57:00Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.1016/j.jpaa.2025.108068 ec_funded: 1 external_id: arxiv: - '2209.14993' file: - access_level: open_access checksum: 39bcad462278c9322ef810af7db67f56 content_type: application/pdf creator: dernst date_created: 2025-12-30T07:55:08Z date_updated: 2025-12-30T07:55:08Z file_id: '20886' file_name: 2025_JourPureAppliedAlgebra_Brown.pdf file_size: 3090836 relation: main_file success: 1 file_date_updated: 2025-12-30T07:55:08Z fulldoi: https://doi.org/10.1016/j.jpaa.2025.108068 has_accepted_license: '1' intvolume: ' 229' issue: '10' language: - iso: eng month: '10' oa: 1 oa_version: Published Version project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: Mathematics, Computer Science - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication: Journal of Pure and Applied Algebra publication_identifier: issn: - 0022-4049 publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '18981' relation: earlier_version status: public scopus_import: '1' status: public title: Discrete microlocal Morse theory 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) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 229 year: '2025' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold PlanS_conform: '1' _id: '20591' 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. 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. article_number: '71' article_processing_charge: Yes article_type: original arxiv: 1 author: - first_name: Giovanni full_name: Brigati, Giovanni id: 63ff57e8-1fbb-11ee-88f2-f558ffc59cf1 last_name: Brigati - first_name: Francesco full_name: Pedrotti, Francesco id: d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c last_name: Pedrotti citation: ama: Brigati G, Pedrotti F. Heat flow, log-concavity, and Lipschitz transport maps. Electronic Communications in Probability. 2025;30. doi:10.1214/25-ECP717 apa: Brigati, G., & Pedrotti, F. (2025). Heat flow, log-concavity, and Lipschitz transport maps. Electronic Communications in Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/25-ECP717 chicago: Brigati, Giovanni, and Francesco Pedrotti. “Heat Flow, Log-Concavity, and Lipschitz Transport Maps.” Electronic Communications in Probability. Institute of Mathematical Statistics, 2025. https://doi.org/10.1214/25-ECP717. ieee: G. Brigati and F. Pedrotti, “Heat flow, log-concavity, and Lipschitz transport maps,” Electronic Communications in Probability, 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. mla: Brigati, Giovanni, and Francesco Pedrotti. “Heat Flow, Log-Concavity, and Lipschitz Transport Maps.” Electronic Communications in Probability, vol. 30, 71, Institute of Mathematical Statistics, 2025, doi:10.1214/25-ECP717. short: G. Brigati, F. Pedrotti, Electronic Communications in Probability 30 (2025). corr_author: '1' date_created: 2025-11-02T23:01:35Z date_published: 2025-09-25T00:00:00Z date_updated: 2026-10-02T12:20:37Z day: '25' ddc: - '500' department: - _id: JaMa doi: 10.1214/25-ECP717 ec_funded: 1 external_id: arxiv: - '2404.15205' isi: - '001611557000018' file: - access_level: open_access checksum: 67858edbd74658fe38955fa1216f2f18 content_type: application/pdf creator: dernst date_created: 2025-11-04T07:34:05Z date_updated: 2025-11-04T07:34:05Z file_id: '20596' file_name: 2025_ElectronJourProbab_Brigati.pdf file_size: 278078 relation: main_file success: 1 file_date_updated: 2025-11-04T07:34:05Z fulldoi: https://doi.org/10.1214/25-ECP717 has_accepted_license: '1' intvolume: ' 30' isi: 1 language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: Electronic Communications in Probability publication_identifier: eissn: - 1083-589X publication_status: published publisher: Institute of Mathematical Statistics quality_controlled: '1' related_material: record: - id: '17353' relation: earlier_version status: public scopus_import: '1' status: public title: Heat flow, log-concavity, and Lipschitz transport maps 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) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 30 year: '2025' ... --- OA_place: repository OA_type: green _id: '20050' 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. 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. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Kseniia full_name: Khudiakova, Kseniia id: 4E6DC800-AE37-11E9-AC72-31CAE5697425 last_name: Khudiakova orcid: 0000-0002-6246-1465 - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 - first_name: Francesco full_name: Pedrotti, Francesco id: d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c last_name: Pedrotti citation: ama: Khudiakova K, Maas J, Pedrotti F. L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. The Annals of Applied Probability. 2025;35(3):1913-1940. doi:10.1214/25-aap2162 apa: 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. Institute of Mathematical Statistics. https://doi.org/10.1214/25-aap2162 chicago: Khudiakova, Kseniia, Jan Maas, and Francesco Pedrotti. “L∞-Optimal Transport of Anisotropic Log-Concave Measures and Exponential Convergence in Fisher’s Infinitesimal Model.” The Annals of Applied Probability. Institute of Mathematical Statistics, 2025. https://doi.org/10.1214/25-aap2162. ieee: K. Khudiakova, J. Maas, and F. Pedrotti, “L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model,” The Annals of Applied Probability, 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. mla: Khudiakova, Kseniia, et al. “L∞-Optimal Transport of Anisotropic Log-Concave Measures and Exponential Convergence in Fisher’s Infinitesimal Model.” The Annals of Applied Probability, vol. 35, no. 3, Institute of Mathematical Statistics, 2025, pp. 1913–40, doi:10.1214/25-aap2162. short: K. Khudiakova, J. Maas, F. Pedrotti, The Annals of Applied Probability 35 (2025) 1913–1940. corr_author: '1' date_created: 2025-07-21T08:13:54Z date_published: 2025-06-01T00:00:00Z date_updated: 2026-10-02T12:20:10Z day: '01' department: - _id: JaMa doi: 10.1214/25-aap2162 external_id: arxiv: - '2402.04151' isi: - '001523520000012' fulldoi: https://doi.org/10.1214/25-aap2162 intvolume: ' 35' isi: 1 issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2402.04151 month: '06' oa: 1 oa_version: Preprint page: 1913-1940 project: - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems - _id: 34d33d68-11ca-11ed-8bc3-ec13763c0ca8 grant_number: '26293' name: The impact of deleterious mutations on small populations publication: The Annals of Applied Probability publication_identifier: issn: - 1050-5164 publication_status: published publisher: Institute of Mathematical Statistics quality_controlled: '1' related_material: record: - id: '17352' relation: earlier_version status: public scopus_import: '1' status: public title: L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 35 year: '2025' ... --- OA_place: repository OA_type: green _id: '22807' abstract: - lang: eng 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.' 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). article_processing_charge: No author: - first_name: Xin full_name: Tong, Xin id: 50F65CDC-AA30-11E9-A72B-8A12E6697425 last_name: Tong - first_name: Yuting I full_name: Li, Yuting I id: ee7a5ca8-8b71-11ed-b662-b3341c05b7eb last_name: Li - first_name: Joséphine full_name: Schelle, Joséphine last_name: Schelle - first_name: Edouard B full_name: Hannezo, Edouard B id: 3A9DB764-F248-11E8-B48F-1D18A9856A87 last_name: Hannezo orcid: 0000-0001-6005-1561 - first_name: Carl-Philipp J full_name: Heisenberg, Carl-Philipp J id: 39427864-F248-11E8-B48F-1D18A9856A87 last_name: Heisenberg orcid: 0000-0002-0912-4566 biorxivid: 1 citation: 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. bioRxiv. doi:10.1101/2025.10.15.682552 apa: Tong, X., Li, Y. I., Schelle, J., Hannezo, E. B., & Heisenberg, C.-P. J. (n.d.). Non-canonical cytokinesis driven by mechanical uncoupling via nematic flows and adhesion-based invagination. bioRxiv. https://doi.org/10.1101/2025.10.15.682552 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.” BioRxiv, n.d. https://doi.org/10.1101/2025.10.15.682552. 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,” bioRxiv. . 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, 10.1101/2025.10.15.682552. mla: Tong, Xin, et al. “Non-Canonical Cytokinesis Driven by Mechanical Uncoupling via Nematic Flows and Adhesion-Based Invagination.” BioRxiv, doi:10.1101/2025.10.15.682552. short: X. Tong, Y.I. Li, J. Schelle, E.B. Hannezo, C.-P.J. Heisenberg, BioRxiv (n.d.). corr_author: '1' date_created: 2026-09-04T12:32:21Z date_published: 2025-10-15T00:00:00Z date_updated: 2026-10-05T08:56:09Z day: '15' department: - _id: EdHa - _id: CaHe doi: 10.1101/2025.10.15.682552 ec_funded: 1 external_id: biorxivid: - 2025.10.15.682552 fulldoi: https://doi.org/10.1101/2025.10.15.682552 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1101/2025.10.15.682552 month: '10' oa: 1 oa_version: Preprint project: - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' - _id: 05943252-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '851288' name: Design Principles of Branching Morphogenesis - _id: 9B861AAC-BA93-11EA-9121-9846C619BF3A name: NOMIS Fellowship Program publication: bioRxiv publication_status: draft related_material: record: - id: '22804' relation: dissertation_contains status: public status: public title: Non-canonical cytokinesis driven by mechanical uncoupling via nematic flows and adhesion-based invagination 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) type: preprint user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '20705' 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. acknowledged_ssus: - _id: M-Shop - _id: ScienComp 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' article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Andrea full_name: Stöllner, Andrea id: 4bdcf7f6-eb97-11eb-a6c2-9981bbdc3bed last_name: Stöllner orcid: 0000-0002-0464-8440 - first_name: Isaac C full_name: Lenton, Isaac C id: a550210f-223c-11ec-8182-e2d45e817efb last_name: Lenton orcid: 0000-0002-5010-6984 - first_name: Artem full_name: Volosniev, Artem id: 37D278BC-F248-11E8-B48F-1D18A9856A87 last_name: Volosniev orcid: 0000-0003-0393-5525 - first_name: James full_name: Millen, James last_name: Millen - first_name: Renjiro full_name: Shibuya, Renjiro last_name: Shibuya - first_name: Hisao full_name: Ishii, Hisao last_name: Ishii - first_name: Dmytro full_name: Rak, Dmytro id: 70313b46-47c2-11ec-9e88-cd79101918fe last_name: Rak - first_name: Zhanybek full_name: Alpichshev, Zhanybek id: 45E67A2A-F248-11E8-B48F-1D18A9856A87 last_name: Alpichshev orcid: 0000-0002-7183-5203 - first_name: Grégory full_name: David, Grégory last_name: David - first_name: Ruth full_name: Signorell, Ruth last_name: Signorell - first_name: Caroline J full_name: Muller, Caroline J id: f978ccb0-3f7f-11eb-b193-b0e2bd13182b last_name: Muller orcid: 0000-0001-5836-5350 - first_name: Scott R full_name: Waitukaitis, Scott R id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87 last_name: Waitukaitis orcid: 0000-0002-2299-3176 citation: 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. Physical Review Letters. 2025;135(21). doi:10.1103/5xd9-4tjj 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. Physical Review Letters. American Physical Society. https://doi.org/10.1103/5xd9-4tjj 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.” Physical Review Letters. American Physical Society, 2025. https://doi.org/10.1103/5xd9-4tjj. ieee: A. Stöllner et al., “Using optical tweezers to simultaneously trap, charge, and measure the charge of a microparticle in air,” Physical Review Letters, vol. 135, no. 21. American Physical Society, 2025. 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. mla: Stöllner, Andrea, et al. “Using Optical Tweezers to Simultaneously Trap, Charge, and Measure the Charge of a Microparticle in Air.” Physical Review Letters, vol. 135, no. 21, 218202, American Physical Society, 2025, doi:10.1103/5xd9-4tjj. 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). corr_author: '1' date_created: 2025-11-30T23:02:07Z date_published: 2025-11-21T00:00:00Z date_updated: 2026-10-09T11:09:09Z day: '21' ddc: - '530' - '550' department: - _id: ZhAl - _id: CaMu - _id: ScWa doi: 10.1103/5xd9-4tjj ec_funded: 1 external_id: arxiv: - '2507.17591' file: - access_level: open_access checksum: a5f76b1230cc7b039ecd0dbd6f99e775 content_type: application/pdf creator: dernst date_created: 2025-12-01T08:19:46Z date_updated: 2025-12-01T08:19:46Z file_id: '20717' file_name: 2025_PhysReviewLetters_Stoellner.pdf file_size: 1761373 relation: main_file success: 1 file_date_updated: 2025-12-01T08:19:46Z fulldoi: https://doi.org/10.1103/5xd9-4tjj has_accepted_license: '1' intvolume: ' 135' issue: '21' language: - iso: eng month: '11' oa: 1 oa_version: Published Version project: - _id: 0aa60e99-070f-11eb-9043-a6de6bdc3afa call_identifier: H2020 grant_number: '949120' name: 'Tribocharge: a multi-scale approach to an enduring problem in physics' - _id: 629205d8-2b32-11ec-9570-e1356ff73576 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 publication: Physical Review Letters publication_identifier: eissn: - 1079-7114 issn: - 0031-9007 publication_status: published publisher: American Physical Society quality_controlled: '1' related_material: link: - description: News on ISTA website relation: press_release url: https://ista.ac.at/en/news/trapping-particles-to-explain-lightning/ record: - id: '23033' relation: dissertation_contains status: public scopus_import: '1' status: public title: Using optical tweezers to simultaneously trap, charge, and measure the charge of a microparticle in air 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) type: journal_article user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd volume: 135 year: '2025' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold PlanS_conform: '1' _id: '20662' abstract: - lang: eng 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. 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' article_processing_charge: Yes article_type: original author: - first_name: Emin full_name: Serin, Emin last_name: Serin - first_name: Kerstin full_name: Ritter, Kerstin last_name: Ritter - first_name: Gunter full_name: Schumann, Gunter last_name: Schumann - first_name: Tobias full_name: Banaschewski, Tobias last_name: Banaschewski - first_name: Andre full_name: Marquand, Andre last_name: Marquand - first_name: Henrik full_name: Walter, Henrik last_name: Walter - first_name: George full_name: Ogoh, George last_name: Ogoh - first_name: Bernd Carsten full_name: Stahl, Bernd Carsten last_name: Stahl - first_name: Ragnhild full_name: Brandlistuen, Ragnhild last_name: Brandlistuen - first_name: Tamara full_name: Schikowski, Tamara last_name: Schikowski - first_name: Allan H. full_name: Young, Allan H. last_name: Young - first_name: Yu full_name: Xinyang, Yu last_name: Xinyang - first_name: Zuo full_name: Zhang, Zuo last_name: Zhang - first_name: Kofoworola full_name: Agunbiade, Kofoworola last_name: Agunbiade - first_name: Di full_name: Chen, Di last_name: Chen - first_name: Sylvane full_name: Desrivières, Sylvane last_name: Desrivières - first_name: Nicholas full_name: Clinton, Nicholas last_name: Clinton - first_name: Paul full_name: Thompson, Paul last_name: Thompson - first_name: Venessa full_name: Köhler, Venessa last_name: Köhler - first_name: Ameli full_name: Schwalber, Ameli last_name: Schwalber - first_name: Vince D. full_name: Calhoun, Vince D. last_name: Calhoun - first_name: Xiao full_name: Chang, Xiao last_name: Chang - first_name: Yanqing full_name: Zhang, Yanqing last_name: Zhang - first_name: Yuzhu full_name: Li, Yuzhu last_name: Li - first_name: Yuxiang full_name: Dai, Yuxiang last_name: Dai - first_name: Jiacan full_name: Yuan, Jiacan last_name: Yuan - first_name: Yunman full_name: Xia, Yunman last_name: Xia - first_name: Tianye full_name: Jia, Tianye last_name: Jia - first_name: Paul full_name: Renner, Paul last_name: Renner - first_name: Sören full_name: Hese, Sören last_name: Hese - first_name: Bernhard full_name: Spanlang, Bernhard last_name: Spanlang - first_name: Charlie full_name: Pearmund, Charlie last_name: Pearmund - first_name: Anastasios Polykarpos full_name: Athanasiadis, Anastasios Polykarpos last_name: Athanasiadis - first_name: Spase full_name: Petkoski, Spase last_name: Petkoski - first_name: Viktor full_name: Jirsa, Viktor last_name: Jirsa - first_name: Karen full_name: Schmitt, Karen last_name: Schmitt - first_name: Johannes H. full_name: Wilbertz, Johannes H. last_name: Wilbertz - first_name: Myrto full_name: Patraskaki, Myrto last_name: Patraskaki - first_name: Peter full_name: Sommer, Peter last_name: Sommer - first_name: Stefanie full_name: Heilmann-Heimbach, Stefanie last_name: Heilmann-Heimbach - first_name: Carina M. full_name: Mathey, Carina M. last_name: Mathey - first_name: Abigail J. full_name: Miller, Abigail J. last_name: Miller - first_name: Isabelle full_name: Claus, Isabelle last_name: Claus - first_name: Markus M. full_name: Nöthen, Markus M. last_name: Nöthen - first_name: Per full_name: Hoffmann, Per last_name: Hoffmann - first_name: Andreas J. full_name: Forstner, Andreas J. last_name: Forstner - first_name: Alvaro full_name: Pastor, Alvaro last_name: Pastor - first_name: Jaime full_name: Gallego, Jaime last_name: Gallego - first_name: Reiya full_name: Itatani, Reiya last_name: Itatani - first_name: Francisco full_name: Eiroa-Orosa, Francisco last_name: Eiroa-Orosa - first_name: Guillem full_name: Feixas, Guillem last_name: Feixas - first_name: Mel full_name: Slater, Mel last_name: Slater - first_name: Gaia full_name: Novarino, Gaia id: 3E57A680-F248-11E8-B48F-1D18A9856A87 last_name: Novarino orcid: 0000-0002-7673-7178 - first_name: Sarah Jane full_name: Böttger, Sarah Jane last_name: Böttger - first_name: Mira full_name: Tschorn, Mira last_name: Tschorn - first_name: Michael full_name: Rapp, Michael last_name: Rapp - first_name: Helga full_name: Ask, Helga last_name: Ask - first_name: Rikka full_name: Kjelkenes, Rikka last_name: Kjelkenes - first_name: Sara full_name: Fernandez, Sara last_name: Fernandez - first_name: Dennis full_name: Van Der Meer, Dennis last_name: Van Der Meer - first_name: Lars T. full_name: Westlye, Lars T. last_name: Westlye - first_name: Ole A. full_name: Andreassen, Ole A. last_name: Andreassen - first_name: Rieke full_name: Aden, Rieke last_name: Aden - first_name: Beke full_name: Seefried, Beke last_name: Seefried - first_name: Frauke full_name: Nees, Frauke last_name: Nees - first_name: Maja full_name: Neidhart, Maja last_name: Neidhart - first_name: Argyris full_name: Stringaris, Argyris last_name: Stringaris - first_name: Emanuel full_name: Schwarz, Emanuel last_name: Schwarz - first_name: Nathalie full_name: Holz, Nathalie last_name: Holz - first_name: Heike full_name: Tost, Heike last_name: Tost - first_name: Andreas full_name: Meyer-Lindenberg, Andreas last_name: Meyer-Lindenberg - first_name: Nina full_name: Christmann, Nina last_name: Christmann - first_name: Karina full_name: Janson, Karina last_name: Janson - first_name: Kerstin full_name: Schepanski, Kerstin last_name: Schepanski - first_name: Tatjana full_name: Schütz, Tatjana last_name: Schütz - first_name: Ulrike Helene full_name: Taron, Ulrike Helene last_name: Taron - first_name: Roland full_name: Eils, Roland last_name: Eils - first_name: Jean Charles full_name: Roy, Jean Charles last_name: Roy - first_name: Tristram A. full_name: Lett, Tristram A. last_name: Lett - first_name: Hedi full_name: Kebir, Hedi last_name: Kebir - first_name: Elli full_name: Polemiti, Elli last_name: Polemiti - first_name: Esther full_name: Hitchen, Esther last_name: Hitchen - first_name: Marcel full_name: Jentsch, Marcel last_name: Jentsch - first_name: Emin full_name: Serin, Emin last_name: Serin - first_name: Antoine full_name: Bernas, Antoine last_name: Bernas - first_name: Nilakshi full_name: Vaidya, Nilakshi last_name: Vaidya - first_name: Sven full_name: Twardziok, Sven last_name: Twardziok - first_name: Markus full_name: Ralser, Markus last_name: Ralser - first_name: Andreas full_name: Heinz, Andreas last_name: Heinz - first_name: Gunter full_name: Schumann, Gunter last_name: Schumann citation: ama: Serin E, Ritter K, Schumann G, et al. Generating synthetic task-based brain fingerprints for population neuroscience using deep learning. Communications Biology. 2025;8. doi:10.1038/s42003-025-09158-6 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. Communications Biology. Springer Nature. https://doi.org/10.1038/s42003-025-09158-6 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.” Communications Biology. Springer Nature, 2025. https://doi.org/10.1038/s42003-025-09158-6. ieee: E. Serin et al., “Generating synthetic task-based brain fingerprints for population neuroscience using deep learning,” Communications Biology, vol. 8. Springer Nature, 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. mla: Serin, Emin, et al. “Generating Synthetic Task-Based Brain Fingerprints for Population Neuroscience Using Deep Learning.” Communications Biology, vol. 8, 1572, Springer Nature, 2025, doi:10.1038/s42003-025-09158-6. 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). date_created: 2025-11-23T23:01:38Z date_published: 2025-12-01T00:00:00Z date_updated: 2026-10-12T11:59:45Z day: '01' ddc: - '570' department: - _id: GaNo doi: 10.1038/s42003-025-09158-6 external_id: isi: - '001614464000001' pmid: - '41238730' file: - access_level: open_access checksum: b8b3c1abe7048a09b920082a37e786a5 content_type: application/pdf creator: dernst date_created: 2025-11-24T09:12:19Z date_updated: 2025-11-24T09:12:19Z file_id: '20675' file_name: 2025_CommunicationsBiology_Serin.pdf file_size: 1588155 relation: main_file success: 1 file_date_updated: 2025-11-24T09:12:19Z fulldoi: https://doi.org/10.1038/s42003-025-09158-6 has_accepted_license: '1' intvolume: ' 8' isi: 1 language: - iso: eng month: '12' oa: 1 oa_version: Published Version pmid: 1 publication: Communications Biology publication_identifier: eissn: - 2399-3642 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - relation: erratum url: https://doi.org/10.1038/s42003-026-10937-y scopus_import: '1' status: public title: Generating synthetic task-based brain fingerprints for population neuroscience using deep learning 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) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2025' ...