@article{19621,
  abstract     = {In this paper we obtain a complete description of all indecomposable characters (central positive-definite functions) of inductive limits of the symmetric groups under block diagonal embedding. As a corollary we obtain the full classification of the isomorphism classes of these inductive limits.},
  author       = {Nessonov, Nikolay and Ngo, Nhok T},
  issn         = {1088-4165},
  journal      = {Representation Theory},
  number       = {8},
  pages        = {256--288},
  publisher    = {American Mathematical Society},
  title        = {{Indecomposable characters of inductive limits of symmetric groups}},
  doi          = {10.1090/ert/689},
  volume       = {29},
  year         = {2025},
}

@phdthesis{19630,
  abstract     = {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.

In 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.

In 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.

Lastly, 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.},
  author       = {Synak, Peter},
  issn         = {2663-337X},
  pages        = {106},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Methods for fluid simulation, surface tracking, and statistics of non-manifold structures}},
  doi          = {10.15479/AT-ISTA-19630},
  year         = {2025},
}

@phdthesis{19684,
  abstract     = {The overarching goal of this thesis is to break down the complexity of turbulent flows in terms of enumerable, coherent structures and patterns. In a five-paper series, we adopt a variety of perspectives and techniques to relate the properties of systems of increasing complexity to their underlying coherent structures. 

Initially, we take a dynamical systems point of view, seeing turbulent flow as a chaotic trajectory bouncing between exact unstable solutions of the underlying equations of motion. Using persistent homology, the main tool of topological data analysis capturing the persistence across scales of topological features in a point cloud, we introduce a method that quantifies visits of turbulent trajectories to unstable time-periodic solutions, also called periodic orbits. We demonstrate this method first in the Rössler and Kuramoto–Sivashinsky systems. Using this method in 3D Kolmogorov flow, we extract a Markov chain from turbulent data, where each node corresponds to the neighbourhood of a periodic orbit. The invariant distribution of this Markov chain reproduces expectation values on turbulent data when it is used to weight averages on the respective periodic orbits.

In more realistic, wall-bounded settings, such as plane-Couette flow (pcf) driven by the relative motion of the walls, or plane-Poiseuille flow (ppf) driven by a pressure gradient, finding exact solutions is difficult. We use dynamic mode decomposition (DMD), a dimensionality reduction method for sequential data, to identify and approximate low-dimensional dynamics without knowing any exact solutions. Most spatially-extended systems are equivariant under translations, and in such cases spatial drifts dominate DMD, hindering its use in the search for and modelling of low-dimensional dynamics. We augment DMD with a symmetry reduction method trained on turbulent data to stop it from seeing translations as a feature, improving its ability to extract dynamical information in translation-equivariant systems. We find segments of turbulent trajectories that linearize well with their symmetry-reduced DMD spectra, akin to dynamics near exact solutions. Searching for harmonics in the spectra gives leads for periodic orbits with spatial drifts, one of which converges to a new solution.

In larger domains, turbulence can localize and coexist with surrounding laminar flow. Our preceding approaches are global, taking all of a domain into account at once, and cannot readily treat each localized patch individually. Working first in a minimal oblique domain that can host a single 1D-localized turbulent patch, we find that turbulence in ppf is connected to a stable periodic orbit at a flow velocity much lower than when turbulence is first onset. We show that, well in advance of sustained turbulence, chaos sets in explosively, and for long time horizons, time series are consistent with that of a random process.

Finally, in much larger domains, we study and compare 2D-localized turbulence that appears as large-scale inclined structures, called stripes, in ppf and pcf. While appearing similar, we find that stripes in these two settings differ significantly in terms of how they sustain themselves, and in higher velocities, how they proliferate.},
  author       = {Yalniz, Gökhan},
  issn         = {2663-337X},
  pages        = {155},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Transition to turbulence : Data-, solution-, and pattern-driven approaches}},
  doi          = {10.15479/AT-ISTA-19684},
  year         = {2025},
}

