[{"type":"journal_article","oa_version":"Preprint","abstract":[{"text":"We consider sample covariance matrices of the form Q = ( σ1/2X)(σ1/2X)∗, where the sample X is an M ×N random matrix whose entries are real independent random variables with variance 1/N and whereσ is an M × M positive-definite deterministic matrix. We analyze the asymptotic fluctuations of the largest rescaled eigenvalue of Q when both M and N tend to infinity with N/M →d ϵ (0,∞). For a large class of populations σ in the sub-critical regime, we show that the distribution of the largest rescaled eigenvalue of Q is given by the type-1 Tracy-Widom distribution under the additional assumptions that (1) either the entries of X are i.i.d. Gaussians or (2) that σ is diagonal and that the entries of X have a sub-exponential decay.","lang":"eng"}],"_id":"1157","title":"Tracy-widom distribution for the largest eigenvalue of real sample covariance matrices with general population","date_created":"2018-12-11T11:50:27Z","status":"public","author":[{"full_name":"Lee, Ji","first_name":"Ji","last_name":"Lee"},{"id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","first_name":"Kevin","last_name":"Schnelli","orcid":"0000-0003-0954-3231","full_name":"Schnelli, Kevin"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-22T09:55:43Z","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"}],"page":"3786 - 3839","citation":{"chicago":"Lee, Ji, and Kevin Schnelli. “Tracy-Widom Distribution for the Largest Eigenvalue of Real Sample Covariance Matrices with General Population.” Annals of Applied Probability. Institute of Mathematical Statistics, 2016. https://doi.org/10.1214/16-AAP1193.","apa":"Lee, J., & Schnelli, K. (2016). Tracy-widom distribution for the largest eigenvalue of real sample covariance matrices with general population. Annals of Applied Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/16-AAP1193","ama":"Lee J, Schnelli K. Tracy-widom distribution for the largest eigenvalue of real sample covariance matrices with general population. Annals of Applied Probability. 2016;26(6):3786-3839. doi:10.1214/16-AAP1193","mla":"Lee, Ji, and Kevin Schnelli. “Tracy-Widom Distribution for the Largest Eigenvalue of Real Sample Covariance Matrices with General Population.” Annals of Applied Probability, vol. 26, no. 6, Institute of Mathematical Statistics, 2016, pp. 3786–839, doi:10.1214/16-AAP1193.","ista":"Lee J, Schnelli K. 2016. Tracy-widom distribution for the largest eigenvalue of real sample covariance matrices with general population. Annals of Applied Probability. 26(6), 3786–3839.","ieee":"J. Lee and K. Schnelli, “Tracy-widom distribution for the largest eigenvalue of real sample covariance matrices with general population,” Annals of Applied Probability, vol. 26, no. 6. Institute of Mathematical Statistics, pp. 3786–3839, 2016.","short":"J. Lee, K. Schnelli, Annals of Applied Probability 26 (2016) 3786–3839."},"ec_funded":1,"acknowledgement":"We thank Horng-Tzer Yau for numerous discussions and remarks. We are grateful to Ben Adlam, Jinho Baik, Zhigang Bao, Paul Bourgade, László Erd ̋os, Iain Johnstone and Antti Knowles for comments. We are also grate-\r\nful to the anonymous referee for carefully reading our manuscript and suggesting several improvements.","publication":"Annals of Applied Probability","issue":"6","scopus_import":"1","language":[{"iso":"eng"}],"publist_id":"6201","year":"2016","quality_controlled":"1","publication_status":"published","intvolume":" 26","fulldoi":"https://doi.org/10.1214/16-AAP1193","arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/1409.4979","open_access":"1"}],"date_published":"2016-12-15T00:00:00Z","article_processing_charge":"No","external_id":{"arxiv":["1409.4979"],"isi":["000391240100016"]},"month":"12","department":[{"_id":"LaEr"}],"publisher":"Institute of Mathematical Statistics","day":"15","oa":1,"volume":26,"doi":"10.1214/16-AAP1193","isi":1},{"abstract":[{"lang":"eng","text":"We present new results from the widest narrow-band survey search for Lyα emitters at z = 5.7, just after reionization. We survey a total of 7 deg2 spread over the COSMOS, UDS and SA22 fields. We find over 11 000 line emitters, out of which 514 are robust Lyα candidates at z = 5.7 within a volume of 6.3 × 106 Mpc3. Our Lyα emitters span a wide range in Lyα luminosities, from faint to bright (LLyα ∼ 1042.5–44 erg s−1) and rest-frame equivalent widths (EW0 ∼ 25–1000 Å) in a single, homogeneous data set. By combining all our fields, we find that the faint end slope of the z = 5.7 Lyα luminosity function is very steep, with α=−2.3+0.4−0.3. We also present an updated z = 6.6 Lyα luminosity function, based on comparable volumes and obtained with the same methods, which we directly compare with that at z = 5.7. We find a significant decline of the number density of faint Lyα emitters from z = 5.7 to 6.6 (by 0.5 ± 0.1 dex), but no evolution at the bright end/no evolution in L*. Faint Lyα emitters at z = 6.6 show much more extended haloes than those at z = 5.7, suggesting that neutral Hydrogen plays an important role, increasing the scattering and leading to observations missing faint Lyα emission within the epoch of reionization. Altogether, our results suggest that we are observing patchy reionization which happens first around the brightest Lyα emitters, allowing the number densities of those sources to remain unaffected by the increase of neutral Hydrogen fraction from z ∼ 5 to 7."}],"extern":"1","article_type":"original","oa_version":"Preprint","type":"journal_article","author":[{"full_name":"Santos, Sérgio","first_name":"Sérgio","last_name":"Santos"},{"last_name":"Sobral","first_name":"David","full_name":"Sobral, David"},{"orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J","first_name":"Jorryt J","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720"}],"status":"public","date_created":"2022-07-13T10:08:20Z","_id":"11574","title":"The Lyα luminosity function at z= 5.7–6.6 and the steep drop of the faint end: Implications for reionization","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2022-08-19T08:09:54Z","page":"1678-1691","citation":{"ama":"Santos S, Sobral D, Matthee JJ. The Lyα luminosity function at z= 5.7–6.6 and the steep drop of the faint end: Implications for reionization. Monthly Notices of the Royal Astronomical Society. 2016;463(2):1678-1691. doi:10.1093/mnras/stw2076","mla":"Santos, Sérgio, et al. “The Lyα Luminosity Function at Z= 5.7–6.6 and the Steep Drop of the Faint End: Implications for Reionization.” Monthly Notices of the Royal Astronomical Society, vol. 463, no. 2, Oxford University Press, 2016, pp. 1678–91, doi:10.1093/mnras/stw2076.","ista":"Santos S, Sobral D, Matthee JJ. 2016. The Lyα luminosity function at z= 5.7–6.6 and the steep drop of the faint end: Implications for reionization. Monthly Notices of the Royal Astronomical Society. 463(2), 1678–1691.","ieee":"S. Santos, D. Sobral, and J. J. Matthee, “The Lyα luminosity function at z= 5.7–6.6 and the steep drop of the faint end: Implications for reionization,” Monthly Notices of the Royal Astronomical Society, vol. 463, no. 2. Oxford University Press, pp. 1678–1691, 2016.","short":"S. Santos, D. Sobral, J.J. Matthee, Monthly Notices of the Royal Astronomical Society 463 (2016) 1678–1691.","chicago":"Santos, Sérgio, David Sobral, and Jorryt J Matthee. “The Lyα Luminosity Function at Z= 5.7–6.6 and the Steep Drop of the Faint End: Implications for Reionization.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2016. https://doi.org/10.1093/mnras/stw2076.","apa":"Santos, S., Sobral, D., & Matthee, J. J. (2016). The Lyα luminosity function at z= 5.7–6.6 and the steep drop of the faint end: Implications for reionization. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stw2076"},"publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"acknowledgement":"We thank the anonymous referee for useful and constructive comments and suggestions which greatly improved the quality and clarity of our work. The authors acknowledge financial support from the Netherlands Organisation for Scientific research (NWO) through a Veni fellowship. SS and DS acknowledge funding from FCT through an FCT Investigator Starting Grant and Start-up Grant (IF/01154/2012/CP0189/CT0010). SS also acknowledges support from FCT through the research grants UID/FIS/04434/2013 and PTDC/FIS-AST/2194/2012. JM acknowledges a Huygens PhD fellowship from Leiden University. Based on observations with the Subaru Telescope (Program IDs: S05B-027, S06A-025, S06B-010, S07A-013, S07B-008, S08B-008, S09A-017, S14A-086). Based on observations made with ESO Telescopes at the La Silla Paranal Observatory under programme ID 294.A-5018. Based on observations obtained with MegaPrime/Megacam, a joint project of CFHT and CEA/IRFU, at the Canada–France–Hawaii Telescope (CFHT) which is operated by the National Research Council (NRC) of Canada, the Institut National des Science de l’Univers of the Centre National de la Recherche Scientifique (CNRS) of France, and the University of Hawaii. This work is based in part on data products produced at TERAPIX available at the Canadian Astronomy Data Centre as part of the Canada–France–Hawaii Telescope Legacy Survey, a collaborative project of NRC and CNRS. Based on data products from observations made with ESO Telescopes at the La Silla Paranal Observatory under ESO programme ID 179.A-2005 and on data products produced by TERAPIX and the Cambridge Astronomy Survey Unit on behalf of the UltraVISTA consortium. We are grateful to the CFHTLS, COSMOS-UltraVISTA, UKIDSS, SXDF and COSMOS survey teams. Without these legacy surveys, this research would have been impossible. The authors wish to recognize and acknowledge the very significant cultural role and reverence that the summit of Mauna Kea has always had within the indigenous Hawaiian community. We are most fortunate to have the opportunity to conduct and explore observations from this mountain. Finally, the authors acknowledge the unique value of the publicly available programming language PYTHON, including the NUMPY, PYFITS, MATPLOTLIB, SCIPY and ASTROPY (Astropy Collaboration et al.","issue":"2","scopus_import":"1","publication":"Monthly Notices of the Royal Astronomical Society","language":[{"iso":"eng"}],"intvolume":" 463","year":"2016","quality_controlled":"1","publication_status":"published","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1606.07435"}],"fulldoi":"https://doi.org/10.1093/mnras/stw2076","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: high-redshift","galaxies: luminosity function","mass function","cosmology: observations","dark ages","reionization","first stars"],"article_processing_charge":"No","date_published":"2016-12-01T00:00:00Z","month":"12","publisher":"Oxford University Press","external_id":{"arxiv":["1606.07435"]},"oa":1,"day":"01","doi":"10.1093/mnras/stw2076","volume":463},{"volume":459,"doi":"10.1093/mnras/stw717","day":"01","oa":1,"external_id":{"arxiv":["1510.08067"]},"publisher":"Oxford University Press","month":"07","date_published":"2016-07-01T00:00:00Z","article_processing_charge":"No","keyword":["Space and Planetary Science","Astronomy and Astrophysics stars: formation","ISM: evolution","galaxies: evolution","galaxies: formation","galaxies: ISM"],"fulldoi":"https://doi.org/10.1093/mnras/stw717","main_file_link":[{"url":"https://arxiv.org/abs/1510.08067","open_access":"1"}],"arxiv":1,"publication_status":"published","year":"2016","quality_controlled":"1","intvolume":" 459","language":[{"iso":"eng"}],"publication":"Monthly Notices of the Royal Astronomical Society","scopus_import":"1","issue":"3","acknowledgement":"We thank Luca Cortese, Matt Bothwell, Paola Santini and Tim Davis for providing observational data sets, and Aaron Robotham, Luca Cortese and Barbara Catinella for useful discussions. CdPL is funded by a Discovery Early Career Researcher Award (DE150100618). CdPL also thanks the MERAC Foundation for a Postdoctoral Research Award. This work used the DiRAC Data Centric system at Durham University, operated by the Institute for Computational Cosmology on behalf of the STFC DiRAC HPC Facility (www.dirac.ac.uk). This equipment was funded by BIS National E-infrastructure capital grant ST/K00042X/1, STFC capital grant ST/H008519/1, and STFC DiRAC Operations grant ST/K003267/1 and Durham University. DiRAC is part of the National E-Infrastructure. Support was also received via the Interuniversity Attraction Poles Programme initiated by the Belgian Science Policy Office ([AP P7/08 CHARM]), the National Science Foundation under grant no. NSF PHY11-25915, and the UK Science and Technology Facilities Council (grant numbers ST/F001166/1 and ST/I000976/1) via rolling and consolidating grants awarded to the ICC. The research was supported in part by the European Research Council under the European Union‘s Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement 278594-GasAroundGalaxies.","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"page":"2632-2650","citation":{"chicago":"Lagos, Claudia del P., Tom Theuns, Joop Schaye, Michelle Furlong, Richard G. Bower, Matthieu Schaller, Robert A. Crain, James W. Trayford, and Jorryt J Matthee. “The Fundamental Plane of Star Formation in Galaxies Revealed by the EAGLE Hydrodynamical Simulations.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2016. https://doi.org/10.1093/mnras/stw717.","apa":"Lagos, C. del P., Theuns, T., Schaye, J., Furlong, M., Bower, R. G., Schaller, M., … Matthee, J. J. (2016). The Fundamental Plane of star formation in galaxies revealed by the EAGLE hydrodynamical simulations. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stw717","ama":"Lagos C del P, Theuns T, Schaye J, et al. The Fundamental Plane of star formation in galaxies revealed by the EAGLE hydrodynamical simulations. Monthly Notices of the Royal Astronomical Society. 2016;459(3):2632-2650. doi:10.1093/mnras/stw717","mla":"Lagos, Claudia del P., et al. “The Fundamental Plane of Star Formation in Galaxies Revealed by the EAGLE Hydrodynamical Simulations.” Monthly Notices of the Royal Astronomical Society, vol. 459, no. 3, Oxford University Press, 2016, pp. 2632–50, doi:10.1093/mnras/stw717.","short":"C. del P. Lagos, T. Theuns, J. Schaye, M. Furlong, R.G. Bower, M. Schaller, R.A. Crain, J.W. Trayford, J.J. Matthee, Monthly Notices of the Royal Astronomical Society 459 (2016) 2632–2650.","ieee":"C. del P. Lagos et al., “The Fundamental Plane of star formation in galaxies revealed by the EAGLE hydrodynamical simulations,” Monthly Notices of the Royal Astronomical Society, vol. 459, no. 3. Oxford University Press, pp. 2632–2650, 2016.","ista":"Lagos C del P, Theuns T, Schaye J, Furlong M, Bower RG, Schaller M, Crain RA, Trayford JW, Matthee JJ. 2016. The Fundamental Plane of star formation in galaxies revealed by the EAGLE hydrodynamical simulations. Monthly Notices of the Royal Astronomical Society. 459(3), 2632–2650."},"date_updated":"2022-08-19T08:12:07Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The Fundamental Plane of star formation in galaxies revealed by the EAGLE hydrodynamical simulations","_id":"11575","status":"public","author":[{"last_name":"Lagos","first_name":"Claudia del P.","full_name":"Lagos, Claudia del P."},{"first_name":"Tom","last_name":"Theuns","full_name":"Theuns, Tom"},{"last_name":"Schaye","first_name":"Joop","full_name":"Schaye, Joop"},{"full_name":"Furlong, Michelle","first_name":"Michelle","last_name":"Furlong"},{"last_name":"Bower","first_name":"Richard G.","full_name":"Bower, Richard G."},{"full_name":"Schaller, Matthieu","last_name":"Schaller","first_name":"Matthieu"},{"first_name":"Robert A.","last_name":"Crain","full_name":"Crain, Robert A."},{"full_name":"Trayford, James W.","first_name":"James W.","last_name":"Trayford"},{"full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720","last_name":"Matthee","first_name":"Jorryt J"}],"date_created":"2022-07-13T10:21:24Z","type":"journal_article","oa_version":"Preprint","article_type":"original","extern":"1","abstract":[{"lang":"eng","text":"We investigate correlations between different physical properties of star-forming galaxies in the ‘Evolution and Assembly of GaLaxies and their Environments’ (EAGLE) cosmological hydrodynamical simulation suite over the redshift range 0 ≤ z ≤ 4.5. A principal component analysis reveals that neutral gas fraction (fgas,neutral), stellar mass (Mstellar) and star formation rate (SFR) account for most of the variance seen in the population, with galaxies tracing a two-dimensional, nearly flat, surface in the three-dimensional space of fgas, neutral–Mstellar–SFR with little scatter. The location of this plane varies little with redshift, whereas galaxies themselves move along the plane as their fgas, neutral and SFR drop with redshift. The positions of galaxies along the plane are highly correlated with gas metallicity. The metallicity can therefore be robustly predicted from fgas, neutral, or from the Mstellar and SFR. We argue that the appearance of this ‘Fundamental Plane of star formation’ is a consequence of self-regulation, with the plane's curvature set by the dependence of the SFR on gas density and metallicity. We analyse a large compilation of observations spanning the redshift range 0 ≲ z ≲ 3, and find that such a plane is also present in the data. The properties of the observed Fundamental Plane of star formation are in good agreement with EAGLE's predictions."}]},{"day":"01","oa":1,"external_id":{"arxiv":["1601.02266"]},"month":"04","publisher":"Oxford University Press","volume":457,"doi":"10.1093/mnras/stw022","year":"2016","quality_controlled":"1","publication_status":"published","intvolume":" 457","date_published":"2016-04-01T00:00:00Z","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: high-redshift","cosmology: observations"],"article_processing_charge":"No","fulldoi":"https://doi.org/10.1093/mnras/stw022","arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/1601.02266","open_access":"1"}],"publication":"Monthly Notices of the Royal Astronomical Society","issue":"2","scopus_import":"1","acknowledgement":"The authors would like to thank the anonymous reviewer for the many helpful comments and suggestions which greatly improved the clarity and quality of this work. DS and SAK acknowledge financial support from the Netherlands Organisation for Scientific research (NWO) through a Veni fellowship. DS also acknowledges funding from FCT through an FCT Investigator Starting Grant and Start-up Grant (IF/01154/2012/CP0189/CT0010) and from FCT grant PEst-OE/FIS/UI2751/2014. Part of this project was undertaken during the inaugural Leiden/ESA Astrophysics Program for Summer Students (LEAPS). IRS acknowledges support from STFC (ST/L00075X/1), the ERC Advanced Investigator programme DUSTYGAL 321334 and a Royal Society/Wolfson merit award. CH acknowledges support from STFC. Based on observations made with ESO Telescopes at the La Silla Paranal Observatory under programme ID 087.A-0337 and ID 089.A-0965. Also based on data from the Telescopio Nazionale Galileo, with time awarded through OPTICON programmes 2011A/026 and 2012A020 and the William Herschel Telescope under programme W12BN007. The William Herschel Telescope is operated on the island of La Palma by the Isaac Newton Group in the Spanish\r\nObservatorio del Roque de los Muchachos of the Instituto de Astrofisica de Canarias. The authors wish to thank all the help given by the telescope staff from all the observatories used in this study: ESO staff in La Silla, and the TNG and WHT staff in La Palma. This publication makes use of data products from the Two Micron All-Sky Survey, which is a joint project of the University of Massachusetts and the Infrared Processing and Analysis Center/California Institute of Technology, funded by the National Aeronautics and Space Administration and the National Science Foundation.","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"language":[{"iso":"eng"}],"_id":"11576","title":"The most luminous H α emitters at z ∼ 0.8–2.23 from HiZELS: Evolution of AGN and star-forming galaxies","date_created":"2022-07-13T12:50:36Z","author":[{"last_name":"Sobral","first_name":"David","full_name":"Sobral, David"},{"first_name":"Saul A.","last_name":"Kohn","full_name":"Kohn, Saul A."},{"full_name":"Best, Philip N.","last_name":"Best","first_name":"Philip N."},{"last_name":"Smail","first_name":"Ian","full_name":"Smail, Ian"},{"full_name":"Harrison, Chris M.","last_name":"Harrison","first_name":"Chris M."},{"first_name":"John","last_name":"Stott","full_name":"Stott, John"},{"full_name":"Calhau, João","first_name":"João","last_name":"Calhau"},{"orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J","first_name":"Jorryt J","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720"}],"status":"public","article_type":"original","type":"journal_article","oa_version":"Preprint","abstract":[{"lang":"eng","text":"We use new near-infrared spectroscopic observations to investigate the nature and evolution of the most luminous Hα emitters at z ∼ 0.8–2.23, which evolve strongly in number density over this period, and compare them to more typical Hα emitters. We study 59 luminous Hα emitters with LHα > L∗Hα, roughly equally split per redshift slice at z ∼ 0.8, 1.47 and 2.23 from the HiZELS and CF-HiZELS surveys. We find that, overall, 30 ± 8 per cent are active galactic nuclei [AGNs; 80 ± 30 per cent of these AGNs are broad-line AGNs, BL-AGNs], and we find little to no evolution in the AGN fraction with redshift, within the errors. However, the AGN fraction increases strongly with Hα luminosity and correlates best with LHα/L∗Hα(z). While LHα ≤ L∗Hα(z) Hα emitters are largely dominated by star-forming galaxies (>80 per cent), the most luminous Hα emitters (LHα>10L∗Hα(z)) at any cosmic time are essentially all BL-AGN. Using our AGN-decontaminated sample of luminous star-forming galaxies, and integrating down to a fixed Hα luminosity, we find a factor of ∼1300 evolution in the star formation rate density from z = 0 to 2.23. This is much stronger than the evolution from typical Hα star-forming galaxies and in line with the evolution seen for constant luminosity cuts used to select ‘ultraluminous’ infrared galaxies and/or sub-millimetre galaxies. By taking into account the evolution in the typical Hα luminosity, we show that the most strongly star-forming Hα-selected galaxies at any epoch (LHα>L∗Hα(z)) contribute the same fractional amount of ≈15 per cent to the total star formation rate density, at least up to z = 2.23."}],"extern":"1","citation":{"chicago":"Sobral, David, Saul A. Kohn, Philip N. Best, Ian Smail, Chris M. Harrison, John Stott, João Calhau, and Jorryt J Matthee. “The Most Luminous H α Emitters at z ∼ 0.8–2.23 from HiZELS: Evolution of AGN and Star-Forming Galaxies.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2016. https://doi.org/10.1093/mnras/stw022.","apa":"Sobral, D., Kohn, S. A., Best, P. N., Smail, I., Harrison, C. M., Stott, J., … Matthee, J. J. (2016). The most luminous H α emitters at z ∼ 0.8–2.23 from HiZELS: Evolution of AGN and star-forming galaxies. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stw022","ama":"Sobral D, Kohn SA, Best PN, et al. The most luminous H α emitters at z ∼ 0.8–2.23 from HiZELS: Evolution of AGN and star-forming galaxies. Monthly Notices of the Royal Astronomical Society. 2016;457(2):1739-1752. doi:10.1093/mnras/stw022","mla":"Sobral, David, et al. “The Most Luminous H α Emitters at z ∼ 0.8–2.23 from HiZELS: Evolution of AGN and Star-Forming Galaxies.” Monthly Notices of the Royal Astronomical Society, vol. 457, no. 2, Oxford University Press, 2016, pp. 1739–52, doi:10.1093/mnras/stw022.","ieee":"D. Sobral et al., “The most luminous H α emitters at z ∼ 0.8–2.23 from HiZELS: Evolution of AGN and star-forming galaxies,” Monthly Notices of the Royal Astronomical Society, vol. 457, no. 2. Oxford University Press, pp. 1739–1752, 2016.","ista":"Sobral D, Kohn SA, Best PN, Smail I, Harrison CM, Stott J, Calhau J, Matthee JJ. 2016. The most luminous H α emitters at z ∼ 0.8–2.23 from HiZELS: Evolution of AGN and star-forming galaxies. Monthly Notices of the Royal Astronomical Society. 457(2), 1739–1752.","short":"D. Sobral, S.A. Kohn, P.N. Best, I. Smail, C.M. Harrison, J. Stott, J. Calhau, J.J. Matthee, Monthly Notices of the Royal Astronomical Society 457 (2016) 1739–1752."},"page":"1739-1752","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2022-08-19T08:15:21Z"},{"page":"449-467","citation":{"mla":"Matthee, Jorryt J., et al. “The CALYMHA Survey: Lyα Escape Fraction and Its Dependence on Galaxy Properties at z = 2.23.” Monthly Notices of the Royal Astronomical Society, vol. 458, no. 1, Oxford University Press, 2016, pp. 449–67, doi:10.1093/mnras/stw322.","ama":"Matthee JJ, Sobral D, Oteo I, et al. The CALYMHA survey: Lyα escape fraction and its dependence on galaxy properties at z = 2.23. Monthly Notices of the Royal Astronomical Society. 2016;458(1):449-467. doi:10.1093/mnras/stw322","ieee":"J. J. Matthee et al., “The CALYMHA survey: Lyα escape fraction and its dependence on galaxy properties at z = 2.23,” Monthly Notices of the Royal Astronomical Society, vol. 458, no. 1. Oxford University Press, pp. 449–467, 2016.","ista":"Matthee JJ, Sobral D, Oteo I, Best P, Smail I, Röttgering H, Paulino-Afonso A. 2016. The CALYMHA survey: Lyα escape fraction and its dependence on galaxy properties at z = 2.23. Monthly Notices of the Royal Astronomical Society. 458(1), 449–467.","short":"J.J. Matthee, D. Sobral, I. Oteo, P. Best, I. Smail, H. Röttgering, A. Paulino-Afonso, Monthly Notices of the Royal Astronomical Society 458 (2016) 449–467.","chicago":"Matthee, Jorryt J, David Sobral, Iván Oteo, Philip Best, Ian Smail, Huub Röttgering, and Ana Paulino-Afonso. “The CALYMHA Survey: Lyα Escape Fraction and Its Dependence on Galaxy Properties at z = 2.23.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2016. https://doi.org/10.1093/mnras/stw322.","apa":"Matthee, J. J., Sobral, D., Oteo, I., Best, P., Smail, I., Röttgering, H., & Paulino-Afonso, A. (2016). The CALYMHA survey: Lyα escape fraction and its dependence on galaxy properties at z = 2.23. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stw322"},"date_updated":"2024-10-14T11:36:40Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The CALYMHA survey: Lyα escape fraction and its dependence on galaxy properties at z = 2.23","_id":"11578","status":"public","author":[{"id":"7439a258-f3c0-11ec-9501-9df22fe06720","first_name":"Jorryt J","last_name":"Matthee","orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J"},{"first_name":"David","last_name":"Sobral","full_name":"Sobral, David"},{"full_name":"Oteo, Iván","last_name":"Oteo","first_name":"Iván"},{"full_name":"Best, Philip","last_name":"Best","first_name":"Philip"},{"first_name":"Ian","last_name":"Smail","full_name":"Smail, Ian"},{"first_name":"Huub","last_name":"Röttgering","full_name":"Röttgering, Huub"},{"last_name":"Paulino-Afonso","first_name":"Ana","full_name":"Paulino-Afonso, Ana"}],"date_created":"2022-07-14T08:51:37Z","type":"journal_article","oa_version":"Preprint","article_type":"original","extern":"1","abstract":[{"lang":"eng","text":"We present the first results from our CAlibrating LYMan α with Hα (CALYMHA) pilot survey at the Isaac Newton Telescope. We measure Lyα emission for 488 Hα selected galaxies at z = 2.23 from High-z Emission Line Survey in the COSMOS and UDS fields with a specially designed narrow-band filter (λc = 3918 Å, Δλ = 52 Å). We find 17 dual Hα-Lyα emitters [fLyα > 5 × 10−17 erg s−1 cm−2, of which five are X-ray active galactic nuclei (AGN)]. For star-forming galaxies, we find a range of Lyα escape fractions (fesc, measured with 3 arcsec apertures) from 2 to 30 per cent. These galaxies have masses from 3 × 108 M⊙ to 1011 M⊙ and dust attenuations E(B − V) = 0–0.5. Using stacking, we measure a median escape fraction of 1.6 ± 0.5 per cent (4.0 ± 1.0 per cent without correcting Hα for dust), but show that this depends on galaxy properties. The stacked fesc tends to decrease with increasing star formation rate and dust attenuation. However, at the highest masses and dust attenuations, we detect individual galaxies with fesc much higher than the typical values from stacking, indicating significant scatter in the values of fesc. Relations between fesc and UV slope are bimodal, with high fesc for either the bluest or reddest galaxies. We speculate that this bimodality and large scatter in the values of fesc is due to additional physical mechanisms such as outflows facilitating fesc for dusty/massive systems. Lyα is significantly more extended than Hα and the UV. fesc continues to increase up to at least 20 kpc (3σ, 40 kpc [2σ]) for typical star-forming galaxies and thus the aperture is the most important predictor of fesc."}],"language":[{"iso":"eng"}],"publication":"Monthly Notices of the Royal Astronomical Society","scopus_import":"1","issue":"1","acknowledgement":"We thank the anonymous referee for constructive comments and suggestions which have improved the quality of this work. JM acknowledges the support of a Huygens PhD fellowship from Leiden University. DS and JM acknowledge financial support from the Netherlands Organization for Scientific research (NWO) through a Veni fellowship, and DS from FCT through a FCT Investigator Starting Grant and Start-up Grant (IF/01154/2012/CP0189/CT0010) and from FCT grant PEst-OE/FIS/UI2751/2014. IO acknowledges support from the European Research Council (ERC) in the form of Advanced Investigator Programme, COSMICISM, 321302. HR acknowledges support from the ERC Advanced Investigator programme NewClusters 321271. IRS acknowledges support from STFC (ST/L00075X/1), the ERC Advanced Investigator programme DUSTYGAL 321334 and a Royal Society/Wolfson Merit Award. APA acknowledges support from the Fundac¸ao para a Ciencia e para a Tecnologia (FCT) through the Fellowship SFRH/BD/52706/2014.\r\nBased on observations made with the Isaac Newton Telescope (proposals 2013AN002, 2013BN008, 2014AC88, 2014AN002, 2014BN006, 2014BC118) operated on the island of La Palma by the Isaac Newton Group in the Spanish Observatorio del Roque de los Muchachos of the Instituto de Astrof´ısica de Canarias. We acknowledge the tremendous work that has been done by both COSMOS and UKIDSS UDS/SXDF teams in assembling such large, state-ofthe-art multi-wavelength data sets over such wide areas, as those have been crucial for the results presented in this paper. The sample of HAEs is publicly available from Sobral et al. (2013).\r\nWe have benefited greatly from the publically available programming language PYTHON, including the NUMPY, MATPLOTLIB, PYFITS, SCIPY (Jones et al. 2001; Hunter 2007; Van Der Walt, Colbert & Varoquaux 2011) and ASTROPY (Astropy Collaboration et al. 2013) packages, the imaging tools SEXTRACTOR, SWARP and SCAMP (Bertin & Arnouts 1996; Bertin 2006, 2010) and the TOPCAT analysis program (Taylor 2005).","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"date_published":"2016-05-01T00:00:00Z","article_processing_charge":"No","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: high-redshift","galaxies: ISM"],"fulldoi":"https://doi.org/10.1093/mnras/stw322","main_file_link":[{"url":"https://arxiv.org/abs/1602.02756","open_access":"1"}],"arxiv":1,"publication_status":"published","year":"2016","quality_controlled":"1","intvolume":" 458","volume":458,"doi":"10.1093/mnras/stw322","day":"01","oa":1,"external_id":{"arxiv":["1602.02756"]},"publisher":"Oxford University Press","month":"05"},{"_id":"1158","title":"Shedding light on the grey zone of speciation along a continuum of genomic divergence","status":"public","author":[{"full_name":"Roux, Camille","first_name":"Camille","last_name":"Roux"},{"id":"32DF5794-F248-11E8-B48F-1D18A9856A87","first_name":"Christelle","last_name":"Fraisse","full_name":"Fraisse, Christelle","orcid":"0000-0001-8441-5075"},{"first_name":"Jonathan","last_name":"Romiguier","full_name":"Romiguier, Jonathan"},{"full_name":"Anciaux, Youann","first_name":"Youann","last_name":"Anciaux"},{"first_name":"Nicolas","last_name":"Galtier","full_name":"Galtier, Nicolas"},{"full_name":"Bierne, Nicolas","last_name":"Bierne","first_name":"Nicolas"}],"date_created":"2018-12-11T11:50:28Z","oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"Speciation results from the progressive accumulation of mutations that decrease the probability of mating between parental populations or reduce the fitness of hybrids—the so-called species barriers. The speciation genomic literature, however, is mainly a collection of case studies, each with its own approach and specificities, such that a global view of the gradual process of evolution from one to two species is currently lacking. Of primary importance is the prevalence of gene flow between diverging entities, which is central in most species concepts and has been widely discussed in recent years. Here, we explore the continuum of speciation thanks to a comparative analysis of genomic data from 61 pairs of populations/species of animals with variable levels of divergence. Gene flow between diverging gene pools is assessed under an approximate Bayesian computation (ABC) framework. We show that the intermediate "grey zone" of speciation, in which taxonomy is often controversial, spans from 0.5% to 2% of net synonymous divergence, irrespective of species life history traits or ecology. Thanks to appropriate modeling of among-locus variation in genetic drift and introgression rate, we clarify the status of the majority of ambiguous cases and uncover a number of cryptic species. Our analysis also reveals the high incidence in animals of semi-isolated species (when some but not all loci are affected by barriers to gene flow) and highlights the intrinsic difficulty, both statistical and conceptual, of delineating species in the grey zone of speciation."}],"related_material":{"record":[{"status":"public","id":"9862","relation":"research_data"},{"relation":"research_data","id":"9863","status":"public"}]},"citation":{"apa":"Roux, C., Fraisse, C., Romiguier, J., Anciaux, Y., Galtier, N., & Bierne, N. (2016). Shedding light on the grey zone of speciation along a continuum of genomic divergence. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.2000234","chicago":"Roux, Camille, Christelle Fraisse, Jonathan Romiguier, Youann Anciaux, Nicolas Galtier, and Nicolas Bierne. “Shedding Light on the Grey Zone of Speciation along a Continuum of Genomic Divergence.” PLoS Biology. Public Library of Science, 2016. https://doi.org/10.1371/journal.pbio.2000234.","ista":"Roux C, Fraisse C, Romiguier J, Anciaux Y, Galtier N, Bierne N. 2016. Shedding light on the grey zone of speciation along a continuum of genomic divergence. PLoS Biology. 14(12), e2000234.","ieee":"C. Roux, C. Fraisse, J. Romiguier, Y. Anciaux, N. Galtier, and N. Bierne, “Shedding light on the grey zone of speciation along a continuum of genomic divergence,” PLoS Biology, vol. 14, no. 12. Public Library of Science, 2016.","short":"C. Roux, C. Fraisse, J. Romiguier, Y. Anciaux, N. Galtier, N. Bierne, PLoS Biology 14 (2016).","mla":"Roux, Camille, et al. “Shedding Light on the Grey Zone of Speciation along a Continuum of Genomic Divergence.” PLoS Biology, vol. 14, no. 12, e2000234, Public Library of Science, 2016, doi:10.1371/journal.pbio.2000234.","ama":"Roux C, Fraisse C, Romiguier J, Anciaux Y, Galtier N, Bierne N. Shedding light on the grey zone of speciation along a continuum of genomic divergence. PLoS Biology. 2016;14(12). doi:10.1371/journal.pbio.2000234"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-22T09:55:10Z","publication":"PLoS Biology","issue":"12","scopus_import":"1","acknowledgement":"European Research Council (ERC) https://erc.europa.eu/ (grant number ERC grant 232971). PopPhyl project. The funder had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. French National Research Agency (ANR) http://www.agence-nationale-recherche.fr/en/project-based-funding-to-advance-french-research/ (grant number ANR-12-BSV7- 0011). HYSEA project.\r\nWe thank Aude Darracq, Vincent Castric, Pierre-Alexandre Gagnaire, Xavier Vekemans, and John Welch for insightful discussions. The computations were performed at the Vital-IT (http://www.vital-it.ch) Center for high-performance computing of the SIB Swiss Institute of Bioinformatics and the ISEM computing cluster at the platform Montpellier Bioinformatique et Biodiversité.","publist_id":"6200","language":[{"iso":"eng"}],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["576"],"quality_controlled":"1","year":"2016","publication_status":"published","intvolume":" 14","file_date_updated":"2020-07-14T12:44:36Z","date_published":"2016-12-27T00:00:00Z","has_accepted_license":"1","article_processing_charge":"No","fulldoi":"https://doi.org/10.1371/journal.pbio.2000234","day":"27","pubrep_id":"742","oa":1,"external_id":{"isi":["000392120100008"]},"month":"12","department":[{"_id":"BeVi"},{"_id":"NiBa"}],"publisher":"Public Library of Science","article_number":"e2000234","isi":1,"volume":14,"file":[{"access_level":"open_access","relation":"main_file","creator":"system","date_created":"2018-12-12T10:15:42Z","checksum":"2bab63b068a9840efd532b9ae583f9bb","content_type":"application/pdf","date_updated":"2020-07-14T12:44:36Z","file_name":"IST-2017-742-v1+1_journal.pbio.2000234.pdf","file_size":2494348,"file_id":"5164"}],"doi":"10.1371/journal.pbio.2000234"},{"external_id":{"isi":["000405478500036"],"arxiv":["1608.08662"]},"month":"12","department":[{"_id":"UlWa"}],"publisher":"Springer","day":"08","oa":1,"volume":9801,"doi":"10.1007/978-3-319-50106-2_36","isi":1,"year":"2016","quality_controlled":"1","publication_status":"published","intvolume":" 9801","fulldoi":"https://doi.org/10.1007/978-3-319-50106-2_36","arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/1608.08662","open_access":"1"}],"date_published":"2016-12-08T00:00:00Z","alternative_title":["LNCS"],"conference":{"end_date":"2016-09-21","start_date":"2016-09-19","name":"GD: Graph Drawing and Network Visualization","location":"Athens, Greece"},"article_processing_charge":"No","ec_funded":1,"scopus_import":"1","publist_id":"6193","language":[{"iso":"eng"}],"oa_version":"Preprint","type":"conference","abstract":[{"text":"A drawing of a graph G is radial if the vertices of G are placed on concentric circles C1, … , Ck with common center c, and edges are drawn radially: every edge intersects every circle centered at c at most once. G is radial planar if it has a radial embedding, that is, a crossing-free radial drawing. If the vertices of G are ordered or partitioned into ordered levels (as they are for leveled graphs), we require that the assignment of vertices to circles corresponds to the given ordering or leveling. A pair of edges e and f in a graph is independent if e and f do not share a vertex. We show that a graph G is radial planar if G has a radial drawing in which every two independent edges cross an even number of times; the radial embedding has the same leveling as the radial drawing. In other words, we establish the strong Hanani-Tutte theorem for radial planarity. This characterization yields a very simple algorithm for radial planarity testing.","lang":"eng"}],"_id":"1164","title":"Hanani-Tutte for radial planarity II","date_created":"2018-12-11T11:50:29Z","author":[{"id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek","first_name":"Radoslav","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774"},{"full_name":"Pelsmajer, Michael","last_name":"Pelsmajer","first_name":"Michael"},{"last_name":"Schaefer","first_name":"Marcus","full_name":"Schaefer, Marcus"}],"status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-23T09:13:42Z","related_material":{"record":[{"relation":"later_version","id":"1113","status":"public"},{"relation":"earlier_version","id":"1595","status":"public"}]},"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"citation":{"apa":"Fulek, R., Pelsmajer, M., & Schaefer, M. (2016). Hanani-Tutte for radial planarity II (Vol. 9801, pp. 468–481). Presented at the GD: Graph Drawing and Network Visualization, Athens, Greece: Springer. https://doi.org/10.1007/978-3-319-50106-2_36","chicago":"Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity II,” 9801:468–81. Springer, 2016. https://doi.org/10.1007/978-3-319-50106-2_36.","short":"R. Fulek, M. Pelsmajer, M. Schaefer, in:, Springer, 2016, pp. 468–481.","ieee":"R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity II,” presented at the GD: Graph Drawing and Network Visualization, Athens, Greece, 2016, vol. 9801, pp. 468–481.","ista":"Fulek R, Pelsmajer M, Schaefer M. 2016. Hanani-Tutte for radial planarity II. GD: Graph Drawing and Network Visualization, LNCS, vol. 9801, 468–481.","mla":"Fulek, Radoslav, et al. Hanani-Tutte for Radial Planarity II. Vol. 9801, Springer, 2016, pp. 468–81, doi:10.1007/978-3-319-50106-2_36.","ama":"Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity II. In: Vol 9801. Springer; 2016:468-481. doi:10.1007/978-3-319-50106-2_36"},"page":"468 - 481"},{"day":"08","oa":1,"external_id":{"isi":["000405478500008"],"arxiv":["1602.01346"]},"month":"12","department":[{"_id":"UlWa"}],"publisher":"Springer","isi":1,"volume":"9801 ","doi":"10.1007/978-3-319-50106-2_8","year":"2016","quality_controlled":"1","publication_status":"published","alternative_title":["LNCS"],"date_published":"2016-12-08T00:00:00Z","conference":{"location":"Athens, Greece","start_date":"2016-09-19","end_date":"2016-09-21","name":"GD: Graph Drawing and Network Visualization"},"article_processing_charge":"No","fulldoi":"https://doi.org/10.1007/978-3-319-50106-2_8","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.01346"}],"scopus_import":"1","acknowledgement":"R. Fulek—The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no [291734].\r\nI would like to thank Jan Kynčl and Dömötör Pálvölgyi for many comments and suggestions that helped to improve the presentation of the result.","ec_funded":1,"publist_id":"6192","language":[{"iso":"eng"}],"_id":"1165","title":"C-planarity of embedded cyclic c-graphs","date_created":"2018-12-11T11:50:30Z","author":[{"full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","first_name":"Radoslav","last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87"}],"status":"public","oa_version":"Preprint","type":"conference","abstract":[{"text":"We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows. Given a graph G with the vertex set partitioned into three parts embedded on a 2-sphere, our algorithm decides if we can augment G by adding edges without creating an edge-crossing so that in the resulting spherical graph the vertices of each part induce a connected sub-graph. We proceed by a reduction to the problem of testing the existence of a perfect matching in planar bipartite graphs. We formulate our result in a slightly more general setting of cyclic clustered graphs, i.e., the simple graph obtained by contracting each cluster, where we disregard loops and multi-edges, is a cycle.","lang":"eng"}],"related_material":{"record":[{"status":"public","id":"794","relation":"later_version"}]},"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"page":"94 - 106","citation":{"chicago":"Fulek, Radoslav. “C-Planarity of Embedded Cyclic c-Graphs,” 9801:94–106. Springer, 2016. https://doi.org/10.1007/978-3-319-50106-2_8.","apa":"Fulek, R. (2016). C-planarity of embedded cyclic c-graphs (Vol. 9801, pp. 94–106). Presented at the GD: Graph Drawing and Network Visualization, Athens, Greece: Springer. https://doi.org/10.1007/978-3-319-50106-2_8","ama":"Fulek R. C-planarity of embedded cyclic c-graphs. In: Vol 9801. Springer; 2016:94-106. doi:10.1007/978-3-319-50106-2_8","mla":"Fulek, Radoslav. C-Planarity of Embedded Cyclic c-Graphs. Vol. 9801, Springer, 2016, pp. 94–106, doi:10.1007/978-3-319-50106-2_8.","ieee":"R. Fulek, “C-planarity of embedded cyclic c-graphs,” presented at the GD: Graph Drawing and Network Visualization, Athens, Greece, 2016, vol. 9801, pp. 94–106.","short":"R. Fulek, in:, Springer, 2016, pp. 94–106.","ista":"Fulek R. 2016. C-planarity of embedded cyclic c-graphs. GD: Graph Drawing and Network Visualization, LNCS, vol. 9801, 94–106."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-22T09:54:03Z"},{"doi":"10.1609/aaai.v30i1.10422","volume":2016,"oa":1,"corr_author":"1","day":"02","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"month":"12","publisher":"AAAI Press","external_id":{"arxiv":["1511.08456"]},"article_processing_charge":"No","date_published":"2016-12-02T00:00:00Z","conference":{"start_date":"2016-02-12","end_date":"2016-02-17","name":"AAAI: Conference on Artificial Intelligence","location":"Phoenix, AZ, United States"},"arxiv":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1511.08456"}],"fulldoi":"https://doi.org/10.1609/aaai.v30i1.10422","intvolume":" 2016","year":"2016","quality_controlled":"1","publication_status":"published","OA_place":"repository","OA_type":"green","language":[{"iso":"eng"}],"publist_id":"6191","publication":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","ec_funded":1,"project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"page":"3225 - 3232","citation":{"chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in POMDPs.” In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016:3225–32. AAAI Press, 2016. https://doi.org/10.1609/aaai.v30i1.10422.","apa":"Chatterjee, K., Chmelik, M., & Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp. 3225–3232). Phoenix, AZ, United States: AAAI Press. https://doi.org/10.1609/aaai.v30i1.10422","ama":"Chatterjee K, Chmelik M, Davies J. A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. Vol 2016. AAAI Press; 2016:3225-3232. doi:10.1609/aaai.v30i1.10422","mla":"Chatterjee, Krishnendu, et al. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in POMDPs.” Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, vol. 2016, AAAI Press, 2016, pp. 3225–32, doi:10.1609/aaai.v30i1.10422.","ista":"Chatterjee K, Chmelik M, Davies J. 2016. A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2016, 3225–3232.","ieee":"K. Chatterjee, M. Chmelik, and J. Davies, “A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs,” in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, AZ, United States, 2016, vol. 2016, pp. 3225–3232.","short":"K. Chatterjee, M. Chmelik, J. Davies, in:, Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI Press, 2016, pp. 3225–3232."},"related_material":{"link":[{"relation":"table_of_contents","url":"https://dl.acm.org/citation.cfm?id=3016355"}],"record":[{"status":"public","id":"5443","relation":"earlier_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-06-25T11:52:14Z","date_created":"2018-12-11T11:50:30Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin"},{"full_name":"Davies, Jessica","last_name":"Davies","first_name":"Jessica","id":"378E0060-F248-11E8-B48F-1D18A9856A87"}],"status":"public","_id":"1166","title":"A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs","abstract":[{"lang":"eng","text":"POMDPs are standard models for probabilistic planning problems, where an agent interacts with an uncertain environment. We study the problem of almost-sure reachability, where given a set of target states, the question is to decide whether there is a policy to ensure that the target set is reached with probability 1 (almost-surely). While in general the problem is EXPTIMEcomplete, in many practical cases policies with a small amount of memory suffice. Moreover, the existing solution to the problem is explicit, which first requires to construct explicitly an exponential reduction to a belief-support MDP. In this work, we first study the existence of observation-stationary strategies, which is NP-complete, and then small-memory strategies. We present a symbolic algorithm by an efficient encoding to SAT and using a SAT solver for the problem. We report experimental results demonstrating the scalability of our symbolic (SAT-based) approach. © 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved."}],"oa_version":"Preprint","type":"conference"},{"citation":{"apa":"Zagórski, M. P., Burda, Z., & Wacław, B. (2016). Beyond the hypercube evolutionary accessibility of fitness landscapes with realistic mutational networks. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005218","chicago":"Zagórski, Marcin P, Zdzisław Burda, and Bartłomiej Wacław. “Beyond the Hypercube Evolutionary Accessibility of Fitness Landscapes with Realistic Mutational Networks.” PLoS Computational Biology. Public Library of Science, 2016. https://doi.org/10.1371/journal.pcbi.1005218.","ista":"Zagórski MP, Burda Z, Wacław B. 2016. Beyond the hypercube evolutionary accessibility of fitness landscapes with realistic mutational networks. PLoS Computational Biology. 12(12), e1005218.","ieee":"M. P. Zagórski, Z. Burda, and B. Wacław, “Beyond the hypercube evolutionary accessibility of fitness landscapes with realistic mutational networks,” PLoS Computational Biology, vol. 12, no. 12. Public Library of Science, 2016.","short":"M.P. Zagórski, Z. Burda, B. Wacław, PLoS Computational Biology 12 (2016).","ama":"Zagórski MP, Burda Z, Wacław B. Beyond the hypercube evolutionary accessibility of fitness landscapes with realistic mutational networks. PLoS Computational Biology. 2016;12(12). doi:10.1371/journal.pcbi.1005218","mla":"Zagórski, Marcin P., et al. “Beyond the Hypercube Evolutionary Accessibility of Fitness Landscapes with Realistic Mutational Networks.” PLoS Computational Biology, vol. 12, no. 12, e1005218, Public Library of Science, 2016, doi:10.1371/journal.pcbi.1005218."},"related_material":{"record":[{"relation":"research_data","id":"9866","status":"public"}]},"date_updated":"2025-09-22T09:53:16Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:50:30Z","status":"public","author":[{"last_name":"Zagórski","first_name":"Marcin P","id":"343DA0DC-F248-11E8-B48F-1D18A9856A87","full_name":"Zagórski, Marcin P","orcid":"0000-0001-7896-7762"},{"full_name":"Burda, Zdzisław","last_name":"Burda","first_name":"Zdzisław"},{"last_name":"Wacław","first_name":"Bartłomiej","full_name":"Wacław, Bartłomiej"}],"title":"Beyond the hypercube evolutionary accessibility of fitness landscapes with realistic mutational networks","_id":"1167","abstract":[{"lang":"eng","text":"Evolutionary pathways describe trajectories of biological evolution in the space of different variants of organisms (genotypes). The probability of existence and the number of evolutionary pathways that lead from a given genotype to a better-adapted genotype are important measures of accessibility of local fitness optima and the reproducibility of evolution. Both quantities have been studied in simple mathematical models where genotypes are represented as binary sequences of two types of basic units, and the network of permitted mutations between the genotypes is a hypercube graph. However, it is unclear how these results translate to the biologically relevant case in which genotypes are represented by sequences of more than two units, for example four nucleotides (DNA) or 20 amino acids (proteins), and the mutational graph is not the hypercube. Here we investigate accessibility of the best-adapted genotype in the general case of K > 2 units. Using computer generated and experimental fitness landscapes we show that accessibility of the global fitness maximum increases with K and can be much higher than for binary sequences. The increase in accessibility comes from the increase in the number of indirect trajectories exploited by evolution for higher K. As one of the consequences, the fraction of genotypes that are accessible increases by three orders of magnitude when the number of units K increases from 2 to 16 for landscapes of size N ∼ 106genotypes. This suggests that evolution can follow many different trajectories on such landscapes and the reconstruction of evolutionary pathways from experimental data might be an extremely difficult task."}],"type":"journal_article","oa_version":"Published Version","publist_id":"6190","language":[{"iso":"eng"}],"scopus_import":"1","issue":"12","publication":"PLoS Computational Biology","acknowledgement":"MZ acknowledges the Polish National Science Centre grant no. DEC-2012/07/N/NZ2/00107. BW was supported by the Scottish Government/Royal Society of Edinburgh Personal Research Fellowship. We thank Marjon de Vos and Oliver Martin for critically reading the manuscript.","article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2020-07-14T12:44:37Z","date_published":"2016-12-09T00:00:00Z","fulldoi":"https://doi.org/10.1371/journal.pcbi.1005218","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["570"],"intvolume":" 12","publication_status":"published","year":"2016","quality_controlled":"1","isi":1,"article_number":"e1005218","doi":"10.1371/journal.pcbi.1005218","file":[{"file_id":"4926","file_size":3822299,"file_name":"IST-2017-740-v1+1_journal.pcbi.1005218.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:44:37Z","checksum":"84f44ae92866c52ff1ca8a574558dca7","date_created":"2018-12-12T10:12:08Z","creator":"system","relation":"main_file","access_level":"open_access"}],"volume":12,"oa":1,"pubrep_id":"740","day":"09","publisher":"Public Library of Science","department":[{"_id":"AnKi"}],"month":"12","external_id":{"isi":["000392126000015"]}},{"quality_controlled":"1","year":"2016","publication_status":"published","oa_version":"None","type":"journal_article","intvolume":" 17","_id":"1171","title":"Understanding regulatory networks requires more than computing a multitude of graph statistics: Comment on "Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function" by O. C. Martin et al.","author":[{"full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik","first_name":"Gasper"}],"status":"public","date_created":"2018-12-11T11:50:32Z","fulldoi":"https://doi.org/10.1016/j.plrev.2016.06.005","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-22T09:50:37Z","date_published":"2016-07-01T00:00:00Z","page":"166 - 167","article_processing_charge":"No","citation":{"mla":"Tkačik, Gašper. “Understanding Regulatory Networks Requires More than Computing a Multitude of Graph Statistics: Comment on "Drivers of Structural Features in Gene Regulatory Networks: From Biophysical Constraints to Biological Function" by O. C. Martin et Al.” Physics of Life Reviews, vol. 17, Elsevier, 2016, pp. 166–67, doi:10.1016/j.plrev.2016.06.005.","ama":"Tkačik G. Understanding regulatory networks requires more than computing a multitude of graph statistics: Comment on "Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function" by O. C. Martin et al. Physics of Life Reviews. 2016;17:166-167. doi:10.1016/j.plrev.2016.06.005","ista":"Tkačik G. 2016. Understanding regulatory networks requires more than computing a multitude of graph statistics: Comment on "Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function" by O. C. Martin et al. Physics of Life Reviews. 17, 166–167.","ieee":"G. Tkačik, “Understanding regulatory networks requires more than computing a multitude of graph statistics: Comment on "Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function" by O. C. Martin et al.,” Physics of Life Reviews, vol. 17. Elsevier, pp. 166–167, 2016.","short":"G. Tkačik, Physics of Life Reviews 17 (2016) 166–167.","chicago":"Tkačik, Gašper. “Understanding Regulatory Networks Requires More than Computing a Multitude of Graph Statistics: Comment on "Drivers of Structural Features in Gene Regulatory Networks: From Biophysical Constraints to Biological Function" by O. C. Martin et Al.” Physics of Life Reviews. Elsevier, 2016. https://doi.org/10.1016/j.plrev.2016.06.005.","apa":"Tkačik, G. (2016). Understanding regulatory networks requires more than computing a multitude of graph statistics: Comment on "Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function" by O. C. Martin et al. Physics of Life Reviews. Elsevier. https://doi.org/10.1016/j.plrev.2016.06.005"},"external_id":{"isi":["000381544100033"]},"department":[{"_id":"GaTk"}],"month":"07","publisher":"Elsevier","publication":"Physics of Life Reviews","day":"01","scopus_import":"1","language":[{"iso":"eng"}],"publist_id":"6185","volume":17,"doi":"10.1016/j.plrev.2016.06.005","isi":1},{"date_created":"2018-12-11T11:50:32Z","status":"public","author":[{"full_name":"Sachdeva, Himani","id":"42377A0A-F248-11E8-B48F-1D18A9856A87","first_name":"Himani","last_name":"Sachdeva"},{"last_name":"Barma","first_name":"Mustansir","full_name":"Barma, Mustansir"},{"last_name":"Rao","first_name":"Madan","full_name":"Rao, Madan"}],"title":"Nonequilibrium description of de novo biogenesis and transport through Golgi-like cisternae","_id":"1172","abstract":[{"lang":"eng","text":"A central issue in cell biology is the physico-chemical basis of organelle biogenesis in intracellular trafficking pathways, its most impressive manifestation being the biogenesis of Golgi cisternae. At a basic level, such morphologically and chemically distinct compartments should arise from an interplay between the molecular transport and chemical maturation. Here, we formulate analytically tractable, minimalist models, that incorporate this interplay between transport and chemical progression in physical space, and explore the conditions for de novo biogenesis of distinct cisternae. We propose new quantitative measures that can discriminate between the various models of transport in a qualitative manner-this includes measures of the dynamics in steady state and the dynamical response to perturbations of the kind amenable to live-cell imaging."}],"oa_version":"Published Version","type":"journal_article","citation":{"mla":"Sachdeva, Himani, et al. “Nonequilibrium Description of de Novo Biogenesis and Transport through Golgi-like Cisternae.” Scientific Reports, vol. 6, 38840, Nature Publishing Group, 2016, doi:10.1038/srep38840.","ama":"Sachdeva H, Barma M, Rao M. Nonequilibrium description of de novo biogenesis and transport through Golgi-like cisternae. Scientific Reports. 2016;6. doi:10.1038/srep38840","ieee":"H. Sachdeva, M. Barma, and M. Rao, “Nonequilibrium description of de novo biogenesis and transport through Golgi-like cisternae,” Scientific Reports, vol. 6. Nature Publishing Group, 2016.","short":"H. Sachdeva, M. Barma, M. Rao, Scientific Reports 6 (2016).","ista":"Sachdeva H, Barma M, Rao M. 2016. Nonequilibrium description of de novo biogenesis and transport through Golgi-like cisternae. Scientific Reports. 6, 38840.","chicago":"Sachdeva, Himani, Mustansir Barma, and Madan Rao. “Nonequilibrium Description of de Novo Biogenesis and Transport through Golgi-like Cisternae.” Scientific Reports. Nature Publishing Group, 2016. https://doi.org/10.1038/srep38840.","apa":"Sachdeva, H., Barma, M., & Rao, M. (2016). Nonequilibrium description of de novo biogenesis and transport through Golgi-like cisternae. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/srep38840"},"date_updated":"2025-09-22T09:49:53Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","publication":"Scientific Reports","acknowledgement":"H.S. thanks NCBS for hospitality. We thank Vivek Malhotra and Mukund Thattai for critical discussions and suggestions.","publist_id":"6183","language":[{"iso":"eng"}],"ddc":["576"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"intvolume":" 6","publication_status":"published","quality_controlled":"1","year":"2016","article_processing_charge":"No","has_accepted_license":"1","date_published":"2016-12-19T00:00:00Z","file_date_updated":"2020-07-14T12:44:37Z","fulldoi":"https://doi.org/10.1038/srep38840","oa":1,"pubrep_id":"737","day":"19","publisher":"Nature Publishing Group","department":[{"_id":"NiBa"}],"month":"12","external_id":{"isi":["000389885900001"]},"isi":1,"article_number":"38840","doi":"10.1038/srep38840","file":[{"file_id":"4977","file_size":760967,"file_name":"IST-2017-737-v1+1_srep38840.pdf","date_updated":"2020-07-14T12:44:37Z","content_type":"application/pdf","date_created":"2018-12-12T10:12:56Z","checksum":"cb378732da885ea4959ec5b845fb6e52","creator":"system","relation":"main_file","access_level":"open_access"}],"volume":6},{"acknowledgement":"We are grateful to the anonymous reviewers for their insightful comments. The\r\ndetailed reports helped us a lot to address the technical mistakes as well as to improve the overall presentation of the paper.","publication":"Algorithmica","issue":"4","publist_id":"6177","language":[{"iso":"eng"}],"type":"journal_article","oa_version":"Submitted Version","abstract":[{"text":"Boldyreva, Palacio and Warinschi introduced a multiple forking game as an extension of general forking. The notion of (multiple) forking is a useful abstraction from the actual simulation of cryptographic scheme to the adversary in a security reduction, and is achieved through the intermediary of a so-called wrapper algorithm. Multiple forking has turned out to be a useful tool in the security argument of several cryptographic protocols. However, a reduction employing multiple forking incurs a significant degradation of (Formula presented.) , where (Formula presented.) denotes the upper bound on the underlying random oracle calls and (Formula presented.) , the number of forkings. In this work we take a closer look at the reasons for the degradation with a tighter security bound in mind. We nail down the exact set of conditions for success in the multiple forking game. A careful analysis of the cryptographic schemes and corresponding security reduction employing multiple forking leads to the formulation of ‘dependence’ and ‘independence’ conditions pertaining to the output of the wrapper in different rounds. Based on the (in)dependence conditions we propose a general framework of multiple forking and a General Multiple Forking Lemma. Leveraging (in)dependence to the full allows us to improve the degradation factor in the multiple forking game by a factor of (Formula presented.). By implication, the cost of a single forking involving two random oracles (augmented forking) matches that involving a single random oracle (elementary forking). Finally, we study the effect of these observations on the concrete security of existing schemes employing multiple forking. We conclude that by careful design of the protocol (and the wrapper in the security reduction) it is possible to harness our observations to the full extent.","lang":"eng"}],"title":"A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound","_id":"1177","date_created":"2018-12-11T11:50:33Z","author":[{"orcid":"0009-0006-6812-7317","full_name":"Kamath Hosdurg, Chethan","last_name":"Kamath Hosdurg","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chatterjee","first_name":"Sanjit","full_name":"Chatterjee, Sanjit"}],"status":"public","date_updated":"2026-06-22T14:07:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"1321 - 1362","citation":{"ama":"Kamath Hosdurg C, Chatterjee S. A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. Algorithmica. 2016;74(4):1321-1362. doi:10.1007/s00453-015-9997-6","mla":"Kamath Hosdurg, Chethan, and Sanjit Chatterjee. “A Closer Look at Multiple-Forking: Leveraging (in)Dependence for a Tighter Bound.” Algorithmica, vol. 74, no. 4, Springer, 2016, pp. 1321–62, doi:10.1007/s00453-015-9997-6.","ista":"Kamath Hosdurg C, Chatterjee S. 2016. A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. Algorithmica. 74(4), 1321–1362.","short":"C. Kamath Hosdurg, S. Chatterjee, Algorithmica 74 (2016) 1321–1362.","ieee":"C. Kamath Hosdurg and S. Chatterjee, “A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound,” Algorithmica, vol. 74, no. 4. Springer, pp. 1321–1362, 2016.","chicago":"Kamath Hosdurg, Chethan, and Sanjit Chatterjee. “A Closer Look at Multiple-Forking: Leveraging (in)Dependence for a Tighter Bound.” Algorithmica. Springer, 2016. https://doi.org/10.1007/s00453-015-9997-6.","apa":"Kamath Hosdurg, C., & Chatterjee, S. (2016). A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. Algorithmica. Springer. https://doi.org/10.1007/s00453-015-9997-6"},"external_id":{"isi":["000373640000005"],"cryptoeprintid":["2013/651"]},"publisher":"Springer","month":"04","department":[{"_id":"KrPi"}],"day":"01","oa":1,"volume":74,"doi":"10.1007/s00453-015-9997-6","isi":1,"publication_status":"published","quality_controlled":"1","year":"2016","intvolume":" 74","cryptoeprintid":1,"das_tickbox":"1","fulldoi":"https://doi.org/10.1007/s00453-015-9997-6","main_file_link":[{"url":"http://eprint.iacr.org/2013/651","open_access":"1"}],"date_published":"2016-04-01T00:00:00Z","article_processing_charge":"No"},{"project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"citation":{"mla":"Pietrzak, Krzysztof Z., and Skorski Maciej. Pseudoentropy: Lower-Bounds for Chain Rules and Transformations. Vol. 9985, Springer, 2016, pp. 183–203, doi:10.1007/978-3-662-53641-4_8.","ama":"Pietrzak KZ, Maciej S. Pseudoentropy: Lower-bounds for chain rules and transformations. In: Vol 9985. Springer; 2016:183-203. doi:10.1007/978-3-662-53641-4_8","short":"K.Z. Pietrzak, S. Maciej, in:, Springer, 2016, pp. 183–203.","ieee":"K. Z. Pietrzak and S. Maciej, “Pseudoentropy: Lower-bounds for chain rules and transformations,” presented at the TCC: Theory of Cryptography Conference, Beijing, China, 2016, vol. 9985, pp. 183–203.","ista":"Pietrzak KZ, Maciej S. 2016. Pseudoentropy: Lower-bounds for chain rules and transformations. TCC: Theory of Cryptography Conference, LNCS, vol. 9985, 183–203.","chicago":"Pietrzak, Krzysztof Z, and Skorski Maciej. “Pseudoentropy: Lower-Bounds for Chain Rules and Transformations,” 9985:183–203. Springer, 2016. https://doi.org/10.1007/978-3-662-53641-4_8.","apa":"Pietrzak, K. Z., & Maciej, S. (2016). Pseudoentropy: Lower-bounds for chain rules and transformations (Vol. 9985, pp. 183–203). Presented at the TCC: Theory of Cryptography Conference, Beijing, China: Springer. https://doi.org/10.1007/978-3-662-53641-4_8"},"page":"183 - 203","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-22T09:48:49Z","date_created":"2018-12-11T11:50:34Z","status":"public","author":[{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Maciej, Skorski","first_name":"Skorski","last_name":"Maciej"}],"_id":"1179","title":"Pseudoentropy: Lower-bounds for chain rules and transformations","abstract":[{"lang":"eng","text":"Computational notions of entropy have recently found many applications, including leakage-resilient cryptography, deterministic encryption or memory delegation. The two main types of results which make computational notions so useful are (1) Chain rules, which quantify by how much the computational entropy of a variable decreases if conditioned on some other variable (2) Transformations, which quantify to which extend one type of entropy implies another.\r\n\r\nSuch chain rules and transformations typically lose a significant amount in quality of the entropy, and are the reason why applying these results one gets rather weak quantitative security bounds. In this paper we for the first time prove lower bounds in this context, showing that existing results for transformations are, unfortunately, basically optimal for non-adaptive black-box reductions (and it’s hard to imagine how non black-box reductions or adaptivity could be useful here.)\r\n\r\nA variable X has k bits of HILL entropy of quality (ϵ,s)\r\nif there exists a variable Y with k bits min-entropy which cannot be distinguished from X with advantage ϵ\r\n\r\nby distinguishing circuits of size s. A weaker notion is Metric entropy, where we switch quantifiers, and only require that for every distinguisher of size s, such a Y exists.\r\n\r\nWe first describe our result concerning transformations. By definition, HILL implies Metric without any loss in quality. Metric entropy often comes up in applications, but must be transformed to HILL for meaningful security guarantees. The best known result states that if a variable X has k bits of Metric entropy of quality (ϵ,s)\r\n, then it has k bits of HILL with quality (2ϵ,s⋅ϵ2). We show that this loss of a factor Ω(ϵ−2)\r\n\r\nin circuit size is necessary. In fact, we show the stronger result that this loss is already necessary when transforming so called deterministic real valued Metric entropy to randomised boolean Metric (both these variants of Metric entropy are implied by HILL without loss in quality).\r\n\r\nThe chain rule for HILL entropy states that if X has k bits of HILL entropy of quality (ϵ,s)\r\n, then for any variable Z of length m, X conditioned on Z has k−m bits of HILL entropy with quality (ϵ,s⋅ϵ2/2m). We show that a loss of Ω(2m/ϵ) in circuit size necessary here. Note that this still leaves a gap of ϵ between the known bound and our lower bound."}],"oa_version":"Preprint","type":"conference","publist_id":"6175","language":[{"iso":"eng"}],"scopus_import":"1","acknowledgement":"K. Pietrzak—Supported by the European Research Council consolidator grant (682815-TOCNeT).\r\nM. Skórski—Supported by the National Science Center, Poland (2015/17/N/ST6/03564).","ec_funded":1,"article_processing_charge":"No","alternative_title":["LNCS"],"date_published":"2016-10-22T00:00:00Z","conference":{"location":"Beijing, China","end_date":"2016-11-03","start_date":"2016-10-31","name":"TCC: Theory of Cryptography Conference"},"main_file_link":[{"url":"https://eprint.iacr.org/2016/159","open_access":"1"}],"fulldoi":"https://doi.org/10.1007/978-3-662-53641-4_8","intvolume":" 9985","quality_controlled":"1","year":"2016","publication_status":"published","isi":1,"doi":"10.1007/978-3-662-53641-4_8","volume":9985,"oa":1,"day":"22","month":"10","department":[{"_id":"KrPi"}],"publisher":"Springer","external_id":{"isi":["000390176000008"]}},{"language":[{"iso":"eng"}],"publist_id":"6172","publication":"Journal of Neuroscience","scopus_import":"1","issue":"45","acknowledgement":"This work was supported by National Institutes of Health Grants R01NS089795 and R01NS098370 to H.T.G., R01NS076640 to N.D.D., and R01MH094589 and R01NS089777 to B.C., Academia Sinica AS-104-TPB09-2 to S.-J.C, European Union FP7-CIG618444 and Human Frontiers Science Program RGP0053 to S.H., and Fonds Léon Fredericq, from the Fondation Médicale Reine Elisabeth, and from the Fonation Simone et Pierre Clerdent to L.N. The authors apologize to colleagues whose work could not be cited due to space limitations.","page":"11394 - 11401","citation":{"chicago":"Dwyer, Noelle, Bin Chen, Shen Chou, Simon Hippenmeyer, Laurent Nguyen, and Troy Ghashghaei. “Neural Stem Cells to Cerebral Cortex: Emerging Mechanisms Regulating Progenitor Behavior and Productivity.” Journal of Neuroscience. Society for Neuroscience, 2016. https://doi.org/10.1523/JNEUROSCI.2359-16.2016.","apa":"Dwyer, N., Chen, B., Chou, S., Hippenmeyer, S., Nguyen, L., & Ghashghaei, T. (2016). Neural stem cells to cerebral cortex: Emerging mechanisms regulating progenitor behavior and productivity. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.2359-16.2016","mla":"Dwyer, Noelle, et al. “Neural Stem Cells to Cerebral Cortex: Emerging Mechanisms Regulating Progenitor Behavior and Productivity.” Journal of Neuroscience, vol. 36, no. 45, Society for Neuroscience, 2016, pp. 11394–401, doi:10.1523/JNEUROSCI.2359-16.2016.","ama":"Dwyer N, Chen B, Chou S, Hippenmeyer S, Nguyen L, Ghashghaei T. Neural stem cells to cerebral cortex: Emerging mechanisms regulating progenitor behavior and productivity. Journal of Neuroscience. 2016;36(45):11394-11401. doi:10.1523/JNEUROSCI.2359-16.2016","short":"N. Dwyer, B. Chen, S. Chou, S. Hippenmeyer, L. Nguyen, T. Ghashghaei, Journal of Neuroscience 36 (2016) 11394–11401.","ieee":"N. Dwyer, B. Chen, S. Chou, S. Hippenmeyer, L. Nguyen, and T. Ghashghaei, “Neural stem cells to cerebral cortex: Emerging mechanisms regulating progenitor behavior and productivity,” Journal of Neuroscience, vol. 36, no. 45. Society for Neuroscience, pp. 11394–11401, 2016.","ista":"Dwyer N, Chen B, Chou S, Hippenmeyer S, Nguyen L, Ghashghaei T. 2016. Neural stem cells to cerebral cortex: Emerging mechanisms regulating progenitor behavior and productivity. Journal of Neuroscience. 36(45), 11394–11401."},"project":[{"grant_number":"RGP0053/2014","_id":"25D7962E-B435-11E9-9278-68D0E5697425","name":"Quantitative Structure-Function Analysis of Cerebral Cortex Assembly at Clonal Level"}],"date_updated":"2025-09-22T09:48:17Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Neural stem cells to cerebral cortex: Emerging mechanisms regulating progenitor behavior and productivity","_id":"1181","status":"public","author":[{"full_name":"Dwyer, Noelle","first_name":"Noelle","last_name":"Dwyer"},{"full_name":"Chen, Bin","last_name":"Chen","first_name":"Bin"},{"first_name":"Shen","last_name":"Chou","full_name":"Chou, Shen"},{"orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","first_name":"Simon"},{"full_name":"Nguyen, Laurent","last_name":"Nguyen","first_name":"Laurent"},{"full_name":"Ghashghaei, Troy","last_name":"Ghashghaei","first_name":"Troy"}],"date_created":"2018-12-11T11:50:35Z","type":"journal_article","oa_version":"None","abstract":[{"lang":"eng","text":"This review accompanies a 2016 SFN mini-symposium presenting examples of current studies that address a central question: How do neural stem cells (NSCs) divide in different ways to produce heterogeneous daughter types at the right time and in proper numbers to build a cerebral cortex with the appropriate size and structure? We will focus on four aspects of corticogenesis: cytokinesis events that follow apical mitoses of NSCs; coordinating abscission with delamination from the apical membrane; timing of neurogenesis and its indirect regulation through emergence of intermediate progenitors; and capacity of single NSCs to generate the correct number and laminar fate of cortical neurons. Defects in these mechanisms can cause microcephaly and other brain malformations, and understanding them is critical to designing diagnostic tools and preventive and corrective therapies."}],"isi":1,"volume":36,"doi":"10.1523/JNEUROSCI.2359-16.2016","day":"09","external_id":{"isi":["000391054300003"]},"publisher":"Society for Neuroscience","department":[{"_id":"SiHi"}],"month":"11","date_published":"2016-11-09T00:00:00Z","article_processing_charge":"No","fulldoi":"https://doi.org/10.1523/JNEUROSCI.2359-16.2016","publication_status":"published","year":"2016","quality_controlled":"1","intvolume":" 36"},{"article_processing_charge":"No","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","start_date":"2016-07-09","end_date":"2016-07-15","location":"New York, NY, USA"},"date_published":"2016-01-01T00:00:00Z","main_file_link":[{"url":"https://arxiv.org/abs/1604.05090","open_access":"1"}],"arxiv":1,"publication_status":"published","year":"2016","quality_controlled":"1","volume":"2016-January","corr_author":"1","oa":1,"day":"01","publisher":"AAAI Press","department":[{"_id":"KrCh"}],"month":"01","external_id":{"arxiv":["1604.05090"]},"page":"172 - 179","citation":{"ista":"Chatterjee K, Ibsen-Jensen R, Tkadlec J. 2016. Robust draws in balanced knockout tournaments. IJCAI: International Joint Conference on Artificial Intelligence vol. 2016–January, 172–179.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and J. Tkadlec, “Robust draws in balanced knockout tournaments,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA, 2016, vol. 2016–January, pp. 172–179.","short":"K. Chatterjee, R. Ibsen-Jensen, J. Tkadlec, in:, AAAI Press, 2016, pp. 172–179.","ama":"Chatterjee K, Ibsen-Jensen R, Tkadlec J. Robust draws in balanced knockout tournaments. In: Vol 2016-January. AAAI Press; 2016:172-179.","mla":"Chatterjee, Krishnendu, et al. Robust Draws in Balanced Knockout Tournaments. Vol. 2016–January, AAAI Press, 2016, pp. 172–79.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Tkadlec, J. (2016). Robust draws in balanced knockout tournaments (Vol. 2016–January, pp. 172–179). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA: AAAI Press.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Josef Tkadlec. “Robust Draws in Balanced Knockout Tournaments,” 2016–January:172–79. AAAI Press, 2016."},"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"related_material":{"link":[{"url":"https://www.ijcai.org/proceedings/2016","relation":"table_of_contents"}]},"date_updated":"2025-04-22T13:42:22Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec","first_name":"Josef"}],"date_created":"2018-12-11T11:50:35Z","title":"Robust draws in balanced knockout tournaments","_id":"1182","abstract":[{"text":"Balanced knockout tournaments are ubiquitous in sports competitions and are also used in decisionmaking and elections. The traditional computational question, that asks to compute a draw (optimal draw) that maximizes the winning probability for a distinguished player, has received a lot of attention. Previous works consider the problem where the pairwise winning probabilities are known precisely, while we study how robust is the winning probability with respect to small errors in the pairwise winning probabilities. First, we present several illuminating examples to establish: (a) there exist deterministic tournaments (where the pairwise winning probabilities are 0 or 1) where one optimal draw is much more robust than the other; and (b) in general, there exist tournaments with slightly suboptimal draws that are more robust than all the optimal draws. The above examples motivate the study of the computational problem of robust draws that guarantee a specified winning probability. Second, we present a polynomial-time algorithm for approximating the robustness of a draw for sufficiently small errors in pairwise winning probabilities, and obtain that the stated computational problem is NP-complete. We also show that two natural cases of deterministic tournaments where the optimal draw could be computed in polynomial time also admit polynomial-time algorithms to compute robust optimal draws.","lang":"eng"}],"oa_version":"Preprint","type":"conference","publist_id":"6171","language":[{"iso":"eng"}],"scopus_import":"1","ec_funded":1},{"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-015-6"]},"scopus_import":"1","publication":"24th Annual European Symposium on Algorithms","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We present a deterministic incremental algorithm for exactly maintaining the size of a minimum cut with ~O(1) amortized time per edge insertion and O(1) query time. This result partially answers an open question posed by Thorup [Combinatorica 2007]. It also stays in sharp contrast to a polynomial conditional lower-bound for the fully-dynamic weighted minimum cut problem. Our algorithm is obtained by combining a recent sparsification technique of Kawarabayashi and Thorup [STOC 2015] and an exact incremental algorithm of Henzinger [J. of Algorithm 1997].\r\n\r\nWe also study space-efficient incremental algorithms for the minimum cut problem. Concretely, we show that there exists an O(n log n/epsilon^2) space Monte-Carlo algorithm that can process a stream of edge insertions starting from an empty graph, and with high probability, the algorithm maintains a (1+epsilon)-approximation to the minimum cut. The algorithm has ~O(1) amortized update-time and constant query-time."}],"extern":"1","oa_version":"Published Version","type":"conference","status":"public","author":[{"full_name":"Goranci, Gramoz","last_name":"Goranci","first_name":"Gramoz"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Thorup, Mikkel","last_name":"Thorup","first_name":"Mikkel"}],"date_created":"2022-08-12T10:58:32Z","_id":"11834","title":"Incremental exact min-cut in poly-logarithmic amortized update time","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-11-06T11:58:55Z","citation":{"mla":"Goranci, Gramoz, et al. “Incremental Exact Min-Cut in Poly-Logarithmic Amortized Update Time.” 24th Annual European Symposium on Algorithms, vol. 57, 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPICS.ESA.2016.46.","ama":"Goranci G, Henzinger M, Thorup M. Incremental exact min-cut in poly-logarithmic amortized update time. In: 24th Annual European Symposium on Algorithms. Vol 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPICS.ESA.2016.46","ieee":"G. Goranci, M. Henzinger, and M. Thorup, “Incremental exact min-cut in poly-logarithmic amortized update time,” in 24th Annual European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.","short":"G. Goranci, M. Henzinger, M. Thorup, in:, 24th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ista":"Goranci G, Henzinger M, Thorup M. 2016. Incremental exact min-cut in poly-logarithmic amortized update time. 24th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 57, 46.","chicago":"Goranci, Gramoz, Monika Henzinger, and Mikkel Thorup. “Incremental Exact Min-Cut in Poly-Logarithmic Amortized Update Time.” In 24th Annual European Symposium on Algorithms, Vol. 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPICS.ESA.2016.46.","apa":"Goranci, G., Henzinger, M., & Thorup, M. (2016). Incremental exact min-cut in poly-logarithmic amortized update time. In 24th Annual European Symposium on Algorithms (Vol. 57). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2016.46"},"month":"08","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","external_id":{"arxiv":["1611.06500"]},"oa":1,"day":"18","doi":"10.4230/LIPICS.ESA.2016.46","volume":57,"article_number":"46","intvolume":" 57","quality_controlled":"1","year":"2016","publication_status":"published","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ESA.2016.46"}],"fulldoi":"https://doi.org/10.4230/LIPICS.ESA.2016.46","article_processing_charge":"No","alternative_title":["LIPIcs"],"date_published":"2016-08-18T00:00:00Z","conference":{"location":"Aarhus, Denmark","start_date":"2016-08-22","end_date":"2016-08-24","name":"ESA: Annual European Symposium on Algorithms"}},{"fulldoi":"https://doi.org/10.4230/LIPICS.ESA.2016.48","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ESA.2016.48"}],"date_published":"2016-08-18T00:00:00Z","alternative_title":["LIPIcs"],"conference":{"start_date":"2016-08-22","end_date":"2016-08-24","name":"ESA: Annual European Symposium on Algorithms","location":"Aarhus, Denmark"},"article_processing_charge":"No","year":"2016","quality_controlled":"1","publication_status":"published","intvolume":" 57","volume":57,"doi":"10.4230/LIPICS.ESA.2016.48","article_number":"48","external_id":{"arxiv":["1611.05248"]},"month":"08","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"18","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-11-06T11:59:06Z","citation":{"apa":"Henzinger, M., & Neumann, S. (2016). Incremental and fully dynamic subgraph connectivity for emergency planning. In 24th Annual European Symposium on Algorithms (Vol. 57). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2016.48","chicago":"Henzinger, Monika, and Stefan Neumann. “Incremental and Fully Dynamic Subgraph Connectivity for Emergency Planning.” In 24th Annual European Symposium on Algorithms, Vol. 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPICS.ESA.2016.48.","ista":"Henzinger M, Neumann S. 2016. Incremental and fully dynamic subgraph connectivity for emergency planning. 24th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 57, 48.","ieee":"M. Henzinger and S. Neumann, “Incremental and fully dynamic subgraph connectivity for emergency planning,” in 24th Annual European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.","short":"M. Henzinger, S. Neumann, in:, 24th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ama":"Henzinger M, Neumann S. Incremental and fully dynamic subgraph connectivity for emergency planning. In: 24th Annual European Symposium on Algorithms. Vol 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPICS.ESA.2016.48","mla":"Henzinger, Monika, and Stefan Neumann. “Incremental and Fully Dynamic Subgraph Connectivity for Emergency Planning.” 24th Annual European Symposium on Algorithms, vol. 57, 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPICS.ESA.2016.48."},"type":"conference","oa_version":"Published Version","abstract":[{"lang":"eng","text":"During the last 10 years it has become popular to study dynamic graph problems in a emergency planning or sensitivity setting: Instead of considering the general fully dynamic problem, we only have to process a single batch update of size d; after the update we have to answer queries.\r\n\r\nIn this paper, we consider the dynamic subgraph connectivity problem with sensitivity d: We are given a graph of which some vertices are activated and some are deactivated. After that we get a single update in which the states of up to $d$ vertices are changed. Then we get a sequence of connectivity queries in the subgraph of activated vertices.\r\n\r\nWe present the first fully dynamic algorithm for this problem which has an update and query time only slightly worse than the best decremental algorithm. In addition, we present the first incremental algorithm which is tight with respect to the best known conditional lower bound; moreover, the algorithm is simple and we believe it is implementable and efficient in practice."}],"extern":"1","_id":"11835","title":"Incremental and fully dynamic subgraph connectivity for emergency planning","date_created":"2022-08-12T11:05:41Z","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Neumann, Stefan","first_name":"Stefan","last_name":"Neumann"}],"status":"public","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-015-6"]},"publication":"24th Annual European Symposium on Algorithms","scopus_import":"1"},{"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-013-2"]},"publication":"43rd International Colloquium on Automata, Languages, and Programming","scopus_import":"1","language":[{"iso":"eng"}],"oa_version":"Published Version","type":"conference","abstract":[{"text":"Given a graph where vertices are partitioned into k terminals and non-terminals, the goal is to compress the graph (i.e., reduce the number of non-terminals) using minor operations while preserving terminal distances approximately. The distortion of a compressed graph is the maximum multiplicative blow-up of distances between all pairs of terminals. We study the trade-off between the number of non-terminals and the distortion. This problem generalizes the Steiner Point Removal (SPR) problem, in which all non-terminals must be removed.\r\n\r\nWe introduce a novel black-box reduction to convert any lower bound on distortion for the SPR problem into a super-linear lower bound on the number of non-terminals, with the same distortion, for our problem. This allows us to show that there exist graphs such that every minor with distortion less than 2 / 2.5 / 3 must have Omega(k^2) / Omega(k^{5/4}) / Omega(k^{6/5}) non-terminals, plus more trade-offs in between. The black-box reduction has an interesting consequence: if the tight lower bound on distortion for the SPR problem is super-constant, then allowing any O(k) non-terminals will not help improving the lower bound to a constant.\r\n\r\nWe also build on the existing results on spanners, distance oracles and connected 0-extensions to show a number of upper bounds for general graphs, planar graphs, graphs that exclude a fixed minor and bounded treewidth graphs. Among others, we show that any graph admits a minor with O(log k) distortion and O(k^2) non-terminals, and any planar graph admits a minor with\r\n1 + epsilon distortion and ~O((k/epsilon)^2) non-terminals.","lang":"eng"}],"extern":"1","_id":"11836","title":"Graph minors for preserving terminal distances approximately - lower and upper bounds","date_created":"2022-08-12T11:16:01Z","status":"public","author":[{"first_name":"Yun Kuen","last_name":"Cheung","full_name":"Cheung, Yun Kuen"},{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-11-06T11:58:15Z","citation":{"chicago":"Cheung, Yun Kuen, Gramoz Goranci, and Monika Henzinger. “Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.” In 43rd International Colloquium on Automata, Languages, and Programming, Vol. 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPICS.ICALP.2016.131.","apa":"Cheung, Y. K., Goranci, G., & Henzinger, M. (2016). Graph minors for preserving terminal distances approximately - lower and upper bounds. In 43rd International Colloquium on Automata, Languages, and Programming (Vol. 55). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2016.131","mla":"Cheung, Yun Kuen, et al. “Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.” 43rd International Colloquium on Automata, Languages, and Programming, vol. 55, 131, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPICS.ICALP.2016.131.","ama":"Cheung YK, Goranci G, Henzinger M. Graph minors for preserving terminal distances approximately - lower and upper bounds. In: 43rd International Colloquium on Automata, Languages, and Programming. Vol 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPICS.ICALP.2016.131","ista":"Cheung YK, Goranci G, Henzinger M. 2016. Graph minors for preserving terminal distances approximately - lower and upper bounds. 43rd International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 55, 131.","ieee":"Y. K. Cheung, G. Goranci, and M. Henzinger, “Graph minors for preserving terminal distances approximately - lower and upper bounds,” in 43rd International Colloquium on Automata, Languages, and Programming, Rome, Italy, 2016, vol. 55.","short":"Y.K. Cheung, G. Goranci, M. Henzinger, in:, 43rd International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016."},"external_id":{"arxiv":["1604.08342"]},"month":"08","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"23","oa":1,"volume":55,"doi":"10.4230/LIPICS.ICALP.2016.131","article_number":"131","quality_controlled":"1","year":"2016","publication_status":"published","intvolume":" 55","fulldoi":"https://doi.org/10.4230/LIPICS.ICALP.2016.131","arxiv":1,"main_file_link":[{"url":"https://doi.org/10.4230/LIPICS.ICALP.2016.131","open_access":"1"}],"date_published":"2016-08-23T00:00:00Z","alternative_title":["LIPIcs"],"conference":{"location":"Rome, Italy","end_date":"2016-07-15","start_date":"2016-07-12","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"article_processing_charge":"No"},{"volume":6,"doi":"10.1002/ece3.2474","file":[{"access_level":"open_access","relation":"main_file","creator":"system","date_created":"2018-12-12T10:14:12Z","checksum":"789026eb9e1be2a0da08376f29f569cf","file_name":"IST-2017-736-v1+1_Metzler_et_al-2016-Ecology_and_Evolution.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:44:37Z","file_size":328414,"file_id":"5062"}],"isi":1,"external_id":{"isi":["000392063300022"]},"publisher":"Wiley-Blackwell","month":"12","department":[{"_id":"SyCr"}],"day":"01","oa":1,"pubrep_id":"736","fulldoi":"https://doi.org/10.1002/ece3.2474","has_accepted_license":"1","date_published":"2016-12-01T00:00:00Z","file_date_updated":"2020-07-14T12:44:37Z","article_processing_charge":"No","publication_status":"published","quality_controlled":"1","year":"2016","intvolume":" 6","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["576","592"],"publist_id":"6169","language":[{"iso":"eng"}],"acknowledgement":"German Science Foundation. Grant Number: SCHR 1135/2-1. We thank M. Adam for handling part of the setups and J. Zoellner for behavioral observations.","publication":"Ecology and Evolution","scopus_import":"1","issue":"24","date_updated":"2025-09-22T09:47:16Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"8903 - 8906","citation":{"ieee":"S. Metzler, J. Heinze, and A. Schrempf, “Mating and longevity in ant males,” Ecology and Evolution, vol. 6, no. 24. Wiley-Blackwell, pp. 8903–8906, 2016.","ista":"Metzler S, Heinze J, Schrempf A. 2016. Mating and longevity in ant males. Ecology and Evolution. 6(24), 8903–8906.","short":"S. Metzler, J. Heinze, A. Schrempf, Ecology and Evolution 6 (2016) 8903–8906.","mla":"Metzler, Sina, et al. “Mating and Longevity in Ant Males.” Ecology and Evolution, vol. 6, no. 24, Wiley-Blackwell, 2016, pp. 8903–06, doi:10.1002/ece3.2474.","ama":"Metzler S, Heinze J, Schrempf A. Mating and longevity in ant males. Ecology and Evolution. 2016;6(24):8903-8906. doi:10.1002/ece3.2474","apa":"Metzler, S., Heinze, J., & Schrempf, A. (2016). Mating and longevity in ant males. Ecology and Evolution. Wiley-Blackwell. https://doi.org/10.1002/ece3.2474","chicago":"Metzler, Sina, Jürgen Heinze, and Alexandra Schrempf. “Mating and Longevity in Ant Males.” Ecology and Evolution. Wiley-Blackwell, 2016. https://doi.org/10.1002/ece3.2474."},"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"Across multicellular organisms, the costs of reproduction and self-maintenance result in a life history trade-off between fecundity and longevity. Queens of perennial social Hymenoptera are both highly fertile and long-lived, and thus, this fundamental trade-off is lacking. Whether social insect males similarly evade the fecundity/longevity trade-off remains largely unstudied. Wingless males of the ant genus Cardiocondyla stay in their natal colonies throughout their relatively long lives and mate with multiple female sexuals. Here, we show that Cardiocondyla obscurior males that were allowed to mate with large numbers of female sexuals had a shortened life span compared to males that mated at a low frequency or virgin males. Although frequent mating negatively affects longevity, males clearly benefit from a “live fast, die young strategy” by inseminating as many female sexuals as possible at a cost to their own survival."}],"title":"Mating and longevity in ant males","_id":"1184","status":"public","date_created":"2018-12-11T11:50:36Z","author":[{"id":"48204546-F248-11E8-B48F-1D18A9856A87","first_name":"Sina","last_name":"Metzler","full_name":"Metzler, Sina","orcid":"0000-0002-9547-2494"},{"first_name":"Jürgen","last_name":"Heinze","full_name":"Heinze, Jürgen"},{"full_name":"Schrempf, Alexandra","last_name":"Schrempf","first_name":"Alexandra"}]}]