TY - CONF AB - This paper demonstrates how to discover the whole causal graph from the second derivative of the log-likelihood in observational non-linear additive Gaussian noise models. Leveraging scalable machine learning approaches to approximate the score function ∇logp(X), we extend the work of Rolland et al. (2022) that only recovers the topological order from the score and requires an expensive pruning step removing spurious edges among those admitted by the ordering. Our analysis leads to DAS (acronym for Discovery At Scale), a practical algorithm that reduces the complexity of the pruning by a factor proportional to the graph size. In practice, DAS achieves competitive accuracy with current state-of-the-art while being over an order of magnitude faster. Overall, our approach enables principled and scalable causal discovery, significantly lowering the compute bar. AU - Montagna, Francesco AU - Noceti, Nicoletta AU - Rosasco, Lorenzo AU - Zhang, Kun AU - Locatello, Francesco ID - 14212 T2 - 2nd Conference on Causal Learning and Reasoning TI - Scalable causal discovery with score matching ER - TY - CONF AB - Recent years have seen a surge of interest in learning high-level causal representations from low-level image pairs under interventions. Yet, existing efforts are largely limited to simple synthetic settings that are far away from real-world problems. In this paper, we present Causal Triplet, a causal representation learning benchmark featuring not only visually more complex scenes, but also two crucial desiderata commonly overlooked in previous works: (i) an actionable counterfactual setting, where only certain object-level variables allow for counterfactual observations whereas others do not; (ii) an interventional downstream task with an emphasis on out-of-distribution robustness from the independent causal mechanisms principle. Through extensive experiments, we find that models built with the knowledge of disentangled or object-centric representations significantly outperform their distributed counterparts. However, recent causal representation learning methods still struggle to identify such latent structures, indicating substantial challenges and opportunities for future work. AU - Liu, Yuejiang AU - Alahi, Alexandre AU - Russell, Chris AU - Horn, Max AU - Zietlow, Dominik AU - Schölkopf, Bernhard AU - Locatello, Francesco ID - 14214 T2 - 2nd Conference on Causal Learning and Reasoning TI - Causal triplet: An open challenge for intervention-centric causal representation learning ER - TY - CONF AB - Neural networks embed the geometric structure of a data manifold lying in a high-dimensional space into latent representations. Ideally, the distribution of the data points in the latent space should depend only on the task, the data, the loss, and other architecture-specific constraints. However, factors such as the random weights initialization, training hyperparameters, or other sources of randomness in the training phase may induce incoherent latent spaces that hinder any form of reuse. Nevertheless, we empirically observe that, under the same data and modeling choices, the angles between the encodings within distinct latent spaces do not change. In this work, we propose the latent similarity between each sample and a fixed set of anchors as an alternative data representation, demonstrating that it can enforce the desired invariances without any additional training. We show how neural architectures can leverage these relative representations to guarantee, in practice, invariance to latent isometries and rescalings, effectively enabling latent space communication: from zero-shot model stitching to latent space comparison between diverse settings. We extensively validate the generalization capability of our approach on different datasets, spanning various modalities (images, text, graphs), tasks (e.g., classification, reconstruction) and architectures (e.g., CNNs, GCNs, transformers). AU - Moschella, Luca AU - Maiorca, Valentino AU - Fumero, Marco AU - Norelli, Antonio AU - Locatello, Francesco AU - Rodolà, Emanuele ID - 14217 T2 - The 11th International Conference on Learning Representations TI - Relative representations enable zero-shot latent space communication ER - TY - CONF AB - Learning generative object models from unlabelled videos is a long standing problem and required for causal scene modeling. We decompose this problem into three easier subtasks, and provide candidate solutions for each of them. Inspired by the Common Fate Principle of Gestalt Psychology, we first extract (noisy) masks of moving objects via unsupervised motion segmentation. Second, generative models are trained on the masks of the background and the moving objects, respectively. Third, background and foreground models are combined in a conditional "dead leaves" scene model to sample novel scene configurations where occlusions and depth layering arise naturally. To evaluate the individual stages, we introduce the Fishbowl dataset positioned between complex real-world scenes and common object-centric benchmarks of simplistic objects. We show that our approach allows learning generative models that generalize beyond the occlusions present in the input videos, and represent scenes in a modular fashion that allows sampling plausible scenes outside the training distribution by permitting, for instance, object numbers or densities not observed in the training set. AU - Tangemann, Matthias AU - Schneider, Steffen AU - Kügelgen, Julius von AU - Locatello, Francesco AU - Gehler, Peter AU - Brox, Thomas AU - Kümmerer, Matthias AU - Bethge, Matthias AU - Schölkopf, Bernhard ID - 14222 T2 - 2nd Conference on Causal Learning and Reasoning TI - Unsupervised object learning via common fate ER - TY - CONF AB - Humans naturally decompose their environment into entities at the appropriate level of abstraction to act in the world. Allowing machine learning algorithms to derive this decomposition in an unsupervised way has become an important line of research. However, current methods are restricted to simulated data or require additional information in the form of motion or depth in order to successfully discover objects. In this work, we overcome this limitation by showing that reconstructing features from models trained in a self-supervised manner is a sufficient training signal for object-centric representations to arise in a fully unsupervised way. Our approach, DINOSAUR, significantly out-performs existing image-based object-centric learning models on simulated data and is the first unsupervised object-centric model that scales to real-world datasets such as COCO and PASCAL VOC. DINOSAUR is conceptually simple and shows competitive performance compared to more involved pipelines from the computer vision literature. AU - Seitzer, Maximilian AU - Horn, Max AU - Zadaianchuk, Andrii AU - Zietlow, Dominik AU - Xiao, Tianjun AU - Carl-Johann Simon-Gabriel, Carl-Johann Simon-Gabriel AU - He, Tong AU - Zhang, Zheng AU - Schölkopf, Bernhard AU - Brox, Thomas AU - Locatello, Francesco ID - 14218 T2 - The 11th International Conference on Learning Representations TI - Bridging the gap to real-world object-centric learning ER - TY - CONF AB - In this paper, we show that recent advances in self-supervised feature learning enable unsupervised object discovery and semantic segmentation with a performance that matches the state of the field on supervised semantic segmentation 10 years ago. We propose a methodology based on unsupervised saliency masks and self-supervised feature clustering to kickstart object discovery followed by training a semantic segmentation network on pseudo-labels to bootstrap the system on images with multiple objects. We present results on PASCAL VOC that go far beyond the current state of the art (50.0 mIoU), and we report for the first time results on MS COCO for the whole set of 81 classes: our method discovers 34 categories with more than $20\%$ IoU, while obtaining an average IoU of 19.6 for all 81 categories. AU - Zadaianchuk, Andrii AU - Kleindessner, Matthaeus AU - Zhu, Yi AU - Locatello, Francesco AU - Brox, Thomas ID - 14219 T2 - The 11th International Conference on Learning Representations TI - Unsupervised semantic segmentation with self-supervised object-centric representations ER - TY - GEN AB - As causal ground truth is incredibly rare, causal discovery algorithms are commonly only evaluated on simulated data. This is concerning, given that simulations reflect common preconceptions about generating processes regarding noise distributions, model classes, and more. In this work, we propose a novel method for falsifying the output of a causal discovery algorithm in the absence of ground truth. Our key insight is that while statistical learning seeks stability across subsets of data points, causal learning should seek stability across subsets of variables. Motivated by this insight, our method relies on a notion of compatibility between causal graphs learned on different subsets of variables. We prove that detecting incompatibilities can falsify wrongly inferred causal relations due to violation of assumptions or errors from finite sample effects. Although passing such compatibility tests is only a necessary criterion for good performance, we argue that it provides strong evidence for the causal models whenever compatibility entails strong implications for the joint distribution. We also demonstrate experimentally that detection of incompatibilities can aid in causal model selection. AU - Faller, Philipp M. AU - Vankadara, Leena Chennuru AU - Mastakouri, Atalanti A. AU - Locatello, Francesco AU - Janzing, Dominik ID - 14333 T2 - arXiv TI - Self-compatibility: Evaluating causal discovery without ground truth ER - TY - JOUR AB - Living tissues are characterized by an intrinsically mechanochemical interplay of active physical forces and complex biochemical signaling pathways. Either feature alone can give rise to complex emergent phenomena, for example, mechanically driven glassy dynamics and rigidity transitions, or chemically driven reaction-diffusion instabilities. An important question is how to quantitatively assess the contribution of these different cues to the large-scale dynamics of biological materials. We address this in Madin-Darby canine kidney (MDCK) monolayers, considering both mechanochemical feedback between extracellular signal-regulated kinase (ERK) signaling activity and cellular density as well as a mechanically active tissue rheology via a self-propelled vertex model. We show that the relative strength of active migration forces to mechanochemical couplings controls a transition from a uniform active glass to periodic spatiotemporal waves. We parametrize the model from published experimental data sets on MDCK monolayers and use it to make new predictions on the correlation functions of cellular dynamics and the dynamics of topological defects associated with the oscillatory phase of cells. Interestingly, MDCK monolayers are best described by an intermediary parameter region in which both mechanochemical couplings and noisy active propulsion have a strong influence on the dynamics. Finally, we study how tissue rheology and ERK waves produce feedback on one another and uncover a mechanism via which tissue fluidity can be controlled by mechanochemical waves at both the local and global levels. AU - Boocock, Daniel R AU - Hirashima, Tsuyoshi AU - Hannezo, Edouard B ID - 14277 IS - 1 JF - PRX Life SN - 2835-8279 TI - Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers VL - 1 ER - TY - JOUR AB - The execution of cognitive functions requires coordinated circuit activity across different brain areas that involves the associated firing of neuronal assemblies. Here, we tested the circuit mechanism behind assembly interactions between the hippocampus and the medial prefrontal cortex (mPFC) of adult rats by recording neuronal populations during a rule-switching task. We identified functionally coupled CA1-mPFC cells that synchronized their activity beyond that expected from common spatial coding or oscillatory firing. When such cell pairs fired together, the mPFC cell strongly phase locked to CA1 theta oscillations and maintained consistent theta firing phases, independent of the theta timing of their CA1 counterpart. These functionally connected CA1-mPFC cells formed interconnected assemblies. While firing together with their CA1 assembly partners, mPFC cells fired along specific theta sequences. Our results suggest that upregulated theta oscillatory firing of mPFC cells can signal transient interactions with specific CA1 assemblies, thus enabling distributed computations. AU - Nardin, Michele AU - Käfer, Karola AU - Stella, Federico AU - Csicsvari, Jozsef L ID - 14314 IS - 9 JF - Cell Reports TI - Theta oscillations as a substrate for medial prefrontal-hippocampal assembly interactions VL - 42 ER - TY - JOUR AB - During apoptosis, caspases degrade 8 out of ~30 nucleoporins to irreversibly demolish the nuclear pore complex. However, for poorly understood reasons, caspases are also activated during cell differentiation. Here, we show that sublethal activation of caspases during myogenesis results in the transient proteolysis of four peripheral Nups and one transmembrane Nup. ‘Trimmed’ NPCs become nuclear export-defective, and we identified in an unbiased manner several classes of cytoplasmic, plasma membrane, and mitochondrial proteins that rapidly accumulate in the nucleus. NPC trimming by non-apoptotic caspases was also observed in neurogenesis and endoplasmic reticulum stress. Our results suggest that caspases can reversibly modulate nuclear transport activity, which allows them to function as agents of cell differentiation and adaptation at sublethal levels. AU - Cho, Ukrae H. AU - Hetzer, Martin W ID - 14315 JF - eLife TI - Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress VL - 12 ER - TY - JOUR AB - We study multigraphs whose edge-sets are the union of three perfect matchings, M1, M2, and M3. Given such a graph G and any a1; a2; a3 2 N with a1 +a2 +a3 6 n - 2, we show there exists a matching M of G with jM \ Mij = ai for each i 2 f1; 2; 3g. The bound n - 2 in the theorem is best possible in general. We conjecture however that if G is bipartite, the same result holds with n - 2 replaced by n - 1. We give a construction that shows such a result would be tight. We also make a conjecture generalising the Ryser-Brualdi-Stein conjecture with colour multiplicities. AU - Anastos, Michael AU - Fabian, David AU - Müyesser, Alp AU - Szabó, Tibor ID - 14319 IS - 3 JF - Electronic Journal of Combinatorics TI - Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets VL - 30 ER - TY - CONF AB - Probabilistic recurrence relations (PRRs) are a standard formalism for describing the runtime of a randomized algorithm. Given a PRR and a time limit κ, we consider the tail probability Pr[T≥κ], i.e., the probability that the randomized runtime T of the PRR exceeds κ. Our focus is the formal analysis of tail bounds that aims at finding a tight asymptotic upper bound u≥Pr[T≥κ]. To address this problem, the classical and most well-known approach is the cookbook method by Karp (JACM 1994), while other approaches are mostly limited to deriving tail bounds of specific PRRs via involved custom analysis. In this work, we propose a novel approach for deriving the common exponentially-decreasing tail bounds for PRRs whose preprocessing time and random passed sizes observe discrete or (piecewise) uniform distribution and whose recursive call is either a single procedure call or a divide-and-conquer. We first establish a theoretical approach via Markov’s inequality, and then instantiate the theoretical approach with a template-based algorithmic approach via a refined treatment of exponentiation. Experimental evaluation shows that our algorithmic approach is capable of deriving tail bounds that are (i) asymptotically tighter than Karp’s method, (ii) match the best-known manually-derived asymptotic tail bound for QuickSelect, and (iii) is only slightly worse (with a loglogn factor) than the manually-proven optimal asymptotic tail bound for QuickSort. Moreover, our algorithmic approach handles all examples (including realistic PRRs such as QuickSort, QuickSelect, DiameterComputation, etc.) in less than 0.1 s, showing that our approach is efficient in practice. AU - Sun, Yican AU - Fu, Hongfei AU - Chatterjee, Krishnendu AU - Goharshady, Amir Kafshdar ID - 14318 SN - 0302-9743 T2 - Computer Aided Verification TI - Automated tail bound analysis for probabilistic recurrence relations VL - 13966 ER - TY - CONF AB - Markov decision processes can be viewed as transformers of probability distributions. While this view is useful from a practical standpoint to reason about trajectories of distributions, basic reachability and safety problems are known to be computationally intractable (i.e., Skolem-hard) to solve in such models. Further, we show that even for simple examples of MDPs, strategies for safety objectives over distributions can require infinite memory and randomization. In light of this, we present a novel overapproximation approach to synthesize strategies in an MDP, such that a safety objective over the distributions is met. More precisely, we develop a new framework for template-based synthesis of certificates as affine distributional and inductive invariants for safety objectives in MDPs. We provide two algorithms within this framework. One can only synthesize memoryless strategies, but has relative completeness guarantees, while the other can synthesize general strategies. The runtime complexity of both algorithms is in PSPACE. We implement these algorithms and show that they can solve several non-trivial examples. AU - Akshay, S. AU - Chatterjee, Krishnendu AU - Meggendorfer, Tobias AU - Zikelic, Dorde ID - 14317 SN - 0302-9743 T2 - International Conference on Computer Aided Verification TI - MDPs as distribution transformers: Affine invariant synthesis for safety objectives VL - 13966 ER - TY - JOUR AB - Clathrin-mediated vesicle trafficking plays central roles in post-Golgi transport. In yeast (Saccharomyces cerevisiae), the AP-1 complex and GGA adaptors are predicted to generate distinct transport vesicles at the trans-Golgi network (TGN), and the epsin-related proteins Ent3p and Ent5p (collectively Ent3p/5p) act as accessories for these adaptors. Recently, we showed that vesicle transport from the TGN is crucial for yeast Rab5 (Vps21p)-mediated endosome formation, and that Ent3p/5p are crucial for this process, whereas AP-1 and GGA adaptors are dispensable. However, these observations were incompatible with previous studies showing that these adaptors are required for Ent3p/5p recruitment to the TGN, and thus the overall mechanism responsible for regulation of Vps21p activity remains ambiguous. Here, we investigated the functional relationships between clathrin adaptors in post-Golgi-mediated Vps21p activation. We show that AP-1 disruption in the ent3Δ5Δ mutant impaired transport of the Vps21p guanine nucleotide exchange factor Vps9p transport to the Vps21p compartment and severely reduced Vps21p activity. Additionally, GGA adaptors, the phosphatidylinositol-4-kinase Pik1p and Rab11 GTPases Ypt31p and Ypt32p were found to have partially overlapping functions for recruitment of AP-1 and Ent3p/5p to the TGN. These findings suggest a distinct role of clathrin adaptors for Vps21p activation in the TGN–endosome trafficking pathway. AU - Nagano, Makoto AU - Aoshima, Kaito AU - Shimamura, Hiroki AU - Siekhaus, Daria E AU - Toshima, Junko Y. AU - Toshima, Jiro ID - 14316 IS - 17 JF - Journal of Cell Science SN - 0021-9533 TI - Distinct role of TGN-resident clathrin adaptors for Vps21p activation in the TGN-endosome trafficking pathway VL - 136 ER - TY - JOUR AB - The development of two-dimensional materials has resulted in a diverse range of novel, high-quality compounds with increasing complexity. A key requirement for a comprehensive quantitative theory is the accurate determination of these materials' band structure parameters. However, this task is challenging due to the intricate band structures and the indirect nature of experimental probes. In this work, we introduce a general framework to derive band structure parameters from experimental data using deep neural networks. We applied our method to the penetration field capacitance measurement of trilayer graphene, an effective probe of its density of states. First, we demonstrate that a trained deep network gives accurate predictions for the penetration field capacitance as a function of tight-binding parameters. Next, we use the fast and accurate predictions from the trained network to automatically determine tight-binding parameters directly from experimental data, with extracted parameters being in a good agreement with values in the literature. We conclude by discussing potential applications of our method to other materials and experimental techniques beyond penetration field capacitance. AU - Henderson, Paul M AU - Ghazaryan, Areg AU - Zibrov, Alexander A. AU - Young, Andrea F. AU - Serbyn, Maksym ID - 14320 IS - 12 JF - Physical Review B SN - 2469-9950 TI - Deep learning extraction of band structure parameters from density of states: A case study on trilayer graphene VL - 108 ER - TY - THES AB - Nonergodic systems, whose out-of-equilibrium dynamics fail to thermalize, provide a fascinating research direction both for fundamental reasons and for application in state of the art quantum devices. Going beyond the description of statistical mechanics, ergodicity breaking yields a new paradigm in quantum many-body physics, introducing novel phases of matter with no counterpart at equilibrium. In this Thesis, we address different open questions in the field, focusing on disorder-induced many-body localization (MBL) and on weak ergodicity breaking in kinetically constrained models. In particular, we contribute to the debate about transport in kinetically constrained models, studying the effect of $U(1)$ conservation and inversion-symmetry breaking in a family of quantum East models. Using tensor network techniques, we analyze the dynamics of large MBL systems beyond the limit of exact numerical methods. In this setting, we approach the debated topic of the coexistence of localized and thermal eigenstates separated by energy thresholds known as many-body mobility edges. Inspired by recent experiments, our work further investigates the localization of a small bath induced by the coupling to a large localized chain, the so-called MBL proximity effect. In the first Chapter, we introduce a family of particle-conserving kinetically constrained models, inspired by the quantum East model. The system we study features strong inversion-symmetry breaking, due to the nature of the correlated hopping. We show that these models host so-called quantum Hilbert space fragmentation, consisting of disconnected subsectors in an entangled basis, and further provide an analytical description of this phenomenon. We further probe its effect on dynamics of simple product states, showing revivals in fidelity and local observalbes. The study of dynamics within the largest subsector reveals an anomalous transient superdiffusive behavior crossing over to slow logarithmic dynamics at later times. This work suggests that particle conserving constrained models with inversion-symmetry breaking realize new universality classes of dynamics and invite their further theoretical and experimental studies. Next, we use kinetic constraints and disorder to design a model with many-body mobility edges in particle density. This feature allows to study the dynamics of localized and thermal states in large systems beyond the limitations of previous studies. The time-evolution shows typical signatures of localization at small densities, replaced by thermal behavior at larger densities. Our results provide evidence in favor of the stability of many-body mobility edges, which was recently challenged by a theoretical argument. To support our findings, we probe the mechanism proposed as a cause of delocalization in many-body localized systems with mobility edges suggesting its ineffectiveness in the model studied. In the last Chapter of this Thesis, we address the topic of many-body localization proximity effect. We study a model inspired by recent experiments, featuring Anderson localized coupled to a small bath of free hard-core bosons. The interaction among the two particle species results in non-trivial dynamics, which we probe using tensor network techniques. Our simulations show convincing evidence of many-body localization proximity effect when the bath is composed by a single free particle and interactions are strong. We furthter observe an anomalous entanglement dynamics, which we explain through a phenomenological theory. Finally, we extract highly excited eigenstates of large systems, providing supplementary evidence in favor of our findings. AU - Brighi, Pietro ID - 12732 SN - 2663-337X TI - Ergodicity breaking in disordered and kinetically constrained quantum many-body systems ER - TY - JOUR AB - Quantum kinetically constrained models have recently attracted significant attention due to their anomalous dynamics and thermalization. In this work, we introduce a hitherto unexplored family of kinetically constrained models featuring conserved particle number and strong inversion-symmetry breaking due to facilitated hopping. We demonstrate that these models provide a generic example of so-called quantum Hilbert space fragmentation, that is manifested in disconnected sectors in the Hilbert space that are not apparent in the computational basis. Quantum Hilbert space fragmentation leads to an exponential in system size number of eigenstates with exactly zero entanglement entropy across several bipartite cuts. These eigenstates can be probed dynamically using quenches from simple initial product states. In addition, we study the particle spreading under unitary dynamics launched from the domain wall state, and find faster than diffusive dynamics at high particle densities, that crosses over into logarithmically slow relaxation at smaller densities. Using a classically simulable cellular automaton, we reproduce the logarithmic dynamics observed in the quantum case. Our work suggests that particle conserving constrained models with inversion symmetry breaking realize so far unexplored dynamical behavior and invite their further theoretical and experimental studies. AU - Brighi, Pietro AU - Ljubotina, Marko AU - Serbyn, Maksym ID - 14334 IS - 3 JF - SciPost Physics KW - General Physics and Astronomy SN - 2542-4653 TI - Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models VL - 15 ER - TY - JOUR AB - We demonstrate the possibility of a coupling between the magnetization direction of a ferromagnet and the tilting angle of adsorbed achiral molecules. To illustrate the mechanism of the coupling, we analyze a minimal Stoner model that includes Rashba spin–orbit coupling due to the electric field on the surface of the ferromagnet. The proposed mechanism allows us to study magnetic anisotropy of the system with an extended Stoner–Wohlfarth model and argue that adsorbed achiral molecules can change magnetocrystalline anisotropy of the substrate. Our research aims to motivate further experimental studies of the current-free chirality induced spin selectivity effect involving both enantiomers. AU - Al Hyder, Ragheed AU - Cappellaro, Alberto AU - Lemeshko, Mikhail AU - Volosniev, Artem ID - 14321 IS - 10 JF - The Journal of Chemical Physics KW - Physical and Theoretical Chemistry KW - General Physics and Astronomy SN - 0021-9606 TI - Achiral dipoles on a ferromagnet can affect its magnetization direction VL - 159 ER - TY - JOUR AB - We propose a simple method to measure nonlinear Kerr refractive index in mid-infrared frequency range that avoids using sophisticated infrared detectors. Our approach is based on using a near-infrared probe beam which interacts with a mid-IR beam via wavelength-non-degenerate cross-phase modulation (XPM). By carefully measuring XPM-induced spectral modifications in the probe beam and comparing the experimental data with simulation results, we extract the value for the non-degenerate Kerr index. Finally, in order to obtain the value of degenerate mid-IR Kerr index, we use the well-established two-band formalism of Sheik-Bahae et al., which is shown to become particularly simple in the limit of low frequencies. The proposed technique is complementary to the conventional techniques, such as z-scan, and has the advantage of not requiring any mid-infrared detectors. AU - Lorenc, Dusan AU - Alpichshev, Zhanybek ID - 14342 IS - 9 JF - Applied Physics Letters SN - 0003-6951 TI - Mid-infrared Kerr index evaluation via cross-phase modulation with a near-infrared probe beam VL - 123 ER - TY - JOUR AB - Purpose: Biallelic variants in TARS2, encoding the mitochondrial threonyl-tRNA-synthetase, have been reported in a small group of individuals displaying a neurodevelopmental phenotype but with limited neuroradiological data and insufficient evidence for causality of the variants. Methods: Exome or genome sequencing was carried out in 15 families. Clinical and neuroradiological evaluation was performed for all affected individuals, including review of 10 previously reported individuals. The pathogenicity of TARS2 variants was evaluated using in vitro assays and a zebrafish model. Results: We report 18 new individuals harboring biallelic TARS2 variants. Phenotypically, these individuals show developmental delay/intellectual disability, regression, cerebellar and cerebral atrophy, basal ganglia signal alterations, hypotonia, cerebellar signs, and increased blood lactate. In vitro studies showed that variants within the TARS2301-381 region had decreased binding to Rag GTPases, likely impairing mTORC1 activity. The zebrafish model recapitulated key features of the human phenotype and unraveled dysregulation of downstream targets of mTORC1 signaling. Functional testing of the variants confirmed the pathogenicity in a zebrafish model. Conclusion: We define the clinico-radiological spectrum of TARS2-related mitochondrial disease, unveil the likely involvement of the mTORC1 signaling pathway as a distinct molecular mechanism, and establish a TARS2 zebrafish model as an important tool to study variant pathogenicity. AU - Accogli, Andrea AU - Lin, Sheng-Jia AU - Severino, Mariasavina AU - Kim, Sung-Hoon AU - Huang, Kevin AU - Rocca, Clarissa AU - Landsverk, Megan AU - Zaki, Maha S. AU - Al-Maawali, Almundher AU - Srinivasan, Varunvenkat M. AU - Al-Thihli, Khalid AU - Schaefer, G. Bradly AU - Davis, Monica AU - Tonduti, Davide AU - Doneda, Chiara AU - Marten, Lara M. AU - Mühlhausen, Chris AU - Gomez, Maria AU - Lamantea, Eleonora AU - Mena, Rafael AU - Nizon, Mathilde AU - Procaccio, Vincent AU - Begtrup, Amber AU - Telegrafi, Aida AU - Cui, Hong AU - Schulz, Heidi L. AU - Mohr, Julia AU - Biskup, Saskia AU - Loos, Mariana Amina AU - Aráoz, Hilda Verónica AU - Salpietro, Vincenzo AU - Keppen, Laura Davis AU - Chitre, Manali AU - Petree, Cassidy AU - Raymond, Lucy AU - Vogt, Julie AU - Sawyer, Lindsey B. AU - Basinger, Alice A. AU - Pedersen, Signe Vandal AU - Pearson, Toni S. AU - Grange, Dorothy K. AU - Lingappa, Lokesh AU - McDunnah, Paige AU - Horvath, Rita AU - Cognè, Benjamin AU - Isidor, Bertrand AU - Hahn, Andreas AU - Gripp, Karen W. AU - Jafarnejad, Seyed Mehdi AU - Østergaard, Elsebet AU - Prada, Carlos E. AU - Ghezzi, Daniele AU - Gowda, Vykuntaraju K. AU - Taylor, Robert W. AU - Sonenberg, Nahum AU - Houlden, Henry AU - Sissler, Marie AU - Varshney, Gaurav K. AU - Maroofian, Reza ID - 14368 IS - 11 JF - Genetics in Medicine KW - Genetics (clinical) SN - 1098-3600 TI - Clinical, neuroradiological, and molecular characterization of mitochondrial threonyl-tRNA-synthetase (TARS2)-related disorder VL - 25 ER - TY - CONF AB - We formalized general (i.e., type-0) grammars using the Lean 3 proof assistant. We defined basic notions of rewrite rules and of words derived by a grammar, and used grammars to show closure of the class of type-0 languages under four operations: union, reversal, concatenation, and the Kleene star. The literature mostly focuses on Turing machine arguments, which are possibly more difficult to formalize. For the Kleene star, we could not follow the literature and came up with our own grammar-based construction. AU - Dvorak, Martin AU - Blanchette, Jasmin ID - 13120 SN - 9783959772846 T2 - 14th International Conference on Interactive Theorem Proving TI - Closure properties of general grammars - formally verified VL - 268 ER - TY - JOUR AB - Bundling crossings is a strategy which can enhance the readability of graph drawings. In this paper we consider good drawings, i.e., we require that any two edges have at most one common point which can be a common vertex or a crossing. Our main result is that there is a polynomial-time algorithm to compute an 8-approximation of the bundled crossing number of a good drawing with no toothed hole. In general the number of toothed holes has to be added to the 8-approximation. In the special case of circular drawings the approximation factor is 8, this improves upon the 10-approximation of Fink et al. [14]. Our approach also works with the same approximation factor for families of pseudosegments, i.e., curves intersecting at most once. We also show how to compute a 9/2-approximation when the intersection graph of the pseudosegments is bipartite and has no toothed hole. AU - Arroyo Guevara, Alan M AU - Felsner, Stefan ID - 13969 IS - 6 JF - Journal of Graph Algorithms and Applications SN - 1526-1719 TI - Approximating the bundled crossing number VL - 27 ER - TY - CONF AB - We study the Hamilton cycle problem with input a random graph G ~ G(n,p) in two different settings. In the first one, G is given to us in the form of randomly ordered adjacency lists while in the second one, we are given the adjacency matrix of G. In each of the two settings we derive a deterministic algorithm that w.h.p. either finds a Hamilton cycle or returns a certificate that such a cycle does not exist for p = p(n) ≥ 0. The running times of our algorithms are O(n) and respectively, each being best possible in its own setting. AU - Anastos, Michael ID - 14344 SN - 9781611977554 T2 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms TI - Fast algorithms for solving the Hamilton cycle problem with high probability VL - 2023 ER - TY - JOUR AB - Surface curvature both emerges from, and influences the behavior of, living objects at length scales ranging from cell membranes to single cells to tissues and organs. The relevance of surface curvature in biology is supported by numerous experimental and theoretical investigations in recent years. In this review, first, a brief introduction to the key ideas of surface curvature in the context of biological systems is given and the challenges that arise when measuring surface curvature are discussed. Giving an overview of the emergence of curvature in biological systems, its significance at different length scales becomes apparent. On the other hand, summarizing current findings also shows that both single cells and entire cell sheets, tissues or organisms respond to curvature by modulating their shape and their migration behavior. Finally, the interplay between the distribution of morphogens or micro-organisms and the emergence of curvature across length scales is addressed with examples demonstrating these key mechanistic principles of morphogenesis. Overall, this review highlights that curved interfaces are not merely a passive by-product of the chemical, biological, and mechanical processes but that curvature acts also as a signal that co-determines these processes. AU - Schamberger, Barbara AU - Ziege, Ricardo AU - Anselme, Karine AU - Ben Amar, Martine AU - Bykowski, Michał AU - Castro, André P.G. AU - Cipitria, Amaia AU - Coles, Rhoslyn A. AU - Dimova, Rumiana AU - Eder, Michaela AU - Ehrig, Sebastian AU - Escudero, Luis M. AU - Evans, Myfanwy E. AU - Fernandes, Paulo R. AU - Fratzl, Peter AU - Geris, Liesbet AU - Gierlinger, Notburga AU - Hannezo, Edouard B AU - Iglič, Aleš AU - Kirkensgaard, Jacob J.K. AU - Kollmannsberger, Philip AU - Kowalewska, Łucja AU - Kurniawan, Nicholas A. AU - Papantoniou, Ioannis AU - Pieuchot, Laurent AU - Pires, Tiago H.V. AU - Renner, Lars D. AU - Sageman-Furnas, Andrew O. AU - Schröder-Turk, Gerd E. AU - Sengupta, Anupam AU - Sharma, Vikas R. AU - Tagua, Antonio AU - Tomba, Caterina AU - Trepat, Xavier AU - Waters, Sarah L. AU - Yeo, Edwina F. AU - Roschger, Andreas AU - Bidan, Cécile M. AU - Dunlop, John W.C. ID - 12710 IS - 13 JF - Advanced Materials SN - 0935-9648 TI - Curvature in biological systems: Its quantification, emergence, and implications across the scales VL - 35 ER - TY - JOUR AB - Coherent flows of self-propelled particles are characterized by vortices and jets that sustain chaotic flows, referred to as active turbulence. Here, we reveal a crossover between defect-free active turbulence and active turbulence laden with topological defects. Interestingly, we show that concurrent to the crossover from defect-free to defect-laden active turbulence is the restoration of the previously broken SO(2) symmetry signaled by the fast decay of the two-point correlations. By stability analyses of the topological charge density field, we provide theoretical insights on the criterion for the crossover to the defect-laden active turbulent state. Despite the distinct symmetry features between these two active turbulence regimes, the flow fluctuations exhibit universal statistical scaling behaviors at large scales, while the spectrum of polarity fluctuations decays exponentially at small length scales compared to the active energy injection length. These findings reveal a dynamical crossover between distinct spatiotemporal organization patterns in polar active matter. AU - Andersen, Benjamin H. AU - Renaud, Julian B AU - Rønning, Jonas AU - Angheluta, Luiza AU - Doostmohammadi, Amin ID - 14377 IS - 6 JF - Physical Review Fluids KW - Fluid Flow and Transfer Processes KW - Modeling and Simulation KW - Computational Mechanics SN - 2469-990X TI - Symmetry-restoring crossover from defect-free to defect-laden turbulence in polar active matter VL - 8 ER - TY - JOUR AB - Photoisomerization of azobenzenes from their stable E isomer to the metastable Z state is the basis of numerous applications of these molecules. However, this reaction typically requires ultraviolet light, which limits applicability. In this study, we introduce disequilibration by sensitization under confinement (DESC), a supramolecular approach to induce the E-to-Z isomerization by using light of a desired color, including red. DESC relies on a combination of a macrocyclic host and a photosensitizer, which act together to selectively bind and sensitize E-azobenzenes for isomerization. The Z isomer lacks strong affinity for and is expelled from the host, which can then convert additional E-azobenzenes to the Z state. In this way, the host–photosensitizer complex converts photon energy into chemical energy in the form of out-of-equilibrium photostationary states, including ones that cannot be accessed through direct photoexcitation. AU - Gemen, Julius AU - Church, Jonathan R. AU - Ruoko, Tero-Petri AU - Durandin, Nikita AU - Białek, Michał J. AU - Weissenfels, Maren AU - Feller, Moran AU - Kazes, Miri AU - Borin, Veniamin A. AU - Odaybat, Magdalena AU - Kalepu, Rishir AU - Diskin-Posner, Yael AU - Oron, Dan AU - Fuchter, Matthew J. AU - Priimagi, Arri AU - Schapiro, Igor AU - Klajn, Rafal ID - 13340 IS - 6664 JF - Science TI - Disequilibrating azoarenes by visible-light sensitization under confinement VL - 381 ER - TY - JOUR AB - The elasticity of disordered and polydisperse polymer networks is a fundamental problem of soft matter physics that is still open. Here, we self-assemble polymer networks via simulations of a mixture of bivalent and tri- or tetravalent patchy particles, which result in an exponential strand length distribution analogous to that of experimental randomly cross-linked systems. After assembly, the network connectivity and topology are frozen and the resulting system is characterized. We find that the fractal structure of the network depends on the number density at which the assembly has been carried out, but that systems with the same mean valence and same assembly density have the same structural properties. Moreover, we compute the long-time limit of the mean-squared displacement, also known as the (squared) localization length, of the cross-links and of the middle monomers of the strands, showing that the dynamics of long strands is well described by the tube model. Finally, we find a relation connecting these two localization lengths at high density and connect the cross-link localization length to the shear modulus of the system. AU - Sorichetti, Valerio AU - Ninarello, Andrea AU - Ruiz-Franco, José AU - Hugouvieux, Virginie AU - Zaccarelli, Emanuela AU - Micheletti, Cristian AU - Kob, Walter AU - Rovigatti, Lorenzo ID - 12705 IS - 7 JF - Journal of Chemical Physics SN - 0021-9606 TI - Structure and elasticity of model disordered, polydisperse, and defect-free polymer networks VL - 158 ER - TY - JOUR AB - We study turn-based stochastic zero-sum games with lexicographic preferences over objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit both randomness as well as controllable and adversarial non-determinism. Lexicographic order allows one to consider multiple objectives with a strict preference order. To the best of our knowledge, stochastic games with lexicographic objectives have not been studied before. For a mixture of reachability and safety objectives, we show that deterministic lexicographically optimal strategies exist and memory is only required to remember the already satisfied and violated objectives. For a constant number of objectives, we show that the relevant decision problem is in NP∩coNP, matching the current known bound for single objectives; and in general the decision problem is PSPACE-hard and can be solved in NEXPTIME∩coNEXPTIME. We present an algorithm that computes the lexicographically optimal strategies via a reduction to the computation of optimal strategies in a sequence of single-objectives games. For omega-regular objectives, we restrict our analysis to one-player games, also known as Markov decision processes. We show that lexicographically optimal strategies exist and need either randomization or finite memory. We present an algorithm that solves the relevant decision problem in polynomial time. We have implemented our algorithms and report experimental results on various case studies. AU - Chatterjee, Krishnendu AU - Katoen, Joost P AU - Mohr, Stefanie AU - Weininger, Maximilian AU - Winkler, Tobias ID - 12738 JF - Formal Methods in System Design TI - Stochastic games with lexicographic objectives ER - TY - GEN AB - The zip file includes source data used in the manuscript "CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration", as well as a representative Jupyter notebook to reproduce the main figures. Please see the preprint on bioRxiv and the DOI link there to access the final published version. Note the title change between the preprint and the published manuscript. A sample script for particle-based simulations of collective chemotaxis by self-generated gradients is also included (see Self-generated_chemotaxis_sample_script.ipynb) to generate exemplary cell trajectories. A detailed description of the simulation setup is provided in the supplementary information of the manuscipt. AU - Ucar, Mehmet C ID - 14279 TI - Source data for the manuscript "CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration" ER - TY - JOUR AB - We consider large non-Hermitian random matrices X with complex, independent, identically distributed centred entries and show that the linear statistics of their eigenvalues are asymptotically Gaussian for test functions having 2+ϵ derivatives. Previously this result was known only for a few special cases; either the test functions were required to be analytic [72], or the distribution of the matrix elements needed to be Gaussian [73], or at least match the Gaussian up to the first four moments [82, 56]. We find the exact dependence of the limiting variance on the fourth cumulant that was not known before. The proof relies on two novel ingredients: (i) a local law for a product of two resolvents of the Hermitisation of X with different spectral parameters and (ii) a coupling of several weakly dependent Dyson Brownian motions. These methods are also the key inputs for our analogous results on the linear eigenvalue statistics of real matrices X that are presented in the companion paper [32]. AU - Cipolloni, Giorgio AU - Erdös, László AU - Schröder, Dominik J ID - 10405 IS - 5 JF - Communications on Pure and Applied Mathematics SN - 0010-3640 TI - Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices VL - 76 ER - TY - JOUR AB - Mathematical models often aim to describe a complicated mechanism in a cohesive and simple manner. However, reaching perfect balance between being simple enough or overly simplistic is a challenging task. Frequently, game-theoretic models have an underlying assumption that players, whenever they choose to execute a specific action, do so perfectly. In fact, it is rare that action execution perfectly coincides with intentions of individuals, giving rise to behavioural mistakes. The concept of incompetence of players was suggested to address this issue in game-theoretic settings. Under the assumption of incompetence, players have non-zero probabilities of executing a different strategy from the one they chose, leading to stochastic outcomes of the interactions. In this article, we survey results related to the concept of incompetence in classic as well as evolutionary game theory and provide several new results. We also suggest future extensions of the model and argue why it is important to take into account behavioural mistakes when analysing interactions among players in both economic and biological settings. AU - Graham, Thomas AU - Kleshnina, Maria AU - Filar, Jerzy A. ID - 10770 JF - Dynamic Games and Applications SN - 2153-0785 TI - Where do mistakes lead? A survey of games with incompetent players VL - 13 ER - TY - JOUR AB - We study direct integrals of quadratic and Dirichlet forms. We show that each quasi-regular Dirichlet space over a probability space admits a unique representation as a direct integral of irreducible Dirichlet spaces, quasi-regular for the same underlying topology. The same holds for each quasi-regular strongly local Dirichlet space over a metrizable Luzin σ-finite Radon measure space, and admitting carré du champ operator. In this case, the representation is only projectively unique. AU - Dello Schiavo, Lorenzo ID - 10145 JF - Potential Analysis SN - 0926-2601 TI - Ergodic decomposition of Dirichlet forms via direct integrals and applications VL - 58 ER - TY - JOUR AB - The study of RNAs has become one of the most influential research fields in contemporary biology and biomedicine. In the last few years, new sequencing technologies have produced an explosion of new and exciting discoveries in the field but have also given rise to many open questions. Defining these questions, together with old, long-standing gaps in our knowledge, is the spirit of this article. The breadth of topics within RNA biology research is vast, and every aspect of the biology of these molecules contains countless exciting open questions. Here, we asked 12 groups to discuss their most compelling question among some plant RNA biology topics. The following vignettes cover RNA alternative splicing; RNA dynamics; RNA translation; RNA structures; R-loops; epitranscriptomics; long non-coding RNAs; small RNA production and their functions in crops; small RNAs during gametogenesis and in cross-kingdom RNA interference; and RNA-directed DNA methylation. In each section, we will present the current state-of-the-art in plant RNA biology research before asking the questions that will surely motivate future discoveries in the field. We hope this article will spark a debate about the future perspective on RNA biology and provoke novel reflections in the reader. AU - Manavella, Pablo A AU - Godoy Herz, Micaela A AU - Kornblihtt, Alberto R AU - Sorenson, Reed AU - Sieburth, Leslie E AU - Nakaminami, Kentaro AU - Seki, Motoaki AU - Ding, Yiliang AU - Sun, Qianwen AU - Kang, Hunseung AU - Ariel, Federico D AU - Crespi, Martin AU - Giudicatti, Axel J AU - Cai, Qiang AU - Jin, Hailing AU - Feng, Xiaoqi AU - Qi, Yijun AU - Pikaard, Craig S ID - 12669 IS - 6 JF - The Plant Cell KW - Cell Biology KW - Plant Science SN - 1040-4651 TI - Beyond transcription: compelling open questions in plant RNA biology VL - 35 ER - TY - JOUR AB - We say that (Formula presented.) if, in every edge coloring (Formula presented.), we can find either a 1-colored copy of (Formula presented.) or a 2-colored copy of (Formula presented.). The well-known states that the threshold for the property (Formula presented.) is equal to (Formula presented.), where (Formula presented.) is given by (Formula presented.) for any pair of graphs (Formula presented.) and (Formula presented.) with (Formula presented.). In this article, we show the 0-statement of the Kohayakawa–Kreuter conjecture for every pair of cycles and cliques. AU - Liebenau, Anita AU - Mattos, Letícia AU - Mendonca Dos Santos, Walner AU - Skokan, Jozef ID - 11706 IS - 4 JF - Random Structures and Algorithms SN - 1042-9832 TI - Asymmetric Ramsey properties of random graphs involving cliques and cycles VL - 62 ER - TY - JOUR AB - We establish precise right-tail small deviation estimates for the largest eigenvalue of real symmetric and complex Hermitian matrices whose entries are independent random variables with uniformly bounded moments. The proof relies on a Green function comparison along a continuous interpolating matrix flow for a long time. Less precise estimates are also obtained in the left tail. AU - Erdös, László AU - Xu, Yuanyuan ID - 12707 IS - 2 JF - Bernoulli SN - 1350-7265 TI - Small deviation estimates for the largest eigenvalue of Wigner matrices VL - 29 ER - TY - JOUR AB - As developing tissues grow in size and undergo morphogenetic changes, their material properties may be altered. Such changes result from tension dynamics at cell contacts or cellular jamming. Yet, in many cases, the cellular mechanisms controlling the physical state of growing tissues are unclear. We found that at early developmental stages, the epithelium in the developing mouse spinal cord maintains both high junctional tension and high fluidity. This is achieved via a mechanism in which interkinetic nuclear movements generate cell area dynamics that drive extensive cell rearrangements. Over time, the cell proliferation rate declines, effectively solidifying the tissue. Thus, unlike well-studied jamming transitions, the solidification uncovered here resembles a glass transition that depends on the dynamical stresses generated by proliferation and differentiation. Our finding that the fluidity of developing epithelia is linked to interkinetic nuclear movements and the dynamics of growth is likely to be relevant to multiple developing tissues. AU - Bocanegra, Laura AU - Singh, Amrita AU - Hannezo, Edouard B AU - Zagórski, Marcin P AU - Kicheva, Anna ID - 12837 JF - Nature Physics SN - 1745-2473 TI - Cell cycle dynamics control fluidity of the developing mouse neuroepithelium VL - 19 ER - TY - JOUR AB - Coherent control and manipulation of quantum degrees of freedom such as spins forms the basis of emerging quantum technologies. In this context, the robust valley degree of freedom and the associated valley pseudospin found in two-dimensional transition metal dichalcogenides is a highly attractive platform. Valley polarization and coherent superposition of valley states have been observed in these systems even up to room temperature. Control of valley coherence is an important building block for the implementation of valley qubit. Large magnetic fields or high-power lasers have been used in the past to demonstrate the control (initialization and rotation) of the valley coherent states. Here, the control of layer–valley coherence via strong coupling of valley excitons in bilayer WS2 to microcavity photons is demonstrated by exploiting the pseudomagnetic field arising in optical cavities owing to the transverse electric–transverse magnetic (TE–TM)mode splitting. The use of photonic structures to generate pseudomagnetic fields which can be used to manipulate exciton-polaritons presents an attractive approach to control optical responses without the need for large magnets or high-intensity optical pump powers. AU - Khatoniar, Mandeep AU - Yama, Nicholas AU - Ghazaryan, Areg AU - Guddala, Sriram AU - Ghaemi, Pouyan AU - Majumdar, Kausik AU - Menon, Vinod ID - 12836 IS - 13 JF - Advanced Optical Materials TI - Optical manipulation of Layer–Valley coherence via strong exciton–photon coupling in microcavities VL - 11 ER - TY - JOUR AB - This paper deals with the large-scale behaviour of dynamical optimal transport on Zd -periodic graphs with general lower semicontinuous and convex energy densities. Our main contribution is a homogenisation result that describes the effective behaviour of the discrete problems in terms of a continuous optimal transport problem. The effective energy density can be explicitly expressed in terms of a cell formula, which is a finite-dimensional convex programming problem that depends non-trivially on the local geometry of the discrete graph and the discrete energy density. Our homogenisation result is derived from a Γ -convergence result for action functionals on curves of measures, which we prove under very mild growth conditions on the energy density. We investigate the cell formula in several cases of interest, including finite-volume discretisations of the Wasserstein distance, where non-trivial limiting behaviour occurs. AU - Gladbach, Peter AU - Kopfer, Eva AU - Maas, Jan AU - Portinale, Lorenzo ID - 12959 IS - 5 JF - Calculus of Variations and Partial Differential Equations SN - 0944-2669 TI - Homogenisation of dynamical optimal transport on periodic graphs VL - 62 ER - TY - JOUR AB - We consider billiards obtained by removing from the plane finitely many strictly convex analytic obstacles satisfying the non-eclipse condition. The restriction of the dynamics to the set of non-escaping orbits is conjugated to a subshift, which provides a natural labeling of periodic orbits. We show that under suitable symmetry and genericity assumptions, the Marked Length Spectrum determines the geometry of the billiard table. AU - De Simoi, Jacopo AU - Kaloshin, Vadim AU - Leguil, Martin ID - 12877 JF - Inventiones Mathematicae SN - 0020-9910 TI - Marked Length Spectral determination of analytic chaotic billiards with axial symmetries VL - 233 ER - TY - JOUR AB - Statistics of natural scenes are not uniform - their structure varies dramatically from ground to sky. It remains unknown whether these non-uniformities are reflected in the large-scale organization of the early visual system and what benefits such adaptations would confer. Here, by relying on the efficient coding hypothesis, we predict that changes in the structure of receptive fields across visual space increase the efficiency of sensory coding. We show experimentally that, in agreement with our predictions, receptive fields of retinal ganglion cells change their shape along the dorsoventral retinal axis, with a marked surround asymmetry at the visual horizon. Our work demonstrates that, according to principles of efficient coding, the panoramic structure of natural scenes is exploited by the retina across space and cell-types. AU - Gupta, Divyansh AU - Mlynarski, Wiktor F AU - Sumser, Anton L AU - Symonova, Olga AU - Svaton, Jan AU - Jösch, Maximilian A ID - 12349 JF - Nature Neuroscience SN - 1097-6256 TI - Panoramic visual statistics shape retina-wide organization of receptive fields VL - 26 ER - TY - DATA AB - Statistics of natural scenes are not uniform - their structure varies dramatically from ground to sky. It remains unknown whether these non-uniformities are reflected in the large-scale organization of the early visual system and what benefits such adaptations would confer. Here, by relying on the efficient coding hypothesis, we predict that changes in the structure of receptive fields across visual space increase the efficiency of sensory coding. We show experimentally that, in agreement with our predictions, receptive fields of retinal ganglion cells change their shape along the dorsoventral retinal axis, with a marked surround asymmetry at the visual horizon. Our work demonstrates that, according to principles of efficient coding, the panoramic structure of natural scenes is exploited by the retina across space and cell-types. AU - Gupta, Divyansh AU - Sumser, Anton L AU - Jösch, Maximilian A ID - 12370 TI - Research Data for: Panoramic visual statistics shape retina-wide organization of receptive fields ER - TY - JOUR AB - We study a new discretization of the Gaussian curvature for polyhedral surfaces. This discrete Gaussian curvature is defined on each conical singularity of a polyhedral surface as the quotient of the angle defect and the area of the Voronoi cell corresponding to the singularity. We divide polyhedral surfaces into discrete conformal classes using a generalization of discrete conformal equivalence pioneered by Feng Luo. We subsequently show that, in every discrete conformal class, there exists a polyhedral surface with constant discrete Gaussian curvature. We also provide explicit examples to demonstrate that this surface is in general not unique. AU - Kourimska, Hana ID - 12764 JF - Discrete and Computational Geometry SN - 0179-5376 TI - Discrete yamabe problem for polyhedral surfaces VL - 70 ER - TY - THES AB - The extension of extremal combinatorics to the setting of exterior algebra is a work in progress that gained attention recently. In this thesis, we study the combinatorial structure of exterior algebra by introducing a dictionary that translates the notions from the set systems into the framework of exterior algebra. We show both generalizations of celebrated Erdös--Ko--Rado theorem and Hilton--Milner theorem to the setting of exterior algebra in the simplest non-trivial case of two-forms. AU - Köse, Seyda ID - 13331 SN - 2791-4585 TI - Exterior algebra and combinatorics ER - TY - JOUR AB - The celebrated Erdős–Ko–Rado theorem about the maximal size of an intersecting family of r-element subsets of was extended to the setting of exterior algebra in [5, Theorem 2.3] and in [6, Theorem 1.4]. However, the equality case has not been settled yet. In this short note, we show that the extension of the Erdős–Ko–Rado theorem and the characterization of the equality case therein, as well as those of the Hilton–Milner theorem to the setting of exterior algebra in the simplest non-trivial case of two-forms follow from a folklore puzzle about possible arrangements of an intersecting family of lines. AU - Ivanov, Grigory AU - Köse, Seyda ID - 12680 IS - 6 JF - Discrete Mathematics SN - 0012-365X TI - Erdős-Ko-Rado and Hilton-Milner theorems for two-forms VL - 346 ER - TY - JOUR AB - In the physics literature the spectral form factor (SFF), the squared Fourier transform of the empirical eigenvalue density, is the most common tool to test universality for disordered quantum systems, yet previous mathematical results have been restricted only to two exactly solvable models (Forrester in J Stat Phys 183:33, 2021. https://doi.org/10.1007/s10955-021-02767-5, Commun Math Phys 387:215–235, 2021. https://doi.org/10.1007/s00220-021-04193-w). We rigorously prove the physics prediction on SFF up to an intermediate time scale for a large class of random matrices using a robust method, the multi-resolvent local laws. Beyond Wigner matrices we also consider the monoparametric ensemble and prove that universality of SFF can already be triggered by a single random parameter, supplementing the recently proven Wigner–Dyson universality (Cipolloni et al. in Probab Theory Relat Fields, 2021. https://doi.org/10.1007/s00440-022-01156-7) to larger spectral scales. Remarkably, extensive numerics indicates that our formulas correctly predict the SFF in the entire slope-dip-ramp regime, as customarily called in physics. AU - Cipolloni, Giorgio AU - Erdös, László AU - Schröder, Dominik J ID - 12792 JF - Communications in Mathematical Physics SN - 0010-3616 TI - On the spectral form factor for random matrices VL - 401 ER - TY - JOUR AB - Given a finite set A ⊂ ℝ^d, let Cov_{r,k} denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors as well. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness. AU - Corbet, René AU - Kerber, Michael AU - Lesnick, Michael AU - Osang, Georg F ID - 12709 JF - Discrete and Computational Geometry SN - 0179-5376 TI - Computing the multicover bifiltration VL - 70 ER - TY - JOUR AB - Kleinjohann (Archiv der Mathematik 35(1):574–582, 1980; Mathematische Zeitschrift 176(3), 327–344, 1981) and Bangert (Archiv der Mathematik 38(1):54–57, 1982) extended the reach rch(S) from subsets S of Euclidean space to the reach rchM(S) of subsets S of Riemannian manifolds M, where M is smooth (we’ll assume at least C3). Bangert showed that sets of positive reach in Euclidean space and Riemannian manifolds are very similar. In this paper we introduce a slight variant of Kleinjohann’s and Bangert’s extension and quantify the similarity between sets of positive reach in Euclidean space and Riemannian manifolds in a new way: Given p∈M and q∈S, we bound the local feature size (a local version of the reach) of its lifting to the tangent space via the inverse exponential map (exp−1p(S)) at q, assuming that rchM(S) and the geodesic distance dM(p,q) are bounded. These bounds are motivated by the importance of the reach and local feature size to manifold learning, topological inference, and triangulating manifolds and the fact that intrinsic approaches circumvent the curse of dimensionality. AU - Boissonnat, Jean Daniel AU - Wintraecken, Mathijs ID - 12763 JF - Journal of Applied and Computational Topology SN - 2367-1726 TI - The reach of subsets of manifolds VL - 7 ER - TY - CONF AB - The safety-liveness dichotomy is a fundamental concept in formal languages which plays a key role in verification. Recently, this dichotomy has been lifted to quantitative properties, which are arbitrary functions from infinite words to partially-ordered domains. We look into harnessing the dichotomy for the specific classes of quantitative properties expressed by quantitative automata. These automata contain finitely many states and rational-valued transition weights, and their common value functions Inf, Sup, LimInf, LimSup, LimInfAvg, LimSupAvg, and DSum map infinite words into the totallyordered domain of real numbers. In this automata-theoretic setting, we establish a connection between quantitative safety and topological continuity and provide an alternative characterization of quantitative safety and liveness in terms of their boolean counterparts. For all common value functions, we show how the safety closure of a quantitative automaton can be constructed in PTime, and we provide PSpace-complete checks of whether a given quantitative automaton is safe or live, with the exception of LimInfAvg and LimSupAvg automata, for which the safety check is in ExpSpace. Moreover, for deterministic Sup, LimInf, and LimSup automata, we give PTime decompositions into safe and live automata. These decompositions enable the separation of techniques for safety and liveness verification for quantitative specifications. AU - Boker, Udi AU - Henzinger, Thomas A AU - Mazzocchi, Nicolas Adrien AU - Sarac, Naci E ID - 13221 SN - 9783959772990 T2 - 34th International Conference on Concurrency Theory TI - Safety and liveness of quantitative automata VL - 279 ER - TY - JOUR AB - Recently, a concept of generalized multifractality, which characterizes fluctuations and correlations of critical eigenstates, was introduced and explored for all 10 symmetry classes of disordered systems. Here, by using the nonlinear sigma-model ( NL σ M ) field theory, we extend the theory of generalized multifractality to boundaries of systems at criticality. Our numerical simulations on two-dimensional systems of symmetry classes A, C, and AII fully confirm the analytical predictions of pure-scaling observables and Weyl symmetry relations between critical exponents of surface generalized multifractality. This demonstrates the validity of the NL σ M for the description of Anderson-localization critical phenomena, not only in the bulk but also on the boundary. The critical exponents strongly violate generalized parabolicity, in analogy with earlier results for the bulk, corroborating the conclusion that the considered Anderson-localization critical points are not described by conformal field theories. We further derive relations between generalized surface multifractal spectra and linear combinations of Lyapunov exponents of a strip in quasi-one-dimensional geometry, which hold under the assumption of invariance with respect to a logarithmic conformal map. Our numerics demonstrate that these relations hold with an excellent accuracy. Taken together, our results indicate an intriguing situation: the conformal invariance is broken but holds partially at critical points of Anderson localization. AU - Babkin, Serafim AU - Karcher, Jonas F. AU - Burmistrov, Igor S. AU - Mirlin, Alexander D. ID - 14406 IS - 10 JF - Physical Review B SN - 2469-9950 TI - Generalized surface multifractality in two-dimensional disordered systems VL - 108 ER - TY - CONF AB - We introduce hypernode automata as a new specification formalism for hyperproperties of concurrent systems. They are finite automata with nodes labeled with hypernode logic formulas and transitions labeled with actions. A hypernode logic formula specifies relations between sequences of variable values in different system executions. Unlike HyperLTL, hypernode logic takes an asynchronous view on execution traces by constraining the values and the order of value changes of each variable without correlating the timing of the changes. Different execution traces are synchronized solely through the transitions of hypernode automata. Hypernode automata naturally combine asynchronicity at the node level with synchronicity at the transition level. We show that the model-checking problem for hypernode automata is decidable over action-labeled Kripke structures, whose actions induce transitions of the specification automata. For this reason, hypernode automaton is a suitable formalism for specifying and verifying asynchronous hyperproperties, such as declassifying observational determinism in multi-threaded programs. AU - Bartocci, Ezio AU - Henzinger, Thomas A AU - Nickovic, Dejan AU - Oliveira da Costa, Ana ID - 14405 SN - 18688969 T2 - 34th International Conference on Concurrency Theory TI - Hypernode automata VL - 279 ER -