@article{19702,
  abstract     = {Moran Birth-death process is a standard stochastic process that is used to model natural selection in spatially structured populations. A newly occurring mutation that invades a population of residents can either fixate on the whole population or it can go extinct due to random drift. The duration of the process depends not only on the total population size n, but also on the spatial structure of the population. In this work, we consider the Moran process with a single type of individuals who invade and colonize an otherwise empty environment. Mathematically, this corresponds to the setting where the residents have zero reproduction rate, thus they never reproduce. The spatial structure is represented by a graph. We present two main contributions. First, in contrast to the Moran process in which residents do reproduce, we show that the colonization time is always at most a polynomial function of the population size n. Namely, we show that colonization always takes at most 1/2n^3 - 1/2n^2 expected steps, and for each n, we identify the slowest graph where it takes exactly that many steps. Moreover, we establish a stronger bound of roughly n^2.5 steps for undirected graphs and an even stronger bound of roughly n^2 steps for so-called regular graphs. Second, we discuss various complications that one faces when attempting to measure fixation times and colonization times in spatially structured populations, and we propose to measure the real duration of the process, rather than counting the steps of the classic Moran process.},
  author       = {Kopfová, Lenka and Tkadlec, Josef},
  issn         = {1553-7358},
  journal      = {PLoS computational biology},
  number       = {5},
  pages        = {e1012868},
  publisher    = {Public Library of Science},
  title        = {{Colonization times in Moran process on graphs}},
  doi          = {10.1371/journal.pcbi.1012868},
  volume       = {21},
  year         = {2025},
}

@article{19704,
  abstract     = {The information-processing capability of the brain’s cellular network depends on the physical wiring pattern between neurons and their molecular and functional characteristics. Mapping neurons and resolving their individual synaptic connections can be achieved by volumetric imaging at nanoscale resolution1,2 with dense cellular labelling. Light microscopy is uniquely positioned to visualize specific molecules, but dense, synapse-level circuit reconstruction by light microscopy has been out of reach, owing to limitations in resolution, contrast and volumetric imaging capability. Here we describe light-microscopy-based connectomics (LICONN). We integrated specifically engineered hydrogel embedding and expansion with comprehensive deep-learning-based segmentation and analysis of connectivity, thereby directly incorporating molecular information into synapse-level reconstructions of brain tissue. LICONN will allow synapse-level phenotyping of brain tissue in biological experiments in a readily adoptable manner.},
  author       = {Tavakoli, Mojtaba and Lyudchik, Julia and Januszewski, Michał and Vistunou, Vitali and Agudelo Duenas, Nathalie and Vorlaufer, Jakob and Sommer, Christoph M and Kreuzinger, Caroline and Oliveira, Bárbara and Cenameri, Alban and Novarino, Gaia and Jain, Viren and Danzl, Johann G},
  issn         = {1476-4687},
  journal      = {Nature},
  pages        = {398--410},
  publisher    = {Springer Nature},
  title        = {{Light-microscopy-based connectomic reconstruction of mammalian brain tissue}},
  doi          = {10.1038/s41586-025-08985-1},
  volume       = {642},
  year         = {2025},
}

@inproceedings{19738,
  abstract     = {Garbling is a fundamental cryptographic primitive, with numerous theoretical and practical applications. Since the first construction by Yao (FOCS’82, ’86), a line of work has concerned itself with reducing the communication and computational complexity of that construction. One of the most efficient garbling schemes presently is the ‘Half Gates’ scheme by Zahur, Rosulek, and Evans (Eurocrypt’15). Despite its widespread adoption, the provable security of this scheme has been based on assumptions whose only instantiations are in idealized models. For example, in their original paper, Zahur, Rosulek, and Evans showed that hash functions satisfying a notion called circular correlation robustness (CCR) suffice for this task, and then proved that CCR secure hash functions can be instantiated in the random permutation model.
In this work, we show how to securely instantiate the Half Gates scheme in the standard model. To this end, we first show how this scheme can be securely instantiated given a (family of) weak CCR hash function, a notion that we introduce. Furthermore, we show how a weak CCR hash function can be used to securely instantiate other efficient garbling schemes, namely the ones by Rosulek and Roy (Crypto’21) and Heath (Eurocrypt’24). Thus we believe this notion to be of independent interest.
Finally, we construct such weak CCR hash functions using indistinguishability obfuscation and one-way functions. The security proof of this construction constitutes our main technical contribution. While our construction is not practical, it serves as a proof of concept supporting the soundness of these garbling schemes, which we regard to be particularly important given the recent initiative by NIST to standardize garbling, and the optimizations in Half Gates being potentially adopted.},
  author       = {Acharya, Anasuya and Azari, Karen and Baig, Mirza Ahad and Hofheinz, Dennis and Kamath, Chethan},
  booktitle    = {28th IACR International Conference on Practice and Theory of Public-Key Cryptography},
  isbn         = {9783031918285},
  issn         = {1611-3349},
  location     = {Roros, Norway},
  pages        = {37--75},
  publisher    = {Springer Nature},
  title        = {{Securely instantiating ‘Half Gates’ garbling in the standard model}},
  doi          = {10.1007/978-3-031-91829-2_2},
  volume       = {15677},
  year         = {2025},
}

