[{"author":[{"last_name":"Miki","full_name":"Miki, Takafumi","first_name":"Takafumi"},{"first_name":"Walter","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","full_name":"Kaufmann, Walter","orcid":"0000-0001-9735-5315","last_name":"Kaufmann"},{"last_name":"Malagon","full_name":"Malagon, Gerardo","first_name":"Gerardo"},{"last_name":"Gomez","full_name":"Gomez, Laura","first_name":"Laura"},{"first_name":"Katsuhiko","full_name":"Tabuchi, Katsuhiko","last_name":"Tabuchi"},{"last_name":"Watanabe","first_name":"Masahiko","full_name":"Watanabe, Masahiko"},{"last_name":"Shigemoto","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi"},{"first_name":"Alain","full_name":"Marty, Alain","last_name":"Marty"}],"file_date_updated":"2020-07-14T12:47:44Z","citation":{"ieee":"T. Miki <i>et al.</i>, “Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses,” <i>PNAS</i>, vol. 114, no. 26. National Academy of Sciences, pp. E5246–E5255, 2017.","ama":"Miki T, Kaufmann W, Malagon G, et al. Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses. <i>PNAS</i>. 2017;114(26):E5246-E5255. doi:<a href=\"https://doi.org/10.1073/pnas.1704470114\">10.1073/pnas.1704470114</a>","short":"T. Miki, W. Kaufmann, G. Malagon, L. Gomez, K. Tabuchi, M. Watanabe, R. Shigemoto, A. Marty, PNAS 114 (2017) E5246–E5255.","apa":"Miki, T., Kaufmann, W., Malagon, G., Gomez, L., Tabuchi, K., Watanabe, M., … Marty, A. (2017). Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1704470114\">https://doi.org/10.1073/pnas.1704470114</a>","ista":"Miki T, Kaufmann W, Malagon G, Gomez L, Tabuchi K, Watanabe M, Shigemoto R, Marty A. 2017. Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses. PNAS. 114(26), E5246–E5255.","mla":"Miki, Takafumi, et al. “Numbers of Presynaptic Ca2+ Channel Clusters Match Those of Functionally Defined Vesicular Docking Sites in Single Central Synapses.” <i>PNAS</i>, vol. 114, no. 26, National Academy of Sciences, 2017, pp. E5246–55, doi:<a href=\"https://doi.org/10.1073/pnas.1704470114\">10.1073/pnas.1704470114</a>.","chicago":"Miki, Takafumi, Walter Kaufmann, Gerardo Malagon, Laura Gomez, Katsuhiko Tabuchi, Masahiko Watanabe, Ryuichi Shigemoto, and Alain Marty. “Numbers of Presynaptic Ca2+ Channel Clusters Match Those of Functionally Defined Vesicular Docking Sites in Single Central Synapses.” <i>PNAS</i>. National Academy of Sciences, 2017. <a href=\"https://doi.org/10.1073/pnas.1704470114\">https://doi.org/10.1073/pnas.1704470114</a>."},"issue":"26","type":"journal_article","file":[{"date_created":"2020-01-03T13:27:29Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"2ab75d554f3df4a34d20fa8040589b7e","file_id":"7223","creator":"kschuh","date_updated":"2020-07-14T12:47:44Z","file_name":"2017_PNAS_Miki.pdf","file_size":2721544}],"volume":114,"publication_identifier":{"issn":["0027-8424"]},"page":"E5246 - E5255","oa":1,"language":[{"iso":"eng"}],"ddc":["570"],"publisher":"National Academy of Sciences","external_id":{"isi":["000404108400028"],"pmid":["28607047"]},"abstract":[{"text":"Many central synapses contain a single presynaptic active zone and a single postsynaptic density. Vesicular release statistics at such “simple synapses” indicate that they contain a small complement of docking sites where vesicles repetitively dock and fuse. In this work, we investigate functional and morphological aspects of docking sites at simple synapses made between cerebellar parallel fibers and molecular layer interneurons. Using immunogold labeling of SDS-treated freeze-fracture replicas, we find that Cav2.1 channels form several clusters per active zone with about nine channels per cluster. The mean value and range of intersynaptic variation are similar for Cav2.1 cluster numbers and for functional estimates of docking-site numbers obtained from the maximum numbers of released vesicles per action potential. Both numbers grow in relation with synaptic size and decrease by a similar extent with age between 2 wk and 4 wk postnatal. Thus, the mean docking-site numbers were 3.15 at 2 wk (range: 1–10) and 2.03 at 4 wk (range: 1–4), whereas the mean numbers of Cav2.1 clusters were 2.84 at 2 wk (range: 1–8) and 2.37 at 4 wk (range: 1–5). These changes were accompanied by decreases of miniature current amplitude (from 93 pA to 56 pA), active-zone surface area (from 0.0427 μm2 to 0.0234 μm2), and initial success rate (from 0.609 to 0.353), indicating a tightening of synaptic transmission with development. Altogether, these results suggest a close correspondence between the number of functionally defined vesicular docking sites and that of clusters of voltage-gated calcium channels. ","lang":"eng"}],"_id":"693","oa_version":"Published Version","department":[{"_id":"EM-Fac"},{"_id":"RySh"}],"corr_author":"1","month":"06","day":"27","status":"public","isi":1,"has_accepted_license":"1","title":"Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:47:57Z","publication_status":"published","year":"2017","scopus_import":"1","article_processing_charge":"Yes (in subscription journal)","fulldoi":"https://doi.org/10.1073/pnas.1704470114","doi":"10.1073/pnas.1704470114","date_published":"2017-06-27T00:00:00Z","publication":"PNAS","pmid":1,"quality_controlled":"1","date_updated":"2025-09-10T14:00:03Z","publist_id":"7013","intvolume":"       114"},{"publication_status":"published","date_created":"2018-12-11T11:47:58Z","article_type":"original","year":"2017","scopus_import":"1","article_processing_charge":"No","fulldoi":"https://doi.org/10.1242/jcs.200899","doi":"10.1242/jcs.200899","date_published":"2017-07-01T00:00:00Z","publication":"Journal of Cell Science","pmid":1,"date_updated":"2025-09-10T11:13:35Z","quality_controlled":"1","publist_id":"7008","intvolume":"       130","external_id":{"isi":["000405612200009"],"pmid":["28515231"]},"abstract":[{"lang":"eng","text":"A change regarding the extent of adhesion - hereafter referred to as adhesion plasticity - between adhesive and less-adhesive states of mammalian cells is important for their behavior. To investigate adhesion plasticity, we have selected a stable isogenic subpopulation of human MDA-MB-468 breast carcinoma cells growing in suspension. These suspension cells are unable to re-adhere to various matrices or to contract three-dimensional collagen lattices. By using transcriptome analysis, we identified the focal adhesion protein tensin3 (Tns3) as a determinant of adhesion plasticity. Tns3 is strongly reduced at mRNA and protein levels in suspension cells. Furthermore, by transiently challenging breast cancer cells to grow under non-adherent conditions markedly reduces Tns3 protein expression, which is regained upon re-adhesion. Stable knockdown of Tns3 in parental MDA-MB-468 cells results in defective adhesion, spreading and migration. Tns3-knockdown cells display impaired structure and dynamics of focal adhesion complexes as determined by immunostaining. Restoration of Tns3 protein expression in suspension cells partially rescues adhesion and focal contact composition. Our work identifies Tns3 as a crucial focal adhesion component regulated by, and functionally contributing to, the switch between adhesive and non-adhesive states in MDA-MB-468 cancer cells."}],"_id":"694","oa_version":"Published Version","department":[{"_id":"MiSi"}],"day":"01","month":"07","isi":1,"status":"public","has_accepted_license":"1","title":"A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file":[{"file_size":10847596,"date_updated":"2020-07-14T12:47:45Z","file_name":"2017_CellScience_Vess.pdf","file_id":"6966","creator":"dernst","checksum":"42c81a0a4fc3128883b391c3af3f74bc","relation":"main_file","date_created":"2019-10-24T09:43:56Z","content_type":"application/pdf","access_level":"open_access"}],"volume":130,"publication_identifier":{"issn":["0021-9533"]},"page":"2172 - 2184","oa":1,"language":[{"iso":"eng"}],"ddc":["570"],"publisher":"Company of Biologists","author":[{"last_name":"Veß","full_name":"Veß, Astrid","first_name":"Astrid"},{"last_name":"Blache","full_name":"Blache, Ulrich","first_name":"Ulrich"},{"first_name":"Laura","full_name":"Leitner, Laura","last_name":"Leitner"},{"last_name":"Kurz","first_name":"Angela","full_name":"Kurz, Angela"},{"first_name":"Anja","full_name":"Ehrenpfordt, Anja","last_name":"Ehrenpfordt"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt"},{"last_name":"Posern","first_name":"Guido","full_name":"Posern, Guido"}],"file_date_updated":"2020-07-14T12:47:45Z","citation":{"chicago":"Veß, Astrid, Ulrich Blache, Laura Leitner, Angela Kurz, Anja Ehrenpfordt, Michael K Sixt, and Guido Posern. “A Dual Phenotype of MDA MB 468 Cancer Cells Reveals Mutual Regulation of Tensin3 and Adhesion Plasticity.” <i>Journal of Cell Science</i>. Company of Biologists, 2017. <a href=\"https://doi.org/10.1242/jcs.200899\">https://doi.org/10.1242/jcs.200899</a>.","mla":"Veß, Astrid, et al. “A Dual Phenotype of MDA MB 468 Cancer Cells Reveals Mutual Regulation of Tensin3 and Adhesion Plasticity.” <i>Journal of Cell Science</i>, vol. 130, no. 13, Company of Biologists, 2017, pp. 2172–84, doi:<a href=\"https://doi.org/10.1242/jcs.200899\">10.1242/jcs.200899</a>.","ista":"Veß A, Blache U, Leitner L, Kurz A, Ehrenpfordt A, Sixt MK, Posern G. 2017. A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity. Journal of Cell Science. 130(13), 2172–2184.","apa":"Veß, A., Blache, U., Leitner, L., Kurz, A., Ehrenpfordt, A., Sixt, M. K., &#38; Posern, G. (2017). A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity. <i>Journal of Cell Science</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.200899\">https://doi.org/10.1242/jcs.200899</a>","short":"A. Veß, U. Blache, L. Leitner, A. Kurz, A. Ehrenpfordt, M.K. Sixt, G. Posern, Journal of Cell Science 130 (2017) 2172–2184.","ieee":"A. Veß <i>et al.</i>, “A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity,” <i>Journal of Cell Science</i>, vol. 130, no. 13. Company of Biologists, pp. 2172–2184, 2017.","ama":"Veß A, Blache U, Leitner L, et al. A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity. <i>Journal of Cell Science</i>. 2017;130(13):2172-2184. doi:<a href=\"https://doi.org/10.1242/jcs.200899\">10.1242/jcs.200899</a>"},"issue":"13","type":"journal_article"},{"intvolume":"        80","publist_id":"7003","quality_controlled":"1","date_updated":"2025-07-10T11:54:07Z","date_published":"2017-07-01T00:00:00Z","doi":"10.4230/LIPIcs.ICALP.2017.39","fulldoi":"https://doi.org/10.4230/LIPIcs.ICALP.2017.39","scopus_import":"1","article_processing_charge":"No","year":"2017","publication_status":"published","date_created":"2018-12-11T11:47:59Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Non uniform attacks against pseudoentropy","has_accepted_license":"1","status":"public","month":"07","day":"01","corr_author":"1","project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"department":[{"_id":"KrPi"}],"oa_version":"Published Version","ec_funded":1,"_id":"697","abstract":[{"text":"De, Trevisan and Tulsiani [CRYPTO 2010] show that every distribution over n-bit strings which has constant statistical distance to uniform (e.g., the output of a pseudorandom generator mapping n-1 to n bit strings), can be distinguished from the uniform distribution with advantage epsilon by a circuit of size O( 2^n epsilon^2). We generalize this result, showing that a distribution which has less than k bits of min-entropy, can be distinguished from any distribution with k bits of delta-smooth min-entropy with advantage epsilon by a circuit of size O(2^k epsilon^2/delta^2). As a special case, this implies that any distribution with support at most 2^k (e.g., the output of a pseudoentropy generator mapping k to n bit strings) can be distinguished from any given distribution with min-entropy k+1 with advantage epsilon by a circuit of size O(2^k epsilon^2). Our result thus shows that pseudoentropy distributions face basically the same non-uniform attacks as pseudorandom distributions. ","lang":"eng"}],"alternative_title":["LIPIcs"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","pubrep_id":"893","ddc":["005"],"language":[{"iso":"eng"}],"oa":1,"publication_identifier":{"issn":["1868-8969"]},"volume":80,"file":[{"relation":"main_file","checksum":"e95618a001692f1af2d68f5fde43bc1f","date_created":"2018-12-12T10:08:40Z","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:46Z","file_name":"IST-2017-893-v1+1_LIPIcs-ICALP-2017-39.pdf","file_size":601004,"creator":"system","file_id":"4701"}],"type":"conference","article_number":"39","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"citation":{"short":"K.Z. Pietrzak, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ama":"Pietrzak KZ, Skórski M. Non uniform attacks against pseudoentropy. In: Vol 80. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2017.39\">10.4230/LIPIcs.ICALP.2017.39</a>","ieee":"K. Z. Pietrzak and M. Skórski, “Non uniform attacks against pseudoentropy,” presented at the ICALP: Automata, Languages and Programming, Warsaw, Poland, 2017, vol. 80.","chicago":"Pietrzak, Krzysztof Z, and Maciej Skórski. “Non Uniform Attacks against Pseudoentropy,” Vol. 80. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2017.39\">https://doi.org/10.4230/LIPIcs.ICALP.2017.39</a>.","apa":"Pietrzak, K. Z., &#38; Skórski, M. (2017). Non uniform attacks against pseudoentropy (Vol. 80). Presented at the ICALP: Automata, Languages and Programming, Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2017.39\">https://doi.org/10.4230/LIPIcs.ICALP.2017.39</a>","mla":"Pietrzak, Krzysztof Z., and Maciej Skórski. <i>Non Uniform Attacks against Pseudoentropy</i>. Vol. 80, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2017.39\">10.4230/LIPIcs.ICALP.2017.39</a>.","ista":"Pietrzak KZ, Skórski M. 2017. Non uniform attacks against pseudoentropy. ICALP: Automata, Languages and Programming, LIPIcs, vol. 80, 39."},"conference":{"location":"Warsaw, Poland","name":"ICALP: Automata, Languages and Programming","start_date":"2017-07-10","end_date":"2017-07-14"},"file_date_updated":"2020-07-14T12:47:46Z","author":[{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak"},{"first_name":"Maciej","full_name":"Skórski, Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skórski"}]},{"publication_identifier":{"issn":["1059-1524"]},"volume":28,"file":[{"checksum":"de01dac9e30970cfa6ae902480a4e04d","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:10:53Z","file_size":1086097,"file_name":"IST-2017-892-v1+1_Mol._Biol._Cell-2017-Wang-1997-2009.pdf","date_updated":"2020-07-14T12:47:46Z","file_id":"4844","creator":"system"}],"publisher":"American Society for Cell Biology","pubrep_id":"892","ddc":["519"],"oa":1,"language":[{"iso":"eng"}],"page":"1997 - 2009","citation":{"short":"Y. Wang, M. Nagarajan, C. Uhler, G. Shivashankar, Molecular Biology of the Cell 28 (2017) 1997–2009.","ama":"Wang Y, Nagarajan M, Uhler C, Shivashankar G. Orientation and repositioning of chromosomes correlate with cell geometry dependent gene expression. <i>Molecular Biology of the Cell</i>. 2017;28(14):1997-2009. doi:<a href=\"https://doi.org/10.1091/mbc.E16-12-0825\">10.1091/mbc.E16-12-0825</a>","ieee":"Y. Wang, M. Nagarajan, C. Uhler, and G. Shivashankar, “Orientation and repositioning of chromosomes correlate with cell geometry dependent gene expression,” <i>Molecular Biology of the Cell</i>, vol. 28, no. 14. American Society for Cell Biology, pp. 1997–2009, 2017.","chicago":"Wang, Yejun, Mallika Nagarajan, Caroline Uhler, and Gv Shivashankar. “Orientation and Repositioning of Chromosomes Correlate with Cell Geometry Dependent Gene Expression.” <i>Molecular Biology of the Cell</i>. American Society for Cell Biology, 2017. <a href=\"https://doi.org/10.1091/mbc.E16-12-0825\">https://doi.org/10.1091/mbc.E16-12-0825</a>.","apa":"Wang, Y., Nagarajan, M., Uhler, C., &#38; Shivashankar, G. (2017). Orientation and repositioning of chromosomes correlate with cell geometry dependent gene expression. <i>Molecular Biology of the Cell</i>. American Society for Cell Biology. <a href=\"https://doi.org/10.1091/mbc.E16-12-0825\">https://doi.org/10.1091/mbc.E16-12-0825</a>","ista":"Wang Y, Nagarajan M, Uhler C, Shivashankar G. 2017. Orientation and repositioning of chromosomes correlate with cell geometry dependent gene expression. Molecular Biology of the Cell. 28(14), 1997–2009.","mla":"Wang, Yejun, et al. “Orientation and Repositioning of Chromosomes Correlate with Cell Geometry Dependent Gene Expression.” <i>Molecular Biology of the Cell</i>, vol. 28, no. 14, American Society for Cell Biology, 2017, pp. 1997–2009, doi:<a href=\"https://doi.org/10.1091/mbc.E16-12-0825\">10.1091/mbc.E16-12-0825</a>."},"tmp":{"image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"author":[{"full_name":"Wang, Yejun","first_name":"Yejun","last_name":"Wang"},{"last_name":"Nagarajan","full_name":"Nagarajan, Mallika","first_name":"Mallika"},{"last_name":"Uhler","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","full_name":"Uhler, Caroline","orcid":"0000-0002-7008-0216","first_name":"Caroline"},{"full_name":"Shivashankar, Gv","first_name":"Gv","last_name":"Shivashankar"}],"file_date_updated":"2020-07-14T12:47:46Z","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","type":"journal_article","issue":"14","fulldoi":"https://doi.org/10.1091/mbc.E16-12-0825","doi":"10.1091/mbc.E16-12-0825","article_processing_charge":"No","scopus_import":"1","year":"2017","date_created":"2018-12-11T11:47:59Z","publication_status":"published","publist_id":"7001","intvolume":"        28","date_updated":"2025-09-10T11:09:13Z","quality_controlled":"1","publication":"Molecular Biology of the Cell","date_published":"2017-07-07T00:00:00Z","department":[{"_id":"CaUh"}],"project":[{"grant_number":"Y 903-N35","_id":"2530CA10-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Gaussian Graphical Models: Theory and Applications"}],"abstract":[{"lang":"eng","text":"Extracellular matrix signals from the microenvironment regulate gene expression patterns and cell behavior. Using a combination of experiments and geometric models, we demonstrate correlations between cell geometry, three-dimensional (3D) organization of chromosome territories, and gene expression. Fluorescence in situ hybridization experiments showed that micropatterned fibroblasts cultured on anisotropic versus isotropic substrates resulted in repositioning of specific chromosomes, which contained genes that were differentially regulated by cell geometries. Experiments combined with ellipsoid packing models revealed that the mechanosensitivity of chromosomes was correlated with their orientation in the nucleus. Transcription inhibition experiments suggested that the intermingling degree was more sensitive to global changes in transcription than to chromosome radial positioning and its orientations. These results suggested that cell geometry modulated 3D chromosome arrangement, and their neighborhoods correlated with gene expression patterns in a predictable manner. This is central to understanding geometric control of genetic programs involved in cellular homeostasis and the associated diseases. "}],"_id":"698","oa_version":"Published Version","external_id":{"isi":["000406471600019"]},"title":"Orientation and repositioning of chromosomes correlate with cell geometry dependent gene expression","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","has_accepted_license":"1","day":"07","month":"07","isi":1,"status":"public"},{"status":"public","isi":1,"day":"03","month":"07","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"The red queen and king in finite populations","external_id":{"isi":["000404576100017"],"pmid":["28630336"]},"oa_version":"Submitted Version","abstract":[{"text":"In antagonistic symbioses, such as host–parasite interactions, one population’s success is the other’s loss. In mutualistic symbioses, such as division of labor, both parties can gain, but they might have different preferences over the possible mutualistic arrangements. The rates of evolution of the two populations in a symbiosis are important determinants of which population will be more successful: Faster evolution is thought to be favored in antagonistic symbioses (the “Red Queen effect”), but disfavored in certain mutualistic symbioses (the “Red King effect”). However, it remains unclear which biological parameters drive these effects. Here, we analyze the effects of the various determinants of evolutionary rate: generation time, mutation rate, population size, and the intensity of natural selection. Our main results hold for the case where mutation is infrequent. Slower evolution causes a long-term advantage in an important class of mutualistic interactions. Surprisingly, less intense selection is the strongest driver of this Red King effect, whereas relative mutation rates and generation times have little effect. In antagonistic interactions, faster evolution by any means is beneficial. Our results provide insight into the demographic evolution of symbionts. ","lang":"eng"}],"_id":"699","department":[{"_id":"KrCh"}],"date_published":"2017-07-03T00:00:00Z","pmid":1,"publication":"PNAS","date_updated":"2025-09-10T11:11:07Z","quality_controlled":"1","intvolume":"       114","publist_id":"7002","publication_status":"published","date_created":"2018-12-11T11:48:00Z","year":"2017","article_processing_charge":"No","scopus_import":"1","doi":"10.1073/pnas.1702020114","fulldoi":"https://doi.org/10.1073/pnas.1702020114","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5502615/"}],"issue":"27","type":"journal_article","author":[{"first_name":"Carl","full_name":"Veller, Carl","last_name":"Veller"},{"full_name":"Hayward, Laura","first_name":"Laura","last_name":"Hayward"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"},{"last_name":"Hilbe","full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"}],"citation":{"ama":"Veller C, Hayward L, Nowak M, Hilbe C. The red queen and king in finite populations. <i>PNAS</i>. 2017;114(27):E5396-E5405. doi:<a href=\"https://doi.org/10.1073/pnas.1702020114\">10.1073/pnas.1702020114</a>","ieee":"C. Veller, L. Hayward, M. Nowak, and C. Hilbe, “The red queen and king in finite populations,” <i>PNAS</i>, vol. 114, no. 27. National Academy of Sciences, pp. E5396–E5405, 2017.","short":"C. Veller, L. Hayward, M. Nowak, C. Hilbe, PNAS 114 (2017) E5396–E5405.","mla":"Veller, Carl, et al. “The Red Queen and King in Finite Populations.” <i>PNAS</i>, vol. 114, no. 27, National Academy of Sciences, 2017, pp. E5396–405, doi:<a href=\"https://doi.org/10.1073/pnas.1702020114\">10.1073/pnas.1702020114</a>.","ista":"Veller C, Hayward L, Nowak M, Hilbe C. 2017. The red queen and king in finite populations. PNAS. 114(27), E5396–E5405.","apa":"Veller, C., Hayward, L., Nowak, M., &#38; Hilbe, C. (2017). The red queen and king in finite populations. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1702020114\">https://doi.org/10.1073/pnas.1702020114</a>","chicago":"Veller, Carl, Laura Hayward, Martin Nowak, and Christian Hilbe. “The Red Queen and King in Finite Populations.” <i>PNAS</i>. National Academy of Sciences, 2017. <a href=\"https://doi.org/10.1073/pnas.1702020114\">https://doi.org/10.1073/pnas.1702020114</a>."},"page":"E5396 - E5405","language":[{"iso":"eng"}],"oa":1,"publisher":"National Academy of Sciences","volume":114,"publication_identifier":{"issn":["0027-8424"]}},{"ddc":["530"],"publisher":"Springer Nature","language":[{"iso":"eng"}],"oa":1,"volume":8,"publication_identifier":{"issn":["2041-1723"]},"file":[{"file_name":"2017_NatureComm_Modic.pdf","date_updated":"2020-07-14T12:47:48Z","file_size":1242958,"file_id":"7091","creator":"cziletti","relation":"main_file","checksum":"57fcd59d2f274b6b16cc89ea03cfd440","access_level":"open_access","content_type":"application/pdf","date_created":"2019-11-20T14:12:54Z"}],"article_number":"180","issue":"1","type":"journal_article","file_date_updated":"2020-07-14T12:47:48Z","author":[{"last_name":"Modic","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","full_name":"Modic, Kimberly A","orcid":"0000-0001-9760-3147","first_name":"Kimberly A"},{"full_name":"Ramshaw, B. J.","first_name":"B. J.","last_name":"Ramshaw"},{"first_name":"J. B.","full_name":"Betts, J. B.","last_name":"Betts"},{"first_name":"Nicholas P.","full_name":"Breznay, Nicholas P.","last_name":"Breznay"},{"first_name":"James G.","full_name":"Analytis, James G.","last_name":"Analytis"},{"last_name":"McDonald","full_name":"McDonald, Ross D.","first_name":"Ross D."},{"full_name":"Shekhter, Arkady","first_name":"Arkady","last_name":"Shekhter"}],"citation":{"chicago":"Modic, Kimberly A, B. J. Ramshaw, J. B. Betts, Nicholas P. Breznay, James G. Analytis, Ross D. McDonald, and Arkady Shekhter. “Robust Spin Correlations at High Magnetic Fields in the Harmonic Honeycomb Iridates.” <i>Nature Communications</i>. Springer Nature, 2017. <a href=\"https://doi.org/10.1038/s41467-017-00264-6\">https://doi.org/10.1038/s41467-017-00264-6</a>.","mla":"Modic, Kimberly A., et al. “Robust Spin Correlations at High Magnetic Fields in the Harmonic Honeycomb Iridates.” <i>Nature Communications</i>, vol. 8, no. 1, 180, Springer Nature, 2017, doi:<a href=\"https://doi.org/10.1038/s41467-017-00264-6\">10.1038/s41467-017-00264-6</a>.","ista":"Modic KA, Ramshaw BJ, Betts JB, Breznay NP, Analytis JG, McDonald RD, Shekhter A. 2017. Robust spin correlations at high magnetic fields in the harmonic honeycomb iridates. Nature Communications. 8(1), 180.","apa":"Modic, K. A., Ramshaw, B. J., Betts, J. B., Breznay, N. P., Analytis, J. G., McDonald, R. D., &#38; Shekhter, A. (2017). Robust spin correlations at high magnetic fields in the harmonic honeycomb iridates. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-017-00264-6\">https://doi.org/10.1038/s41467-017-00264-6</a>","short":"K.A. Modic, B.J. Ramshaw, J.B. Betts, N.P. Breznay, J.G. Analytis, R.D. McDonald, A. Shekhter, Nature Communications 8 (2017).","ieee":"K. A. Modic <i>et al.</i>, “Robust spin correlations at high magnetic fields in the harmonic honeycomb iridates,” <i>Nature Communications</i>, vol. 8, no. 1. Springer Nature, 2017.","ama":"Modic KA, Ramshaw BJ, Betts JB, et al. Robust spin correlations at high magnetic fields in the harmonic honeycomb iridates. <i>Nature Communications</i>. 2017;8(1). doi:<a href=\"https://doi.org/10.1038/s41467-017-00264-6\">10.1038/s41467-017-00264-6</a>"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"date_updated":"2021-01-12T08:11:39Z","quality_controlled":"1","intvolume":"         8","date_published":"2017-08-01T00:00:00Z","publication":"Nature Communications","article_processing_charge":"No","doi":"10.1038/s41467-017-00264-6","fulldoi":"https://doi.org/10.1038/s41467-017-00264-6","date_created":"2019-11-19T13:11:55Z","publication_status":"published","article_type":"original","year":"2017","extern":"1","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Robust spin correlations at high magnetic fields in the harmonic honeycomb iridates","status":"public","month":"08","day":"01","oa_version":"Published Version","abstract":[{"lang":"eng","text":"The complex antiferromagnetic orders observed in the honeycomb iridates are a double-edged sword in the search for a quantum spin-liquid: both attesting that the magnetic interactions provide many of the necessary ingredients, while simultaneously impeding access. Focus has naturally been drawn to the unusual magnetic orders that hint at the underlying spin correlations. However, the study of any particular broken symmetry state generally provides little clue about the possibility of other nearby ground states. Here we use magnetic fields approaching 100 Tesla to reveal the extent of the spin correlations in γ-lithium iridate. We find that a small component of field along the magnetic easy-axis melts long-range order, revealing a bistable, strongly correlated spin state. Far from the usual destruction of antiferromagnetism via spin polarization, the high-field state possesses only a small fraction of the total iridium moment, without evidence for long-range order up to the highest attainable magnetic fields."}],"_id":"7064"},{"_id":"7066","abstract":[{"text":"The excitonic insulator phase has long been predicted to form in proximity to a band gap opening in the underlying band structure. The character of the pairing is conjectured to crossover from weak (BCS-like) to strong coupling (BEC-like) as the underlying band structure is tuned from the metallic to the insulating side of the gap opening. Here we report the high-magnetic field phase diagram of graphite to exhibit just such a crossover. By way of comprehensive angle-resolved magnetoresistance measurements, we demonstrate that the underlying band gap opening occurs inside the magnetic field-induced phase, paving the way for a systematic study of the BCS-BEC-like crossover by means of conventional condensed matter probes.","lang":"eng"}],"oa_version":"Published Version","day":"04","month":"05","status":"public","extern":"1","has_accepted_license":"1","title":"Magnetic field tuning of an excitonic insulator between the weak and strong coupling regimes in quantum limit graphite","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_created":"2019-11-19T13:17:46Z","article_type":"original","year":"2017","article_processing_charge":"No","fulldoi":"https://doi.org/10.1038/s41598-017-01693-5","doi":"10.1038/s41598-017-01693-5","date_published":"2017-05-04T00:00:00Z","publication":"Scientific Reports","date_updated":"2021-01-12T08:11:40Z","quality_controlled":"1","intvolume":"         7","author":[{"last_name":"Zhu","full_name":"Zhu, Z.","first_name":"Z."},{"full_name":"McDonald, R. D.","first_name":"R. D.","last_name":"McDonald"},{"last_name":"Shekhter","first_name":"A.","full_name":"Shekhter, A."},{"full_name":"Ramshaw, B. J.","first_name":"B. J.","last_name":"Ramshaw"},{"first_name":"Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147","full_name":"Modic, Kimberly A","last_name":"Modic"},{"full_name":"Balakirev, F. F.","first_name":"F. F.","last_name":"Balakirev"},{"last_name":"Harrison","full_name":"Harrison, N.","first_name":"N."}],"file_date_updated":"2020-07-14T12:47:48Z","citation":{"apa":"Zhu, Z., McDonald, R. D., Shekhter, A., Ramshaw, B. J., Modic, K. A., Balakirev, F. F., &#38; Harrison, N. (2017). Magnetic field tuning of an excitonic insulator between the weak and strong coupling regimes in quantum limit graphite. <i>Scientific Reports</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41598-017-01693-5\">https://doi.org/10.1038/s41598-017-01693-5</a>","ista":"Zhu Z, McDonald RD, Shekhter A, Ramshaw BJ, Modic KA, Balakirev FF, Harrison N. 2017. Magnetic field tuning of an excitonic insulator between the weak and strong coupling regimes in quantum limit graphite. Scientific Reports. 7, 1733.","mla":"Zhu, Z., et al. “Magnetic Field Tuning of an Excitonic Insulator between the Weak and Strong Coupling Regimes in Quantum Limit Graphite.” <i>Scientific Reports</i>, vol. 7, 1733, Springer Nature, 2017, doi:<a href=\"https://doi.org/10.1038/s41598-017-01693-5\">10.1038/s41598-017-01693-5</a>.","chicago":"Zhu, Z., R. D. McDonald, A. Shekhter, B. J. Ramshaw, Kimberly A Modic, F. F. Balakirev, and N. Harrison. “Magnetic Field Tuning of an Excitonic Insulator between the Weak and Strong Coupling Regimes in Quantum Limit Graphite.” <i>Scientific Reports</i>. Springer Nature, 2017. <a href=\"https://doi.org/10.1038/s41598-017-01693-5\">https://doi.org/10.1038/s41598-017-01693-5</a>.","ama":"Zhu Z, McDonald RD, Shekhter A, et al. Magnetic field tuning of an excitonic insulator between the weak and strong coupling regimes in quantum limit graphite. <i>Scientific Reports</i>. 2017;7. doi:<a href=\"https://doi.org/10.1038/s41598-017-01693-5\">10.1038/s41598-017-01693-5</a>","ieee":"Z. Zhu <i>et al.</i>, “Magnetic field tuning of an excitonic insulator between the weak and strong coupling regimes in quantum limit graphite,” <i>Scientific Reports</i>, vol. 7. Springer Nature, 2017.","short":"Z. Zhu, R.D. McDonald, A. Shekhter, B.J. Ramshaw, K.A. Modic, F.F. Balakirev, N. Harrison, Scientific Reports 7 (2017)."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"article_number":"1733","type":"journal_article","file":[{"file_size":1571567,"date_updated":"2020-07-14T12:47:48Z","file_name":"2017_ScientificReports_Zhu.pdf","creator":"dernst","file_id":"7111","checksum":"801f80b04ecd1ead95c8ab9827cbe067","relation":"main_file","date_created":"2019-11-26T11:58:58Z","content_type":"application/pdf","access_level":"open_access"}],"volume":7,"publication_identifier":{"issn":["2045-2322"]},"oa":1,"language":[{"iso":"eng"}],"ddc":["530"],"publisher":"Springer Nature"},{"abstract":[{"text":"Broken fourfold rotational (C4) symmetry is observed in the experimental properties of several classes of unconventional superconductors. It has been proposed that this symmetry breaking is important for superconducting pairing in these materials, but in the high-Tc cuprates this broken symmetry has never been observed on the Fermi surface. Here we report a pronounced anisotropy in the angle dependence of the interlayer magnetoresistance of the underdoped high transition temperature (high-Tc) superconductor YBa2Cu3O6.58, directly revealing broken C4 symmetry on the Fermi surface. Moreover, we demonstrate that this Fermi surface has C2 symmetry of the type produced by a uniaxial or anisotropic density-wave phase. This establishes the central role of C4 symmetry breaking in the Fermi surface reconstruction of YBa2Cu3O6+δ , and suggests a striking degree of universality among unconventional superconductors.","lang":"eng"}],"_id":"7067","oa_version":"Published Version","title":"Broken rotational symmetry on the Fermi surface of a high-Tc superconductor","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","extern":"1","month":"02","day":"13","status":"public","fulldoi":"https://doi.org/10.1038/s41535-017-0013-z","doi":"10.1038/s41535-017-0013-z","article_processing_charge":"No","year":"2017","date_created":"2019-11-19T13:18:30Z","publication_status":"published","article_type":"original","intvolume":"         2","quality_controlled":"1","date_updated":"2021-01-12T08:11:40Z","publication":"npj Quantum Materials","date_published":"2017-02-13T00:00:00Z","citation":{"short":"B.J. Ramshaw, N. Harrison, S.E. Sebastian, S. Ghannadzadeh, K.A. Modic, D.A. Bonn, W.N. Hardy, R. Liang, P.A. Goddard, Npj Quantum Materials 2 (2017).","ieee":"B. J. Ramshaw <i>et al.</i>, “Broken rotational symmetry on the Fermi surface of a high-Tc superconductor,” <i>npj Quantum Materials</i>, vol. 2, no. 1. Springer Nature, 2017.","ama":"Ramshaw BJ, Harrison N, Sebastian SE, et al. Broken rotational symmetry on the Fermi surface of a high-Tc superconductor. <i>npj Quantum Materials</i>. 2017;2(1). doi:<a href=\"https://doi.org/10.1038/s41535-017-0013-z\">10.1038/s41535-017-0013-z</a>","chicago":"Ramshaw, B. J., N. Harrison, S. E. Sebastian, S. Ghannadzadeh, Kimberly A Modic, D. A. Bonn, W. N. Hardy, Ruixing Liang, and P. A. Goddard. “Broken Rotational Symmetry on the Fermi Surface of a High-Tc Superconductor.” <i>Npj Quantum Materials</i>. Springer Nature, 2017. <a href=\"https://doi.org/10.1038/s41535-017-0013-z\">https://doi.org/10.1038/s41535-017-0013-z</a>.","mla":"Ramshaw, B. J., et al. “Broken Rotational Symmetry on the Fermi Surface of a High-Tc Superconductor.” <i>Npj Quantum Materials</i>, vol. 2, no. 1, 8, Springer Nature, 2017, doi:<a href=\"https://doi.org/10.1038/s41535-017-0013-z\">10.1038/s41535-017-0013-z</a>.","ista":"Ramshaw BJ, Harrison N, Sebastian SE, Ghannadzadeh S, Modic KA, Bonn DA, Hardy WN, Liang R, Goddard PA. 2017. Broken rotational symmetry on the Fermi surface of a high-Tc superconductor. npj Quantum Materials. 2(1), 8.","apa":"Ramshaw, B. J., Harrison, N., Sebastian, S. E., Ghannadzadeh, S., Modic, K. A., Bonn, D. A., … Goddard, P. A. (2017). Broken rotational symmetry on the Fermi surface of a high-Tc superconductor. <i>Npj Quantum Materials</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41535-017-0013-z\">https://doi.org/10.1038/s41535-017-0013-z</a>"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"author":[{"last_name":"Ramshaw","full_name":"Ramshaw, B. J.","first_name":"B. J."},{"first_name":"N.","full_name":"Harrison, N.","last_name":"Harrison"},{"last_name":"Sebastian","full_name":"Sebastian, S. E.","first_name":"S. E."},{"last_name":"Ghannadzadeh","full_name":"Ghannadzadeh, S.","first_name":"S."},{"first_name":"Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","full_name":"Modic, Kimberly A","orcid":"0000-0001-9760-3147","last_name":"Modic"},{"full_name":"Bonn, D. A.","first_name":"D. A.","last_name":"Bonn"},{"last_name":"Hardy","first_name":"W. N.","full_name":"Hardy, W. N."},{"last_name":"Liang","full_name":"Liang, Ruixing","first_name":"Ruixing"},{"last_name":"Goddard","full_name":"Goddard, P. A.","first_name":"P. A."}],"file_date_updated":"2020-07-14T12:47:48Z","type":"journal_article","issue":"1","article_number":"8","publication_identifier":{"issn":["2397-4648"]},"volume":2,"file":[{"date_created":"2019-11-26T12:57:11Z","content_type":"application/pdf","access_level":"open_access","checksum":"433a26a7e14206e139f3fec2c8ee8623","relation":"main_file","creator":"dernst","file_id":"7115","file_size":1383236,"file_name":"2017_NPJ_Ramshaw.pdf","date_updated":"2020-07-14T12:47:48Z"}],"publisher":"Springer Nature","ddc":["530"],"oa":1,"language":[{"iso":"eng"}]},{"oa_version":"Preprint","_id":"707","ec_funded":1,"abstract":[{"text":"We answer a question of M. Gromov on the waist of the unit ball.","lang":"eng"}],"department":[{"_id":"HeEd"}],"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000407045900012"],"arxiv":["1608.06279"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"A tight estimate for the waist of the ball ","corr_author":"1","isi":1,"status":"public","day":"01","month":"08","article_processing_charge":"No","scopus_import":"1","doi":"10.1112/blms.12062","fulldoi":"https://doi.org/10.1112/blms.12062","publication_status":"published","date_created":"2018-12-11T11:48:02Z","year":"2017","date_updated":"2025-09-10T11:04:43Z","quality_controlled":"1","intvolume":"        49","publist_id":"6982","date_published":"2017-08-01T00:00:00Z","publication":"Bulletin of the London Mathematical Society","author":[{"last_name":"Akopyan","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy"},{"full_name":"Karasev, Roman","first_name":"Roman","last_name":"Karasev"}],"citation":{"ista":"Akopyan A, Karasev R. 2017. A tight estimate for the waist of the ball . Bulletin of the London Mathematical Society. 49(4), 690–693.","mla":"Akopyan, Arseniy, and Roman Karasev. “A Tight Estimate for the Waist of the Ball .” <i>Bulletin of the London Mathematical Society</i>, vol. 49, no. 4, Wiley, 2017, pp. 690–93, doi:<a href=\"https://doi.org/10.1112/blms.12062\">10.1112/blms.12062</a>.","apa":"Akopyan, A., &#38; Karasev, R. (2017). A tight estimate for the waist of the ball . <i>Bulletin of the London Mathematical Society</i>. Wiley. <a href=\"https://doi.org/10.1112/blms.12062\">https://doi.org/10.1112/blms.12062</a>","chicago":"Akopyan, Arseniy, and Roman Karasev. “A Tight Estimate for the Waist of the Ball .” <i>Bulletin of the London Mathematical Society</i>. Wiley, 2017. <a href=\"https://doi.org/10.1112/blms.12062\">https://doi.org/10.1112/blms.12062</a>.","ama":"Akopyan A, Karasev R. A tight estimate for the waist of the ball . <i>Bulletin of the London Mathematical Society</i>. 2017;49(4):690-693. doi:<a href=\"https://doi.org/10.1112/blms.12062\">10.1112/blms.12062</a>","ieee":"A. Akopyan and R. Karasev, “A tight estimate for the waist of the ball ,” <i>Bulletin of the London Mathematical Society</i>, vol. 49, no. 4. Wiley, pp. 690–693, 2017.","short":"A. Akopyan, R. Karasev, Bulletin of the London Mathematical Society 49 (2017) 690–693."},"main_file_link":[{"url":"https://arxiv.org/abs/1608.06279","open_access":"1"}],"type":"journal_article","issue":"4","volume":49,"publication_identifier":{"issn":["0024-6093"]},"publisher":"Wiley","page":"690 - 693","language":[{"iso":"eng"}],"oa":1,"arxiv":1},{"day":"22","month":"08","status":"public","isi":1,"corr_author":"1","title":"Different patterns of neuronal activity trigger distinct responses of oligodendrocyte precursor cells in the corpus callosum","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","has_accepted_license":"1","external_id":{"isi":["000408756200005"]},"department":[{"_id":"SaSi"}],"_id":"708","abstract":[{"text":"In the developing and adult brain, oligodendrocyte precursor cells (OPCs) are influenced by neuronal activity: they are involved in synaptic signaling with neurons, and their proliferation and differentiation into myelinating glia can be altered by transient changes in neuronal firing. An important question that has been unanswered is whether OPCs can discriminate different patterns of neuronal activity and respond to them in a distinct way. Here, we demonstrate in brain slices that the pattern of neuronal activity determines the functional changes triggered at synapses between axons and OPCs. Furthermore, we show that stimulation of the corpus callosum at different frequencies in vivo affects proliferation and differentiation of OPCs in a dissimilar way. Our findings suggest that neurons do not influence OPCs in “all-or-none” fashion but use their firing pattern to tune the response and behavior of these nonneuronal cells.","lang":"eng"}],"oa_version":"Published Version","publication":"PLoS Biology","date_published":"2017-08-22T00:00:00Z","publist_id":"6983","intvolume":"        15","quality_controlled":"1","date_updated":"2025-09-10T11:05:19Z","year":"2017","publication_status":"published","date_created":"2018-12-11T11:48:03Z","fulldoi":"https://doi.org/10.1371/journal.pbio.2001993","doi":"10.1371/journal.pbio.2001993","article_processing_charge":"No","scopus_import":"1","issue":"8","type":"journal_article","article_number":"e2001993","citation":{"short":"B. Nagy, A. Hovhannisyan, R. Barzan, T. Chen, M. Kukley, PLoS Biology 15 (2017).","ama":"Nagy B, Hovhannisyan A, Barzan R, Chen T, Kukley M. Different patterns of neuronal activity trigger distinct responses of oligodendrocyte precursor cells in the corpus callosum. <i>PLoS Biology</i>. 2017;15(8). doi:<a href=\"https://doi.org/10.1371/journal.pbio.2001993\">10.1371/journal.pbio.2001993</a>","ieee":"B. Nagy, A. Hovhannisyan, R. Barzan, T. Chen, and M. Kukley, “Different patterns of neuronal activity trigger distinct responses of oligodendrocyte precursor cells in the corpus callosum,” <i>PLoS Biology</i>, vol. 15, no. 8. Public Library of Science, 2017.","chicago":"Nagy, Balint, Anahit Hovhannisyan, Ruxandra Barzan, Ting Chen, and Maria Kukley. “Different Patterns of Neuronal Activity Trigger Distinct Responses of Oligodendrocyte Precursor Cells in the Corpus Callosum.” <i>PLoS Biology</i>. Public Library of Science, 2017. <a href=\"https://doi.org/10.1371/journal.pbio.2001993\">https://doi.org/10.1371/journal.pbio.2001993</a>.","apa":"Nagy, B., Hovhannisyan, A., Barzan, R., Chen, T., &#38; Kukley, M. (2017). Different patterns of neuronal activity trigger distinct responses of oligodendrocyte precursor cells in the corpus callosum. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.2001993\">https://doi.org/10.1371/journal.pbio.2001993</a>","ista":"Nagy B, Hovhannisyan A, Barzan R, Chen T, Kukley M. 2017. Different patterns of neuronal activity trigger distinct responses of oligodendrocyte precursor cells in the corpus callosum. PLoS Biology. 15(8), e2001993.","mla":"Nagy, Balint, et al. “Different Patterns of Neuronal Activity Trigger Distinct Responses of Oligodendrocyte Precursor Cells in the Corpus Callosum.” <i>PLoS Biology</i>, vol. 15, no. 8, e2001993, Public Library of Science, 2017, doi:<a href=\"https://doi.org/10.1371/journal.pbio.2001993\">10.1371/journal.pbio.2001993</a>."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"author":[{"last_name":"Nagy","full_name":"Nagy, Balint","orcid":"0000-0002-4002-4686","id":"30F830CE-02D1-11E9-9BAA-DAF4881429F2","first_name":"Balint"},{"last_name":"Hovhannisyan","full_name":"Hovhannisyan, Anahit","first_name":"Anahit"},{"first_name":"Ruxandra","full_name":"Barzan, Ruxandra","last_name":"Barzan"},{"last_name":"Chen","full_name":"Chen, Ting","first_name":"Ting"},{"full_name":"Kukley, Maria","first_name":"Maria","last_name":"Kukley"}],"file_date_updated":"2020-07-14T12:47:49Z","oa":1,"language":[{"iso":"eng"}],"publisher":"Public Library of Science","pubrep_id":"889","ddc":["576","610"],"file":[{"creator":"system","file_id":"5156","file_name":"IST-2017-889-v1+1_journal.pbio.2001993.pdf","date_updated":"2020-07-14T12:47:49Z","file_size":18155365,"date_created":"2018-12-12T10:15:35Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"0c974f430682dc832ea7b27ab5a93124"}],"publication_identifier":{"issn":["1544-9173"]},"volume":15},{"title":"Renyi entropy estimation revisited","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","month":"08","day":"01","status":"public","corr_author":"1","department":[{"_id":"KrPi"}],"project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"_id":"710","ec_funded":1,"abstract":[{"lang":"eng","text":"We revisit the problem of estimating entropy of discrete distributions from independent samples, studied recently by Acharya, Orlitsky, Suresh and Tyagi (SODA 2015), improving their upper and lower bounds on the necessary sample size n. For estimating Renyi entropy of order alpha, up to constant accuracy and error probability, we show the following * Upper bounds n = O(1) 2^{(1-1/alpha)H_alpha} for integer alpha&gt;1, as the worst case over distributions with Renyi entropy equal to H_alpha. * Lower bounds n = Omega(1) K^{1-1/alpha} for any real alpha&gt;1, with the constant being an inverse polynomial of the accuracy, as the worst case over all distributions on K elements. Our upper bounds essentially replace the alphabet size by a factor exponential in the entropy, which offers improvements especially in low or medium entropy regimes (interesting for example in anomaly detection). As for the lower bounds, our proof explicitly shows how the complexity depends on both alphabet and accuracy, partially solving the open problem posted in previous works. The argument for upper bounds derives a clean identity for the variance of falling-power sum of a multinomial distribution. Our approach for lower bounds utilizes convex optimization to find a distribution with possibly worse estimation performance, and may be of independent interest as a tool to work with Le Cam’s two point method. "}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"publist_id":"6979","intvolume":"        81","quality_controlled":"1","date_updated":"2025-07-10T11:54:14Z","date_published":"2017-08-01T00:00:00Z","fulldoi":"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20","doi":"10.4230/LIPIcs.APPROX-RANDOM.2017.20","article_processing_charge":"No","scopus_import":"1","year":"2017","publication_status":"published","date_created":"2018-12-11T11:48:04Z","type":"conference","article_number":"20","conference":{"location":"Berkeley, USA","start_date":"2017-08-18","name":"20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX","end_date":"2017-08-18"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"citation":{"chicago":"Obremski, Maciej, and Maciej Skórski. “Renyi Entropy Estimation Revisited,” Vol. 81. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20\">https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20</a>.","apa":"Obremski, M., &#38; Skórski, M. (2017). Renyi entropy estimation revisited (Vol. 81). Presented at the 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, Berkeley, USA: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20\">https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20</a>","ista":"Obremski M, Skórski M. 2017. Renyi entropy estimation revisited. 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, LIPIcs, vol. 81, 20.","mla":"Obremski, Maciej, and Maciej Skórski. <i>Renyi Entropy Estimation Revisited</i>. Vol. 81, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20\">10.4230/LIPIcs.APPROX-RANDOM.2017.20</a>.","short":"M. Obremski, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ama":"Obremski M, Skórski M. Renyi entropy estimation revisited. In: Vol 81. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20\">10.4230/LIPIcs.APPROX-RANDOM.2017.20</a>","ieee":"M. Obremski and M. Skórski, “Renyi entropy estimation revisited,” presented at the 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, Berkeley, USA, 2017, vol. 81."},"author":[{"full_name":"Obremski, Maciej","first_name":"Maciej","last_name":"Obremski"},{"last_name":"Skórski","full_name":"Skórski, Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","first_name":"Maciej"}],"file_date_updated":"2020-07-14T12:47:49Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","pubrep_id":"888","ddc":["005","600"],"oa":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1868-8969"]},"volume":81,"file":[{"date_updated":"2020-07-14T12:47:49Z","file_name":"IST-2017-888-v1+1_LIPIcs-APPROX-RANDOM-2017-20.pdf","file_size":604813,"file_id":"4991","creator":"system","relation":"main_file","checksum":"89225c7dcec2c93838458c9102858985","date_created":"2018-12-12T10:13:10Z","access_level":"open_access","content_type":"application/pdf"}]},{"quality_controlled":"1","date_updated":"2025-07-10T11:54:15Z","publist_id":"6976","intvolume":"        85","date_published":"2017-08-01T00:00:00Z","article_processing_charge":"No","scopus_import":"1","fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2017.5","doi":"10.4230/LIPIcs.CONCUR.2017.5","publication_status":"published","date_created":"2018-12-11T11:48:04Z","year":"2017","has_accepted_license":"1","title":"Bidirectional nested weighted automata","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","month":"08","day":"01","status":"public","abstract":[{"lang":"eng","text":"Nested weighted automata (NWA) present a robust and convenient automata-theoretic formalism for quantitative specifications. Previous works have considered NWA that processed input words only in the forward direction. It is natural to allow the automata to process input words backwards as well, for example, to measure the maximal or average time between a response and the preceding request. We therefore introduce and study bidirectional NWA that can process input words in both directions. First, we show that bidirectional NWA can express interesting quantitative properties that are not expressible by forward-only NWA. Second, for the fundamental decision problems of emptiness and universality, we establish decidability and complexity results for the new framework which match the best-known results for the special case of forward-only NWA. Thus, for NWA, the increased expressiveness of bidirectionality is achieved at no additional computational complexity. This is in stark contrast to the unweighted case, where bidirectional finite automata are no more expressive but exponentially more succinct than their forward-only counterparts."}],"_id":"711","oa_version":"Published Version","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"alternative_title":["LIPIcs"],"ddc":["004","005"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","pubrep_id":"886","language":[{"iso":"eng"}],"oa":1,"volume":85,"publication_identifier":{"issn":["1868-8969"]},"file":[{"checksum":"d2bda4783821a6358333fe27f11f4737","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:08:02Z","file_size":570294,"date_updated":"2020-07-14T12:47:49Z","file_name":"IST-2017-886-v1+1_LIPIcs-CONCUR-2017-5.pdf","file_id":"4661","creator":"system"}],"article_number":"5","type":"conference","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Jan","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"}],"file_date_updated":"2020-07-14T12:47:49Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Bidirectional Nested Weighted Automata,” Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2017.5\">https://doi.org/10.4230/LIPIcs.CONCUR.2017.5</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2017). Bidirectional nested weighted automata (Vol. 85). Presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2017.5\">https://doi.org/10.4230/LIPIcs.CONCUR.2017.5</a>","ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Bidirectional nested weighted automata. 28th International Conference on Concurrency Theory, CONCUR, LIPIcs, vol. 85, 5.","mla":"Chatterjee, Krishnendu, et al. <i>Bidirectional Nested Weighted Automata</i>. Vol. 85, 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2017.5\">10.4230/LIPIcs.CONCUR.2017.5</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ama":"Chatterjee K, Henzinger TA, Otop J. Bidirectional nested weighted automata. In: Vol 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2017.5\">10.4230/LIPIcs.CONCUR.2017.5</a>","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Bidirectional nested weighted automata,” presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany, 2017, vol. 85."},"conference":{"end_date":"2017-09-08","location":"Berlin, Germany","name":"28th International Conference on Concurrency Theory, CONCUR","start_date":"2017-09-05"}},{"_id":"712","abstract":[{"lang":"eng","text":"We establish a weak–strong uniqueness principle for solutions to entropy-dissipating reaction–diffusion equations: As long as a strong solution to the reaction–diffusion equation exists, any weak solution and even any renormalized solution must coincide with this strong solution. Our assumptions on the reaction rates are just the entropy condition and local Lipschitz continuity; in particular, we do not impose any growth restrictions on the reaction rates. Therefore, our result applies to any single reversible reaction with mass-action kinetics as well as to systems of reversible reactions with mass-action kinetics satisfying the detailed balance condition. Renormalized solutions are known to exist globally in time for reaction–diffusion equations with entropy-dissipating reaction rates; in contrast, the global-in-time existence of weak solutions is in general still an open problem–even for smooth data–, thereby motivating the study of renormalized solutions. The key ingredient of our result is a careful adjustment of the usual relative entropy functional, whose evolution cannot be controlled properly for weak solutions or renormalized solutions."}],"oa_version":"Submitted Version","department":[{"_id":"JuFi"}],"external_id":{"isi":["000404309400009"],"arxiv":["1703.00730"]},"title":"Weak–strong uniqueness of solutions to entropy dissipating reaction–diffusion equations","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","corr_author":"1","day":"01","month":"08","status":"public","isi":1,"article_processing_charge":"No","scopus_import":"1","fulldoi":"https://doi.org/10.1016/j.na.2017.03.001","doi":"10.1016/j.na.2017.03.001","publication_status":"published","date_created":"2018-12-11T11:48:05Z","year":"2017","date_updated":"2026-04-16T10:01:49Z","quality_controlled":"1","publist_id":"6975","intvolume":"       159","date_published":"2017-08-01T00:00:00Z","publication":"Nonlinear Analysis: Theory, Methods and Applications","author":[{"orcid":"0000-0002-0479-558X","full_name":"Fischer, Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","first_name":"Julian L","last_name":"Fischer"}],"citation":{"ama":"Fischer JL. Weak–strong uniqueness of solutions to entropy dissipating reaction–diffusion equations. <i>Nonlinear Analysis: Theory, Methods and Applications</i>. 2017;159:181-207. doi:<a href=\"https://doi.org/10.1016/j.na.2017.03.001\">10.1016/j.na.2017.03.001</a>","ieee":"J. L. Fischer, “Weak–strong uniqueness of solutions to entropy dissipating reaction–diffusion equations,” <i>Nonlinear Analysis: Theory, Methods and Applications</i>, vol. 159. Elsevier, pp. 181–207, 2017.","short":"J.L. Fischer, Nonlinear Analysis: Theory, Methods and Applications 159 (2017) 181–207.","apa":"Fischer, J. L. (2017). Weak–strong uniqueness of solutions to entropy dissipating reaction–diffusion equations. <i>Nonlinear Analysis: Theory, Methods and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.na.2017.03.001\">https://doi.org/10.1016/j.na.2017.03.001</a>","mla":"Fischer, Julian L. “Weak–Strong Uniqueness of Solutions to Entropy Dissipating Reaction–Diffusion Equations.” <i>Nonlinear Analysis: Theory, Methods and Applications</i>, vol. 159, Elsevier, 2017, pp. 181–207, doi:<a href=\"https://doi.org/10.1016/j.na.2017.03.001\">10.1016/j.na.2017.03.001</a>.","ista":"Fischer JL. 2017. Weak–strong uniqueness of solutions to entropy dissipating reaction–diffusion equations. Nonlinear Analysis: Theory, Methods and Applications. 159, 181–207.","chicago":"Fischer, Julian L. “Weak–Strong Uniqueness of Solutions to Entropy Dissipating Reaction–Diffusion Equations.” <i>Nonlinear Analysis: Theory, Methods and Applications</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.na.2017.03.001\">https://doi.org/10.1016/j.na.2017.03.001</a>."},"main_file_link":[{"url":"https://arxiv.org/abs/1703.00730","open_access":"1"}],"type":"journal_article","volume":159,"publication_identifier":{"issn":["0362-546X"]},"publisher":"Elsevier","page":"181 - 207","arxiv":1,"language":[{"iso":"eng"}],"oa":1},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"citation":{"short":"D. Andergassen, C. Dotter, D. Wenzel, V. Sigl, P. Bammer, M. Muckenhuber, D. Mayer, T. Kulinski, H. Theussl, J. Penninger, C. Bock, D. Barlow, F. Pauler, Q. Hudson, ELife 6 (2017).","ama":"Andergassen D, Dotter C, Wenzel D, et al. Mapping the mouse Allelome reveals tissue specific regulation of allelic expression. <i>eLife</i>. 2017;6. doi:<a href=\"https://doi.org/10.7554/eLife.25125\">10.7554/eLife.25125</a>","ieee":"D. Andergassen <i>et al.</i>, “Mapping the mouse Allelome reveals tissue specific regulation of allelic expression,” <i>eLife</i>, vol. 6. eLife Sciences Publications, 2017.","chicago":"Andergassen, Daniel, Christoph Dotter, Dyniel Wenzel, Verena Sigl, Philipp Bammer, Markus Muckenhuber, Daniela Mayer, et al. “Mapping the Mouse Allelome Reveals Tissue Specific Regulation of Allelic Expression.” <i>ELife</i>. eLife Sciences Publications, 2017. <a href=\"https://doi.org/10.7554/eLife.25125\">https://doi.org/10.7554/eLife.25125</a>.","apa":"Andergassen, D., Dotter, C., Wenzel, D., Sigl, V., Bammer, P., Muckenhuber, M., … Hudson, Q. (2017). Mapping the mouse Allelome reveals tissue specific regulation of allelic expression. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.25125\">https://doi.org/10.7554/eLife.25125</a>","ista":"Andergassen D, Dotter C, Wenzel D, Sigl V, Bammer P, Muckenhuber M, Mayer D, Kulinski T, Theussl H, Penninger J, Bock C, Barlow D, Pauler F, Hudson Q. 2017. Mapping the mouse Allelome reveals tissue specific regulation of allelic expression. eLife. 6, e25125.","mla":"Andergassen, Daniel, et al. “Mapping the Mouse Allelome Reveals Tissue Specific Regulation of Allelic Expression.” <i>ELife</i>, vol. 6, e25125, eLife Sciences Publications, 2017, doi:<a href=\"https://doi.org/10.7554/eLife.25125\">10.7554/eLife.25125</a>."},"author":[{"last_name":"Andergassen","first_name":"Daniel","full_name":"Andergassen, Daniel"},{"last_name":"Dotter","id":"4C66542E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9033-9096","full_name":"Dotter, Christoph","first_name":"Christoph"},{"last_name":"Wenzel","first_name":"Dyniel","full_name":"Wenzel, Dyniel"},{"last_name":"Sigl","full_name":"Sigl, Verena","first_name":"Verena"},{"full_name":"Bammer, Philipp","first_name":"Philipp","last_name":"Bammer"},{"full_name":"Muckenhuber, Markus","first_name":"Markus","last_name":"Muckenhuber"},{"last_name":"Mayer","first_name":"Daniela","full_name":"Mayer, Daniela"},{"last_name":"Kulinski","full_name":"Kulinski, Tomasz","first_name":"Tomasz"},{"last_name":"Theussl","full_name":"Theussl, Hans","first_name":"Hans"},{"last_name":"Penninger","first_name":"Josef","full_name":"Penninger, Josef"},{"last_name":"Bock","first_name":"Christoph","full_name":"Bock, Christoph"},{"last_name":"Barlow","first_name":"Denise","full_name":"Barlow, Denise"},{"last_name":"Pauler","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7462-0048","full_name":"Pauler, Florian","first_name":"Florian"},{"last_name":"Hudson","full_name":"Hudson, Quanah","first_name":"Quanah"}],"file_date_updated":"2020-07-14T12:47:50Z","type":"journal_article","article_number":"e25125","file":[{"access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:13:36Z","checksum":"1ace3462e64a971b9ead896091829549","relation":"main_file","creator":"system","file_id":"5020","file_size":6399510,"date_updated":"2020-07-14T12:47:50Z","file_name":"IST-2017-885-v1+1_elife-25125-figures-v2.pdf"},{"creator":"system","file_id":"5021","date_updated":"2020-07-14T12:47:50Z","file_name":"IST-2017-885-v1+2_elife-25125-v2.pdf","file_size":4264398,"access_level":"open_access","date_created":"2018-12-12T10:13:36Z","content_type":"application/pdf","relation":"main_file","checksum":"6241dc31eeb87b03facadec3a53a6827"}],"publication_identifier":{"issn":["2050-084X"]},"volume":6,"language":[{"iso":"eng"}],"oa":1,"pubrep_id":"885","publisher":"eLife Sciences Publications","ddc":["576"],"external_id":{"isi":["000407617200001"]},"project":[{"name":"Revealing the mechanisms underlying drug interactions","call_identifier":"FWF","_id":"25E9AF9E-B435-11E9-9278-68D0E5697425","grant_number":"P27201-B22"}],"department":[{"_id":"GaNo"},{"_id":"SiHi"}],"_id":"713","abstract":[{"lang":"eng","text":"To determine the dynamics of allelic-specific expression during mouse development, we analyzed RNA-seq data from 23 F1 tissues from different developmental stages, including 19 female tissues allowing X chromosome inactivation (XCI) escapers to also be detected. We demonstrate that allelic expression arising from genetic or epigenetic differences is highly tissue-specific. We find that tissue-specific strain-biased gene expression may be regulated by tissue-specific enhancers or by post-transcriptional differences in stability between the alleles. We also find that escape from X-inactivation is tissue-specific, with leg muscle showing an unexpectedly high rate of XCI escapers. By surveying a range of tissues during development, and performing extensive validation, we are able to provide a high confidence list of mouse imprinted genes including 18 novel genes. This shows that cluster size varies dynamically during development and can be substantially larger than previously thought, with the Igf2r cluster extending over 10 Mb in placenta."}],"oa_version":"Published Version","day":"14","month":"08","status":"public","isi":1,"corr_author":"1","title":"Mapping the mouse Allelome reveals tissue specific regulation of allelic expression","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","has_accepted_license":"1","year":"2017","date_created":"2018-12-11T11:48:05Z","publication_status":"published","fulldoi":"https://doi.org/10.7554/eLife.25125","doi":"10.7554/eLife.25125","scopus_import":"1","article_processing_charge":"No","publication":"eLife","date_published":"2017-08-14T00:00:00Z","publist_id":"6971","intvolume":"         6","quality_controlled":"1","date_updated":"2025-09-10T11:02:33Z"},{"publisher":"Elsevier","page":"7 - 14","language":[{"iso":"eng"}],"oa":1,"volume":178,"publication_identifier":{"issn":["0376-8716"]},"acknowledgement":"This work was supported by the National Institutes of Health grants DA035926 (to MEA), and P30DA013429 (to EMU).","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5797705"}],"type":"journal_article","author":[{"last_name":"Brailoiu","first_name":"Gabriela","full_name":"Brailoiu, Gabriela"},{"last_name":"Deliu","full_name":"Deliu, Elena","orcid":"0000-0002-7370-5293","id":"37A40D7E-F248-11E8-B48F-1D18A9856A87","first_name":"Elena"},{"full_name":"Barr, Jeffrey","first_name":"Jeffrey","last_name":"Barr"},{"first_name":"Linda","full_name":"Console Bram, Linda","last_name":"Console Bram"},{"first_name":"Alexandra","full_name":"Ciuciu, Alexandra","last_name":"Ciuciu"},{"first_name":"Mary","full_name":"Abood, Mary","last_name":"Abood"},{"full_name":"Unterwald, Ellen","first_name":"Ellen","last_name":"Unterwald"},{"last_name":"Brǎiloiu","full_name":"Brǎiloiu, Eugen","first_name":"Eugen"}],"citation":{"apa":"Brailoiu, G., Deliu, E., Barr, J., Console Bram, L., Ciuciu, A., Abood, M., … Brǎiloiu, E. (2017). HIV Tat excites D1 receptor-like expressing neurons from rat nucleus accumbens. <i>Drug and Alcohol Dependence</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.drugalcdep.2017.04.015\">https://doi.org/10.1016/j.drugalcdep.2017.04.015</a>","ista":"Brailoiu G, Deliu E, Barr J, Console Bram L, Ciuciu A, Abood M, Unterwald E, Brǎiloiu E. 2017. HIV Tat excites D1 receptor-like expressing neurons from rat nucleus accumbens. Drug and Alcohol Dependence. 178, 7–14.","mla":"Brailoiu, Gabriela, et al. “HIV Tat Excites D1 Receptor-like Expressing Neurons from Rat Nucleus Accumbens.” <i>Drug and Alcohol Dependence</i>, vol. 178, Elsevier, 2017, pp. 7–14, doi:<a href=\"https://doi.org/10.1016/j.drugalcdep.2017.04.015\">10.1016/j.drugalcdep.2017.04.015</a>.","chicago":"Brailoiu, Gabriela, Elena Deliu, Jeffrey Barr, Linda Console Bram, Alexandra Ciuciu, Mary Abood, Ellen Unterwald, and Eugen Brǎiloiu. “HIV Tat Excites D1 Receptor-like Expressing Neurons from Rat Nucleus Accumbens.” <i>Drug and Alcohol Dependence</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.drugalcdep.2017.04.015\">https://doi.org/10.1016/j.drugalcdep.2017.04.015</a>.","ama":"Brailoiu G, Deliu E, Barr J, et al. HIV Tat excites D1 receptor-like expressing neurons from rat nucleus accumbens. <i>Drug and Alcohol Dependence</i>. 2017;178:7-14. doi:<a href=\"https://doi.org/10.1016/j.drugalcdep.2017.04.015\">10.1016/j.drugalcdep.2017.04.015</a>","ieee":"G. Brailoiu <i>et al.</i>, “HIV Tat excites D1 receptor-like expressing neurons from rat nucleus accumbens,” <i>Drug and Alcohol Dependence</i>, vol. 178. Elsevier, pp. 7–14, 2017.","short":"G. Brailoiu, E. Deliu, J. Barr, L. Console Bram, A. Ciuciu, M. Abood, E. Unterwald, E. Brǎiloiu, Drug and Alcohol Dependence 178 (2017) 7–14."},"date_updated":"2026-04-16T10:01:59Z","quality_controlled":"1","publist_id":"6967","intvolume":"       178","date_published":"2017-09-01T00:00:00Z","publication":"Drug and Alcohol Dependence","pmid":1,"scopus_import":"1","article_processing_charge":"No","fulldoi":"https://doi.org/10.1016/j.drugalcdep.2017.04.015","doi":"10.1016/j.drugalcdep.2017.04.015","publication_status":"published","article_type":"original","date_created":"2018-12-11T11:48:05Z","year":"2017","title":"HIV Tat excites D1 receptor-like expressing neurons from rat nucleus accumbens","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","month":"09","day":"01","isi":1,"status":"public","abstract":[{"lang":"eng","text":"Background HIV-1 infection and drug abuse are frequently co-morbid and their association greatly increases the severity of HIV-1-induced neuropathology. While nucleus accumbens (NAcc) function is severely perturbed by drugs of abuse, little is known about how HIV-1 infection affects NAcc. Methods We used calcium and voltage imaging to investigate the effect of HIV-1 trans-activator of transcription (Tat) on rat NAcc. Based on previous neuronal studies, we hypothesized that Tat modulates intracellular Ca2+ homeostasis of NAcc neurons. Results We provide evidence that Tat triggers a Ca2+ signaling cascade in NAcc medium spiny neurons (MSN) expressing D1-like dopamine receptors leading to neuronal depolarization. Firstly, Tat induced inositol 1,4,5-trisphsophate (IP3) receptor-mediated Ca2+ release from endoplasmic reticulum, followed by Ca2+ and Na+ influx via transient receptor potential canonical channels. The influx of cations depolarizes the membrane promoting additional Ca2+ entry through voltage-gated P/Q-type Ca2+ channels and opening of tetrodotoxin-sensitive Na+ channels. By activating this mechanism, Tat elicits a feed-forward depolarization increasing the excitability of D1-phosphatidylinositol-linked NAcc MSN. We previously found that cocaine targets NAcc neurons directly (independent of the inhibition of dopamine transporter) only when IP3-generating mechanisms are concomitantly initiated. When tested here, cocaine produced a dose-dependent potentiation of the effect of Tat on cytosolic Ca2+. Conclusion We describe for the first time a HIV-1 Tat-triggered Ca2+ signaling in MSN of NAcc involving TRPC and depolarization and a potentiation of the effect of Tat by cocaine, which may be relevant for the reward axis in cocaine-abusing HIV-1-positive patients."}],"_id":"714","oa_version":"Submitted Version","department":[{"_id":"GaNo"}],"external_id":{"pmid":["28623807"],"isi":["000409152300002"]}},{"external_id":{"arxiv":["1201.2829"],"isi":["000443590400005"]},"oa_version":"Preprint","abstract":[{"text":"Two-player games on graphs are central in many problems in formal verification and program analysis, such as synthesis and verification of open systems. In this work, we consider solving recursive game graphs (or pushdown game graphs) that model the control flow of sequential programs with recursion.While pushdown games have been studied before with qualitative objectives-such as reachability and ?-regular objectives- in this work, we study for the first time such games with the most well-studied quantitative objective, the mean-payoff objective. In pushdown games, two types of strategies are relevant: (1) global strategies, which depend on the entire global history; and (2) modular strategies, which have only local memory and thus do not depend on the context of invocation but rather only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two-player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP-hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity by showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games and memoryless modular strategies are sufficient in two-player pushdown games. Finally, we also show that all the problems have the same complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded.","lang":"eng"}],"_id":"716","ec_funded":1,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"department":[{"_id":"KrCh"}],"corr_author":"1","isi":1,"status":"public","month":"09","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"The complexity of mean-payoff pushdown games","publication_status":"published","date_created":"2018-12-11T11:48:06Z","article_type":"original","year":"2017","scopus_import":"1","article_processing_charge":"No","doi":"10.1145/3121408","fulldoi":"https://doi.org/10.1145/3121408","date_published":"2017-09-01T00:00:00Z","publication":"Journal of the ACM","quality_controlled":"1","date_updated":"2025-09-10T11:01:10Z","intvolume":"        64","publist_id":"6964","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"full_name":"Velner, Yaron","first_name":"Yaron","last_name":"Velner"}],"citation":{"chicago":"Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.” <i>Journal of the ACM</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3121408\">https://doi.org/10.1145/3121408</a>.","apa":"Chatterjee, K., &#38; Velner, Y. (2017). The complexity of mean-payoff pushdown games. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/3121408\">https://doi.org/10.1145/3121408</a>","ista":"Chatterjee K, Velner Y. 2017. The complexity of mean-payoff pushdown games. Journal of the ACM. 64(5), 34.","mla":"Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.” <i>Journal of the ACM</i>, vol. 64, no. 5, ACM, 2017, p. 34, doi:<a href=\"https://doi.org/10.1145/3121408\">10.1145/3121408</a>.","short":"K. Chatterjee, Y. Velner, Journal of the ACM 64 (2017) 34.","ieee":"K. Chatterjee and Y. Velner, “The complexity of mean-payoff pushdown games,” <i>Journal of the ACM</i>, vol. 64, no. 5. ACM, p. 34, 2017.","ama":"Chatterjee K, Velner Y. The complexity of mean-payoff pushdown games. <i>Journal of the ACM</i>. 2017;64(5):34. doi:<a href=\"https://doi.org/10.1145/3121408\">10.1145/3121408</a>"},"main_file_link":[{"url":"https://arxiv.org/abs/1201.2829","open_access":"1"}],"issue":"5","type":"journal_article","volume":64,"publication_identifier":{"issn":["0004-5411"]},"page":"34","language":[{"iso":"eng"}],"oa":1,"arxiv":1,"publisher":"ACM"},{"day":"01","month":"12","related_material":{"record":[{"status":"public","relation":"research_paper","id":"614"}]},"status":"public","type":"research_data","title":"Supplementary Files for \"The deep conservation of the Lepidoptera Z chromosome suggests a non canonical origin of the W\"","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","contributor":[{"first_name":"Christelle","orcid":"0000-0001-8441-5075","id":"32DF5794-F248-11E8-B48F-1D18A9856A87","last_name":"Fraisse"},{"orcid":"0000-0002-8101-2518","id":"2C921A7A-F248-11E8-B48F-1D18A9856A87","first_name":"Marion A L","last_name":"Picard"},{"last_name":"Vicoso","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4579-8306","first_name":"Beatriz"}],"citation":{"ieee":"C. Fraisse, “Supplementary Files for ‘The deep conservation of the Lepidoptera Z chromosome suggests a non canonical origin of the W.’” Institute of Science and Technology Austria, 2017.","ama":"Fraisse C. Supplementary Files for “The deep conservation of the Lepidoptera Z chromosome suggests a non canonical origin of the W.” 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7163\">10.15479/AT:ISTA:7163</a>","short":"C. Fraisse, (2017).","apa":"Fraisse, C. (2017). Supplementary Files for “The deep conservation of the Lepidoptera Z chromosome suggests a non canonical origin of the W.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7163\">https://doi.org/10.15479/AT:ISTA:7163</a>","mla":"Fraisse, Christelle. <i>Supplementary Files for “The Deep Conservation of the Lepidoptera Z Chromosome Suggests a Non Canonical Origin of the W.”</i> Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7163\">10.15479/AT:ISTA:7163</a>.","ista":"Fraisse C. 2017. Supplementary Files for ‘The deep conservation of the Lepidoptera Z chromosome suggests a non canonical origin of the W’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:7163\">10.15479/AT:ISTA:7163</a>.","chicago":"Fraisse, Christelle. “Supplementary Files for ‘The Deep Conservation of the Lepidoptera Z Chromosome Suggests a Non Canonical Origin of the W.’” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:7163\">https://doi.org/10.15479/AT:ISTA:7163</a>."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"project":[{"call_identifier":"FWF","name":"Sex chromosome evolution under male- and female- heterogamety","grant_number":"P28842-B22","_id":"250ED89C-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"BeVi"},{"_id":"NiBa"}],"_id":"7163","author":[{"first_name":"Christelle","orcid":"0000-0001-8441-5075","full_name":"Fraisse, Christelle","id":"32DF5794-F248-11E8-B48F-1D18A9856A87","last_name":"Fraisse"}],"abstract":[{"lang":"eng","text":"The de novo genome assemblies generated for this study, and the associated metadata."}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:50Z","oa":1,"date_published":"2017-12-01T00:00:00Z","publisher":"Institute of Science and Technology Austria","date_updated":"2025-09-11T07:33:33Z","ddc":["576"],"year":"2017","file":[{"access_level":"open_access","date_created":"2019-12-10T08:46:46Z","content_type":"application/zip","checksum":"3cae8a2e3cbf8703399b9c483aaba7f3","relation":"main_file","file_id":"7164","creator":"cfraisse","file_size":841375478,"file_name":"Vicoso_Cohridella_Ndegeerella_Tsylvina_genome_assemblies.zip","date_updated":"2020-07-14T12:47:50Z"}],"date_created":"2019-12-09T23:03:03Z","fulldoi":"https://doi.org/10.15479/AT:ISTA:7163","doi":"10.15479/AT:ISTA:7163","article_processing_charge":"No"},{"volume":88,"acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), Microsoft faculty fellows award, the RICH Model Toolkit (ICT COST Action IC0901), and was carried out in partial fulfillment of the requirements for the Ph.D. degree of the second author.","publisher":"Academic Press","page":"236 - 259","arxiv":1,"oa":1,"language":[{"iso":"eng"}],"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Yaron","full_name":"Velner, Yaron","last_name":"Velner"}],"citation":{"short":"K. Chatterjee, Y. Velner, Journal of Computer and System Sciences 88 (2017) 236–259.","ieee":"K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” <i>Journal of Computer and System Sciences</i>, vol. 88. Academic Press, pp. 236–259, 2017.","ama":"Chatterjee K, Velner Y. Hyperplane separation technique for multidimensional mean-payoff games. <i>Journal of Computer and System Sciences</i>. 2017;88:236-259. doi:<a href=\"https://doi.org/10.1016/j.jcss.2017.04.005\">10.1016/j.jcss.2017.04.005</a>","chicago":"Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” <i>Journal of Computer and System Sciences</i>. Academic Press, 2017. <a href=\"https://doi.org/10.1016/j.jcss.2017.04.005\">https://doi.org/10.1016/j.jcss.2017.04.005</a>.","apa":"Chatterjee, K., &#38; Velner, Y. (2017). Hyperplane separation technique for multidimensional mean-payoff games. <i>Journal of Computer and System Sciences</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.jcss.2017.04.005\">https://doi.org/10.1016/j.jcss.2017.04.005</a>","mla":"Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” <i>Journal of Computer and System Sciences</i>, vol. 88, Academic Press, 2017, pp. 236–59, doi:<a href=\"https://doi.org/10.1016/j.jcss.2017.04.005\">10.1016/j.jcss.2017.04.005</a>.","ista":"Chatterjee K, Velner Y. 2017. Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. 88, 236–259."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1210.3141"}],"type":"journal_article","scopus_import":"1","article_processing_charge":"No","fulldoi":"https://doi.org/10.1016/j.jcss.2017.04.005","doi":"10.1016/j.jcss.2017.04.005","publication_status":"published","date_created":"2018-12-11T11:48:07Z","year":"2017","date_updated":"2025-09-10T11:00:30Z","quality_controlled":"1","publist_id":"6963","intvolume":"        88","date_published":"2017-09-01T00:00:00Z","publication":"Journal of Computer and System Sciences","ec_funded":1,"_id":"717","abstract":[{"lang":"eng","text":"We consider finite-state and recursive game graphs with multidimensional mean-payoff objectives. In recursive games two types of strategies are relevant: global strategies and modular strategies. Our contributions are: (1) We show that finite-state multidimensional mean-payoff games can be solved in polynomial time if the number of dimensions and the maximal absolute value of weights are fixed; whereas for arbitrary dimensions the problem is coNP-complete. (2) We show that one-player recursive games with multidimensional mean-payoff objectives can be solved in polynomial time. Both above algorithms are based on hyperplane separation technique. (3) For recursive games we show that under modular strategies the multidimensional problem is undecidable. We show that if the number of modules, exits, and the maximal absolute value of the weights are fixed, then one-dimensional recursive mean-payoff games under modular strategies can be solved in polynomial time, whereas for unbounded number of exits or modules the problem is NP-hard."}],"oa_version":"Preprint","department":[{"_id":"KrCh"}],"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"external_id":{"arxiv":["1210.3141"],"isi":["000403857100014"]},"title":"Hyperplane separation technique for multidimensional mean-payoff games","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"09","related_material":{"record":[{"id":"2329","relation":"earlier_version","status":"public"}]},"day":"01","status":"public","isi":1},{"external_id":{"arxiv":["1607.05915"],"isi":["000416417500004"]},"_id":"718","abstract":[{"lang":"eng","text":"Mapping every simplex in the Delaunay mosaic of a discrete point set to the radius of the smallest empty circumsphere gives a generalized discrete Morse function. Choosing the points from a Poisson point process in ℝ n , we study the expected number of simplices in the Delaunay mosaic as well as the expected number of critical simplices and nonsingular intervals in the corresponding generalized discrete gradient. Observing connections with other probabilistic models, we obtain precise expressions for the expected numbers in low dimensions. In particular, we obtain the expected numbers of simplices in the Poisson–Delaunay mosaic in dimensions n ≤ 4."}],"ec_funded":1,"oa_version":"Preprint","department":[{"_id":"HeEd"}],"project":[{"call_identifier":"FP7","name":"Topological Complex Systems","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"month":"09","related_material":{"record":[{"id":"6287","relation":"dissertation_contains","status":"public"}]},"day":"01","status":"public","isi":1,"title":"Expected sizes of poisson Delaunay mosaics and their discrete Morse functions","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","date_created":"2018-12-11T11:48:07Z","year":"2017","scopus_import":"1","article_processing_charge":"No","fulldoi":"https://doi.org/10.1017/apr.2017.20","doi":"10.1017/apr.2017.20","date_published":"2017-09-01T00:00:00Z","publication":"Advances in Applied Probability","quality_controlled":"1","date_updated":"2026-04-08T14:19:30Z","publist_id":"6962","intvolume":"        49","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0659-3201","full_name":"Nikitenko, Anton","first_name":"Anton","last_name":"Nikitenko"},{"last_name":"Reitzner","full_name":"Reitzner, Matthias","first_name":"Matthias"}],"citation":{"apa":"Edelsbrunner, H., Nikitenko, A., &#38; Reitzner, M. (2017). Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. <i>Advances in Applied Probability</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/apr.2017.20\">https://doi.org/10.1017/apr.2017.20</a>","ista":"Edelsbrunner H, Nikitenko A, Reitzner M. 2017. Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. Advances in Applied Probability. 49(3), 745–767.","mla":"Edelsbrunner, Herbert, et al. “Expected Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.” <i>Advances in Applied Probability</i>, vol. 49, no. 3, Cambridge University Press, 2017, pp. 745–67, doi:<a href=\"https://doi.org/10.1017/apr.2017.20\">10.1017/apr.2017.20</a>.","chicago":"Edelsbrunner, Herbert, Anton Nikitenko, and Matthias Reitzner. “Expected Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.” <i>Advances in Applied Probability</i>. Cambridge University Press, 2017. <a href=\"https://doi.org/10.1017/apr.2017.20\">https://doi.org/10.1017/apr.2017.20</a>.","ieee":"H. Edelsbrunner, A. Nikitenko, and M. Reitzner, “Expected sizes of poisson Delaunay mosaics and their discrete Morse functions,” <i>Advances in Applied Probability</i>, vol. 49, no. 3. Cambridge University Press, pp. 745–767, 2017.","ama":"Edelsbrunner H, Nikitenko A, Reitzner M. Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. <i>Advances in Applied Probability</i>. 2017;49(3):745-767. doi:<a href=\"https://doi.org/10.1017/apr.2017.20\">10.1017/apr.2017.20</a>","short":"H. Edelsbrunner, A. Nikitenko, M. Reitzner, Advances in Applied Probability 49 (2017) 745–767."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.05915"}],"type":"journal_article","issue":"3","volume":49,"publication_identifier":{"issn":["0001-8678"]},"page":"745 - 767","arxiv":1,"oa":1,"language":[{"iso":"eng"}],"publisher":"Cambridge University Press"},{"date_published":"2017-09-19T00:00:00Z","publication":"PLoS Computational Biology","date_updated":"2025-09-10T10:58:42Z","quality_controlled":"1","intvolume":"        13","publist_id":"6960","publication_status":"published","date_created":"2018-12-11T11:48:08Z","year":"2017","scopus_import":"1","article_processing_charge":"Yes","doi":"10.1371/journal.pcbi.1005763","fulldoi":"https://doi.org/10.1371/journal.pcbi.1005763","corr_author":"1","status":"public","isi":1,"day":"19","month":"09","has_accepted_license":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Probabilistic models for neural populations that naturally capture global coupling and criticality","external_id":{"isi":["000411981000042"]},"oa_version":"Published Version","abstract":[{"text":"Advances in multi-unit recordings pave the way for statistical modeling of activity patterns in large neural populations. Recent studies have shown that the summed activity of all neurons strongly shapes the population response. A separate recent finding has been that neural populations also exhibit criticality, an anomalously large dynamic range for the probabilities of different population activity patterns. Motivated by these two observations, we introduce a class of probabilistic models which takes into account the prior knowledge that the neural population could be globally coupled and close to critical. These models consist of an energy function which parametrizes interactions between small groups of neurons, and an arbitrary positive, strictly increasing, and twice differentiable function which maps the energy of a population pattern to its probability. We show that: 1) augmenting a pairwise Ising model with a nonlinearity yields an accurate description of the activity of retinal ganglion cells which outperforms previous models based on the summed activity of neurons; 2) prior knowledge that the population is critical translates to prior expectations about the shape of the nonlinearity; 3) the nonlinearity admits an interpretation in terms of a continuous latent variable globally coupling the system whose distribution we can infer from data. Our method is independent of the underlying system’s state space; hence, it can be applied to other systems such as natural scenes or amino acid sequences of proteins which are also known to exhibit criticality.","lang":"eng"}],"_id":"720","department":[{"_id":"GaTk"}],"project":[{"_id":"255008E4-B435-11E9-9278-68D0E5697425","grant_number":"RGP0065/2012","name":"Information processing and computation in fish groups"},{"call_identifier":"FWF","name":"Sensitivity to higher-order statistics in natural scenes","grant_number":"P 25651-N26","_id":"254D1A94-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"oa":1,"ddc":["530","571"],"pubrep_id":"884","publisher":"Public Library of Science","file":[{"file_id":"5352","creator":"system","file_name":"IST-2017-884-v1+1_journal.pcbi.1005763.pdf","date_updated":"2020-07-14T12:47:53Z","file_size":14167050,"access_level":"open_access","date_created":"2018-12-12T10:18:30Z","content_type":"application/pdf","relation":"main_file","checksum":"81107096c19771c36ddbe6f0282a3acb"}],"volume":13,"publication_identifier":{"issn":["1553-734X"]},"article_number":"e1005763","issue":"9","type":"journal_article","file_date_updated":"2020-07-14T12:47:53Z","author":[{"first_name":"Jan","full_name":"Humplik, Jan","id":"2E9627A8-F248-11E8-B48F-1D18A9856A87","last_name":"Humplik"},{"orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper","last_name":"Tkacik"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"citation":{"short":"J. Humplik, G. Tkačik, PLoS Computational Biology 13 (2017).","ieee":"J. Humplik and G. Tkačik, “Probabilistic models for neural populations that naturally capture global coupling and criticality,” <i>PLoS Computational Biology</i>, vol. 13, no. 9. Public Library of Science, 2017.","ama":"Humplik J, Tkačik G. Probabilistic models for neural populations that naturally capture global coupling and criticality. <i>PLoS Computational Biology</i>. 2017;13(9). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1005763\">10.1371/journal.pcbi.1005763</a>","chicago":"Humplik, Jan, and Gašper Tkačik. “Probabilistic Models for Neural Populations That Naturally Capture Global Coupling and Criticality.” <i>PLoS Computational Biology</i>. Public Library of Science, 2017. <a href=\"https://doi.org/10.1371/journal.pcbi.1005763\">https://doi.org/10.1371/journal.pcbi.1005763</a>.","mla":"Humplik, Jan, and Gašper Tkačik. “Probabilistic Models for Neural Populations That Naturally Capture Global Coupling and Criticality.” <i>PLoS Computational Biology</i>, vol. 13, no. 9, e1005763, Public Library of Science, 2017, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1005763\">10.1371/journal.pcbi.1005763</a>.","ista":"Humplik J, Tkačik G. 2017. Probabilistic models for neural populations that naturally capture global coupling and criticality. PLoS Computational Biology. 13(9), e1005763.","apa":"Humplik, J., &#38; Tkačik, G. (2017). Probabilistic models for neural populations that naturally capture global coupling and criticality. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1005763\">https://doi.org/10.1371/journal.pcbi.1005763</a>"}}]