@article{9558, abstract = {We show that turbulent dynamics that arise in simulations of the three-dimensional Navier--Stokes equations in a triply-periodic domain under sinusoidal forcing can be described as transient visits to the neighborhoods of unstable time-periodic solutions. Based on this description, we reduce the original system with more than 10^5 degrees of freedom to a 17-node Markov chain where each node corresponds to the neighborhood of a periodic orbit. The model accurately reproduces long-term averages of the system's observables as weighted sums over the periodic orbits. }, author = {Yalniz, Gökhan and Hof, Björn and Budanur, Nazmi B}, issn = {1079-7114}, journal = {Physical Review Letters}, number = {24}, publisher = {American Physical Society}, title = {{Coarse graining the state space of a turbulent flow using periodic orbits}}, doi = {10.1103/PhysRevLett.126.244502}, volume = {126}, year = {2021}, } @article{9903, abstract = {Eigenstate thermalization in quantum many-body systems implies that eigenstates at high energy are similar to random vectors. Identifying systems where at least some eigenstates are nonthermal is an outstanding question. In this Letter we show that interacting quantum models that have a nullspace—a degenerate subspace of eigenstates at zero energy (zero modes), which corresponds to infinite temperature, provide a route to nonthermal eigenstates. We analytically show the existence of a zero mode which can be represented as a matrix product state for a certain class of local Hamiltonians. In the more general case we use a subspace disentangling algorithm to generate an orthogonal basis of zero modes characterized by increasing entanglement entropy. We show evidence for an area-law entanglement scaling of the least-entangled zero mode in the broad parameter regime, leading to a conjecture that all local Hamiltonians with the nullspace feature zero modes with area-law entanglement scaling and, as such, break the strong thermalization hypothesis. Finally, we find zero modes in constrained models and propose a setup for observing their experimental signatures.}, author = {Karle, Volker and Serbyn, Maksym and Michailidis, Alexios}, issn = {1079-7114}, journal = {Physical Review Letters}, number = {6}, publisher = {American Physical Society}, title = {{Area-law entangled eigenstates from nullspaces of local Hamiltonians}}, doi = {10.1103/physrevlett.127.060602}, volume = {127}, year = {2021}, } @inproceedings{9356, abstract = {In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime verification to monitors that attempt to estimate numerical values of quantitative trace properties (instead of attempting to conclude boolean values of trace specifications), such as maximal or average response time along a trace. Quantitative monitors are approximate: with every finite prefix, they can improve their estimate of the infinite trace's unknown property value. Consequently, quantitative monitors can be compared with regard to a precision-cost trade-off: better approximations of the property value require more monitor resources, such as states (in the case of finite-state monitors) or registers, and additional resources yield better approximations. We introduce a formal framework for quantitative and approximate monitoring, show how it conservatively generalizes the classical boolean setting for monitoring, and give several precision-cost trade-offs for monitors. For example, we prove that there are quantitative properties for which every additional register improves monitoring precision.}, author = {Henzinger, Thomas A and Sarac, Naci E}, booktitle = {Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science}, location = {Online}, publisher = {Institute of Electrical and Electronics Engineers}, title = {{Quantitative and approximate monitoring}}, doi = {10.1109/LICS52264.2021.9470547}, year = {2021}, } @article{9905, abstract = {Vaccines are thought to be the best available solution for controlling the ongoing SARS-CoV-2 pandemic. However, the emergence of vaccine-resistant strains may come too rapidly for current vaccine developments to alleviate the health, economic and social consequences of the pandemic. To quantify and characterize the risk of such a scenario, we created a SIR-derived model with initial stochastic dynamics of the vaccine-resistant strain to study the probability of its emergence and establishment. Using parameters realistically resembling SARS-CoV-2 transmission, we model a wave-like pattern of the pandemic and consider the impact of the rate of vaccination and the strength of non-pharmaceutical intervention measures on the probability of emergence of a resistant strain. As expected, we found that a fast rate of vaccination decreases the probability of emergence of a resistant strain. Counterintuitively, when a relaxation of non-pharmaceutical interventions happened at a time when most individuals of the population have already been vaccinated the probability of emergence of a resistant strain was greatly increased. Consequently, we show that a period of transmission reduction close to the end of the vaccination campaign can substantially reduce the probability of resistant strain establishment. Our results suggest that policymakers and individuals should consider maintaining non-pharmaceutical interventions and transmission-reducing behaviours throughout the entire vaccination period.}, author = {Rella, Simon and Kulikova, Yuliya A. and Dermitzakis, Emmanouil T. and Kondrashov, Fyodor}, issn = {2045-2322}, journal = {Scientific Reports}, number = {1}, publisher = {Springer Nature}, title = {{Rates of SARS-CoV-2 transmission and vaccination impact the fate of vaccine-resistant strains}}, doi = {10.1038/s41598-021-95025-3}, volume = {11}, year = {2021}, } @article{10067, abstract = {The search for novel entangled phases of matter has lead to the recent discovery of a new class of “entanglement transitions,” exemplified by random tensor networks and monitored quantum circuits. Most known examples can be understood as some classical ordering transitions in an underlying statistical mechanics model, where entanglement maps onto the free-energy cost of inserting a domain wall. In this paper we study the possibility of entanglement transitions driven by physics beyond such statistical mechanics mappings. Motivated by recent applications of neural-network-inspired variational Ansätze, we investigate under what conditions on the variational parameters these Ansätze can capture an entanglement transition. We study the entanglement scaling of short-range restricted Boltzmann machine (RBM) quantum states with random phases. For uncorrelated random phases, we analytically demonstrate the absence of an entanglement transition and reveal subtle finite-size effects in finite-size numerical simulations. Introducing phases with correlations decaying as 1/r^α in real space, we observe three regions with a different scaling of entanglement entropy depending on the exponent α. We study the nature of the transition between these regions, finding numerical evidence for critical behavior. Our work establishes the presence of long-range correlated phases in RBM-based wave functions as a required ingredient for entanglement transitions.}, author = {Medina Ramos, Raimel A and Vasseur, Romain and Serbyn, Maksym}, issn = {2469-9969}, journal = {Physical Review B}, number = {10}, publisher = {American Physical Society}, title = {{Entanglement transitions from restricted Boltzmann machines}}, doi = {10.1103/physrevb.104.104205}, volume = {104}, year = {2021}, } @article{10545, abstract = {Classical models with complex energy landscapes represent a perspective avenue for the near-term application of quantum simulators. Until now, many theoretical works studied the performance of quantum algorithms for models with a unique ground state. However, when the classical problem is in a so-called clustering phase, the ground state manifold is highly degenerate. As an example, we consider a 3-XORSAT model defined on simple hypergraphs. The degeneracy of classical ground state manifold translates into the emergence of an extensive number of Z2 symmetries, which remain intact even in the presence of a quantum transverse magnetic field. We establish a general duality approach that restricts the quantum problem to a given sector of conserved Z2 charges and use it to study how the outcome of the quantum adiabatic algorithm depends on the hypergraph geometry. We show that the tree hypergraph which corresponds to a classically solvable instance of the 3-XORSAT problem features a constant gap, whereas the closed hypergraph encounters a second-order phase transition with a gap vanishing as a power-law in the problem size. The duality developed in this work provides a practical tool for studies of quantum models with classically degenerate energy manifold and reveals potential connections between glasses and gauge theories.}, author = {Medina Ramos, Raimel A and Serbyn, Maksym}, issn = {2469-9934}, journal = {Physical Review A}, number = {6}, publisher = {American Physical Society}, title = {{Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT)}}, doi = {10.1103/physreva.104.062423}, volume = {104}, year = {2021}, } @inproceedings{9345, abstract = {Modeling a crystal as a periodic point set, we present a fingerprint consisting of density functionsthat facilitates the efficient search for new materials and material properties. We prove invarianceunder isometries, continuity, and completeness in the generic case, which are necessary featuresfor the reliable comparison of crystals. The proof of continuity integrates methods from discretegeometry and lattice theory, while the proof of generic completeness combines techniques fromgeometry with analysis. The fingerprint has a fast algorithm based on Brillouin zones and relatedinclusion-exclusion formulae. We have implemented the algorithm and describe its application tocrystal structure prediction.}, author = {Edelsbrunner, Herbert and Heiss, Teresa and Kurlin , Vitaliy and Smith, Philip and Wintraecken, Mathijs}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, issn = {1868-8969}, location = {Virtual}, pages = {32:1--32:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{The density fingerprint of a periodic point set}}, doi = {10.4230/LIPIcs.SoCG.2021.32}, volume = {189}, year = {2021}, } @article{7553, abstract = {Normative theories and statistical inference provide complementary approaches for the study of biological systems. A normative theory postulates that organisms have adapted to efficiently solve essential tasks, and proceeds to mathematically work out testable consequences of such optimality; parameters that maximize the hypothesized organismal function can be derived ab initio, without reference to experimental data. In contrast, statistical inference focuses on efficient utilization of data to learn model parameters, without reference to any a priori notion of biological function, utility, or fitness. Traditionally, these two approaches were developed independently and applied separately. Here we unify them in a coherent Bayesian framework that embeds a normative theory into a family of maximum-entropy “optimization priors.” This family defines a smooth interpolation between a data-rich inference regime (characteristic of “bottom-up” statistical models), and a data-limited ab inito prediction regime (characteristic of “top-down” normative theory). We demonstrate the applicability of our framework using data from the visual cortex, and argue that the flexibility it affords is essential to address a number of fundamental challenges relating to inference and prediction in complex, high-dimensional biological problems.}, author = {Mlynarski, Wiktor F and Hledik, Michal and Sokolowski, Thomas R and Tkačik, Gašper}, journal = {Neuron}, number = {7}, pages = {1227--1241.e5}, publisher = {Cell Press}, title = {{Statistical analysis and optimality of neural systems}}, doi = {10.1016/j.neuron.2021.01.020}, volume = {109}, year = {2021}, } @inproceedings{10408, abstract = {Key trees are often the best solution in terms of transmission cost and storage requirements for managing keys in a setting where a group needs to share a secret key, while being able to efficiently rotate the key material of users (in order to recover from a potential compromise, or to add or remove users). Applications include multicast encryption protocols like LKH (Logical Key Hierarchies) or group messaging like the current IETF proposal TreeKEM. A key tree is a (typically balanced) binary tree, where each node is identified with a key: leaf nodes hold users’ secret keys while the root is the shared group key. For a group of size N, each user just holds log(N) keys (the keys on the path from its leaf to the root) and its entire key material can be rotated by broadcasting 2log(N) ciphertexts (encrypting each fresh key on the path under the keys of its parents). In this work we consider the natural setting where we have many groups with partially overlapping sets of users, and ask if we can find solutions where the cost of rotating a key is better than in the trivial one where we have a separate key tree for each group. We show that in an asymptotic setting (where the number m of groups is fixed while the number N of users grows) there exist more general key graphs whose cost converges to the cost of a single group, thus saving a factor linear in the number of groups over the trivial solution. As our asymptotic “solution” converges very slowly and performs poorly on concrete examples, we propose an algorithm that uses a natural heuristic to compute a key graph for any given group structure. Our algorithm combines two greedy algorithms, and is thus very efficient: it first converts the group structure into a “lattice graph”, which is then turned into a key graph by repeatedly applying the algorithm for constructing a Huffman code. To better understand how far our proposal is from an optimal solution, we prove lower bounds on the update cost of continuous group-key agreement and multicast encryption in a symbolic model admitting (asymmetric) encryption, pseudorandom generators, and secret sharing as building blocks.}, author = {Alwen, Joel F and Auerbach, Benedikt and Baig, Mirza Ahad and Cueto Noval, Miguel and Klein, Karen and Pascual Perez, Guillermo and Pietrzak, Krzysztof Z and Walter, Michael}, booktitle = {19th International Conference}, isbn = {9-783-0309-0455-5}, issn = {1611-3349}, location = {Raleigh, NC, United States}, pages = {222--253}, publisher = {Springer Nature}, title = {{Grafting key trees: Efficient key management for overlapping groups}}, doi = {10.1007/978-3-030-90456-2_8}, volume = {13044}, year = {2021}, } @article{10123, abstract = {Solution synthesis of particles emerged as an alternative to prepare thermoelectric materials with less demanding processing conditions than conventional solid-state synthetic methods. However, solution synthesis generally involves the presence of additional molecules or ions belonging to the precursors or added to enable solubility and/or regulate nucleation and growth. These molecules or ions can end up in the particles as surface adsorbates and interfere in the material properties. This work demonstrates that ionic adsorbates, in particular Na⁺ ions, are electrostatically adsorbed in SnSe particles synthesized in water and play a crucial role not only in directing the material nano/microstructure but also in determining the transport properties of the consolidated material. In dense pellets prepared by sintering SnSe particles, Na remains within the crystal lattice as dopant, in dislocations, precipitates, and forming grain boundary complexions. These results highlight the importance of considering all the possible unintentional impurities to establish proper structure-property relationships and control material properties in solution-processed thermoelectric materials.}, author = {Liu, Yu and Calcabrini, Mariano and Yu, Yuan and Genç, Aziz and Chang, Cheng and Costanzo, Tommaso and Kleinhanns, Tobias and Lee, Seungho and Llorca, Jordi and Cojocaru‐Mirédin, Oana and Ibáñez, Maria}, issn = {1521-4095}, journal = {Advanced Materials}, keywords = {mechanical engineering, mechanics of materials, general materials science}, number = {52}, publisher = {Wiley}, title = {{The importance of surface adsorbates in solution‐processed thermoelectric materials: The case of SnSe}}, doi = {10.1002/adma.202106858}, volume = {33}, year = {2021}, } @article{10806, abstract = {Ligands are a fundamental part of nanocrystals. They control and direct nanocrystal syntheses and provide colloidal stability. Bound ligands also affect the nanocrystals’ chemical reactivity and electronic structure. Surface chemistry is thus crucial to understand nanocrystal properties and functionality. Here, we investigate the synthesis of metal oxide nanocrystals (CeO2-x, ZnO, and NiO) from metal nitrate precursors, in the presence of oleylamine ligands. Surprisingly, the nanocrystals are capped exclusively with a fatty acid instead of oleylamine. Analysis of the reaction mixtures with nuclear magnetic resonance spectroscopy revealed several reaction byproducts and intermediates that are common to the decomposition of Ce, Zn, Ni, and Zr nitrate precursors. Our evidence supports the oxidation of alkylamine and formation of a carboxylic acid, thus unraveling this counterintuitive surface chemistry.}, author = {Calcabrini, Mariano and Van den Eynden, Dietger and Sanchez Ribot, Sergi and Pokratath, Rohan and Llorca, Jordi and De Roo, Jonathan and Ibáñez, Maria}, issn = {2691-3704}, journal = {JACS Au}, keywords = {general medicine}, number = {11}, pages = {1898--1903}, publisher = {American Chemical Society}, title = {{Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate}}, doi = {10.1021/jacsau.1c00349}, volume = {1}, year = {2021}, } @article{9118, abstract = {Cesium lead halides have intrinsically unstable crystal lattices and easily transform within perovskite and nonperovskite structures. In this work, we explore the conversion of the perovskite CsPbBr3 into Cs4PbBr6 in the presence of PbS at 450 °C to produce doped nanocrystal-based composites with embedded Cs4PbBr6 nanoprecipitates. We show that PbBr2 is extracted from CsPbBr3 and diffuses into the PbS lattice with a consequent increase in the concentration of free charge carriers. This new doping strategy enables the adjustment of the density of charge carriers between 1019 and 1020 cm–3, and it may serve as a general strategy for doping other nanocrystal-based semiconductors.}, author = {Calcabrini, Mariano and Genc, Aziz and Liu, Yu and Kleinhanns, Tobias and Lee, Seungho and Dirin, Dmitry N. and Akkerman, Quinten A. and Kovalenko, Maksym V. and Arbiol, Jordi and Ibáñez, Maria}, issn = {2380-8195}, journal = {ACS Energy Letters}, number = {2}, pages = {581--587}, publisher = {American Chemical Society}, title = {{Exploiting the lability of metal halide perovskites for doping semiconductor nanocomposites}}, doi = {10.1021/acsenergylett.0c02448}, volume = {6}, year = {2021}, } @article{8910, abstract = {A semiconducting nanowire fully wrapped by a superconducting shell has been proposed as a platform for obtaining Majorana modes at small magnetic fields. In this study, we demonstrate that the appearance of subgap states in such structures is actually governed by the junction region in tunneling spectroscopy measurements and not the full-shell nanowire itself. Short tunneling regions never show subgap states, whereas longer junctions always do. This can be understood in terms of quantum dots forming in the junction and hosting Andreev levels in the Yu-Shiba-Rusinov regime. The intricate magnetic field dependence of the Andreev levels, through both the Zeeman and Little-Parks effects, may result in robust zero-bias peaks—features that could be easily misinterpreted as originating from Majorana zero modes but are unrelated to topological superconductivity.}, author = {Valentini, Marco and Peñaranda, Fernando and Hofmann, Andrea C and Brauns, Matthias and Hauschild, Robert and Krogstrup, Peter and San-Jose, Pablo and Prada, Elsa and Aguado, Ramón and Katsaros, Georgios}, issn = {1095-9203}, journal = {Science}, number = {6550}, publisher = {American Association for the Advancement of Science}, title = {{Nontopological zero-bias peaks in full-shell nanowires induced by flux-tunable Andreev states}}, doi = {10.1126/science.abf1513}, volume = {373}, year = {2021}, } @inproceedings{10414, abstract = {We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in LexRSM not existing even for simple terminating programs. Our contributions are twofold: First, we introduce a generalization of LexRSMs which allows for some components to be negative. This standard feature of non-probabilistic termination proofs was hitherto not known to be sound in the probabilistic setting, as the soundness proof requires a careful analysis of the underlying stochastic process. Second, we present polynomial-time algorithms using our generalized LexRSMs for proving a.s. termination in broad classes of linear-arithmetic programs.}, author = {Chatterjee, Krishnendu and Kafshdar Goharshadi, Ehsan and Novotný, Petr and Zárevúcky, Jiří and Zikelic, Dorde}, booktitle = {24th International Symposium on Formal Methods}, isbn = {9-783-0309-0869-0}, issn = {1611-3349}, location = {Virtual}, pages = {619--639}, publisher = {Springer Nature}, title = {{On lexicographic proof rules for probabilistic termination}}, doi = {10.1007/978-3-030-90870-6_33}, volume = {13047}, year = {2021}, } @inproceedings{9644, abstract = {We present a new approach to proving non-termination of non-deterministic integer programs. Our technique is rather simple but efficient. It relies on a purely syntactic reversal of the program's transition system followed by a constraint-based invariant synthesis with constraints coming from both the original and the reversed transition system. The latter task is performed by a simple call to an off-the-shelf SMT-solver, which allows us to leverage the latest advances in SMT-solving. Moreover, our method offers a combination of features not present (as a whole) in previous approaches: it handles programs with non-determinism, provides relative completeness guarantees and supports programs with polynomial arithmetic. The experiments performed with our prototype tool RevTerm show that our approach, despite its simplicity and stronger theoretical guarantees, is at least on par with the state-of-the-art tools, often achieving a non-trivial improvement under a proper configuration of its parameters.}, author = {Chatterjee, Krishnendu and Goharshady, Ehsan Kafshdar and Novotný, Petr and Zikelic, Dorde}, booktitle = {Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation}, isbn = {9781450383912}, location = {Online}, pages = {1033--1048}, publisher = {Association for Computing Machinery}, title = {{Proving non-termination by program reversal}}, doi = {10.1145/3453483.3454093}, year = {2021}, } @inproceedings{11458, abstract = {The increasing computational requirements of deep neural networks (DNNs) have led to significant interest in obtaining DNN models that are sparse, yet accurate. Recent work has investigated the even harder case of sparse training, where the DNN weights are, for as much as possible, already sparse to reduce computational costs during training. Existing sparse training methods are often empirical and can have lower accuracy relative to the dense baseline. In this paper, we present a general approach called Alternating Compressed/DeCompressed (AC/DC) training of DNNs, demonstrate convergence for a variant of the algorithm, and show that AC/DC outperforms existing sparse training methods in accuracy at similar computational budgets; at high sparsity levels, AC/DC even outperforms existing methods that rely on accurate pre-trained dense models. An important property of AC/DC is that it allows co-training of dense and sparse models, yielding accurate sparse–dense model pairs at the end of the training process. This is useful in practice, where compressed variants may be desirable for deployment in resource-constrained settings without re-doing the entire training flow, and also provides us with insights into the accuracy gap between dense and compressed models. The code is available at: https://github.com/IST-DASLab/ACDC.}, author = {Peste, Elena-Alexandra and Iofinova, Eugenia B and Vladu, Adrian and Alistarh, Dan-Adrian}, booktitle = {35th Conference on Neural Information Processing Systems}, isbn = {9781713845393}, issn = {1049-5258}, location = {Virtual, Online}, pages = {8557--8570}, publisher = {Neural Information Processing Systems Foundation}, title = {{AC/DC: Alternating Compressed/DeCompressed training of deep neural networks}}, volume = {34}, year = {2021}, } @inproceedings{9969, abstract = {Payment channel networks are a promising approach to improve the scalability of cryptocurrencies: they allow to perform transactions in a peer-to-peer fashion, along multihop routes in the network, without requiring consensus on the blockchain. However, during the discovery of cost-efficient routes for the transaction, critical information may be revealed about the transacting entities. This paper initiates the study of privacy-preserving route discovery mechanisms for payment channel networks. In particular, we present LightPIR, an approach which allows a client to learn the shortest (or cheapest in terms of fees) path between two nodes without revealing any information about the endpoints of the transaction to the servers. The two main observations which allow for an efficient solution in LightPIR are that: (1) surprisingly, hub labelling algorithms – which were developed to preprocess “street network like” graphs so one can later efficiently compute shortest paths – also perform well for the graphs underlying payment channel networks, and that (2) hub labelling algorithms can be conveniently combined with private information retrieval. LightPIR relies on a simple hub labeling heuristic on top of existing hub labeling algorithms which leverages the specific topological features of cryptocurrency networks to further minimize storage and bandwidth overheads. In a case study considering the Lightning network, we show that our approach is an order of magnitude more efficient compared to a privacy-preserving baseline based on using private information retrieval on a database that stores all pairs shortest paths.}, author = {Pietrzak, Krzysztof Z and Salem, Iosif and Schmid, Stefan and Yeo, Michelle X}, isbn = {978-1-6654-4501-6}, issn = {1861-2288}, location = {Espoo and Helsinki, Finland}, publisher = {IEEE}, title = {{LightPIR: Privacy-preserving route discovery for payment channel networks}}, doi = {10.23919/IFIPNetworking52078.2021.9472205}, year = {2021}, } @article{9394, abstract = {Chromosomal inversions have long been recognized for their role in local adaptation. By suppressing recombination in heterozygous individuals, they can maintain coadapted gene complexes and protect them from homogenizing effects of gene flow. However, to fully understand their importance for local adaptation we need to know their influence on phenotypes under divergent selection. For this, the marine snail Littorina saxatilis provides an ideal study system. Divergent ecotypes adapted to wave action and crab predation occur in close proximity on intertidal shores with gene flow between them. Here, we used F2 individuals obtained from crosses between the ecotypes to test for associations between genomic regions and traits distinguishing the Crab‐/Wave‐adapted ecotypes including size, shape, shell thickness, and behavior. We show that most of these traits are influenced by two previously detected inversion regions that are divergent between ecotypes. We thus gain a better understanding of one important underlying mechanism responsible for the rapid and repeated formation of ecotypes: divergent selection acting on inversions. We also found that some inversions contributed to more than one trait suggesting that they may contain several loci involved in adaptation, consistent with the hypothesis that suppression of recombination within inversions facilitates differentiation in the presence of gene flow.}, author = {Koch, Eva L. and Morales, Hernán E. and Larsson, Jenny and Westram, Anja M and Faria, Rui and Lemmon, Alan R. and Lemmon, E. Moriarty and Johannesson, Kerstin and Butlin, Roger K.}, issn = {2056-3744}, journal = {Evolution Letters}, number = {3}, pages = {196--213}, publisher = {Wiley}, title = {{Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis}}, doi = {10.1002/evl3.227}, volume = {5}, year = {2021}, } @misc{12987, abstract = {Chromosomal inversion polymorphisms, segments of chromosomes that are flipped in orientation and occur in reversed order in some individuals, have long been recognized to play an important role in local adaptation. They can reduce recombination in heterozygous individuals and thus help to maintain sets of locally adapted alleles. In a wide range of organisms, populations adapted to different habitats differ in frequency of inversion arrangements. However, getting a full understanding of the importance of inversions for adaptation requires confirmation of their influence on traits under divergent selection. Here, we studied a marine snail, Littorina saxatilis, that has evolved ecotypes adapted to wave exposure or crab predation. These two types occur in close proximity on different parts of the shore. Gene flow between them exists in contact zones. However, they exhibit strong phenotypic divergence in several traits under habitat-specific selection, including size, shape and behaviour. We used crosses between these ecotypes to identify genomic regions that explain variation in these traits by using QTL analysis and variance partitioning across linkage groups. We could show that previously detected inversion regions contribute to adaptive divergence. Some inversions influenced multiple traits suggesting that they contain sets of locally adaptive alleles. Our study also identified regions without known inversions that are important for phenotypic divergence. Thus, we provide a more complete overview of the importance of inversions in relation to the remaining genome.}, author = {Koch, Eva and Morales, Hernán E. and Larsson, Jenny and Westram, Anja M and Faria, Rui and Lemmon, Alan R. and Lemmon, E. Moriarty and Johannesson, Kerstin and Butlin, Roger K.}, publisher = {Dryad}, title = {{Data from: Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis}}, doi = {10.5061/DRYAD.ZGMSBCCB4}, year = {2021}, } @article{9350, abstract = {Intercellular adhesion is the key to multicellularity, and its malfunction plays an important role in various developmental and disease-related processes. Although it has been intensively studied by both biologists and physicists, a commonly accepted definition of cell-cell adhesion is still being debated. Cell-cell adhesion has been described at the molecular scale as a function of adhesion receptors controlling binding affinity, at the cellular scale as resistance to detachment forces or modulation of surface tension, and at the tissue scale as a regulator of cellular rearrangements and morphogenesis. In this review, we aim to summarize and discuss recent advances in the molecular, cellular, and theoretical description of cell-cell adhesion, ranging from biomimetic models to the complexity of cells and tissues in an organismal context. In particular, we will focus on cadherin-mediated cell-cell adhesion and the role of adhesion signaling and mechanosensation therein, two processes central for understanding the biological and physical basis of cell-cell adhesion.}, author = {Arslan, Feyza N and Eckert, Julia and Schmidt, Thomas and Heisenberg, Carl-Philipp J}, issn = {1542-0086}, journal = {Biophysical Journal}, pages = {4182--4192}, publisher = {Biophysical Society}, title = {{Holding it together: when cadherin meets cadherin}}, doi = {10.1016/j.bpj.2021.03.025}, volume = {120}, year = {2021}, }