@phdthesis{19759,
  abstract     = {Despite generating remarkable results in various computer vision tasks, deep learning comes
with some surprising shortcomings. For example, tiny perturbations, often imperceptible to
the human eye, can completely change the predictions of image classifiers. Despite a decade
of research, the field has made limited progress in developing image classifiers that are both
accurate and robust. This thesis aims to address this gap.
As our first contribution, we aim to simplify the process of training certifiably robust image
classifiers. We do this by designing a convolutional layer that does not require executing an
iterative procedure in every forward pass, but relies on an explicit bound instead. We also
propose a loss function that allows optimizing for a particular margin more precisely.
Next, we provide an overview and comparison of various methods that create robust image
classifiers by constraining the Lipschitz constant. This is important since generally longer
training times and more parameters improve the performance of robust classifiers, making it
challenging to determine the most practical and effective methods from existing literature.
In 1-Lipschitz classification, the performance of current methods is still much worse than what
we expect on the simple tasks we consider. Therefore, we next investigate potential causes of
this shortcoming. We first consider the role of the activation function. We prove a theoretical
shortcoming of the commonly used activation function, and provide an alternative without it.
However this theoretical improvement does barely translate to the empirical performance of
robust classifiers, suggesting a different bottleneck.
Therefore, in the final chapter, we study how the performance depends on the amount of
training data. We prove that in the worst case, we might require far more data to train a
robust classifier compared to a normal one. We furthermore find that the amount of training
data is a key determinant of the performance current methods achieve on popular datasets.
Additionally, we show that linear subspaces exist with tiny data variance, and yet we can
still train very accurate classifiers after projecting into those subspaces. This shows that on
the datasets considered, enforcing robustness in classification makes the task strictly more
challenging.

-----------------“In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not endorse any of [name of university or educational entity]’s products or services. Internal or personal use of this material is permitted. If interested in reprinting/republishing IEEE copyrighted material for advertising or promotional purposes or for creating new collective works for resale or redistribution, please go to http://www.ieee.org/publications_standards/publications/rights/rights_link.html to learn how to obtain a License from RightsLink. If applicable, University Microfilms and/or ProQuest Library, or the Archives of Canada may supply single copies of the dissertation.”
},
  author       = {Prach, Bernd},
  issn         = {2663-337X},
  pages        = {84},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Robust image classification with 1-Lipschitz networks}},
  doi          = {10.15479/10.15479/at-ista-19759},
  year         = {2025},
}

@inproceedings{19778,
  abstract     = {A verifiable delay function VDF(x, T)->(y, π) maps an input x and time parameter T to an output y together with an efficiently verifiable proof π certifying that y was correctly computed. The function runs in T sequential steps, and it should not be possible to compute y much faster than that. The only known practical VDFs use sequential squaring in groups of unknown order as the sequential function, i.e., y = x^2^T. There are two constructions for the proof of exponentiation (PoE) certifying that y = x^2^T, with Wesolowski (Eurocrypt’19) having very short proofs, but they are more expensive to compute and the soundness relies on stronger assumptions than the PoE proposed by Pietrzak (ITCS’19).
A recent application of VDFs by Arun, Bonneau and Clark (Asiacrypt’22) are short-lived proofs and signatures, which are proofs and signatures that are only sound for some time t, but after that can be forged by anyone. For this they rely on “watermarkable VDFs”, where the proof embeds a prover chosen watermark. To achieve stronger notions of proofs/signatures with reusable forgeability, they rely on “zero-knowledge VDFs”, where instead of the output y, one just proves knowledge of this output. The existing proposals for watermarkable and zero-knowledge VDFs all build on Wesolowski’s PoE, for the watermarkable VDFs there’s currently no security proof.

In this work we give the first constructions that transform any PoEs in hidden order groups into watermarkable VDFs and into zkVDFs, solving an open question by Arun et al. Unlike our watermarkable VDF, the zkVDF (required for reusable forgeability) is not very practical as the number of group elements in the proof is a security parameter. To address this, we introduce the notion of zero-knowledge proofs of sequential work (zkPoSW), a notion that relaxes zkVDFs by not requiring that the output is unique. We show that zkPoSW are sufficient to construct proofs or signatures with reusable forgeability, and construct efficient zkPoSW from any PoE, ultimately achieving short lived proofs and signatures that improve upon Arun et al.’s construction in several dimensions (faster forging times, arguably weaker assumptions).
A key idea underlying our constructions is to not directly construct a (watermarked or zk) proof for y = x^2^T, but instead give a (watermarked or zk) proof for the more basic statement that 
x^l, y^l satisfy x^l = x ^r, y^l = y^r for some r, together with a normal PoE for y^l = (x^l)^2^T.},
  author       = {Hoffmann, Charlotte and Pietrzak, Krzysztof Z},
  booktitle    = {28th IACR International Conference on Practice and Theory of Public-Key Cryptography},
  isbn         = {9783031918193},
  issn         = {1611-3349},
  location     = {Roros, Norway},
  pages        = {36--66},
  publisher    = {Springer Nature},
  title        = {{Watermarkable and zero-knowledge Verifiable Delay Functions from any proof of exponentiation}},
  doi          = {10.1007/978-3-031-91820-9_2},
  volume       = {15674},
  year         = {2025},
}

