[{"issue":"4","intvolume":"       241","author":[{"first_name":"Yaron","full_name":"Velner, Yaron","last_name":"Velner"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Alexander","full_name":"Rabinovich, Alexander","last_name":"Rabinovich"},{"last_name":"Raskin","full_name":"Raskin, Jean","first_name":"Jean"}],"quality_controlled":"1","external_id":{"isi":["000353352800008"],"arxiv":["1209.3234"]},"language":[{"iso":"eng"}],"status":"public","publication_status":"published","year":"2015","date_published":"2015-04-01T00:00:00Z","citation":{"chicago":"Velner, Yaron, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger, Alexander Rabinovich, and Jean Raskin. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.03.001\">https://doi.org/10.1016/j.ic.2015.03.001</a>.","short":"Y. Velner, K. Chatterjee, L. Doyen, T.A. Henzinger, A. Rabinovich, J. Raskin, Information and Computation 241 (2015) 177–196.","mla":"Velner, Yaron, et al. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.” <i>Information and Computation</i>, vol. 241, no. 4, Elsevier, 2015, pp. 177–96, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.001\">10.1016/j.ic.2015.03.001</a>.","apa":"Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., &#38; Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.03.001\">https://doi.org/10.1016/j.ic.2015.03.001</a>","ama":"Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. The complexity of multi-mean-payoff and multi-energy games. <i>Information and Computation</i>. 2015;241(4):177-196. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.001\">10.1016/j.ic.2015.03.001</a>","ieee":"Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. Rabinovich, and J. Raskin, “The complexity of multi-mean-payoff and multi-energy games,” <i>Information and Computation</i>, vol. 241, no. 4. Elsevier, pp. 177–196, 2015.","ista":"Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. 2015. The complexity of multi-mean-payoff and multi-energy games. Information and Computation. 241(4), 177–196."},"corr_author":"1","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 and S11402-N23 (RiSE), ERC Start grant (279307: Graph Games), Microsoft faculty fellows award, the ERC Advanced Grant QUAREM (267989: Quantitative Reactive Modeling), European project Cassting (FP7-601148), ERC Start grant (279499: inVEST).","date_created":"2018-12-11T11:53:32Z","publication":"Information and Computation","title":"The complexity of multi-mean-payoff and multi-energy games","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-23T13:47:20Z","arxiv":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1209.3234"}],"oa":1,"abstract":[{"lang":"eng","text":"In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Multi-mean-payoff and multi-energy games replace individual weights by tuples, and the limit average (resp., running sum) of each coordinate must be (resp., remain) nonnegative. We prove finite-memory determinacy of multi-energy games and show inter-reducibility of multi-mean-payoff and multi-energy games for finite-memory strategies. We improve the computational complexity for solving both classes with finite-memory strategies: we prove coNP-completeness improving the previous known EXPSPACE bound. For memoryless strategies, we show that deciding the existence of a winning strategy for the protagonist is NP-complete. We present the first solution of multi-mean-payoff games with infinite-memory strategies: we show that mean-payoff-sup objectives can be decided in NP∩coNP, whereas mean-payoff-inf objectives are coNP-complete."}],"ec_funded":1,"publisher":"Elsevier","publist_id":"5443","doi":"10.1016/j.ic.2015.03.001","day":"01","volume":241,"project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"_id":"1698","oa_version":"Preprint","month":"04","type":"journal_article","isi":1,"scopus_import":"1","page":"177 - 196","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"article_processing_charge":"No"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-23T07:31:45Z","publication":"Journal of Mathematical Biology","title":"Adaptive gene introgression after secondary contact","acknowledgement":"This work was made possible with financial support by the Vienna Science and Technology Fund (WWTF), by the Deutsche Forschungsgemeinschaft (DFG), Research Unit 1078 Natural selection in structured populations, by the Austrian Science Fund (FWF) via funding for the Vienna Graduate School for Population Genetics, and by a “For Women in Science” fellowship (L’Oréal Österreich in cooperation with the Austrian Commission for UNESCO and the Austrian Academy of Sciences with financial support from the Federal Ministry for Science and Research Austria).","date_created":"2018-12-11T11:53:32Z","publisher":"Springer","abstract":[{"text":"By hybridization and backcrossing, alleles can surmount species boundaries and be incorporated into the genome of a related species. This introgression of genes is of particular evolutionary relevance if it involves the transfer of adaptations between populations. However, any beneficial allele will typically be associated with other alien alleles that are often deleterious and hamper the introgression process. In order to describe the introgression of an adaptive allele, we set up a stochastic model with an explicit genetic makeup of linked and unlinked deleterious alleles. Based on the theory of reducible multitype branching processes, we derive a recursive expression for the establishment probability of the beneficial allele after a single hybridization event. We furthermore study the probability that slightly deleterious alleles hitchhike to fixation. The key to the analysis is a split of the process into a stochastic phase in which the advantageous alleles establishes and a deterministic phase in which it sweeps to fixation. We thereafter apply the theory to a set of biologically relevant scenarios such as introgression in the presence of many unlinked or few closely linked deleterious alleles. A comparison to computer simulations shows that the approximations work well over a large parameter range.","lang":"eng"}],"file":[{"relation":"main_file","content_type":"application/pdf","checksum":"00e3a67bda05d4cc165b3a48b41ef9ad","creator":"system","file_name":"IST-2016-458-v1+1_s00285-014-0802-y.pdf","file_size":1321527,"date_created":"2018-12-12T10:14:27Z","file_id":"5079","date_updated":"2020-07-14T12:45:12Z","access_level":"open_access"}],"oa":1,"author":[{"orcid":"0000-0001-9435-2813","full_name":"Uecker, Hildegard","id":"2DB8F68A-F248-11E8-B48F-1D18A9856A87","first_name":"Hildegard","last_name":"Uecker"},{"first_name":"Derek","full_name":"Setter, Derek","last_name":"Setter"},{"first_name":"Joachim","full_name":"Hermisson, Joachim","last_name":"Hermisson"}],"issue":"7","intvolume":"        70","has_accepted_license":"1","corr_author":"1","file_date_updated":"2020-07-14T12:45:12Z","citation":{"ama":"Uecker H, Setter D, Hermisson J. Adaptive gene introgression after secondary contact. <i>Journal of Mathematical Biology</i>. 2015;70(7):1523-1580. doi:<a href=\"https://doi.org/10.1007/s00285-014-0802-y\">10.1007/s00285-014-0802-y</a>","ieee":"H. Uecker, D. Setter, and J. Hermisson, “Adaptive gene introgression after secondary contact,” <i>Journal of Mathematical Biology</i>, vol. 70, no. 7. Springer, pp. 1523–1580, 2015.","apa":"Uecker, H., Setter, D., &#38; Hermisson, J. (2015). Adaptive gene introgression after secondary contact. <i>Journal of Mathematical Biology</i>. Springer. <a href=\"https://doi.org/10.1007/s00285-014-0802-y\">https://doi.org/10.1007/s00285-014-0802-y</a>","ista":"Uecker H, Setter D, Hermisson J. 2015. Adaptive gene introgression after secondary contact. Journal of Mathematical Biology. 70(7), 1523–1580.","mla":"Uecker, Hildegard, et al. “Adaptive Gene Introgression after Secondary Contact.” <i>Journal of Mathematical Biology</i>, vol. 70, no. 7, Springer, 2015, pp. 1523–80, doi:<a href=\"https://doi.org/10.1007/s00285-014-0802-y\">10.1007/s00285-014-0802-y</a>.","short":"H. Uecker, D. Setter, J. Hermisson, Journal of Mathematical Biology 70 (2015) 1523–1580.","chicago":"Uecker, Hildegard, Derek Setter, and Joachim Hermisson. “Adaptive Gene Introgression after Secondary Contact.” <i>Journal of Mathematical Biology</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00285-014-0802-y\">https://doi.org/10.1007/s00285-014-0802-y</a>."},"publication_status":"published","status":"public","year":"2015","date_published":"2015-06-01T00:00:00Z","external_id":{"isi":["000354196800003"]},"language":[{"iso":"eng"}],"quality_controlled":"1","pubrep_id":"458","month":"06","type":"journal_article","oa_version":"Published Version","article_processing_charge":"No","page":"1523 - 1580","department":[{"_id":"NiBa"}],"isi":1,"ddc":["576"],"scopus_import":"1","publist_id":"5442","volume":70,"_id":"1699","project":[{"_id":"25B67606-B435-11E9-9278-68D0E5697425","name":"Evolutionary rescue"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"day":"01","doi":"10.1007/s00285-014-0802-y"},{"volume":92,"_id":"1700","day":"10","doi":"10.1103/PhysRevB.92.081106","article_number":"081106","publist_id":"5441","article_processing_charge":"No","isi":1,"scopus_import":"1","department":[{"_id":"MiLe"}],"oa_version":"Preprint","month":"08","type":"journal_article","status":"public","publication_status":"published","year":"2015","date_published":"2015-08-10T00:00:00Z","corr_author":"1","citation":{"mla":"Van Loon, Erik, et al. “Ultralong-Range Order in the Fermi-Hubbard Model with Long-Range Interactions.” <i>Physical Review B</i>, vol. 92, no. 8, 081106, American Physical Society, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevB.92.081106\">10.1103/PhysRevB.92.081106</a>.","ista":"Van Loon E, Katsnelson M, Lemeshko M. 2015. Ultralong-range order in the Fermi-Hubbard model with long-range interactions. Physical Review B. 92(8), 081106.","ieee":"E. Van Loon, M. Katsnelson, and M. Lemeshko, “Ultralong-range order in the Fermi-Hubbard model with long-range interactions,” <i>Physical Review B</i>, vol. 92, no. 8. American Physical Society, 2015.","apa":"Van Loon, E., Katsnelson, M., &#38; Lemeshko, M. (2015). Ultralong-range order in the Fermi-Hubbard model with long-range interactions. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.92.081106\">https://doi.org/10.1103/PhysRevB.92.081106</a>","ama":"Van Loon E, Katsnelson M, Lemeshko M. Ultralong-range order in the Fermi-Hubbard model with long-range interactions. <i>Physical Review B</i>. 2015;92(8). doi:<a href=\"https://doi.org/10.1103/PhysRevB.92.081106\">10.1103/PhysRevB.92.081106</a>","chicago":"Van Loon, Erik, Mikhail Katsnelson, and Mikhail Lemeshko. “Ultralong-Range Order in the Fermi-Hubbard Model with Long-Range Interactions.” <i>Physical Review B</i>. American Physical Society, 2015. <a href=\"https://doi.org/10.1103/PhysRevB.92.081106\">https://doi.org/10.1103/PhysRevB.92.081106</a>.","short":"E. Van Loon, M. Katsnelson, M. Lemeshko, Physical Review B 92 (2015)."},"external_id":{"arxiv":["1506.06007"],"isi":["000359344700002"]},"language":[{"iso":"eng"}],"issue":"8","intvolume":"        92","author":[{"last_name":"Van Loon","first_name":"Erik","full_name":"Van Loon, Erik"},{"last_name":"Katsnelson","first_name":"Mikhail","full_name":"Katsnelson, Mikhail"},{"last_name":"Lemeshko","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","first_name":"Mikhail"}],"publisher":"American Physical Society","oa":1,"abstract":[{"lang":"eng","text":"We use the dual boson approach to reveal the phase diagram of the Fermi-Hubbard model with long-range dipole-dipole interactions. By using a large-scale finite-temperature calculation on a 64×64 square lattice we demonstrate the existence of a novel phase, possessing an &quot;ultralong-range&quot; order. The fingerprint of this phase - the density correlation function - features a nontrivial behavior on a scale of tens of lattice sites. We study the properties and the stability of the ultralong-range-ordered phase, and show that it is accessible in modern experiments with ultracold polar molecules and magnetic atoms."}],"arxiv":1,"date_updated":"2025-09-29T10:59:26Z","main_file_link":[{"url":"http://arxiv.org/abs/1506.06007","open_access":"1"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","acknowledgement":"The work is supported by European Research Council (ERC) Advanced Grant No. 338957 FEMTO/NANO.","date_created":"2018-12-11T11:53:32Z","publication":"Physical Review B","title":"Ultralong-range order in the Fermi-Hubbard model with long-range interactions"},{"article_processing_charge":"No","isi":1,"scopus_import":"1","page":"11508 - 11513","department":[{"_id":"GaTk"}],"oa_version":"Submitted Version","month":"09","type":"journal_article","volume":112,"project":[{"call_identifier":"FWF","_id":"254D1A94-B435-11E9-9278-68D0E5697425","grant_number":"P 25651-N26","name":"Sensitivity to higher-order statistics in natural scenes"}],"_id":"1701","doi":"10.1073/pnas.1514188112","day":"15","publist_id":"5440","publisher":"National Academy of Sciences","oa":1,"abstract":[{"lang":"eng","text":"The activity of a neural network is defined by patterns of spiking and silence from the individual neurons. Because spikes are (relatively) sparse, patterns of activity with increasing numbers of spikes are less probable, but, with more spikes, the number of possible patterns increases. This tradeoff between probability and numerosity is mathematically equivalent to the relationship between entropy and energy in statistical physics. We construct this relationship for populations of up to N = 160 neurons in a small patch of the vertebrate retina, using a combination of direct and model-based analyses of experiments on the response of this network to naturalistic movies. We see signs of a thermodynamic limit, where the entropy per neuron approaches a smooth function of the energy per neuron as N increases. The form of this function corresponds to the distribution of activity being poised near an unusual kind of critical point. We suggest further tests of criticality, and give a brief discussion of its functional significance. "}],"date_updated":"2025-09-23T14:54:27Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4577210/"}],"pmid":1,"acknowledgement":"Research was supported in part by National Science Foundation Grants PHY-1305525, PHY-1451171, and CCF-0939370, by National Institutes of Health Grant R01 EY14196, and by Austrian Science Foundation Grant FWF P25651. Additional support was provided by the\r\nFannie and John Hertz Foundation, by the Swartz Foundation, by the W. M. Keck Foundation, and by the Simons Foundation.","date_created":"2018-12-11T11:53:33Z","publication":"PNAS","title":"Thermodynamics and signatures of criticality in a network of neurons","status":"public","publication_status":"published","date_published":"2015-09-15T00:00:00Z","year":"2015","citation":{"short":"G. Tkačik, T. Mora, O. Marre, D. Amodei, S. Palmer, M. Berry Ii, W. Bialek, PNAS 112 (2015) 11508–11513.","chicago":"Tkačik, Gašper, Thierry Mora, Olivier Marre, Dario Amodei, Stephanie Palmer, Michael Berry Ii, and William Bialek. “Thermodynamics and Signatures of Criticality in a Network of Neurons.” <i>PNAS</i>. National Academy of Sciences, 2015. <a href=\"https://doi.org/10.1073/pnas.1514188112\">https://doi.org/10.1073/pnas.1514188112</a>.","apa":"Tkačik, G., Mora, T., Marre, O., Amodei, D., Palmer, S., Berry Ii, M., &#38; Bialek, W. (2015). Thermodynamics and signatures of criticality in a network of neurons. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1514188112\">https://doi.org/10.1073/pnas.1514188112</a>","ieee":"G. Tkačik <i>et al.</i>, “Thermodynamics and signatures of criticality in a network of neurons,” <i>PNAS</i>, vol. 112, no. 37. National Academy of Sciences, pp. 11508–11513, 2015.","ama":"Tkačik G, Mora T, Marre O, et al. Thermodynamics and signatures of criticality in a network of neurons. <i>PNAS</i>. 2015;112(37):11508-11513. doi:<a href=\"https://doi.org/10.1073/pnas.1514188112\">10.1073/pnas.1514188112</a>","ista":"Tkačik G, Mora T, Marre O, Amodei D, Palmer S, Berry Ii M, Bialek W. 2015. Thermodynamics and signatures of criticality in a network of neurons. PNAS. 112(37), 11508–11513.","mla":"Tkačik, Gašper, et al. “Thermodynamics and Signatures of Criticality in a Network of Neurons.” <i>PNAS</i>, vol. 112, no. 37, National Academy of Sciences, 2015, pp. 11508–13, doi:<a href=\"https://doi.org/10.1073/pnas.1514188112\">10.1073/pnas.1514188112</a>."},"quality_controlled":"1","external_id":{"isi":["000361393700038"],"pmid":["26330611"]},"language":[{"iso":"eng"}],"issue":"37","intvolume":"       112","author":[{"last_name":"Tkacik","full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","first_name":"Gasper"},{"first_name":"Thierry","full_name":"Mora, Thierry","last_name":"Mora"},{"last_name":"Marre","first_name":"Olivier","full_name":"Marre, Olivier"},{"full_name":"Amodei, Dario","first_name":"Dario","last_name":"Amodei"},{"first_name":"Stephanie","full_name":"Palmer, Stephanie","last_name":"Palmer"},{"last_name":"Berry Ii","full_name":"Berry Ii, Michael","first_name":"Michael"},{"first_name":"William","full_name":"Bialek, William","last_name":"Bialek"}]},{"publist_id":"5434","day":"26","doi":"10.1071/BT15023","volume":63,"_id":"1703","month":"05","type":"journal_article","oa_version":"None","page":"455 - 466","department":[{"_id":"NiBa"}],"isi":1,"scopus_import":"1","article_processing_charge":"No","author":[{"first_name":"Linda","full_name":"Broadhurst, Linda","last_name":"Broadhurst"},{"full_name":"Fifield, Graham","first_name":"Graham","last_name":"Fifield"},{"full_name":"Vanzella, Bindi","first_name":"Bindi","last_name":"Vanzella"},{"full_name":"Pickup, Melinda","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6118-0541","first_name":"Melinda","last_name":"Pickup"}],"issue":"5","intvolume":"        63","external_id":{"isi":["000363276500009"]},"language":[{"iso":"eng"}],"quality_controlled":"1","citation":{"ista":"Broadhurst L, Fifield G, Vanzella B, Pickup M. 2015. An evaluation of the genetic structure of seed sources and the maintenance of genetic diversity during establishment of two yellow box (Eucalyptus melliodora) seed-production areas. Australian Journal of Botany. 63(5), 455–466.","ieee":"L. Broadhurst, G. Fifield, B. Vanzella, and M. Pickup, “An evaluation of the genetic structure of seed sources and the maintenance of genetic diversity during establishment of two yellow box (Eucalyptus melliodora) seed-production areas,” <i>Australian Journal of Botany</i>, vol. 63, no. 5. CSIRO, pp. 455–466, 2015.","ama":"Broadhurst L, Fifield G, Vanzella B, Pickup M. An evaluation of the genetic structure of seed sources and the maintenance of genetic diversity during establishment of two yellow box (Eucalyptus melliodora) seed-production areas. <i>Australian Journal of Botany</i>. 2015;63(5):455-466. doi:<a href=\"https://doi.org/10.1071/BT15023\">10.1071/BT15023</a>","apa":"Broadhurst, L., Fifield, G., Vanzella, B., &#38; Pickup, M. (2015). An evaluation of the genetic structure of seed sources and the maintenance of genetic diversity during establishment of two yellow box (Eucalyptus melliodora) seed-production areas. <i>Australian Journal of Botany</i>. CSIRO. <a href=\"https://doi.org/10.1071/BT15023\">https://doi.org/10.1071/BT15023</a>","mla":"Broadhurst, Linda, et al. “An Evaluation of the Genetic Structure of Seed Sources and the Maintenance of Genetic Diversity during Establishment of Two Yellow Box (Eucalyptus Melliodora) Seed-Production Areas.” <i>Australian Journal of Botany</i>, vol. 63, no. 5, CSIRO, 2015, pp. 455–66, doi:<a href=\"https://doi.org/10.1071/BT15023\">10.1071/BT15023</a>.","short":"L. Broadhurst, G. Fifield, B. Vanzella, M. Pickup, Australian Journal of Botany 63 (2015) 455–466.","chicago":"Broadhurst, Linda, Graham Fifield, Bindi Vanzella, and Melinda Pickup. “An Evaluation of the Genetic Structure of Seed Sources and the Maintenance of Genetic Diversity during Establishment of Two Yellow Box (Eucalyptus Melliodora) Seed-Production Areas.” <i>Australian Journal of Botany</i>. CSIRO, 2015. <a href=\"https://doi.org/10.1071/BT15023\">https://doi.org/10.1071/BT15023</a>."},"publication_status":"published","status":"public","date_published":"2015-05-26T00:00:00Z","year":"2015","publication":"Australian Journal of Botany","title":"An evaluation of the genetic structure of seed sources and the maintenance of genetic diversity during establishment of two yellow box (Eucalyptus melliodora) seed-production areas","date_created":"2018-12-11T11:53:34Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-23T07:51:07Z","abstract":[{"text":"Vegetation clearing and land-use change have depleted many natural plant communities to the point where restoration is required. A major impediment to the success of rebuilding complex vegetation communities is having regular access to sufficient quantities of high-quality seed. Seed-production areas (SPAs) can help generate this seed, but these must be underpinned by a broad genetic base to maximise the evolutionary potential of restored populations. However, genetic bottlenecks can occur at the collection, establishment and production stages in SPAs, requiring genetic evaluation. This is especially relevant for species that may take many years before a return on SPA investment is realised. Two recently established yellow box (Eucalyptus melliodora A.Cunn. ex Schauer, Myrtaceae) SPAs were evaluated to determine whether genetic bottlenecks had occurred between seed collection and SPA establishment. No evidence was found to suggest that a significant loss of genetic diversity had occurred at this stage, although there was a significant difference in diversity between the two SPAs. Complex population genetic structure was also observed in the seed used to source the SPAs, with up to eight groups identified. Plant survival in the SPAs was influenced by seed collection location but not by SPA location and was not associated with genetic diversity. There were also no associations between genetic diversity and plant growth. These data highlighted the importance of chance events when establishing SPAs and indicated that the two yellow box SPAs are likely to provide genetically diverse seed sources for future restoration projects, especially by pooling seed from both SPAs.","lang":"eng"}],"publisher":"CSIRO"},{"department":[{"_id":"RoSe"}],"page":"1449 - 1466","scopus_import":"1","ddc":["510"],"isi":1,"article_processing_charge":"No","type":"journal_article","month":"08","oa_version":"Preprint","day":"05","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"doi":"10.1007/s11005-015-0787-5","_id":"1704","volume":105,"publist_id":"5432","file":[{"access_level":"open_access","date_updated":"2020-07-14T12:45:13Z","date_created":"2019-01-15T14:42:07Z","file_id":"5836","creator":"dernst","file_name":"2015_LettersMathPhys_Deuchert.pdf","file_size":484967,"content_type":"application/pdf","relation":"main_file","checksum":"fd7307282a314cc1fbbaef77b187516b"}],"abstract":[{"lang":"eng","text":"Given a convex function (Formula presented.) and two hermitian matrices A and B, Lewin and Sabin study in (Lett Math Phys 104:691–705, 2014) the relative entropy defined by (Formula presented.). Among other things, they prove that the so-defined quantity is monotone if and only if (Formula presented.) is operator monotone. The monotonicity is then used to properly define (Formula presented.) for bounded self-adjoint operators acting on an infinite-dimensional Hilbert space by a limiting procedure. More precisely, for an increasing sequence of finite-dimensional projections (Formula presented.) with (Formula presented.) strongly, the limit (Formula presented.) is shown to exist and to be independent of the sequence of projections (Formula presented.). The question whether this sequence converges to its &quot;obvious&quot; limit, namely (Formula presented.), has been left open. We answer this question in principle affirmatively and show that (Formula presented.). If the operators A and B are regular enough, that is (A − B), (Formula presented.) and (Formula presented.) are trace-class, the identity (Formula presented.) holds."}],"oa":1,"publisher":"Springer","title":"Note on a family of monotone quantum relative entropies","publication":"Letters in Mathematical Physics","date_created":"2018-12-11T11:53:34Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-23T09:41:03Z","arxiv":1,"external_id":{"arxiv":["1502.07205"],"isi":["000361007600006"]},"language":[{"iso":"eng"}],"quality_controlled":"1","citation":{"short":"A. Deuchert, C. Hainzl, R. Seiringer, Letters in Mathematical Physics 105 (2015) 1449–1466.","chicago":"Deuchert, Andreas, Christian Hainzl, and Robert Seiringer. “Note on a Family of Monotone Quantum Relative Entropies.” <i>Letters in Mathematical Physics</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s11005-015-0787-5\">https://doi.org/10.1007/s11005-015-0787-5</a>.","ista":"Deuchert A, Hainzl C, Seiringer R. 2015. Note on a family of monotone quantum relative entropies. Letters in Mathematical Physics. 105(10), 1449–1466.","ieee":"A. Deuchert, C. Hainzl, and R. Seiringer, “Note on a family of monotone quantum relative entropies,” <i>Letters in Mathematical Physics</i>, vol. 105, no. 10. Springer, pp. 1449–1466, 2015.","ama":"Deuchert A, Hainzl C, Seiringer R. Note on a family of monotone quantum relative entropies. <i>Letters in Mathematical Physics</i>. 2015;105(10):1449-1466. doi:<a href=\"https://doi.org/10.1007/s11005-015-0787-5\">10.1007/s11005-015-0787-5</a>","apa":"Deuchert, A., Hainzl, C., &#38; Seiringer, R. (2015). Note on a family of monotone quantum relative entropies. <i>Letters in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s11005-015-0787-5\">https://doi.org/10.1007/s11005-015-0787-5</a>","mla":"Deuchert, Andreas, et al. “Note on a Family of Monotone Quantum Relative Entropies.” <i>Letters in Mathematical Physics</i>, vol. 105, no. 10, Springer, 2015, pp. 1449–66, doi:<a href=\"https://doi.org/10.1007/s11005-015-0787-5\">10.1007/s11005-015-0787-5</a>."},"file_date_updated":"2020-07-14T12:45:13Z","corr_author":"1","date_published":"2015-08-05T00:00:00Z","year":"2015","publication_status":"published","status":"public","has_accepted_license":"1","author":[{"first_name":"Andreas","full_name":"Deuchert, Andreas","orcid":"0000-0003-3146-6746","last_name":"Deuchert"},{"full_name":"Hainzl, Christian","first_name":"Christian","last_name":"Hainzl"},{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","intvolume":"       105","issue":"10"},{"language":[{"iso":"eng"}],"external_id":{"arxiv":["1602.06531"],"isi":["000367595100013"]},"quality_controlled":"1","corr_author":"1","citation":{"ieee":"A. Pentina and S. Ben David, “Multi-task and lifelong learning of kernels,” presented at the ALT: Algorithmic Learning Theory, Banff, AB, Canada, 2015, vol. 9355, pp. 194–208.","apa":"Pentina, A., &#38; Ben David, S. (2015). Multi-task and lifelong learning of kernels (Vol. 9355, pp. 194–208). Presented at the ALT: Algorithmic Learning Theory, Banff, AB, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-319-24486-0_13\">https://doi.org/10.1007/978-3-319-24486-0_13</a>","ama":"Pentina A, Ben David S. Multi-task and lifelong learning of kernels. In: Vol 9355. Springer; 2015:194-208. doi:<a href=\"https://doi.org/10.1007/978-3-319-24486-0_13\">10.1007/978-3-319-24486-0_13</a>","ista":"Pentina A, Ben David S. 2015. Multi-task and lifelong learning of kernels. ALT: Algorithmic Learning Theory, LNCS, vol. 9355, 194–208.","mla":"Pentina, Anastasia, and Shai Ben David. <i>Multi-Task and Lifelong Learning of Kernels</i>. Vol. 9355, Springer, 2015, pp. 194–208, doi:<a href=\"https://doi.org/10.1007/978-3-319-24486-0_13\">10.1007/978-3-319-24486-0_13</a>.","short":"A. Pentina, S. Ben David, in:, Springer, 2015, pp. 194–208.","chicago":"Pentina, Anastasia, and Shai Ben David. “Multi-Task and Lifelong Learning of Kernels,” 9355:194–208. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-24486-0_13\">https://doi.org/10.1007/978-3-319-24486-0_13</a>."},"alternative_title":["LNCS"],"status":"public","publication_status":"published","year":"2015","date_published":"2015-01-01T00:00:00Z","author":[{"last_name":"Pentina","full_name":"Pentina, Anastasia","id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","first_name":"Anastasia"},{"first_name":"Shai","full_name":"Ben David, Shai","last_name":"Ben David"}],"intvolume":"      9355","abstract":[{"text":"We consider a problem of learning kernels for use in SVM classification in the multi-task and lifelong scenarios and provide generalization bounds on the error of a large margin classifier. Our results show that, under mild conditions on the family of kernels used for learning, solving several related tasks simultaneously is beneficial over single task learning. In particular, as the number of observed tasks grows, assuming that in the considered family of kernels there exists one that yields low approximation error on all tasks, the overhead associated with learning such a kernel vanishes and the complexity converges to that of learning when this good kernel is given to the learner.","lang":"eng"}],"oa":1,"publisher":"Springer","ec_funded":1,"title":"Multi-task and lifelong learning of kernels","date_created":"2018-12-11T11:53:35Z","date_updated":"2025-09-23T09:36:51Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1602.06531"}],"arxiv":1,"day":"01","doi":"10.1007/978-3-319-24486-0_13","conference":{"start_date":"2015-10-04","name":"ALT: Algorithmic Learning Theory","end_date":"2015-10-06","location":"Banff, AB, Canada"},"volume":9355,"project":[{"grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"_id":"1706","publist_id":"5430","page":"194 - 208","department":[{"_id":"ChLa"}],"isi":1,"scopus_import":"1","article_processing_charge":"No","month":"01","type":"conference","oa_version":"Preprint"},{"doi":"10.1137/140993843","day":"14","volume":47,"_id":"1710","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"publist_id":"5423","page":"2754 - 2769","department":[{"_id":"HeEd"}],"isi":1,"scopus_import":"1","article_processing_charge":"No","month":"07","type":"journal_article","oa_version":"Preprint","language":[{"iso":"eng"}],"external_id":{"arxiv":["1410.3736"],"isi":["000360691500009"]},"quality_controlled":"1","citation":{"mla":"Akopyan, Arseniy, and Alexander Plakhov. “Minimal Resistance of Curves under the Single Impact Assumption.” <i>Society for Industrial and Applied Mathematics</i>, vol. 47, no. 4, SIAM, 2015, pp. 2754–69, doi:<a href=\"https://doi.org/10.1137/140993843\">10.1137/140993843</a>.","apa":"Akopyan, A., &#38; Plakhov, A. (2015). Minimal resistance of curves under the single impact assumption. <i>Society for Industrial and Applied Mathematics</i>. SIAM. <a href=\"https://doi.org/10.1137/140993843\">https://doi.org/10.1137/140993843</a>","ama":"Akopyan A, Plakhov A. Minimal resistance of curves under the single impact assumption. <i>Society for Industrial and Applied Mathematics</i>. 2015;47(4):2754-2769. doi:<a href=\"https://doi.org/10.1137/140993843\">10.1137/140993843</a>","ieee":"A. Akopyan and A. Plakhov, “Minimal resistance of curves under the single impact assumption,” <i>Society for Industrial and Applied Mathematics</i>, vol. 47, no. 4. SIAM, pp. 2754–2769, 2015.","ista":"Akopyan A, Plakhov A. 2015. Minimal resistance of curves under the single impact assumption. Society for Industrial and Applied Mathematics. 47(4), 2754–2769.","chicago":"Akopyan, Arseniy, and Alexander Plakhov. “Minimal Resistance of Curves under the Single Impact Assumption.” <i>Society for Industrial and Applied Mathematics</i>. SIAM, 2015. <a href=\"https://doi.org/10.1137/140993843\">https://doi.org/10.1137/140993843</a>.","short":"A. Akopyan, A. Plakhov, Society for Industrial and Applied Mathematics 47 (2015) 2754–2769."},"publication_status":"published","status":"public","year":"2015","date_published":"2015-07-14T00:00:00Z","author":[{"last_name":"Akopyan","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy"},{"first_name":"Alexander","full_name":"Plakhov, Alexander","last_name":"Plakhov"}],"issue":"4","intvolume":"        47","abstract":[{"lang":"eng","text":"We consider the hollow on the half-plane {(x, y) : y ≤ 0} ⊂ ℝ2 defined by a function u : (-1, 1) → ℝ, u(x) &lt; 0, and a vertical flow of point particles incident on the hollow. It is assumed that u satisfies the so-called single impact condition (SIC): each incident particle is elastically reflected by graph(u) and goes away without hitting the graph of u anymore. We solve the problem: find the function u minimizing the force of resistance created by the flow. We show that the graph of the minimizer is formed by two arcs of parabolas symmetric to each other with respect to the y-axis. Assuming that the resistance of u ≡ 0 equals 1, we show that the minimal resistance equals π/2 - 2arctan(1/2) ≈ 0.6435. This result completes the previously obtained result [SIAM J. Math. Anal., 46 (2014), pp. 2730-2742] stating in particular that the minimal resistance of a hollow in higher dimensions equals 0.5. We additionally consider a similar problem of minimal resistance, where the hollow in the half-space {(x1,...,xd,y) : y ≤ 0} ⊂ ℝd+1 is defined by a radial function U satisfying the SIC, U(x) = u(|x|), with x = (x1,...,xd), u(ξ) &lt; 0 for 0 ≤ ξ &lt; 1, and u(ξ) = 0 for ξ ≥ 1, and the flow is parallel to the y-axis. The minimal resistance is greater than 0.5 (and coincides with 0.6435 when d = 1) and converges to 0.5 as d → ∞."}],"oa":1,"publisher":"SIAM","ec_funded":1,"publication":"Society for Industrial and Applied Mathematics","title":"Minimal resistance of curves under the single impact assumption","date_created":"2018-12-11T11:53:36Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.3736"}],"arxiv":1,"date_updated":"2025-09-23T09:35:36Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"project":[{"_id":"2536F660-B435-11E9-9278-68D0E5697425","name":"Investigating the role of transporters in invasive migration through junctions","grant_number":"334077","call_identifier":"FP7"}],"_id":"1712","volume":36,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"day":"01","doi":"10.1016/j.ceb.2015.07.003","publist_id":"5421","article_processing_charge":"No","department":[{"_id":"DaSi"}],"page":"71 - 79","scopus_import":"1","isi":1,"ddc":["573"],"pubrep_id":"346","type":"journal_article","month":"10","oa_version":"Published Version","corr_author":"1","citation":{"apa":"Ratheesh, A., Belyaeva, V., &#38; Siekhaus, D. E. (2015). Drosophila immune cell migration and adhesion during embryonic development and larval immune responses. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2015.07.003\">https://doi.org/10.1016/j.ceb.2015.07.003</a>","ieee":"A. Ratheesh, V. Belyaeva, and D. E. Siekhaus, “Drosophila immune cell migration and adhesion during embryonic development and larval immune responses,” <i>Current Opinion in Cell Biology</i>, vol. 36, no. 10. Elsevier, pp. 71–79, 2015.","ama":"Ratheesh A, Belyaeva V, Siekhaus DE. Drosophila immune cell migration and adhesion during embryonic development and larval immune responses. <i>Current Opinion in Cell Biology</i>. 2015;36(10):71-79. doi:<a href=\"https://doi.org/10.1016/j.ceb.2015.07.003\">10.1016/j.ceb.2015.07.003</a>","ista":"Ratheesh A, Belyaeva V, Siekhaus DE. 2015. Drosophila immune cell migration and adhesion during embryonic development and larval immune responses. Current Opinion in Cell Biology. 36(10), 71–79.","mla":"Ratheesh, Aparna, et al. “Drosophila Immune Cell Migration and Adhesion during Embryonic Development and Larval Immune Responses.” <i>Current Opinion in Cell Biology</i>, vol. 36, no. 10, Elsevier, 2015, pp. 71–79, doi:<a href=\"https://doi.org/10.1016/j.ceb.2015.07.003\">10.1016/j.ceb.2015.07.003</a>.","short":"A. Ratheesh, V. Belyaeva, D.E. Siekhaus, Current Opinion in Cell Biology 36 (2015) 71–79.","chicago":"Ratheesh, Aparna, Vera Belyaeva, and Daria E Siekhaus. “Drosophila Immune Cell Migration and Adhesion during Embryonic Development and Larval Immune Responses.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ceb.2015.07.003\">https://doi.org/10.1016/j.ceb.2015.07.003</a>."},"file_date_updated":"2020-07-14T12:45:13Z","date_published":"2015-10-01T00:00:00Z","year":"2015","status":"public","publication_status":"published","language":[{"iso":"eng"}],"external_id":{"isi":["000364577600011"]},"quality_controlled":"1","author":[{"id":"2F064CFE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7190-0776","full_name":"Ratheesh, Aparna","first_name":"Aparna","last_name":"Ratheesh"},{"first_name":"Vera","full_name":"Belyaeva, Vera","id":"47F080FE-F248-11E8-B48F-1D18A9856A87","last_name":"Belyaeva"},{"last_name":"Siekhaus","first_name":"Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8323-8353","full_name":"Siekhaus, Daria E"}],"intvolume":"        36","issue":"10","has_accepted_license":"1","publisher":"Elsevier","ec_funded":1,"file":[{"date_created":"2018-12-12T10:14:44Z","file_id":"5098","date_updated":"2020-07-14T12:45:13Z","access_level":"open_access","checksum":"bbb1ee39ca52929aefe4f48752b166ee","content_type":"application/pdf","relation":"main_file","file_name":"IST-2015-346-v1+1_Current_Opinion_Review_Ratheesh_et_al_2015.pdf","file_size":1023680,"creator":"system"}],"abstract":[{"text":"The majority of immune cells in Drosophila melanogaster are plasmatocytes; they carry out similar functions to vertebrate macrophages, influencing development as well as protecting against infection and cancer. Plasmatocytes, sometimes referred to with the broader term of hemocytes, migrate widely during embryonic development and cycle in the larvae between sessile and circulating positions. Here we discuss the similarities of plasmatocyte developmental migration and its functions to that of vertebrate macrophages, considering the recent controversy regarding the functions of Drosophila PDGF/VEGF related ligands. We also examine recent findings on the significance of adhesion for plasmatocyte migration in the embryo, as well as proliferation, trans-differentiation, and tumor responses in the larva. We spotlight parallels throughout to vertebrate immune responses.","lang":"eng"}],"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-23T08:29:26Z","title":"Drosophila immune cell migration and adhesion during embryonic development and larval immune responses","publication":"Current Opinion in Cell Biology","date_created":"2018-12-11T11:53:36Z"},{"scopus_import":"1","isi":1,"department":[{"_id":"UlWa"}],"page":"587 - 620","article_processing_charge":"No","oa_version":"Preprint","type":"journal_article","month":"04","day":"02","doi":"10.1007/s00454-015-9679-9","_id":"1730","volume":53,"publist_id":"5397","oa":1,"abstract":[{"text":"How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given combinatorial map in triangulated combinatorial surfaces (or their dual cross-metric counterpart). Our work builds upon Riemannian systolic inequalities, which bound the minimum length of non-trivial closed curves in terms of the genus and the area of the surface. We first describe a systematic way to translate Riemannian systolic inequalities to a discrete setting, and vice-versa. This implies a conjecture by Przytycka and Przytycki (Graph structure theory. Contemporary Mathematics, vol. 147, 1993), a number of new systolic inequalities in the discrete setting, and the fact that a theorem of Hutchinson on the edge-width of triangulated surfaces and Gromov’s systolic inequality for surfaces are essentially equivalent. We also discuss how these proofs generalize to higher dimensions. Then we focus on topological decompositions of surfaces. Relying on ideas of Buser, we prove the existence of pants decompositions of length O(g^(3/2)n^(1/2)) for any triangulated combinatorial surface of genus g with n triangles, and describe an O(gn)-time algorithm to compute such a decomposition. Finally, we consider the problem of embedding a cut graph (or more generally a cellular graph) with a given combinatorial map on a given surface. Using random triangulations, we prove (essentially) that, for any choice of a combinatorial map, there are some surfaces on which any cellular embedding with that combinatorial map has length superlinear in the number of triangles of the triangulated combinatorial surface. There is also a similar result for graphs embedded on polyhedral triangulations.","lang":"eng"}],"publisher":"Springer","date_created":"2018-12-11T11:53:42Z","title":"Discrete systolic inequalities and decompositions of triangulated surfaces","publication":"Discrete & Computational Geometry","date_updated":"2025-09-23T08:27:38Z","main_file_link":[{"url":"http://arxiv.org/abs/1408.4036","open_access":"1"}],"arxiv":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","external_id":{"isi":["000353895200006"],"arxiv":["1408.4036"]},"language":[{"iso":"eng"}],"year":"2015","date_published":"2015-04-02T00:00:00Z","publication_status":"published","status":"public","citation":{"short":"É. Colin De Verdière, A. Hubard, A.N. de Mesmay, Discrete &#38; Computational Geometry 53 (2015) 587–620.","chicago":"Colin De Verdière, Éric, Alfredo Hubard, and Arnaud N de Mesmay. “Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00454-015-9679-9\">https://doi.org/10.1007/s00454-015-9679-9</a>.","ista":"Colin De Verdière É, Hubard A, de Mesmay AN. 2015. Discrete systolic inequalities and decompositions of triangulated surfaces. Discrete &#38; Computational Geometry. 53(3), 587–620.","ieee":"É. Colin De Verdière, A. Hubard, and A. N. de Mesmay, “Discrete systolic inequalities and decompositions of triangulated surfaces,” <i>Discrete &#38; Computational Geometry</i>, vol. 53, no. 3. Springer, pp. 587–620, 2015.","apa":"Colin De Verdière, É., Hubard, A., &#38; de Mesmay, A. N. (2015). Discrete systolic inequalities and decompositions of triangulated surfaces. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-015-9679-9\">https://doi.org/10.1007/s00454-015-9679-9</a>","ama":"Colin De Verdière É, Hubard A, de Mesmay AN. Discrete systolic inequalities and decompositions of triangulated surfaces. <i>Discrete &#38; Computational Geometry</i>. 2015;53(3):587-620. doi:<a href=\"https://doi.org/10.1007/s00454-015-9679-9\">10.1007/s00454-015-9679-9</a>","mla":"Colin De Verdière, Éric, et al. “Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces.” <i>Discrete &#38; Computational Geometry</i>, vol. 53, no. 3, Springer, 2015, pp. 587–620, doi:<a href=\"https://doi.org/10.1007/s00454-015-9679-9\">10.1007/s00454-015-9679-9</a>."},"intvolume":"        53","issue":"3","author":[{"last_name":"Colin De Verdière","full_name":"Colin De Verdière, Éric","first_name":"Éric"},{"full_name":"Hubard, Alfredo","first_name":"Alfredo","last_name":"Hubard"},{"first_name":"Arnaud N","full_name":"De Mesmay, Arnaud N","id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","last_name":"De Mesmay"}]},{"isi":1,"scopus_import":"1","page":"3 - 16","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"article_processing_charge":"No","oa_version":"Preprint","month":"12","type":"journal_article","day":"01","doi":"10.1016/j.ic.2015.06.003","volume":245,"_id":"1731","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"publist_id":"5395","oa":1,"abstract":[{"text":"We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (both players interact simultaneously); and (b) turn-based (both players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. In this work we present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games. ","lang":"eng"}],"ec_funded":1,"publisher":"Elsevier","date_created":"2018-12-11T11:53:42Z","publication":"Information and Computation","related_material":{"record":[{"relation":"earlier_version","id":"3856","status":"public"}]},"title":"Randomness for free","main_file_link":[{"url":"http://arxiv.org/abs/1006.0673","open_access":"1"}],"arxiv":1,"date_updated":"2025-09-23T10:32:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","external_id":{"arxiv":["1006.0673"],"isi":["000368899100002"]},"language":[{"iso":"eng"}],"publication_status":"published","status":"public","date_published":"2015-12-01T00:00:00Z","year":"2015","corr_author":"1","citation":{"mla":"Chatterjee, Krishnendu, et al. “Randomness for Free.” <i>Information and Computation</i>, vol. 245, no. 12, Elsevier, 2015, pp. 3–16, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">10.1016/j.ic.2015.06.003</a>.","apa":"Chatterjee, K., Doyen, L., Gimbert, H., &#38; Henzinger, T. A. (2015). Randomness for free. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">https://doi.org/10.1016/j.ic.2015.06.003</a>","ama":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. <i>Information and Computation</i>. 2015;245(12):3-16. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">10.1016/j.ic.2015.06.003</a>","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” <i>Information and Computation</i>, vol. 245, no. 12. Elsevier, pp. 3–16, 2015.","ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2015. Randomness for free. Information and Computation. 245(12), 3–16.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">https://doi.org/10.1016/j.ic.2015.06.003</a>.","short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation 245 (2015) 3–16."},"issue":"12","intvolume":"       245","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"last_name":"Gimbert","first_name":"Hugo","full_name":"Gimbert, Hugo"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger"}]},{"department":[{"_id":"KrCh"}],"page":"325 - 330","scopus_import":1,"type":"conference","month":"01","oa_version":"Preprint","conference":{"name":"ICRA: International Conference on Robotics and Automation","end_date":"2015-05-30","location":"Seattle, WA, United States","start_date":"2015-05-26"},"_id":"1732","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"day":"01","doi":"10.1109/ICRA.2015.7139019","publist_id":"5394","publisher":"IEEE","ec_funded":1,"abstract":[{"lang":"eng","text":"We consider partially observable Markov decision processes (POMDPs), that are a standard framework for robotics applications to model uncertainties present in the real world, with temporal logic specifications. All temporal logic specifications in linear-time temporal logic (LTL) can be expressed as parity objectives. We study the qualitative analysis problem for POMDPs with parity objectives that asks whether there is a controller (policy) to ensure that the objective holds with probability 1 (almost-surely). While the qualitative analysis of POMDPs with parity objectives is undecidable, recent results show that when restricted to finite-memory policies the problem is EXPTIME-complete. While the problem is intractable in theory, we present a practical approach to solve the qualitative analysis problem. We designed several heuristics to deal with the exponential complexity, and have used our implementation on a number of well-known POMDP examples for robotics applications. Our results provide the first practical approach to solve the qualitative analysis of robot motion planning with LTL properties in the presence of uncertainty."}],"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1409.3360","open_access":"1"}],"date_updated":"2023-02-23T12:25:52Z","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Qualitative analysis of POMDPs with temporal logic specifications for robotics applications","related_material":{"record":[{"status":"public","id":"5424","relation":"earlier_version"},{"status":"public","id":"5426","relation":"earlier_version"}]},"date_created":"2018-12-11T11:53:43Z","citation":{"ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. ICRA: International Conference on Robotics and Automation, 325–330.","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Qualitative analysis of POMDPs with temporal logic specifications for robotics applications,” presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States, 2015, pp. 325–330.","ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. In: IEEE; 2015:325-330. doi:<a href=\"https://doi.org/10.1109/ICRA.2015.7139019\">10.1109/ICRA.2015.7139019</a>","apa":"Chatterjee, K., Chmelik, M., Gupta, R., &#38; Kanodia, A. (2015). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications (pp. 325–330). Presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States: IEEE. <a href=\"https://doi.org/10.1109/ICRA.2015.7139019\">https://doi.org/10.1109/ICRA.2015.7139019</a>","mla":"Chatterjee, Krishnendu, et al. <i>Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications</i>. IEEE, 2015, pp. 325–30, doi:<a href=\"https://doi.org/10.1109/ICRA.2015.7139019\">10.1109/ICRA.2015.7139019</a>.","short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, IEEE, 2015, pp. 325–330.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications,” 325–30. IEEE, 2015. <a href=\"https://doi.org/10.1109/ICRA.2015.7139019\">https://doi.org/10.1109/ICRA.2015.7139019</a>."},"year":"2015","date_published":"2015-01-01T00:00:00Z","publication_status":"published","status":"public","language":[{"iso":"eng"}],"external_id":{"arxiv":["1409.3360"]},"quality_controlled":"1","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"full_name":"Gupta, Raghav","first_name":"Raghav","last_name":"Gupta"},{"last_name":"Kanodia","full_name":"Kanodia, Ayush","first_name":"Ayush"}]},{"oa_version":"None","type":"journal_article","month":"05","article_processing_charge":"No","scopus_import":"1","isi":1,"department":[{"_id":"BeBi"}],"page":"709 - 733","publist_id":"5391","_id":"1734","volume":34,"doi":"10.1111/cgf.12594","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-23T10:32:38Z","main_file_link":[{"url":"https://graphics.ethz.ch/~mpapas/publications/fac_star.pdf"}],"date_created":"2018-12-11T11:53:43Z","title":"Recent advances in facial appearance capture","publication":"Computer Graphics Forum","publisher":"Wiley-Blackwell","abstract":[{"lang":"eng","text":"Facial appearance capture is now firmly established within academic research and used extensively across various application domains, perhaps most prominently in the entertainment industry through the design of virtual characters in video games and films. While significant progress has occurred over the last two decades, no single survey currently exists that discusses the similarities, differences, and practical considerations of the available appearance capture techniques as applied to human faces. A central difficulty of facial appearance capture is the way light interacts with skin-which has a complex multi-layered structure-and the interactions that occur below the skin surface can, by definition, only be observed indirectly. In this report, we distinguish between two broad strategies for dealing with this complexity. &quot;Image-based methods&quot; try to exhaustively capture the exact face appearance under different lighting and viewing conditions, and then render the face through weighted image combinations. &quot;Parametric methods&quot; instead fit the captured reflectance data to some parametric appearance model used during rendering, allowing for a more lightweight and flexible representation but at the cost of potentially increased rendering complexity or inexact reproduction. The goal of this report is to provide an overview that can guide practitioners and researchers in assessing the tradeoffs between current approaches and identifying directions for future advances in facial appearance capture."}],"intvolume":"        34","issue":"2","author":[{"full_name":"Klehm, Oliver","first_name":"Oliver","last_name":"Klehm"},{"last_name":"Rousselle","full_name":"Rousselle, Fabrice","first_name":"Fabrice"},{"last_name":"Papas","full_name":"Papas, Marios","first_name":"Marios"},{"last_name":"Bradley","full_name":"Bradley, Derek","first_name":"Derek"},{"first_name":"Christophe","full_name":"Hery, Christophe","last_name":"Hery"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel"},{"first_name":"Wojciech","full_name":"Jarosz, Wojciech","last_name":"Jarosz"},{"first_name":"Thabo","full_name":"Beeler, Thabo","last_name":"Beeler"}],"year":"2015","date_published":"2015-05-01T00:00:00Z","publication_status":"published","status":"public","citation":{"short":"O. Klehm, F. Rousselle, M. Papas, D. Bradley, C. Hery, B. Bickel, W. Jarosz, T. Beeler, Computer Graphics Forum 34 (2015) 709–733.","chicago":"Klehm, Oliver, Fabrice Rousselle, Marios Papas, Derek Bradley, Christophe Hery, Bernd Bickel, Wojciech Jarosz, and Thabo Beeler. “Recent Advances in Facial Appearance Capture.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2015. <a href=\"https://doi.org/10.1111/cgf.12594\">https://doi.org/10.1111/cgf.12594</a>.","ista":"Klehm O, Rousselle F, Papas M, Bradley D, Hery C, Bickel B, Jarosz W, Beeler T. 2015. Recent advances in facial appearance capture. Computer Graphics Forum. 34(2), 709–733.","ieee":"O. Klehm <i>et al.</i>, “Recent advances in facial appearance capture,” <i>Computer Graphics Forum</i>, vol. 34, no. 2. Wiley-Blackwell, pp. 709–733, 2015.","ama":"Klehm O, Rousselle F, Papas M, et al. Recent advances in facial appearance capture. <i>Computer Graphics Forum</i>. 2015;34(2):709-733. doi:<a href=\"https://doi.org/10.1111/cgf.12594\">10.1111/cgf.12594</a>","apa":"Klehm, O., Rousselle, F., Papas, M., Bradley, D., Hery, C., Bickel, B., … Beeler, T. (2015). Recent advances in facial appearance capture. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/cgf.12594\">https://doi.org/10.1111/cgf.12594</a>","mla":"Klehm, Oliver, et al. “Recent Advances in Facial Appearance Capture.” <i>Computer Graphics Forum</i>, vol. 34, no. 2, Wiley-Blackwell, 2015, pp. 709–33, doi:<a href=\"https://doi.org/10.1111/cgf.12594\">10.1111/cgf.12594</a>."},"quality_controlled":"1","external_id":{"isi":["000358326600063"]},"language":[{"iso":"eng"}]},{"publisher":"Wiley","oa":1,"abstract":[{"lang":"eng","text":"This work presents a method for efficiently simplifying the pressure projection step in a liquid simulation. We first devise a straightforward dimension reduction technique that dramatically reduces the cost of solving the pressure projection. Next, we introduce a novel change of basis that satisfies free-surface boundary conditions exactly, regardless of the accuracy of the pressure solve. When combined, these ideas greatly reduce the computational complexity of the pressure solve without compromising free surface boundary conditions at the highest level of detail. Our techniques are easy to parallelize, and they effectively eliminate the computational bottleneck for large liquid simulations."}],"file":[{"file_id":"5218","date_created":"2018-12-12T10:16:30Z","access_level":"open_access","date_updated":"2020-07-14T12:45:15Z","checksum":"590752bf977855b337a80f78a9bc2404","content_type":"application/pdf","relation":"main_file","file_size":6312352,"file_name":"IST-2016-607-v1+1_coarsegrid.pdf","creator":"system"}],"date_updated":"2025-09-22T14:29:19Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","acknowledgement":"The first author was supported by a JSPS Postdoctoral Fellowship for Research Abroad","date_created":"2018-12-11T11:53:44Z","publication":"Computer Graphics Forum","title":"A dimension-reduced pressure solver for liquid simulations","publication_status":"published","status":"public","year":"2015","date_published":"2015-05-01T00:00:00Z","citation":{"ista":"Ando R, Thürey N, Wojtan C. 2015. A dimension-reduced pressure solver for liquid simulations. Computer Graphics Forum. 34(2), 473–480.","ama":"Ando R, Thürey N, Wojtan C. A dimension-reduced pressure solver for liquid simulations. <i>Computer Graphics Forum</i>. 2015;34(2):473-480. doi:<a href=\"https://doi.org/10.1111/cgf.12576\">10.1111/cgf.12576</a>","ieee":"R. Ando, N. Thürey, and C. Wojtan, “A dimension-reduced pressure solver for liquid simulations,” <i>Computer Graphics Forum</i>, vol. 34, no. 2. Wiley, pp. 473–480, 2015.","apa":"Ando, R., Thürey, N., &#38; Wojtan, C. (2015). A dimension-reduced pressure solver for liquid simulations. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.12576\">https://doi.org/10.1111/cgf.12576</a>","mla":"Ando, Ryoichi, et al. “A Dimension-Reduced Pressure Solver for Liquid Simulations.” <i>Computer Graphics Forum</i>, vol. 34, no. 2, Wiley, 2015, pp. 473–80, doi:<a href=\"https://doi.org/10.1111/cgf.12576\">10.1111/cgf.12576</a>.","short":"R. Ando, N. Thürey, C. Wojtan, Computer Graphics Forum 34 (2015) 473–480.","chicago":"Ando, Ryoichi, Nils Thürey, and Chris Wojtan. “A Dimension-Reduced Pressure Solver for Liquid Simulations.” <i>Computer Graphics Forum</i>. Wiley, 2015. <a href=\"https://doi.org/10.1111/cgf.12576\">https://doi.org/10.1111/cgf.12576</a>."},"file_date_updated":"2020-07-14T12:45:15Z","quality_controlled":"1","language":[{"iso":"eng"}],"external_id":{"isi":["000358326600045"]},"issue":"2","intvolume":"        34","author":[{"last_name":"Ando","first_name":"Ryoichi","full_name":"Ando, Ryoichi"},{"full_name":"Thürey, Nils","first_name":"Nils","last_name":"Thürey"},{"last_name":"Wojtan","first_name":"Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J"}],"has_accepted_license":"1","article_processing_charge":"No","ddc":["000"],"isi":1,"scopus_import":"1","page":"473 - 480","department":[{"_id":"ChWo"}],"pubrep_id":"607","oa_version":"Submitted Version","month":"05","type":"journal_article","volume":34,"_id":"1735","day":"01","doi":"10.1111/cgf.12576","publist_id":"5389"},{"article_processing_charge":"No","page":"2540-2545","scopus_import":"1","month":"07","type":"journal_article","oa_version":"Published Version","volume":452,"_id":"17615","day":"24","doi":"10.1093/mnras/stv1457","publication_identifier":{"issn":["0035-8711","1365-2966"]},"article_type":"original","publisher":"Oxford University Press","abstract":[{"text":"Graham et al. have detected a 5.2 yr periodic optical variability of the quasar PG 1302-102 at redshift z = 0.3, which they interpret as the redshifted orbital period (1 + z)tbin of a putative supermassive black hole binary (SMBHB). Here, we consider the implications of a 3–8 times shorter orbital period, suggested by hydrodynamical simulations of circumbinary discs (CBDs) with nearly equal-mass SMBHBs (q ≡ M2/M1 ≳ 0.3). With the corresponding 2–4 times tighter binary separation, PG 1302 would be undergoing gravitational wave dominated inspiral, and serve as a proof that the BHs can be fuelled and produce bright emission even in this late stage of the merger. The expected fraction of binaries with the shorter tbin, among bright quasars, would be reduced by one to two orders of magnitude, compared to the 5.2 yr period, in better agreement with the rarity of candidates reported by Graham et al. Finally, shorter periods would imply higher binary speeds, possibly imprinting periodicity on the light curves from relativistic beaming, as well as measurable relativistic effects on the Fe K α line. The CBD model predicts additional periodic variability on time-scales of tbin and ≈0.5tbin, as well as periodic variation of broad line widths and offsets relative to the narrow lines, which are consistent with the observations. Future observations will be able to test these predictions and hence the binary+CBD hypothesis for PG 1302.","lang":"eng"}],"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2024-09-24T07:58:52Z","main_file_link":[{"url":"https://doi.org/10.1093/mnras/stv1457","open_access":"1"}],"publication":"Monthly Notices of the Royal Astronomical Society","title":"A reduced orbital period for the supermassive black hole binary candidate in the quasar PG 1302-102?","date_created":"2024-09-05T13:31:30Z","citation":{"ieee":"D. J. D’Orazio, Z. Haiman, P. Duffell, B. D. Farris, and A. I. MacFadyen, “A reduced orbital period for the supermassive black hole binary candidate in the quasar PG 1302-102?,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 452, no. 3. Oxford University Press, pp. 2540–2545, 2015.","apa":"D’Orazio, D. J., Haiman, Z., Duffell, P., Farris, B. D., &#38; MacFadyen, A. I. (2015). A reduced orbital period for the supermassive black hole binary candidate in the quasar PG 1302-102? <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stv1457\">https://doi.org/10.1093/mnras/stv1457</a>","ama":"D’Orazio DJ, Haiman Z, Duffell P, Farris BD, MacFadyen AI. A reduced orbital period for the supermassive black hole binary candidate in the quasar PG 1302-102? <i>Monthly Notices of the Royal Astronomical Society</i>. 2015;452(3):2540-2545. doi:<a href=\"https://doi.org/10.1093/mnras/stv1457\">10.1093/mnras/stv1457</a>","ista":"D’Orazio DJ, Haiman Z, Duffell P, Farris BD, MacFadyen AI. 2015. A reduced orbital period for the supermassive black hole binary candidate in the quasar PG 1302-102? Monthly Notices of the Royal Astronomical Society. 452(3), 2540–2545.","mla":"D’Orazio, D. J., et al. “A Reduced Orbital Period for the Supermassive Black Hole Binary Candidate in the Quasar PG 1302-102?” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 452, no. 3, Oxford University Press, 2015, pp. 2540–45, doi:<a href=\"https://doi.org/10.1093/mnras/stv1457\">10.1093/mnras/stv1457</a>.","short":"D.J. D’Orazio, Z. Haiman, P. Duffell, B.D. Farris, A.I. MacFadyen, Monthly Notices of the Royal Astronomical Society 452 (2015) 2540–2545.","chicago":"D’Orazio, D. J., Zoltán Haiman, P. Duffell, B. D. Farris, and A. I. MacFadyen. “A Reduced Orbital Period for the Supermassive Black Hole Binary Candidate in the Quasar PG 1302-102?” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2015. <a href=\"https://doi.org/10.1093/mnras/stv1457\">https://doi.org/10.1093/mnras/stv1457</a>."},"status":"public","publication_status":"published","extern":"1","year":"2015","date_published":"2015-07-24T00:00:00Z","language":[{"iso":"eng"}],"quality_controlled":"1","author":[{"full_name":"D'Orazio, D. J.","first_name":"D. J.","last_name":"D'Orazio"},{"last_name":"Haiman","first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","full_name":"Haiman, Zoltán"},{"last_name":"Duffell","first_name":"P.","full_name":"Duffell, P."},{"last_name":"Farris","first_name":"B. D.","full_name":"Farris, B. D."},{"last_name":"MacFadyen","first_name":"A. I.","full_name":"MacFadyen, A. I."}],"issue":"3","intvolume":"       452"},{"publication_identifier":{"issn":["1745-3933","1745-3925"]},"day":"11","doi":"10.1093/mnrasl/slv111","_id":"17622","volume":454,"article_type":"original","scopus_import":"1","page":"L21-L25","article_processing_charge":"No","oa_version":"Published Version","type":"journal_article","month":"09","quality_controlled":"1","language":[{"iso":"eng"}],"date_published":"2015-09-11T00:00:00Z","year":"2015","status":"public","extern":"1","publication_status":"published","citation":{"mla":"Charisi, M., et al. “Multiple Periods in the Variability of the Supermassive Black Hole Binary Candidate Quasar PG1302-102?” <i>Monthly Notices of the Royal Astronomical Society: Letters</i>, vol. 454, no. 1, Oxford University Press, 2015, pp. L21–25, doi:<a href=\"https://doi.org/10.1093/mnrasl/slv111\">10.1093/mnrasl/slv111</a>.","ista":"Charisi M, Bartos I, Haiman Z, Price-Whelan AM, Márka S. 2015. Multiple periods in the variability of the supermassive black hole binary candidate quasar PG1302-102? Monthly Notices of the Royal Astronomical Society: Letters. 454(1), L21–L25.","ama":"Charisi M, Bartos I, Haiman Z, Price-Whelan AM, Márka S. Multiple periods in the variability of the supermassive black hole binary candidate quasar PG1302-102? <i>Monthly Notices of the Royal Astronomical Society: Letters</i>. 2015;454(1):L21-L25. doi:<a href=\"https://doi.org/10.1093/mnrasl/slv111\">10.1093/mnrasl/slv111</a>","ieee":"M. Charisi, I. Bartos, Z. Haiman, A. M. Price-Whelan, and S. Márka, “Multiple periods in the variability of the supermassive black hole binary candidate quasar PG1302-102?,” <i>Monthly Notices of the Royal Astronomical Society: Letters</i>, vol. 454, no. 1. Oxford University Press, pp. L21–L25, 2015.","apa":"Charisi, M., Bartos, I., Haiman, Z., Price-Whelan, A. M., &#38; Márka, S. (2015). Multiple periods in the variability of the supermassive black hole binary candidate quasar PG1302-102? <i>Monthly Notices of the Royal Astronomical Society: Letters</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnrasl/slv111\">https://doi.org/10.1093/mnrasl/slv111</a>","chicago":"Charisi, M., I. Bartos, Zoltán Haiman, A. M. Price-Whelan, and S. Márka. “Multiple Periods in the Variability of the Supermassive Black Hole Binary Candidate Quasar PG1302-102?” <i>Monthly Notices of the Royal Astronomical Society: Letters</i>. Oxford University Press, 2015. <a href=\"https://doi.org/10.1093/mnrasl/slv111\">https://doi.org/10.1093/mnrasl/slv111</a>.","short":"M. Charisi, I. Bartos, Z. Haiman, A.M. Price-Whelan, S. Márka, Monthly Notices of the Royal Astronomical Society: Letters 454 (2015) L21–L25."},"intvolume":"       454","issue":"1","author":[{"first_name":"M.","full_name":"Charisi, M.","last_name":"Charisi"},{"last_name":"Bartos","full_name":"Bartos, I.","first_name":"I."},{"last_name":"Haiman","full_name":"Haiman, Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","first_name":"Zoltán"},{"last_name":"Price-Whelan","full_name":"Price-Whelan, A. M.","first_name":"A. M."},{"last_name":"Márka","first_name":"S.","full_name":"Márka, S."}],"oa":1,"abstract":[{"text":"Graham et al. discovered a supermassive black hole binary (SMBHB) candidate and identified the detected 5.2 yr period of the optical variability as the orbital period of the binary. Hydrodynamical simulations predict multiple periodic components for the variability of SMBHBs, thus raising the possibility that the true period of the binary is different from 5.2 yr. We analyse the periodogram of PG1302 and find no compelling evidence for additional peaks. We also point out that, despite the 5.2 yr peak being significant if a single source is considered, further analysis is required to account for the fact that PG1302 was selected among a large sample of 247 000 quasars. We derive upper limits on any additional periodic modulations in the available data, by modelling the light curve as the sum of stochastic noise and the known 5.2 yr periodic component, and injecting additional sinusoidal signals. We find that, with the current data, we would be able to detect with high significance (false alarm probability <1 per cent) secondary periodic terms, with periods in the range predicted by the simulations, if the amplitude of the variability was at least ∼0.06 mag (compared to 0.14 mag for the main sinusoid). A three-year follow-up monitoring campaign with weekly observations can increase the sensitivity for detecting secondary peaks by ≈50 per cent, and would allow a more robust test of predictions from hydrodynamical simulations.","lang":"eng"}],"publisher":"Oxford University Press","date_created":"2024-09-05T13:51:39Z","title":"Multiple periods in the variability of the supermassive black hole binary candidate quasar PG1302-102?","publication":"Monthly Notices of the Royal Astronomical Society: Letters","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","main_file_link":[{"url":"https://doi.org/10.1093/mnrasl/slv111","open_access":"1"}],"date_updated":"2024-09-24T08:34:12Z"},{"year":"2015","date_published":"2015-07-08T00:00:00Z","publication_status":"published","status":"public","extern":"1","citation":{"short":"J. Prieto, R. Jimenez, Z. Haiman, R.E. González, Monthly Notices of the Royal Astronomical Society 452 (2015) 784–802.","chicago":"Prieto, Joaquin, Raul Jimenez, Zoltán Haiman, and Roberto E. González. “The Origin of Spin in Galaxies: Clues from Simulations of Atomic Cooling Haloes.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2015. <a href=\"https://doi.org/10.1093/mnras/stv1234\">https://doi.org/10.1093/mnras/stv1234</a>.","apa":"Prieto, J., Jimenez, R., Haiman, Z., &#38; González, R. E. (2015). The origin of spin in galaxies: Clues from simulations of atomic cooling haloes. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stv1234\">https://doi.org/10.1093/mnras/stv1234</a>","ama":"Prieto J, Jimenez R, Haiman Z, González RE. The origin of spin in galaxies: Clues from simulations of atomic cooling haloes. <i>Monthly Notices of the Royal Astronomical Society</i>. 2015;452(1):784-802. doi:<a href=\"https://doi.org/10.1093/mnras/stv1234\">10.1093/mnras/stv1234</a>","ieee":"J. Prieto, R. Jimenez, Z. Haiman, and R. E. González, “The origin of spin in galaxies: Clues from simulations of atomic cooling haloes,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 452, no. 1. Oxford University Press, pp. 784–802, 2015.","ista":"Prieto J, Jimenez R, Haiman Z, González RE. 2015. The origin of spin in galaxies: Clues from simulations of atomic cooling haloes. Monthly Notices of the Royal Astronomical Society. 452(1), 784–802.","mla":"Prieto, Joaquin, et al. “The Origin of Spin in Galaxies: Clues from Simulations of Atomic Cooling Haloes.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 452, no. 1, Oxford University Press, 2015, pp. 784–802, doi:<a href=\"https://doi.org/10.1093/mnras/stv1234\">10.1093/mnras/stv1234</a>."},"quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":"       452","issue":"1","author":[{"full_name":"Prieto, Joaquin","first_name":"Joaquin","last_name":"Prieto"},{"last_name":"Jimenez","full_name":"Jimenez, Raul","first_name":"Raul"},{"last_name":"Haiman","first_name":"Zoltán","full_name":"Haiman, Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36"},{"first_name":"Roberto E.","full_name":"González, Roberto E.","last_name":"González"}],"publisher":"Oxford University Press","oa":1,"abstract":[{"lang":"eng","text":"In order to elucidate the origin of spin in both dark matter and baryons in galaxies, we have performed hydrodynamical simulations from cosmological initial conditions. We study atomic cooling haloes in the redshift range 100>z>9 with masses of order 109M⊙ at redshift z=10. We assume that the gas has primordial composition and that H2-cooling and prior star-formation in the haloes have been suppressed. We present a comprehensive analysis of the gas and dark matter properties of four halos with very low (λ≈0.01), low (λ≈0.04), high (λ≈0.06) and very high (λ≈0.1) spin parameter. Our main conclusion is that the spin orientation and magnitude is initially well described by tidal torque linear theory, but later on is determined by the merging and accretion history of each halo. We provide evidence that the topology of the merging region, i.e. the number of colliding filaments, gives an accurate prediction for the spin of dark matter and gas: halos at the center of knots will have low spin while those in the center of filaments will have high spin. The spin of a halo is given by λ≈0.05×(7.6/numberoffilaments)^5.1"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2024-09-24T11:52:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/mnras/stv1234"}],"date_created":"2024-09-06T07:18:53Z","title":"The origin of spin in galaxies: Clues from simulations of atomic cooling haloes","publication":"Monthly Notices of the Royal Astronomical Society","_id":"17641","volume":452,"publication_identifier":{"issn":["0035-8711","1365-2966"]},"doi":"10.1093/mnras/stv1234","day":"08","article_type":"original","article_processing_charge":"No","scopus_import":"1","page":"784-802","oa_version":"Published Version","type":"journal_article","month":"07"},{"abstract":[{"text":"Because most large galaxies contain a central black hole, and galaxies often merge, black-hole binaries are expected to be common in galactic nuclei. Although they cannot be imaged, periodicities in the light curves of quasars have been interpreted as evidence for binaries, most recently in PG~1302-102, with a short rest-frame optical period of 4 years. If the orbital period matches this value, then for the range of estimated black hole masses the components would be separated by 0.007-0.017 pc, implying relativistic orbital speeds. There has been much debate over whether black hole orbits could be smaller than 1 pc. Here we show that the amplitude and the sinusoid-like shape of the variability of PG~1302-102 can be fit by relativistic Doppler boosting of emission from a compact, steadily accreting, unequal-mass binary. We predict that brightness variations in the ultraviolet light curve track those in the optical, but with a 2-3 times larger amplitude. This prediction is relatively insensitive to the details of the emission process, and is consistent with archival UV data. Follow-up UV and optical observations in the next few years can test this prediction and confirm the existence of a binary black hole in the relativistic regime.","lang":"eng"}],"oa":1,"publisher":"Springer Science and Business Media LLC","publication":"Nature","title":"Relativistic boost as the cause of periodicity in a massive black-hole binary candidate","date_created":"2024-09-06T07:30:45Z","arxiv":1,"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1509.04301"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2024-09-24T13:22:24Z","external_id":{"arxiv":["1509.04301"]},"language":[{"iso":"eng"}],"quality_controlled":"1","citation":{"apa":"D’Orazio, D. J., Haiman, Z., &#38; Schiminovich, D. (2015). Relativistic boost as the cause of periodicity in a massive black-hole binary candidate. <i>Nature</i>. Springer Science and Business Media LLC. <a href=\"https://doi.org/10.1038/nature15262\">https://doi.org/10.1038/nature15262</a>","ieee":"D. J. D’Orazio, Z. Haiman, and D. Schiminovich, “Relativistic boost as the cause of periodicity in a massive black-hole binary candidate,” <i>Nature</i>, vol. 525, no. 7569. Springer Science and Business Media LLC, pp. 351–353, 2015.","ama":"D’Orazio DJ, Haiman Z, Schiminovich D. Relativistic boost as the cause of periodicity in a massive black-hole binary candidate. <i>Nature</i>. 2015;525(7569):351-353. doi:<a href=\"https://doi.org/10.1038/nature15262\">10.1038/nature15262</a>","ista":"D’Orazio DJ, Haiman Z, Schiminovich D. 2015. Relativistic boost as the cause of periodicity in a massive black-hole binary candidate. Nature. 525(7569), 351–353.","mla":"D’Orazio, Daniel J., et al. “Relativistic Boost as the Cause of Periodicity in a Massive Black-Hole Binary Candidate.” <i>Nature</i>, vol. 525, no. 7569, Springer Science and Business Media LLC, 2015, pp. 351–53, doi:<a href=\"https://doi.org/10.1038/nature15262\">10.1038/nature15262</a>.","short":"D.J. D’Orazio, Z. Haiman, D. Schiminovich, Nature 525 (2015) 351–353.","chicago":"D’Orazio, Daniel J., Zoltán Haiman, and David Schiminovich. “Relativistic Boost as the Cause of Periodicity in a Massive Black-Hole Binary Candidate.” <i>Nature</i>. Springer Science and Business Media LLC, 2015. <a href=\"https://doi.org/10.1038/nature15262\">https://doi.org/10.1038/nature15262</a>."},"extern":"1","publication_status":"published","status":"public","date_published":"2015-09-16T00:00:00Z","year":"2015","author":[{"last_name":"D'Orazio","first_name":"Daniel J.","full_name":"D'Orazio, Daniel J."},{"last_name":"Haiman","first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","full_name":"Haiman, Zoltán"},{"last_name":"Schiminovich","full_name":"Schiminovich, David","first_name":"David"}],"issue":"7569","intvolume":"       525","page":"351-353","scopus_import":"1","article_processing_charge":"No","month":"09","type":"journal_article","oa_version":"Preprint","doi":"10.1038/nature15262","day":"16","publication_identifier":{"issn":["0028-0836","1476-4687"]},"volume":525,"_id":"17652","article_type":"original"},{"abstract":[{"lang":"eng","text":"Recently, Planck measured a value of the cosmic microwave background (CMB) optical depth due to electron scattering of τ=0.066±0.016. Here we show that this low value leaves essentially no room for an early partial reionisation of the intergalactic medium (IGM) by high-redshift Population III (Pop III) stars, expected to have formed in low-mass minihaloes. We perform semi-analytic calculations of reionisation which include the contribution from Pop II stars in atomic cooling haloes, calibrated with high-redshift galaxy observations, and Pop III stars in minihaloes with feedback due to Lyman-Werner (LW) radiation and metal enrichment. We find that without LW feedback or prompt metal enrichment (and assuming a minihalo escape fraction of 0.5) the Pop III star formation efficiency cannot exceed ∼a few×10−4, without violating the constraints set by Planck data. This excludes massive Pop III star formation in typical 106M⊙ minihaloes. Including LW feedback and metal enrichment alleviates this tension, allowing large Pop III stars to form early on before they are quenched by feedback. We find that the total density of Pop III stars formed across cosmic time is ≲104−5 M⊙ Mpc−3 and does not depend strongly on the feedback prescription adopted. Additionally, we perform a simple estimate of the possible impact on reionisation of X-rays produced by accretion onto black hole remnants of Pop III stars. We find that unless the accretion duty cycle is very low (≲0.01), this could lead to an optical depth inconsistent with Planck."}],"oa":1,"publisher":"Oxford University Press","title":"Limits on population III star formation in minihaloes implied by Planck","publication":"Monthly Notices of the Royal Astronomical Society","date_created":"2024-09-06T07:40:38Z","arxiv":1,"date_updated":"2024-09-25T07:32:20Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1505.06359","open_access":"1"}],"external_id":{"arxiv":["1505.06359"]},"language":[{"iso":"eng"}],"quality_controlled":"1","citation":{"ieee":"E. Visbal, Z. Haiman, and G. L. Bryan, “Limits on population III star formation in minihaloes implied by Planck,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 453, no. 4. Oxford University Press, pp. 4457–4467, 2015.","ama":"Visbal E, Haiman Z, Bryan GL. Limits on population III star formation in minihaloes implied by Planck. <i>Monthly Notices of the Royal Astronomical Society</i>. 2015;453(4):4457-4467. doi:<a href=\"https://doi.org/10.1093/mnras/stv1941\">10.1093/mnras/stv1941</a>","apa":"Visbal, E., Haiman, Z., &#38; Bryan, G. L. (2015). Limits on population III star formation in minihaloes implied by Planck. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stv1941\">https://doi.org/10.1093/mnras/stv1941</a>","ista":"Visbal E, Haiman Z, Bryan GL. 2015. Limits on population III star formation in minihaloes implied by Planck. Monthly Notices of the Royal Astronomical Society. 453(4), 4457–4467.","mla":"Visbal, Eli, et al. “Limits on Population III Star Formation in Minihaloes Implied by Planck.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 453, no. 4, Oxford University Press, 2015, pp. 4457–67, doi:<a href=\"https://doi.org/10.1093/mnras/stv1941\">10.1093/mnras/stv1941</a>.","short":"E. Visbal, Z. Haiman, G.L. Bryan, Monthly Notices of the Royal Astronomical Society 453 (2015) 4457–4467.","chicago":"Visbal, Eli, Zoltán Haiman, and Greg L. Bryan. “Limits on Population III Star Formation in Minihaloes Implied by Planck.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2015. <a href=\"https://doi.org/10.1093/mnras/stv1941\">https://doi.org/10.1093/mnras/stv1941</a>."},"year":"2015","date_published":"2015-09-16T00:00:00Z","status":"public","extern":"1","publication_status":"published","author":[{"first_name":"Eli","full_name":"Visbal, Eli","last_name":"Visbal"},{"id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","full_name":"Haiman, Zoltán","first_name":"Zoltán","last_name":"Haiman"},{"last_name":"Bryan","full_name":"Bryan, Greg L.","first_name":"Greg L."}],"intvolume":"       453","issue":"4","page":"4457-4467","scopus_import":"1","article_processing_charge":"No","type":"journal_article","month":"09","oa_version":"Preprint","doi":"10.1093/mnras/stv1941","day":"16","publication_identifier":{"issn":["0035-8711","1365-2966"]},"_id":"17663","volume":453,"article_type":"original"},{"day":"02","doi":"10.1093/mnras/stv2371","publication_identifier":{"issn":["0035-8711","1365-2966"]},"_id":"17685","volume":455,"article_type":"original","page":"484-492","scopus_import":"1","article_processing_charge":"No","type":"journal_article","month":"11","oa_version":"Published Version","language":[{"iso":"eng"}],"quality_controlled":"1","citation":{"short":"P. Raffai, Z. Haiman, Z. Frei, Monthly Notices of the Royal Astronomical Society 455 (2015) 484–492.","chicago":"Raffai, P., Zoltán Haiman, and Z. Frei. “A Statistical Method to Search for Recoiling Supermassive Black Holes in Active Galactic Nuclei.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2015. <a href=\"https://doi.org/10.1093/mnras/stv2371\">https://doi.org/10.1093/mnras/stv2371</a>.","ista":"Raffai P, Haiman Z, Frei Z. 2015. A statistical method to search for recoiling supermassive black holes in active galactic nuclei. Monthly Notices of the Royal Astronomical Society. 455(1), 484–492.","ama":"Raffai P, Haiman Z, Frei Z. A statistical method to search for recoiling supermassive black holes in active galactic nuclei. <i>Monthly Notices of the Royal Astronomical Society</i>. 2015;455(1):484-492. doi:<a href=\"https://doi.org/10.1093/mnras/stv2371\">10.1093/mnras/stv2371</a>","apa":"Raffai, P., Haiman, Z., &#38; Frei, Z. (2015). A statistical method to search for recoiling supermassive black holes in active galactic nuclei. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stv2371\">https://doi.org/10.1093/mnras/stv2371</a>","ieee":"P. Raffai, Z. Haiman, and Z. Frei, “A statistical method to search for recoiling supermassive black holes in active galactic nuclei,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 455, no. 1. Oxford University Press, pp. 484–492, 2015.","mla":"Raffai, P., et al. “A Statistical Method to Search for Recoiling Supermassive Black Holes in Active Galactic Nuclei.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 455, no. 1, Oxford University Press, 2015, pp. 484–92, doi:<a href=\"https://doi.org/10.1093/mnras/stv2371\">10.1093/mnras/stv2371</a>."},"date_published":"2015-11-02T00:00:00Z","year":"2015","extern":"1","publication_status":"published","status":"public","author":[{"last_name":"Raffai","first_name":"P.","full_name":"Raffai, P."},{"full_name":"Haiman, Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","first_name":"Zoltán","last_name":"Haiman"},{"last_name":"Frei","first_name":"Z.","full_name":"Frei, Z."}],"intvolume":"       455","issue":"1","abstract":[{"text":"We propose an observational test for gravitationally recoiling supermassive black holes (BHs) in active galactic nuclei, based on a correlation between the velocities of BHs relative to their host galaxies, |\\Delta v|, and their obscuring dust column densities, \\Sigma_{dust} (both measured along the line of sight). We use toy models for the distribution of recoil velocities, BH trajectories, and the geometry of obscuring dust tori in galactic centres, to simulate 2.5x10^5 random observations of recoiling quasars. BHs with recoil velocities comparable to the escape velocity from the galactic centre remain bound to the nucleus, and do not fully settle back to the centre of the torus due to dynamical friction in a typical quasar lifetime. We find that |\\Delta v| and \\Sigma_ {dust} for these BHs are positively correlated. For obscured (\\Sigma_{dust}>0) and for partially obscured (0<\\Sigma_{dust}<~2.3 g/m^2) quasars with |\\Delta v|>=45 km/s, the sample correlation coefficient between log10(|\\Delta v|) and \\Sigma_{dust} is r_{45} = 0.28+/-0.02 and r_{45} = 0.13+/-0.02, respectively. Allowing for random +/-100 km/s errors in |\\Delta v| unrelated to the recoil dilutes the correlation for the partially obscured quasars to r_{45} = 0.026+/-0.004 measured between |\\Delta v| and \\Sigma_{dust}. A random sample of >~3,500 obscured quasars with |\\Delta v|>=45 km/s would allow rejection of the no-correlation hypothesis with 3 sigma significance 95% of the time. Finally, we find that the fraction of obscured quasars, F_{obs}(|\\Delta v|), decreases with |\\Delta v| from F_{obs}(<10 km/s)>~0.8 to F_{obs}(>10^3 km/s)<~0.4. This predicted trend can be compared to the observed fraction of type II quasars, and can further test combinations of recoil, trajectory, and dust torus models.","lang":"eng"}],"oa":1,"publisher":"Oxford University Press","title":"A statistical method to search for recoiling supermassive black holes in active galactic nuclei","publication":"Monthly Notices of the Royal Astronomical Society","date_created":"2024-09-06T08:20:30Z","date_updated":"2024-09-25T09:18:47Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/mnras/stv2371"}]}]