[{"publication_identifier":{"eissn":["13616544"],"issn":["09517715"]},"publication_status":"published","file":[{"file_size":1223899,"date_updated":"2020-10-27T12:09:57Z","creator":"cziletti","file_name":"2020_Nonlinearity_Fischer.pdf","date_created":"2020-10-27T12:09:57Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"8710","checksum":"ed90bc6eb5f32ee6157fef7f3aabc057"}],"language":[{"iso":"eng"}],"volume":33,"issue":"11","license":"https://creativecommons.org/licenses/by/3.0/","abstract":[{"lang":"eng","text":"In the computation of the material properties of random alloys, the method of 'special quasirandom structures' attempts to approximate the properties of the alloy on a finite volume with higher accuracy by replicating certain statistics of the random atomic lattice in the finite volume as accurately as possible. In the present work, we provide a rigorous justification for a variant of this method in the framework of the Thomas–Fermi–von Weizsäcker (TFW) model. Our approach is based on a recent analysis of a related variance reduction method in stochastic homogenization of linear elliptic PDEs and the locality properties of the TFW model. Concerning the latter, we extend an exponential locality result by Nazar and Ortner to include point charges, a result that may be of independent interest."}],"oa_version":"Published Version","scopus_import":"1","month":"11","intvolume":" 33","date_updated":"2023-08-22T10:38:38Z","ddc":["510"],"department":[{"_id":"JuFi"}],"file_date_updated":"2020-10-27T12:09:57Z","_id":"8697","article_type":"original","type":"journal_article","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"status":"public","isi":1,"has_accepted_license":"1","year":"2020","day":"01","publication":"Nonlinearity","page":"5733-5772","date_published":"2020-11-01T00:00:00Z","doi":"10.1088/1361-6544/ab9728","date_created":"2020-10-25T23:01:16Z","quality_controlled":"1","publisher":"IOP Publishing","oa":1,"citation":{"chicago":"Fischer, Julian L, and Michael Kniely. “Variance Reduction for Effective Energies of Random Lattices in the Thomas-Fermi-von Weizsäcker Model.” Nonlinearity. IOP Publishing, 2020. https://doi.org/10.1088/1361-6544/ab9728.","ista":"Fischer JL, Kniely M. 2020. Variance reduction for effective energies of random lattices in the Thomas-Fermi-von Weizsäcker model. Nonlinearity. 33(11), 5733–5772.","mla":"Fischer, Julian L., and Michael Kniely. “Variance Reduction for Effective Energies of Random Lattices in the Thomas-Fermi-von Weizsäcker Model.” Nonlinearity, vol. 33, no. 11, IOP Publishing, 2020, pp. 5733–72, doi:10.1088/1361-6544/ab9728.","ieee":"J. L. Fischer and M. Kniely, “Variance reduction for effective energies of random lattices in the Thomas-Fermi-von Weizsäcker model,” Nonlinearity, vol. 33, no. 11. IOP Publishing, pp. 5733–5772, 2020.","short":"J.L. Fischer, M. Kniely, Nonlinearity 33 (2020) 5733–5772.","ama":"Fischer JL, Kniely M. Variance reduction for effective energies of random lattices in the Thomas-Fermi-von Weizsäcker model. Nonlinearity. 2020;33(11):5733-5772. doi:10.1088/1361-6544/ab9728","apa":"Fischer, J. L., & Kniely, M. (2020). Variance reduction for effective energies of random lattices in the Thomas-Fermi-von Weizsäcker model. Nonlinearity. IOP Publishing. https://doi.org/10.1088/1361-6544/ab9728"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"orcid":"0000-0002-0479-558X","full_name":"Fischer, Julian L","last_name":"Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","first_name":"Julian L"},{"last_name":"Kniely","orcid":"0000-0001-5645-4333","full_name":"Kniely, Michael","id":"2CA2C08C-F248-11E8-B48F-1D18A9856A87","first_name":"Michael"}],"external_id":{"arxiv":["1906.12245"],"isi":["000576492700001"]},"article_processing_charge":"Yes (via OA deal)","title":"Variance reduction for effective energies of random lattices in the Thomas-Fermi-von Weizsäcker model"},{"page":"113-116","date_created":"2020-10-19T14:09:38Z","doi":"10.1126/science.aba6637","date_published":"2020-10-02T00:00:00Z","year":"2020","isi":1,"publication":"Science","day":"02","oa":1,"publisher":"American Association for the Advancement of Science","quality_controlled":"1","acknowledgement":"We thank the members of the Megason and Heisenberg labs for critical discussions of and technical assistance during the work and B. Appel, S. Holley, J. Jontes, and D. Gilmour for transgenic fish. This work is supported by the Damon Runyon Cancer Foundation, a NICHD K99 fellowship (1K99HD092623), a Travelling Fellowship of the Company of Biologists, a Collaborative Research grant from the Burroughs Wellcome Foundation (T.Y.-C.T.), NIH grant 01GM107733 (T.Y.-C.T. and S.G.M.), NIH grant R01NS102322 (T.C.-C. and H.K.), and an ERC advanced grant\r\n(MECSPEC) (C.-P.H.).","article_processing_charge":"No","external_id":{"isi":["000579169000053"]},"author":[{"last_name":"Tsai","full_name":"Tsai, Tony Y.-C.","first_name":"Tony Y.-C."},{"full_name":"Sikora, Mateusz K","last_name":"Sikora","first_name":"Mateusz K","id":"2F74BCDE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Xia","orcid":"0000-0002-5419-7756","full_name":"Xia, Peng","first_name":"Peng","id":"4AB6C7D0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Colak-Champollion","full_name":"Colak-Champollion, Tugba","first_name":"Tugba"},{"first_name":"Holger","full_name":"Knaut, Holger","last_name":"Knaut"},{"orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sean G.","last_name":"Megason","full_name":"Megason, Sean G."}],"title":"An adhesion code ensures robust pattern formation during tissue morphogenesis","citation":{"ista":"Tsai TY-C, Sikora MK, Xia P, Colak-Champollion T, Knaut H, Heisenberg C-PJ, Megason SG. 2020. An adhesion code ensures robust pattern formation during tissue morphogenesis. Science. 370(6512), 113–116.","chicago":"Tsai, Tony Y.-C., Mateusz K Sikora, Peng Xia, Tugba Colak-Champollion, Holger Knaut, Carl-Philipp J Heisenberg, and Sean G. Megason. “An Adhesion Code Ensures Robust Pattern Formation during Tissue Morphogenesis.” Science. American Association for the Advancement of Science, 2020. https://doi.org/10.1126/science.aba6637.","ieee":"T. Y.-C. Tsai et al., “An adhesion code ensures robust pattern formation during tissue morphogenesis,” Science, vol. 370, no. 6512. American Association for the Advancement of Science, pp. 113–116, 2020.","short":"T.Y.-C. Tsai, M.K. Sikora, P. Xia, T. Colak-Champollion, H. Knaut, C.-P.J. Heisenberg, S.G. Megason, Science 370 (2020) 113–116.","apa":"Tsai, T. Y.-C., Sikora, M. K., Xia, P., Colak-Champollion, T., Knaut, H., Heisenberg, C.-P. J., & Megason, S. G. (2020). An adhesion code ensures robust pattern formation during tissue morphogenesis. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.aba6637","ama":"Tsai TY-C, Sikora MK, Xia P, et al. An adhesion code ensures robust pattern formation during tissue morphogenesis. Science. 2020;370(6512):113-116. doi:10.1126/science.aba6637","mla":"Tsai, Tony Y. C., et al. “An Adhesion Code Ensures Robust Pattern Formation during Tissue Morphogenesis.” Science, vol. 370, no. 6512, American Association for the Advancement of Science, 2020, pp. 113–16, doi:10.1126/science.aba6637."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"call_identifier":"H2020","_id":"260F1432-B435-11E9-9278-68D0E5697425","name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation","grant_number":"742573"}],"ec_funded":1,"issue":"6512","related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/sticking-together/"}]},"volume":370,"publication_status":"published","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.biorxiv.org/content/10.1101/803635v1","open_access":"1"}],"scopus_import":"1","intvolume":" 370","month":"10","abstract":[{"text":"Animal development entails the organization of specific cell types in space and time, and spatial patterns must form in a robust manner. In the zebrafish spinal cord, neural progenitors form stereotypic patterns despite noisy morphogen signaling and large-scale cellular rearrangements during morphogenesis and growth. By directly measuring adhesion forces and preferences for three types of endogenous neural progenitors, we provide evidence for the differential adhesion model in which differences in intercellular adhesion mediate cell sorting. Cell type–specific combinatorial expression of different classes of cadherins (N-cadherin, cadherin 11, and protocadherin 19) results in homotypic preference ex vivo and patterning robustness in vivo. Furthermore, the differential adhesion code is regulated by the sonic hedgehog morphogen gradient. We propose that robust patterning during tissue morphogenesis results from interplay between adhesion-based self-organization and morphogen-directed patterning.","lang":"eng"}],"oa_version":"Preprint","department":[{"_id":"CaHe"}],"date_updated":"2023-08-22T10:36:35Z","article_type":"original","type":"journal_article","keyword":["Multidisciplinary"],"status":"public","_id":"8680"},{"title":"CHESS enables quantitative comparison of chromatin contact data and automatic feature extraction","author":[{"full_name":" Galan, Silvia","last_name":" Galan","first_name":"Silvia"},{"id":"3591A0AA-F248-11E8-B48F-1D18A9856A87","first_name":"Nick N","full_name":"Machnik, Nick N","orcid":"0000-0001-6617-9742","last_name":"Machnik"},{"first_name":"Kai","last_name":"Kruse","full_name":"Kruse, Kai"},{"last_name":"Díaz","full_name":"Díaz, Noelia","first_name":"Noelia"},{"first_name":"Marc A","last_name":"Marti-Renom","full_name":"Marti-Renom, Marc A"},{"full_name":"Vaquerizas, Juan M","last_name":"Vaquerizas","first_name":"Juan M"}],"external_id":{"isi":["000579693500004"],"pmid":["33077914"]},"article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Galan, Silvia, et al. “CHESS Enables Quantitative Comparison of Chromatin Contact Data and Automatic Feature Extraction.” Nature Genetics, vol. 52, Springer Nature, 2020, pp. 1247–55, doi:10.1038/s41588-020-00712-y.","ama":"Galan S, Machnik NN, Kruse K, Díaz N, Marti-Renom MA, Vaquerizas JM. CHESS enables quantitative comparison of chromatin contact data and automatic feature extraction. Nature Genetics. 2020;52:1247-1255. doi:10.1038/s41588-020-00712-y","apa":"Galan, S., Machnik, N. N., Kruse, K., Díaz, N., Marti-Renom, M. A., & Vaquerizas, J. M. (2020). CHESS enables quantitative comparison of chromatin contact data and automatic feature extraction. Nature Genetics. Springer Nature. https://doi.org/10.1038/s41588-020-00712-y","ieee":"S. Galan, N. N. Machnik, K. Kruse, N. Díaz, M. A. Marti-Renom, and J. M. Vaquerizas, “CHESS enables quantitative comparison of chromatin contact data and automatic feature extraction,” Nature Genetics, vol. 52. Springer Nature, pp. 1247–1255, 2020.","short":"S. Galan, N.N. Machnik, K. Kruse, N. Díaz, M.A. Marti-Renom, J.M. Vaquerizas, Nature Genetics 52 (2020) 1247–1255.","chicago":"Galan, Silvia, Nick N Machnik, Kai Kruse, Noelia Díaz, Marc A Marti-Renom, and Juan M Vaquerizas. “CHESS Enables Quantitative Comparison of Chromatin Contact Data and Automatic Feature Extraction.” Nature Genetics. Springer Nature, 2020. https://doi.org/10.1038/s41588-020-00712-y.","ista":"Galan S, Machnik NN, Kruse K, Díaz N, Marti-Renom MA, Vaquerizas JM. 2020. CHESS enables quantitative comparison of chromatin contact data and automatic feature extraction. Nature Genetics. 52, 1247–1255."},"doi":"10.1038/s41588-020-00712-y","date_published":"2020-10-19T00:00:00Z","date_created":"2020-10-25T23:01:20Z","page":"1247-1255","day":"19","publication":"Nature Genetics","isi":1,"year":"2020","publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"Work in the Vaquerizas laboratory is funded by the Max Planck Society, the Deutsche Forschungsgemeinschaft (DFG) Priority Programme SPP 2202 ‘Spatial Genome Architecture in Development and Disease’ (project no. 422857230 to J.M.V.), the DFG Clinical Research Unit CRU326 ‘Male Germ Cells: from Genes to Function’ (project no. 329621271 to J.M.V.), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 643062—ZENCODE-ITN to J.M.V.) and the Medical Research Council in the UK. This research was partially funded by the European Union’s H2020 Framework Programme through the European Research Council (grant no. 609989 to M.A.M.-R.). We thank the support of the Spanish Ministerio de Ciencia, Innovación y Universidades through grant no. BFU2017-85926-P to M.A.M.-R. The Centre for Genomic Regulation thanks the support of the Ministerio de Ciencia, Innovación y Universidades to the European Molecular Biology Laboratory partnership, the ‘Centro de Excelencia Severo Ochoa 2013–2017’, agreement no. SEV-2012-0208, the CERCA Programme/Generalitat de Catalunya, Spanish Ministerio de Ciencia, Innovación y Universidades through the Instituto de Salud Carlos III, the Generalitat de Catalunya through the Departament de Salut and Departament d’Empresa i Coneixement and cofinancing by the Spanish Ministerio de Ciencia, Innovación y Universidades with funds from the European Regional Development Fund corresponding to the 2014–2020 Smart Growth Operating Program. S.G. thanks the support from the Company of Biologists (grant no. JCSTF181158) and the European Molecular Biology Organization Short-Term Fellowship programme.","department":[{"_id":"FyKo"}],"date_updated":"2023-08-22T10:37:10Z","status":"public","article_type":"original","type":"journal_article","_id":"8707","volume":52,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["10614036"],"eissn":["15461718"]},"publication_status":"published","month":"10","intvolume":" 52","scopus_import":"1","pmid":1,"oa_version":"None","abstract":[{"text":"Dynamic changes in the three-dimensional (3D) organization of chromatin are associated with central biological processes, such as transcription, replication and development. Therefore, the comprehensive identification and quantification of these changes is fundamental to understanding of evolutionary and regulatory mechanisms. Here, we present Comparison of Hi-C Experiments using Structural Similarity (CHESS), an algorithm for the comparison of chromatin contact maps and automatic differential feature extraction. We demonstrate the robustness of CHESS to experimental variability and showcase its biological applications on (1) interspecies comparisons of syntenic regions in human and mouse models; (2) intraspecies identification of conformational changes in Zelda-depleted Drosophila embryos; (3) patient-specific aberrant chromatin conformation in a diffuse large B-cell lymphoma sample; and (4) the systematic identification of chromatin contact differences in high-resolution Capture-C data. In summary, CHESS is a computationally efficient method for the comparison and classification of changes in chromatin contact data.","lang":"eng"}]},{"intvolume":" 2","month":"10","scopus_import":"1","oa_version":"None","abstract":[{"lang":"eng","text":"A central goal of artificial intelligence in high-stakes decision-making applications is to design a single algorithm that simultaneously expresses generalizability by learning coherent representations of their world and interpretable explanations of its dynamics. Here, we combine brain-inspired neural computation principles and scalable deep learning architectures to design compact neural controllers for task-specific compartments of a full-stack autonomous vehicle control system. We discover that a single algorithm with 19 control neurons, connecting 32 encapsulated input features to outputs by 253 synapses, learns to map high-dimensional inputs into steering commands. This system shows superior generalizability, interpretability and robustness compared with orders-of-magnitude larger black-box learning systems. The obtained neural agents enable high-fidelity autonomy for task-specific parts of a complex autonomous system."}],"volume":2,"related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/new-deep-learning-models/"}]},"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["2522-5839"]},"status":"public","type":"journal_article","article_type":"original","_id":"8679","department":[{"_id":"ToHe"}],"date_updated":"2023-08-22T10:36:06Z","quality_controlled":"1","publisher":"Springer Nature","date_created":"2020-10-19T13:46:06Z","doi":"10.1038/s42256-020-00237-3","date_published":"2020-10-01T00:00:00Z","page":"642-652","publication":"Nature Machine Intelligence","day":"01","year":"2020","isi":1,"project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"title":"Neural circuit policies enabling auditable autonomy","article_processing_charge":"No","external_id":{"isi":["000583337200011"]},"author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"first_name":"Alexander","last_name":"Amini","full_name":"Amini, Alexander"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"chicago":"Lechner, Mathias, Ramin Hasani, Alexander Amini, Thomas A Henzinger, Daniela Rus, and Radu Grosu. “Neural Circuit Policies Enabling Auditable Autonomy.” Nature Machine Intelligence. Springer Nature, 2020. https://doi.org/10.1038/s42256-020-00237-3.","ista":"Lechner M, Hasani R, Amini A, Henzinger TA, Rus D, Grosu R. 2020. Neural circuit policies enabling auditable autonomy. Nature Machine Intelligence. 2, 642–652.","mla":"Lechner, Mathias, et al. “Neural Circuit Policies Enabling Auditable Autonomy.” Nature Machine Intelligence, vol. 2, Springer Nature, 2020, pp. 642–52, doi:10.1038/s42256-020-00237-3.","ama":"Lechner M, Hasani R, Amini A, Henzinger TA, Rus D, Grosu R. Neural circuit policies enabling auditable autonomy. Nature Machine Intelligence. 2020;2:642-652. doi:10.1038/s42256-020-00237-3","apa":"Lechner, M., Hasani, R., Amini, A., Henzinger, T. A., Rus, D., & Grosu, R. (2020). Neural circuit policies enabling auditable autonomy. Nature Machine Intelligence. Springer Nature. https://doi.org/10.1038/s42256-020-00237-3","short":"M. Lechner, R. Hasani, A. Amini, T.A. Henzinger, D. Rus, R. Grosu, Nature Machine Intelligence 2 (2020) 642–652.","ieee":"M. Lechner, R. Hasani, A. Amini, T. A. Henzinger, D. Rus, and R. Grosu, “Neural circuit policies enabling auditable autonomy,” Nature Machine Intelligence, vol. 2. Springer Nature, pp. 642–652, 2020."}},{"project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"article_number":"102201","author":[{"last_name":"Zhang","full_name":"Zhang, Haonan","first_name":"Haonan","id":"D8F41E38-9E66-11E9-A9E2-65C2E5697425"}],"article_processing_charge":"No","external_id":{"isi":["000578529200001"],"arxiv":["2007.06644"]},"title":"Equality conditions of data processing inequality for α-z Rényi relative entropies","citation":{"mla":"Zhang, Haonan. “Equality Conditions of Data Processing Inequality for α-z Rényi Relative Entropies.” Journal of Mathematical Physics, vol. 61, no. 10, 102201, AIP Publishing, 2020, doi:10.1063/5.0022787.","short":"H. Zhang, Journal of Mathematical Physics 61 (2020).","ieee":"H. Zhang, “Equality conditions of data processing inequality for α-z Rényi relative entropies,” Journal of Mathematical Physics, vol. 61, no. 10. AIP Publishing, 2020.","ama":"Zhang H. Equality conditions of data processing inequality for α-z Rényi relative entropies. Journal of Mathematical Physics. 2020;61(10). doi:10.1063/5.0022787","apa":"Zhang, H. (2020). Equality conditions of data processing inequality for α-z Rényi relative entropies. Journal of Mathematical Physics. AIP Publishing. https://doi.org/10.1063/5.0022787","chicago":"Zhang, Haonan. “Equality Conditions of Data Processing Inequality for α-z Rényi Relative Entropies.” Journal of Mathematical Physics. AIP Publishing, 2020. https://doi.org/10.1063/5.0022787.","ista":"Zhang H. 2020. Equality conditions of data processing inequality for α-z Rényi relative entropies. Journal of Mathematical Physics. 61(10), 102201."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","quality_controlled":"1","publisher":"AIP Publishing","oa":1,"acknowledgement":"This research was supported by the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 754411. The author would like to thank Anna Vershynina and Sarah Chehade for their helpful comments.","doi":"10.1063/5.0022787","date_published":"2020-10-01T00:00:00Z","date_created":"2020-10-18T22:01:36Z","isi":1,"year":"2020","day":"01","publication":"Journal of Mathematical Physics","type":"journal_article","article_type":"original","status":"public","_id":"8670","department":[{"_id":"JaMa"}],"date_updated":"2023-08-22T10:32:29Z","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/2007.06644","open_access":"1"}],"month":"10","intvolume":" 61","abstract":[{"text":"The α–z Rényi relative entropies are a two-parameter family of Rényi relative entropies that are quantum generalizations of the classical α-Rényi relative entropies. In the work [Adv. Math. 365, 107053 (2020)], we decided the full range of (α, z) for which the data processing inequality (DPI) is valid. In this paper, we give algebraic conditions for the equality in DPI. For the full range of parameters (α, z), we give necessary conditions and sufficient conditions. For most parameters, we give equivalent conditions. This generalizes and strengthens the results of Leditzky et al. [Lett. Math. Phys. 107, 61–80 (2017)].","lang":"eng"}],"oa_version":"Preprint","volume":61,"issue":"10","ec_funded":1,"publication_identifier":{"issn":["00222488"]},"publication_status":"published","language":[{"iso":"eng"}]},{"ddc":["570"],"date_updated":"2023-08-22T12:11:23Z","department":[{"_id":"GaTk"}],"file_date_updated":"2020-10-27T14:57:50Z","_id":"8698","status":"public","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"type":"journal_article","article_type":"original","language":[{"iso":"eng"}],"file":[{"creator":"cziletti","file_size":1755359,"date_updated":"2020-10-27T14:57:50Z","file_name":"2020_PNAS_Maoz.pdf","date_created":"2020-10-27T14:57:50Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"8713","checksum":"c6a24fdecf3f28faf447078e7a274a88"}],"publication_status":"published","publication_identifier":{"eissn":["10916490"],"issn":["00278424"]},"volume":117,"issue":"40","oa_version":"Published Version","pmid":1,"abstract":[{"text":"The brain represents and reasons probabilistically about complex stimuli and motor actions using a noisy, spike-based neural code. A key building block for such neural computations, as well as the basis for supervised and unsupervised learning, is the ability to estimate the surprise or likelihood of incoming high-dimensional neural activity patterns. Despite progress in statistical modeling of neural responses and deep learning, current approaches either do not scale to large neural populations or cannot be implemented using biologically realistic mechanisms. Inspired by the sparse and random connectivity of real neuronal circuits, we present a model for neural codes that accurately estimates the likelihood of individual spiking patterns and has a straightforward, scalable, efficient, learnable, and realistic neural implementation. This model’s performance on simultaneously recorded spiking activity of >100 neurons in the monkey visual and prefrontal cortices is comparable with or better than that of state-of-the-art models. Importantly, the model can be learned using a small number of samples and using a local learning rule that utilizes noise intrinsic to neural circuits. Slower, structural changes in random connectivity, consistent with rewiring and pruning processes, further improve the efficiency and sparseness of the resulting neural representations. Our results merge insights from neuroanatomy, machine learning, and theoretical neuroscience to suggest random sparse connectivity as a key design principle for neuronal computation.","lang":"eng"}],"intvolume":" 117","month":"10","scopus_import":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Maoz, Ori, et al. “Learning Probabilistic Neural Representations with Randomly Connected Circuits.” Proceedings of the National Academy of Sciences of the United States of America, vol. 117, no. 40, National Academy of Sciences, 2020, pp. 25066–73, doi:10.1073/pnas.1912804117.","ieee":"O. Maoz, G. Tkačik, M. S. Esteki, R. Kiani, and E. Schneidman, “Learning probabilistic neural representations with randomly connected circuits,” Proceedings of the National Academy of Sciences of the United States of America, vol. 117, no. 40. National Academy of Sciences, pp. 25066–25073, 2020.","short":"O. Maoz, G. Tkačik, M.S. Esteki, R. Kiani, E. Schneidman, Proceedings of the National Academy of Sciences of the United States of America 117 (2020) 25066–25073.","apa":"Maoz, O., Tkačik, G., Esteki, M. S., Kiani, R., & Schneidman, E. (2020). Learning probabilistic neural representations with randomly connected circuits. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.1912804117","ama":"Maoz O, Tkačik G, Esteki MS, Kiani R, Schneidman E. Learning probabilistic neural representations with randomly connected circuits. Proceedings of the National Academy of Sciences of the United States of America. 2020;117(40):25066-25073. doi:10.1073/pnas.1912804117","chicago":"Maoz, Ori, Gašper Tkačik, Mohamad Saleh Esteki, Roozbeh Kiani, and Elad Schneidman. “Learning Probabilistic Neural Representations with Randomly Connected Circuits.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2020. https://doi.org/10.1073/pnas.1912804117.","ista":"Maoz O, Tkačik G, Esteki MS, Kiani R, Schneidman E. 2020. Learning probabilistic neural representations with randomly connected circuits. Proceedings of the National Academy of Sciences of the United States of America. 117(40), 25066–25073."},"title":"Learning probabilistic neural representations with randomly connected circuits","article_processing_charge":"No","external_id":{"isi":["000579045200012"],"pmid":["32948691"]},"author":[{"first_name":"Ori","full_name":"Maoz, Ori","last_name":"Maoz"},{"full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455","last_name":"Tkačik","first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mohamad Saleh","last_name":"Esteki","full_name":"Esteki, Mohamad Saleh"},{"last_name":"Kiani","full_name":"Kiani, Roozbeh","first_name":"Roozbeh"},{"first_name":"Elad","full_name":"Schneidman, Elad","last_name":"Schneidman"}],"publication":"Proceedings of the National Academy of Sciences of the United States of America","day":"06","year":"2020","isi":1,"has_accepted_license":"1","date_created":"2020-10-25T23:01:16Z","date_published":"2020-10-06T00:00:00Z","doi":"10.1073/pnas.1912804117","page":"25066-25073","acknowledgement":"We thank Udi Karpas, Roy Harpaz, Tal Tamir, Adam Haber, and Amir Bar for discussions and suggestions; and especially Oren Forkosh and Walter Senn for invaluable discussions of the learning rule. This work was supported by European Research Council Grant 311238 (to E.S.) and Israel Science Foundation Grant 1629/12 (to E.S.); as well as research support from Martin Kushner Schnur and Mr. and Mrs. Lawrence Feis (E.S.); National Institute of Mental Health Grant R01MH109180 (to R.K.); a Pew Scholarship in Biomedical Sciences (to R.K.); Simons Collaboration on the Global Brain Grant 542997 (to R.K. and E.S.); and a CRCNS (Collaborative Research in Computational Neuroscience) grant (to R.K. and E.S.).","oa":1,"publisher":"National Academy of Sciences","quality_controlled":"1"},{"date_updated":"2023-08-22T10:40:15Z","ddc":["000"],"department":[{"_id":"ToHe"}],"file_date_updated":"2020-11-06T10:58:49Z","_id":"8704","type":"conference","conference":{"start_date":"2020-05-31","location":"Paris, France","end_date":"2020-08-31","name":"ICRA: International Conference on Robotics and Automation"},"status":"public","publication_identifier":{"isbn":["9781728173955"],"issn":["10504729"]},"publication_status":"published","file":[{"file_id":"8733","checksum":"fccf7b986ac78046918a298cc6849a50","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2020-11-06T10:58:49Z","file_name":"2020_ICRA_Lechner.pdf","creator":"dernst","date_updated":"2020-11-06T10:58:49Z","file_size":1070010}],"language":[{"iso":"eng"}],"abstract":[{"text":"Traditional robotic control suits require profound task-specific knowledge for designing, building and testing control software. The rise of Deep Learning has enabled end-to-end solutions to be learned entirely from data, requiring minimal knowledge about the application area. We design a learning scheme to train end-to-end linear dynamical systems (LDS)s by gradient descent in imitation learning robotic domains. We introduce a new regularization loss component together with a learning algorithm that improves the stability of the learned autonomous system, by forcing the eigenvalues of the internal state updates of an LDS to be negative reals. We evaluate our approach on a series of real-life and simulated robotic experiments, in comparison to linear and nonlinear Recurrent Neural Network (RNN) architectures. Our results show that our stabilizing method significantly improves test performance of LDS, enabling such linear models to match the performance of contemporary nonlinear RNN architectures. A video of the obstacle avoidance performance of our method on a mobile robot, in unseen environments, compared to other methods can be viewed at https://youtu.be/mhEsCoNao5E.","lang":"eng"}],"oa_version":"Submitted Version","alternative_title":["ICRA"],"scopus_import":"1","month":"05","citation":{"ista":"Lechner M, Hasani R, Rus D, Grosu R. 2020. Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, , 5446–5452.","chicago":"Lechner, Mathias, Ramin Hasani, Daniela Rus, and Radu Grosu. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.” In Proceedings - IEEE International Conference on Robotics and Automation, 5446–52. IEEE, 2020. https://doi.org/10.1109/ICRA40945.2020.9196608.","apa":"Lechner, M., Hasani, R., Rus, D., & Grosu, R. (2020). Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In Proceedings - IEEE International Conference on Robotics and Automation (pp. 5446–5452). Paris, France: IEEE. https://doi.org/10.1109/ICRA40945.2020.9196608","ama":"Lechner M, Hasani R, Rus D, Grosu R. Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In: Proceedings - IEEE International Conference on Robotics and Automation. IEEE; 2020:5446-5452. doi:10.1109/ICRA40945.2020.9196608","short":"M. Lechner, R. Hasani, D. Rus, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2020, pp. 5446–5452.","ieee":"M. Lechner, R. Hasani, D. Rus, and R. Grosu, “Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme,” in Proceedings - IEEE International Conference on Robotics and Automation, Paris, France, 2020, pp. 5446–5452.","mla":"Lechner, Mathias, et al. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.” Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2020, pp. 5446–52, doi:10.1109/ICRA40945.2020.9196608."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"external_id":{"isi":["000712319503110"]},"article_processing_charge":"No","title":"Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"has_accepted_license":"1","isi":1,"year":"2020","day":"01","publication":"Proceedings - IEEE International Conference on Robotics and Automation","page":"5446-5452","date_published":"2020-05-01T00:00:00Z","doi":"10.1109/ICRA40945.2020.9196608","date_created":"2020-10-25T23:01:19Z","acknowledgement":"M.L. is supported in parts by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H., and R.G. are partially supported by the Horizon-2020 ECSELProject grant No. 783163 (iDev40), and the Austrian Research Promotion Agency (FFG), Project No. 860424. R.H. and D.R. is partially supported by the Boeing Company.","publisher":"IEEE","quality_controlled":"1","oa":1},{"publication":"Molecular Biology","day":"01","year":"2020","isi":1,"date_created":"2020-10-25T23:01:17Z","date_published":"2020-09-01T00:00:00Z","doi":"10.1134/S0026893320050088","page":"739-748","acknowledgement":"We would like to thank the staff of CCU Genome for sequencing, Tat’yana Pestova, Christopher Helen, and Lyudmila Yur’evna Frolova for the plasmids provided, as well as the laboratory staff for productive discussion of the results. We also thank former laboratory employees Yuliya Vladimirovna Bocharova and Polina Nikolaevna Kryuchkova for the exceptional contribution to the present work.","publisher":"Springer Nature","quality_controlled":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ista":"Sokolova EE, Vlasov P, Egorova TV, Shuvalov AV, Alkalaeva EZ. 2020. The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes. Molecular Biology. 54(5), 739–748.","chicago":"Sokolova, E. E., Petr Vlasov, T. V. Egorova, A. V. Shuvalov, and E. Z. Alkalaeva. “The Influence of A/G Composition of 3’ Stop Codon Contexts on Translation Termination Efficiency in Eukaryotes.” Molecular Biology. Springer Nature, 2020. https://doi.org/10.1134/S0026893320050088.","ieee":"E. E. Sokolova, P. Vlasov, T. V. Egorova, A. V. Shuvalov, and E. Z. Alkalaeva, “The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes,” Molecular Biology, vol. 54, no. 5. Springer Nature, pp. 739–748, 2020.","short":"E.E. Sokolova, P. Vlasov, T.V. Egorova, A.V. Shuvalov, E.Z. Alkalaeva, Molecular Biology 54 (2020) 739–748.","apa":"Sokolova, E. E., Vlasov, P., Egorova, T. V., Shuvalov, A. V., & Alkalaeva, E. Z. (2020). The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes. Molecular Biology. Springer Nature. https://doi.org/10.1134/S0026893320050088","ama":"Sokolova EE, Vlasov P, Egorova TV, Shuvalov AV, Alkalaeva EZ. The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes. Molecular Biology. 2020;54(5):739-748. doi:10.1134/S0026893320050088","mla":"Sokolova, E. E., et al. “The Influence of A/G Composition of 3’ Stop Codon Contexts on Translation Termination Efficiency in Eukaryotes.” Molecular Biology, vol. 54, no. 5, Springer Nature, 2020, pp. 739–48, doi:10.1134/S0026893320050088."},"title":"The influence of A/G composition of 3' stop codon contexts on translation termination efficiency in eukaryotes","article_processing_charge":"No","external_id":{"isi":["000579441200009"]},"author":[{"full_name":"Sokolova, E. E.","last_name":"Sokolova","first_name":"E. E."},{"full_name":"Vlasov, Petr","last_name":"Vlasov","first_name":"Petr","id":"38BB9AC4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Egorova","full_name":"Egorova, T. V.","first_name":"T. V."},{"first_name":"A. V.","full_name":"Shuvalov, A. V.","last_name":"Shuvalov"},{"full_name":"Alkalaeva, E. Z.","last_name":"Alkalaeva","first_name":"E. Z."}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["16083245"],"issn":["00268933"]},"related_material":{"record":[{"status":"public","id":"8701","relation":"original"}]},"issue":"5","volume":54,"oa_version":"None","abstract":[{"text":"Translation termination is a finishing step of protein biosynthesis. The significant role in this process belongs not only to protein factors of translation termination but also to the nearest nucleotide environment of stop codons. There are numerous descriptions of stop codons readthrough, which is due to specific nucleotide sequences behind them. However, represented data are segmental and don’t explain the mechanism of the nucleotide context influence on translation termination. It is well known that stop codon UAA usage is preferential for A/T-rich genes, and UAG, UGA—for G/C-rich genes, which is related to an expression level of these genes. We investigated the connection between a frequency of nucleotides occurrence in 3' area of stop codons in the human genome and their influence on translation termination efficiency. We found that 3' context motif, which is cognate to the sequence of a stop codon, stimulates translation termination. At the same time, the nucleotide composition of 3' sequence that differs from stop codon, decreases translation termination efficiency.","lang":"eng"}],"intvolume":" 54","month":"09","scopus_import":"1","date_updated":"2023-08-22T10:39:38Z","department":[{"_id":"FyKo"}],"_id":"8700","status":"public","article_type":"original","type":"journal_article"},{"type":"journal_article","article_type":"original","status":"public","_id":"8701","department":[{"_id":"FyKo"}],"date_updated":"2023-08-22T10:39:37Z","scopus_import":"1","intvolume":" 54","month":"09","abstract":[{"lang":"eng","text":"Translation termination is a finishing step of protein biosynthesis. The significant role in this process belongs not only to protein factors of translation termination but also to the nearest nucleotide environment of stop codons. There are numerous descriptions of stop codons readthrough, which is due to specific nucleotide sequences behind them. However, represented data are segmental and don’t explain the mechanism of the nucleotide context influence on translation termination. It is well known that stop codon UAA usage is preferential for A/T-rich genes, and UAG, UGA—for G/C-rich genes, which is related to an expression level of these genes. We investigated the connection between a frequency of nucleotides occurrence in 3' area of stop codons in the human genome and their influence on translation termination efficiency. We found that 3' context motif, which is cognate to the sequence of a stop codon, stimulates translation termination. At the same time, the nucleotide composition of 3' sequence that differs from stop codon, decreases translation termination efficiency."}],"pmid":1,"oa_version":"None","issue":"5","volume":54,"related_material":{"record":[{"id":"8700","status":"public","relation":"translation"}]},"publication_status":"published","publication_identifier":{"issn":["00268984"]},"language":[{"iso":"rus"}],"article_processing_charge":"No","external_id":{"pmid":["33009793"]},"author":[{"first_name":"E. E.","last_name":"Sokolova","full_name":"Sokolova, E. E."},{"full_name":"Vlasov, Petr","last_name":"Vlasov","id":"38BB9AC4-F248-11E8-B48F-1D18A9856A87","first_name":"Petr"},{"last_name":"Egorova","full_name":"Egorova, T. V.","first_name":"T. V."},{"first_name":"A. V.","full_name":"Shuvalov, A. V.","last_name":"Shuvalov"},{"full_name":"Alkalaeva, E. Z.","last_name":"Alkalaeva","first_name":"E. Z."}],"title":"The influence of A/G composition of 3' stop codon contexts on translation termination efficiency in eukaryotes","citation":{"mla":"Sokolova, E. E., et al. “The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes.” Molekuliarnaia biologiia, vol. 54, no. 5, Russian Academy of Sciences, 2020, pp. 837–48, doi:10.31857/S0026898420050080.","apa":"Sokolova, E. E., Vlasov, P., Egorova, T. V., Shuvalov, A. V., & Alkalaeva, E. Z. (2020). The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes. Molekuliarnaia biologiia. Russian Academy of Sciences. https://doi.org/10.31857/S0026898420050080","ama":"Sokolova EE, Vlasov P, Egorova TV, Shuvalov AV, Alkalaeva EZ. The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes. Molekuliarnaia biologiia. 2020;54(5):837-848. doi:10.31857/S0026898420050080","ieee":"E. E. Sokolova, P. Vlasov, T. V. Egorova, A. V. Shuvalov, and E. Z. Alkalaeva, “The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes,” Molekuliarnaia biologiia, vol. 54, no. 5. Russian Academy of Sciences, pp. 837–848, 2020.","short":"E.E. Sokolova, P. Vlasov, T.V. Egorova, A.V. Shuvalov, E.Z. Alkalaeva, Molekuliarnaia biologiia 54 (2020) 837–848.","chicago":"Sokolova, E. E., Petr Vlasov, T. V. Egorova, A. V. Shuvalov, and E. Z. Alkalaeva. “The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes.” Molekuliarnaia biologiia. Russian Academy of Sciences, 2020. https://doi.org/10.31857/S0026898420050080.","ista":"Sokolova EE, Vlasov P, Egorova TV, Shuvalov AV, Alkalaeva EZ. 2020. The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes. Molekuliarnaia biologiia. 54(5), 837–848."},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","publisher":"Russian Academy of Sciences","quality_controlled":"1","page":"837-848","date_created":"2020-10-25T23:01:17Z","doi":"10.31857/S0026898420050080","date_published":"2020-09-01T00:00:00Z","year":"2020","publication":"Molekuliarnaia biologiia","day":"01"},{"status":"public","type":"preprint","article_number":"2011.06630","_id":"14096","title":"Successful common envelope ejection and binary neutron star formation in 3D hydrodynamics","article_processing_charge":"No","external_id":{"arxiv":["2011.06630"]},"author":[{"full_name":"Jamie A. P. Law-Smith, Jamie A. P. Law-Smith","last_name":"Jamie A. P. Law-Smith","first_name":"Jamie A. P. Law-Smith"},{"last_name":"Everson","full_name":"Everson, Rosa Wallace","first_name":"Rosa Wallace"},{"last_name":"Enrico Ramirez-Ruiz","full_name":"Enrico Ramirez-Ruiz, Enrico Ramirez-Ruiz","first_name":"Enrico Ramirez-Ruiz"},{"full_name":"Mink, Selma E. de","last_name":"Mink","first_name":"Selma E. de"},{"first_name":"Lieke A. C. van","full_name":"Son, Lieke A. C. van","last_name":"Son"},{"id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d","first_name":"Ylva Louise Linsdotter","orcid":"0000-0002-6960-6911","full_name":"Götberg, Ylva Louise Linsdotter","last_name":"Götberg"},{"full_name":"Zellmann, Stefan","last_name":"Zellmann","first_name":"Stefan"},{"first_name":"Alejandro Vigna-Gómez","last_name":"Alejandro Vigna-Gómez","full_name":"Alejandro Vigna-Gómez, Alejandro Vigna-Gómez"},{"last_name":"Renzo","full_name":"Renzo, Mathieu","first_name":"Mathieu"},{"last_name":"Wu","full_name":"Wu, Samantha","first_name":"Samantha"},{"last_name":"Schrøder","full_name":"Schrøder, Sophie L.","first_name":"Sophie L."},{"last_name":"Foley","full_name":"Foley, Ryan J.","first_name":"Ryan J."},{"first_name":"Tenley Hutchinson-Smith","full_name":"Tenley Hutchinson-Smith, Tenley Hutchinson-Smith","last_name":"Tenley Hutchinson-Smith"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-08-22T11:03:00Z","citation":{"ista":"Jamie A. P. Law-Smith JAPL-S, Everson RW, Enrico Ramirez-Ruiz ER-R, Mink SE de, Son LAC van, Götberg YLL, Zellmann S, Alejandro Vigna-Gómez AV-G, Renzo M, Wu S, Schrøder SL, Foley RJ, Tenley Hutchinson-Smith TH-S. Successful common envelope ejection and binary neutron star formation in 3D hydrodynamics. arXiv, 2011.06630.","chicago":"Jamie A. P. Law-Smith, Jamie A. P. Law-Smith, Rosa Wallace Everson, Enrico Ramirez-Ruiz Enrico Ramirez-Ruiz, Selma E. de Mink, Lieke A. C. van Son, Ylva Louise Linsdotter Götberg, Stefan Zellmann, et al. “Successful Common Envelope Ejection and Binary Neutron Star Formation in 3D Hydrodynamics.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2011.06630.","ama":"Jamie A. P. Law-Smith JAPL-S, Everson RW, Enrico Ramirez-Ruiz ER-R, et al. Successful common envelope ejection and binary neutron star formation in 3D hydrodynamics. arXiv. doi:10.48550/arXiv.2011.06630","apa":"Jamie A. P. Law-Smith, J. A. P. L.-S., Everson, R. W., Enrico Ramirez-Ruiz, E. R.-R., Mink, S. E. de, Son, L. A. C. van, Götberg, Y. L. L., … Tenley Hutchinson-Smith, T. H.-S. (n.d.). Successful common envelope ejection and binary neutron star formation in 3D hydrodynamics. arXiv. https://doi.org/10.48550/arXiv.2011.06630","short":"J.A.P.L.-S. Jamie A. P. Law-Smith, R.W. Everson, E.R.-R. Enrico Ramirez-Ruiz, S.E. de Mink, L.A.C. van Son, Y.L.L. Götberg, S. Zellmann, A.V.-G. Alejandro Vigna-Gómez, M. Renzo, S. Wu, S.L. Schrøder, R.J. Foley, T.H.-S. Tenley Hutchinson-Smith, ArXiv (n.d.).","ieee":"J. A. P. L.-S. Jamie A. P. Law-Smith et al., “Successful common envelope ejection and binary neutron star formation in 3D hydrodynamics,” arXiv. .","mla":"Jamie A. P. Law-Smith, Jamie A. P. Law-Smith, et al. “Successful Common Envelope Ejection and Binary Neutron Star Formation in 3D Hydrodynamics.” ArXiv, 2011.06630, doi:10.48550/arXiv.2011.06630."},"month":"11","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2011.06630","open_access":"1"}],"oa":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"A binary neutron star merger has been observed in a multi-messenger detection of gravitational wave (GW) and electromagnetic (EM) radiation. Binary neutron stars that merge within a Hubble time, as well as many other compact binaries, are expected to form via common envelope evolution. Yet five decades of research on common envelope evolution have not yet resulted in a satisfactory understanding of the multi-spatial multi-timescale evolution for the systems that lead to compact binaries. In this paper, we report on the first successful simulations of common envelope ejection leading to binary neutron star formation in 3D hydrodynamics. We simulate the dynamical inspiral phase of the interaction between a 12M⊙ red supergiant and a 1.4M⊙ neutron star for different initial separations and initial conditions. For all of our simulations, we find complete envelope ejection and final orbital separations of af≈1.3-5.1R⊙ depending on the simulation and criterion, leading to binary neutron stars that can merge within a Hubble time. We find αCE-equivalent efficiencies of ≈0.1-2.7 depending on the simulation and criterion, but this may be specific for these extended progenitors. We fully resolve the core of the star to ≲0.005R⊙ and our 3D hydrodynamics simulations are informed by an adjusted 1D analytic energy formalism and a 2D kinematics study in order to overcome the prohibitive computational cost of simulating these systems. The framework we develop in this paper can be used to simulate a wide variety of interactions between stars, from stellar mergers to common envelope episodes leading to GW sources."}],"date_created":"2023-08-21T10:10:41Z","doi":"10.48550/arXiv.2011.06630","date_published":"2020-11-12T00:00:00Z","publication":"arXiv","language":[{"iso":"eng"}],"day":"12","year":"2020","publication_status":"submitted"}]