@article{19795,
  abstract     = {Super-resolution microscopy often entails long acquisition times of minutes to hours. Since drifts during the acquisition adversely affect data quality, active sample stabilization is commonly used for some of these techniques to reach their full potential. Although drifts in the lateral plane can often be corrected after acquisition, this is not always possible or may come with drawbacks. Therefore, it is appealing to stabilize sample position in three dimensions (3D) during acquisition. Various schemes for active sample stabilization have been demonstrated previously, with some reaching sub-nanometer stability in 3D. Here, we present a scheme for active drift correction that delivers the nanometer-scale 3D stability demanded by state-of-the-art super-resolution techniques and is straightforward to implement compared to previous schemes capable of reaching this level of stabilization precision. Using a refined algorithm that can handle various types of reference structure, without sparse signal peaks being mandatory, we stabilized sample position to ∼1 nm in 3D using objective lenses both with high and low numerical aperture. Our implementation requires only the addition of a simple widefield imaging path and we provide an open-source control software with graphical user interface to facilitate easy adoption of the module. Finally, we demonstrate how this has the potential to enhance data collection for diffraction-limited and super-resolution imaging techniques using single-molecule localization microscopy and cryo-confocal imaging as showcases.},
  author       = {Vorlaufer, Jakob and Semenov, Nikolai and Kreuzinger, Caroline and Javoor, Manjunath and Zens, Bettina and Agudelo Duenas, Nathalie and Tavakoli, Mojtaba and Suplata, Marek and Jahr, Wiebke and Lyudchik, Julia and Wartak, Andreas and Schur, Florian Km and Danzl, Johann G},
  issn         = {2667-0747},
  journal      = {Biophysical Reports},
  number       = {2},
  publisher    = {Elsevier},
  title        = {{Image-based 3D active sample stabilization on the nanometer scale for optical microscopy}},
  doi          = {10.1016/j.bpr.2025.100211},
  volume       = {5},
  year         = {2025},
}

@article{19852,
  abstract     = {Technology involving hybrid superconductor–semiconductor materials is a promising avenue for engineering quantum devices for information storage, manipulation, and transmission. Proximity-induced superconducting correlations are an essential part of such devices. While the proximity effect in the conduction band of common semiconductors is well understood, its manifestation in confined hole gases, realized for instance in germanium, is an active area of research. Lower-dimensional hole-based systems, particularly in germanium, are emerging as an attractive platform for a variety of solid-state quantum devices, due to their combination of efficient spin and charge control and long coherence times. The recent experimental realization of the proximity effect in germanium thus calls for a theoretical description that is tailored to hole gases. In this work, we propose a simple model to describe proximity-induced superconductivity in two-dimensional hole gases, incorporating both the heavy-hole (HH) and light-hole (LH) bands. We start from the Luttinger–Kohn model, introduce three parameters that characterize hopping across the superconductor–semiconductor interface, and derive explicit intraband and interband effective pairing terms for the HH and LH bands. Unlike previous approaches, our theory provides a quantitative relationship between induced pairings and interface properties. Restricting our general model to an experimentally relevant case where only the HH band crosses the chemical potential, we predict the coexistence of 𝑠-wave and 𝑑-wave singlet pairings, along with triplet-type pairings, and modified Zeeman and Rashba spin–orbit couplings. Our results thus present a starting point for theoretical modeling of quantum devices based on proximitized hole gases, fueling further progress in quantum technology.},
  author       = {Babkin, Serafim and Joecker, Benjamin and Flensberg, Karsten and Serbyn, Maksym and Danon, Jeroen},
  issn         = {2469-9969},
  journal      = {Physical Review B},
  number       = {21},
  publisher    = {American Physical Society},
  title        = {{Superconducting proximity effect in two-dimensional hole gases}},
  doi          = {10.1103/k4jh-pnxy},
  volume       = {111},
  year         = {2025},
}

@phdthesis{19853,
  abstract     = {The internal dynamical properties of red giant stars have been explored extensively in recent
years as a result of the increase in high precision data availability from the space missions
Kepler and TESS (Transiting Exoplanet Survey Satellite), and in this exploration, it has been
discovered that some of these stars are not behaving as expected. Red giants are stars that have
evolved off of the main sequence after having completed fusing hydrogen into helium in their
core. Observational data shows that the cores are rotating significantly slower than models can
recreate consistently across evolutionary stages. This discrepancy has prompted investigation
into the efficiency of angular momentum transport mechanisms and mixing processes including
meridional circulation, shear instability, internal gravity waves, Tayler-Spruit dynamo, fossil
magnetic fields etc., to explain this behavior.
Analyzing seismic oscillations in stars, via asteroseismology, is a powerful tool as it is the only
way in which the deep stellar interior can be probed and subsequently characterized; this is
possible as global oscillations modulating the stellar surface are effected by internal processes.
For red giants, p-modes (pressure modes; resonating through the entire star) and g-modes
(gravity-modes; resonating in the radiative interior) couple to create mixed modes. These
mixed modes give access to the otherwise hidden stellar interior as g-modes couple to p-modes,
delivering information from the interior to the surface.
Internal magnetic signatures have been observationally confirmed in red giant stars via
asteroseismology and characterized in two ways. One being that dipole mixed modes with
ℓ = 1 will display a global asymmetric frequency shift of its azimuthal components; where
the m = 0 and m = ±1 components of the ℓ = 1 dipole mode will be shifted by two
different power laws, respectively. And the other being a reduced visibility of dipole mixed
mode amplitudes in the power spectra, where stars presenting with this feature are denoted as
suppressed.
Several studies of the suppressed dipole mixed mode amplitudes have been carried out, but thus
far, no dedicated studies of the asymmetric frequency shifts of suppressed red giants have been
conducted; one reason being that the asymmetric frequency shifts cannot be characterized
when the dipole mixed mode amplitudes are severely reduced in many of the suppressed stars.
Sincefullysuppressedstarsdonothavedetectablemixed-modestoevaluate, partiallysuppressed
stars, that is, red giant stars presenting with suppressed dipole mixed modes in select parts of
their power spectra rather than across the entire spectra, will be the subject of this study as
the respective mode amplitudes are still visible at high frequencies.
As such, this study will search for asymmetric frequency shifts on the dipole mixed
modes of partially suppressed red giant stars; the aim here is to investigate if both
mode suppression and magnetic shifting of dipole mixed modes occur simultaneously.
Thisstudywillbeconductedbycreatingapipelinetoestimatepriorsofasteroseismicparameters,
use the priors to model the power spectra with the stellar modeling code sloscillations_ISTA,
and perform a Bayesian fit of the parameters with the simulated data on the star KIC 6975038,
a target with partially suppressed dipolar mode amplitudes identified in the literature, to fit its
magnetic parameters. I present a novel method to model the stellar power spectra of
partially suppressed red giants by application of a sigmoid profile to the ℓ= 1 dipolar
mode component of the spectra. With the results of this study I aim at constraining
the cause of this partial dipole mode amplitude suppression, allowing for more detailed
studies regarding their astrophysical nature. Furthermore, the long term hope for the method
used in this study will be to expand the sample of partially suppressed red giants and fit their
asteroseismic parameters accordingly.},
  author       = {Smith, Kanah},
  issn         = {2791-4585},
  keywords     = {asteroseismology, stellar physics, red giant, magnetism, suppressed},
  pages        = {38},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Exploring internal magnetism in partially suppressed red giant stars}},
  doi          = {10.15479/AT-ISTA-19853},
  year         = {2025},
}

@misc{19885,
  abstract     = {This .zip file contains the data to reproduce the figures and supplementary figures of "Automated All-RF Tuning for Spin Qubit Readout and Control" by Cornelius Carlsson and Jaime Saez-Mollejo et al.},
  author       = {Saez Mollejo, Jaime},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Automated All-RF Tuning for Spin Qubit Readout and Control}},
  doi          = {10.15479/AT:ISTA:19885},
  year         = {2025},
}

@phdthesis{19903,
  abstract     = {Cooperation, that is, one person paying a cost for another's benefit, is a fundamental principle without which no form of society could exist. The extent to which humans cooperate with each other is also an essential feature that differentiates them from other animals. Cooperation occurs even in the absence of altruistic motivations, when it is selfishly incentivised by the expectation of a future reward. For example, many economic interactions are well described that way. This kind of cooperation requires that people exhibit reciprocal behaviour that acts as a mechanism that rewards cooperation.
With game-theoretic models, it is possible to formally study potential such mechanisms and under what conditions they can exist. This thesis contributes to this effort by analysing recently introduced models of cooperation that advance on previous work by taking into account the potential for pre-existing inequality among cooperating individuals as well as the different forms that reciprocity can take.
Individuals may differ both intrinsically, in their abilities, as well as extrinsically, in the amount of resources they have available. Allowing for such differences in a model of cooperation helps to understand how inequality affects the potential for, and outcomes of, cooperation among unequals. In this thesis, it is shown that in the presence of intrinsic inequality, a similar unequal distribution of resources can increase the potential for cooperation. This effect is stronger the smaller the group is in which cooperation takes place. It is also shown that under particular assumptions, if the unequal members of a group vary the size of their contributions to a cooperative effort over time, they can thereby increase their efficiency and improve the collective outcome.
Cooperative behaviour in a two-person interaction can be rewarded either by direct reciprocation whenever the same two people interact again, or indirectly by a third party who observed the interaction. In the latter case of indirect reciprocity, individuals are proximally rewarded by a good reputation, which ultimately translates to being rewarded with cooperative behaviour by others. This mechanism can enable selfishly motivated cooperation even in circumstances where individuals are unlikely to meet again, akin to how money facilitates trade. While these two forms of reciprocity have mostly been studied in isolation, this thesis analyses both direct and indirect reciprocity in a general model in order to compare their relative effectiveness under different circumstances. The contribution of this thesis is an extension of previous work regarding a specific kind of interaction, whose parameters allow for convenient mathematical analysis, to the most general set of possible interactions.},
  author       = {Hübner, Valentin},
  issn         = {2663-337X},
  pages        = {157},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Reciprocity and inequality in social dilemmas}},
  doi          = {10.15479/AT-ISTA-19903},
  year         = {2025},
}

@phdthesis{20074,
  abstract     = {Prenatal immune challenges pose significant risks to human embryonic brain and eye development. However, we still lack knowledge about the safe usage of anti-inflammatory drugs during pregnancy. Human induced pluripotent stem cell (hIPSC)-derived brain organoid models provide a unique opportunity to investigate neuronal development and have started to explore functional consequences upon viral infection. However, brain organoids usually lack microglia, the brain-resident immune cells. They are present in the early human embryonic brain and actively participate in neuronal circuit development. At the same time, microglia are known for their immune-sensing properties and will influence viral-mediated effects. In my thesis, I was interested to study the multifunctional role of human microglia during retinal development. 
In chapter 1, I characterize the innate occurrence of IBA1+-microglia-like cells within the retinal organoid differentiation (Bartalska et al., 2022). Therefore, we differentiate hIPSC using an unguided retinal organoid differentiation protocol and observe the presence of IBA1+-microglia-like cells alongside retinal cups between week 3 and 4 in 2.5D culture. However, instead of infiltrating the neuroectodermal sides, they enrich within non-pigmented, 3D-cystic compartments that develop in low numbers parallel to 3D-retinal organoids. To enrich for IBA1+-microglia precursors (preMG), we guided the differentiation with a low-dosed BMP4 application, which prevents retinal cup development and enhances microglia and 3D-cysts formation. We characterize the differentiated preMG for their microglia-like identity and validated their functionality. In parallel, mass spectrometry identifies the 3D-cysts to express mesenchymal and epithelial markers. We confirm that comparable 3D-cysts are also the preferential environment for IBA1+-microglia-like cells within the unguided retinal organoid differentiation. 
In chapter 2, I investigate how microglia influence retinal development and whether they contribute to viral-mediated consequences (Schmied et al., 2025). Here, we assemble preMG, which we have characterized in chapter 1, into 3D-retinal organoids. Once the outer plexiform layer forms, microglia-like cells (iMG) populate them and interact with retinal cell types. However, at this developmental stage, the ganglion cell number decreases in 3D-retinal organoids. Thus, we adapted the model into 2D which promotes their survival. Integrated iMG engulf ganglion cells and control their cell number. In parallel, we apply the immunostimulant POLY(I:C) to mimic a fetal viral infection. Although POLY(I:C) stimulation affects iMG phenotype, it does not influence their interaction with ganglion cells. Furthermore, iMG presence significantly contributes to the supernatant’s inflammatory secretome and increases retinal cell proliferation. Simultaneous exposure to the non-steroidal anti-inflammatory drug (NSAID) ibuprofen dampens POLY(I:C)-mediated consequences of the iMG phenotype and ameliorates cell proliferation. Remarkably, while POLY(I:C) disrupts neuronal calcium dynamics independent of iMG presence, ibuprofen rescues this effect only in the presence of iMG. Mechanistically, ibuprofen blocks the enzymes cyclooxygenase 1 and 2 (COX1/ PTGS1 and COX2/ PTGS2) simultaneously, from which iMG predominantly express COX1. Selective inhibition of COX1 does not restore the calcium peak amplitude upon POLY(I:C) stimulation, indicating ibuprofen’s effect depends on the presence and interplay of both, COX1 and COX2. 
In summary, we characterized the 3D-retinal organoid model for the occurrence of IBA1+-microglia like cells. As the innately developing IBA1+-cells enrich in mesenchymal over retinal structures, we optimized a protocol to differentiate IBA1+-microglia precursors. By combining these two models we generate microglia-assembled retinal organoids. Our results underscore the importance of microglia during neurodevelopment, in the context of prenatal immune challenges and provide insight into the mechanisms by which ibuprofen exerts its protective effects during embryonic development.},
  author       = {Hübschmann, Verena},
  isbn         = {978-3-99078-060-2},
  issn         = {2663-337X},
  pages        = {151},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{ Human microglia impact neuronal development in retinal organoids}},
  doi          = {10.15479/AT-ISTA-20074},
  year         = {2025},
}

@article{20101,
  abstract     = {Evading imminent threat from predators is critical for animal survival. Effective defensive strategies can vary, even between closely related species. However, the neural basis of such species-specific behaviours remains poorly understood1,2,3,4. Here we find that two sister species of deer mice (genus Peromyscus)5 show different responses to the same looming stimulus: Peromyscus maniculatus, which occupies densely vegetated habitats, predominantly escapes, whereas the open field specialist, Peromyscus polionotus, briefly freezes. This difference arises from species-specific escape thresholds, is largely context-independent, and can be triggered by both visual and auditory threat stimuli. Using immunohistochemistry and electrophysiological recordings, we find that although visual threat activates the superior colliculus in both species, the role of the dorsal periaqueductal grey (dPAG) in driving behaviour differs. Whereas dPAG activity scales with running speed in P. maniculatus, neural activity in the dPAG of P. polionotus correlates poorly with movement, including during visually triggered escape. Moreover, optogenetic activation of dPAG neurons elicits acceleration in P. maniculatus but not in P. polionotus, and their chemogenetic inhibition during a looming stimulus delays escape onset in P. maniculatus to match that of P. polionotus. Together, we trace species-specific escape thresholds to a central circuit node, downstream of peripheral sensory neurons, localizing an ecologically relevant behavioural difference to a specific region of the mammalian brain.},
  author       = {Baier, Felix and Reinhard, Katja and Nuttin, Bram and Sans-Dublanc, Arnau and Liu, Chen and Tong, Victoria and Murmann, Julie Stefanie and Wierda, Keimpe and Farrow, Karl and Hoekstra, Hopi E.},
  issn         = {1476-4687},
  journal      = {Nature},
  pages        = {439--447},
  publisher    = {Springer Nature},
  title        = {{The neural basis of species-specific defensive behaviour in Peromyscus mice}},
  doi          = {10.1038/s41586-025-09241-2},
  volume       = {645},
  year         = {2025},
}

@phdthesis{20117,
  author       = {Wang, Yiqun},
  issn         = {2663-337X},
  pages        = {108},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{The role of dynamin related protein 2A in cytokinin regulated plant growth and development}},
  doi          = {10.15479/AT-ISTA-20117},
  year         = {2025},
}

@phdthesis{20138,
  abstract     = {The evolution shapes the world around us.
Not only in biology, where the fittest individuals spread their genes but also in physics and social dynamics, the evolutionary forces determine the development of a state of matter or public opinions.
Many models describe these dynamics.
This thesis examines the role of the structure in the models of selection.
The population structure is represented as a graph or a network, and each vertex is occupied by one individual.
Every individual has a type and fitness that represents the reproductive potential and depends on the type, occupied vertex, and the arrangement of the neighbors.
The evolution is modeled in discrete steps; in one step, one individual is replaced by a neighbor selected randomly with the influence of fitness.



The role of the networks is widely examined in the literature.
The structures that promote the spread of the desired type compared to the structureless case are called amplifiers.
The existence of amplifiers in various settings is an intensively studied topic, and in some settings, the amplifiers have been identified.
Moreover, there are other important questions about the number of steps until one type spreads over the whole network (fixation time), the computational complexity, and the questions about the robustness of these processes.


This thesis explores the role of structure in evolution from many perspectives.
First, it introduces different models and various choices that can be made in the models of evolution.
It highlights the role of the structure in the real world and how this is reflected in these models.
Then, it describes the previous results and open problems.
Second, the thesis describes an amplifier for two variants of the Moran process: one with a constant birth rate and the other with a constant death rate.
This is an important contribution to the robustness of the amplification.
Third, the thesis determines the complexity of spatial games.
These are processes where the fitness comes from a game, and the strength of selection is high.
It shows that determining the fate of cooperation in these games is a PSPACE-complete problem.
Fourth, the thesis describes the amplifier of cooperation for spatial games.
This is the first amplifier in this setting.
Fifth, the thesis examines the coexistence in the Moran process with environmental heterogeneity.
In this setting, the fitness depends not only on the type of the individual but also on the occupied vertex.
The chapter determines the relationship between the interactions of vertices of different types and the coexistence time.
Sixth, the thesis examines the social balance on networks and proposes a stochastic dynamic partially aware of the state of the graph, which reaches a balanced position quickly.
Finally, the thesis presents conclusions and outlines the directions for future work.


},
  author       = {Svoboda, Jakub},
  issn         = {2663-337X},
  pages        = {167},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Structural properties of games on graphs}},
  doi          = {10.15479/AT-ISTA-20138},
  year         = {2025},
}

@phdthesis{20147,
  abstract     = {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.

In 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.

-------------------------------------------------------------------------------------------------------------------------------------------------------------- In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not
endorse any of ISTA's products or services. Internal or personal use of this
material is permitted. If interested in reprinting/republishing IEEE copyrighted material for advertising or promotional
purposes or for creating new collective works for resale or redistribution, please go to
http://www.ieee.org/publications_standards/publications/rights/rights_link.html to learn how to obtain a License from
RightsLink.
},
  author       = {Sarac, Naci E},
  issn         = {2663-337X},
  pages        = {149},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{A monitoring-oriented theory and classification of quantitative specifications}},
  doi          = {10.15479/AT-ISTA-20147},
  year         = {2025},
}

@phdthesis{20149,
  abstract     = {Immune responses depend on the coordinated and efficient migration of leukocytes. These
cells, which are embedded and tightly confined within tissues, must navigate and traverse
diverse and complex three-dimensional environments. Leukocytes adapt their locomotory
behavior to the mechanical, geometrical, and biochemical characteristics of their
surroundings. In low-density environments, where the pore size of the interstitial matrix
allows free passage, these cells position the nucleus directly behind the lamellipodium, the
protrusive actin structure that forms the leading front of the cell. In this configuration, they
use the nucleus as a gauge to identify the path of least resistance.
Here, we show that in high-density environments, where the pore size precludes free passage
of the cell body, leukocytes reposition the microtubule-organizing center (MTOC) and
associated organelles in front of the nucleus. In this configuration, they use actin structures
protruding orthogonally to the direction of migration in order to open a path for the cell body.
We identify two distinct actin populations that serve this purpose at different subcellular
localizations. At the leading edge, local indentation of the plasma membrane leads to
recruitment of the Wiskott-Aldrich syndrome protein (WASp), which, via Arp2/3, results in
the formation of individual actin foci. At the cell body, actin polymerization is triggered by
DOCK8, a Cdc42 exchange factor, resulting in the formation of a central actin pool.
We demonstrate that the central and peripheral actin pools are functionally communicating
and that depletion of the central actin pool leads to increased actin accumulation at the cell
front, resulting in excessive extension of the leading edge.},
  author       = {Dos Reis Rodrigues, Patricia},
  issn         = {2663-337X},
  pages        = {114},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Coordination of protrusive forces in immune cell migration }},
  doi          = {10.15479/AT-ISTA-20149},
  year         = {2025},
}

@phdthesis{20167,
  author       = {Schön, Hanna},
  isbn         = {978-3-99078-061-9},
  issn         = {2663-337X},
  pages        = {171},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{The ER complex SUTU-7/MACO-1 regulates the fate of mRNAs encoding GPCRs}},
  doi          = {10.15479/AT-ISTA-20167},
  year         = {2025},
}

