--- _id: '11615' abstract: - lang: eng text: The recently published Kepler mission Data Release 25 (DR25) reported on ∼197 000 targets observed during the mission. Despite this, no wide search for red giants showing solar-like oscillations have been made across all stars observed in Kepler’s long-cadence mode. In this work, we perform this task using custom apertures on the Kepler pixel files and detect oscillations in 21 914 stars, representing the largest sample of solar-like oscillating stars to date. We measure their frequency at maximum power, νmax, down to νmax≃4μHz and obtain log (g) estimates with a typical uncertainty below 0.05 dex, which is superior to typical measurements from spectroscopy. Additionally, the νmax distribution of our detections show good agreement with results from a simulated model of the Milky Way, with a ratio of observed to predicted stars of 0.992 for stars with 10<νmax<270μHz. Among our red giant detections, we find 909 to be dwarf/subgiant stars whose flux signal is polluted by a neighbouring giant as a result of using larger photometric apertures than those used by the NASA Kepler science processing pipeline. We further find that only 293 of the polluting giants are known Kepler targets. The remainder comprises over 600 newly identified oscillating red giants, with many expected to belong to the Galactic halo, serendipitously falling within the Kepler pixel files of targeted stars. acknowledgement: Funding for this Discovery mission is provided by NASA’s Science mission Directorate. We thank the entire Kepler team without whom this investigation would not be possible. DS is the recipient of an Australian Research Council Future Fellowship (project number FT1400147). RAG acknowledges the support from CNES. SM acknowledges support from NASA grant NNX15AF13G, NSF grant AST-1411685, and the Ramon y Cajal fellowship number RYC-2015-17697. ILC acknowledges scholarship support from the University of Sydney. We would like to thank Nicholas Barbara and Timothy Bedding for providing us with a list of variable stars that helped to validate a number of detections in this study. We also thank the group at the University of Sydney for fruitful discussions. Finally, we gratefully acknowledge the support of NVIDIA Corporation with the donation of the Titan Xp GPU used for this research. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Marc full_name: Hon, Marc last_name: Hon - first_name: Dennis full_name: Stello, Dennis last_name: Stello - first_name: Rafael A full_name: García, Rafael A last_name: García - first_name: Savita full_name: Mathur, Savita last_name: Mathur - first_name: Sanjib full_name: Sharma, Sanjib last_name: Sharma - first_name: Isabel L full_name: Colman, Isabel L last_name: Colman - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 citation: ama: Hon M, Stello D, García RA, et al. A search for red giant solar-like oscillations in all Kepler data. Monthly Notices of the Royal Astronomical Society. 2019;485(4):5616-5630. doi:10.1093/mnras/stz622 apa: Hon, M., Stello, D., García, R. A., Mathur, S., Sharma, S., Colman, I. L., & Bugnet, L. A. (2019). A search for red giant solar-like oscillations in all Kepler data. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stz622 chicago: Hon, Marc, Dennis Stello, Rafael A García, Savita Mathur, Sanjib Sharma, Isabel L Colman, and Lisa Annabelle Bugnet. “A Search for Red Giant Solar-like Oscillations in All Kepler Data.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2019. https://doi.org/10.1093/mnras/stz622. ieee: M. Hon et al., “A search for red giant solar-like oscillations in all Kepler data,” Monthly Notices of the Royal Astronomical Society, vol. 485, no. 4. Oxford University Press, pp. 5616–5630, 2019. ista: Hon M, Stello D, García RA, Mathur S, Sharma S, Colman IL, Bugnet LA. 2019. A search for red giant solar-like oscillations in all Kepler data. Monthly Notices of the Royal Astronomical Society. 485(4), 5616–5630. mla: Hon, Marc, et al. “A Search for Red Giant Solar-like Oscillations in All Kepler Data.” Monthly Notices of the Royal Astronomical Society, vol. 485, no. 4, Oxford University Press, 2019, pp. 5616–30, doi:10.1093/mnras/stz622. short: M. Hon, D. Stello, R.A. García, S. Mathur, S. Sharma, I.L. Colman, L.A. Bugnet, Monthly Notices of the Royal Astronomical Society 485 (2019) 5616–5630. date_created: 2022-07-18T14:26:03Z date_published: 2019-06-01T00:00:00Z date_updated: 2022-08-22T07:35:19Z day: '01' doi: 10.1093/mnras/stz622 extern: '1' external_id: arxiv: - '1903.00115' intvolume: ' 485' issue: '4' keyword: - Space and Planetary Science - Astronomy and Astrophysics - asteroseismology - 'methods: data analysis' - 'techniques: image processing' - 'stars: oscillations' - 'stars: statistics' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1903.00115 month: '06' oa: 1 oa_version: Preprint page: 5616-5630 publication: Monthly Notices of the Royal Astronomical Society publication_identifier: eissn: - 1365-2966 issn: - 0035-8711 publication_status: published publisher: Oxford University Press quality_controlled: '1' scopus_import: '1' status: public title: A search for red giant solar-like oscillations in all Kepler data type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 485 year: '2019' ... --- _id: '11616' abstract: - lang: eng text: We present the discovery of HD 221416 b, the first transiting planet identified by the Transiting Exoplanet Survey Satellite (TESS) for which asteroseismology of the host star is possible. HD 221416 b (HIP 116158, TOI-197) is a bright (V = 8.2 mag), spectroscopically classified subgiant that oscillates with an average frequency of about 430 μHz and displays a clear signature of mixed modes. The oscillation amplitude confirms that the redder TESS bandpass compared to Kepler has a small effect on the oscillations, supporting the expected yield of thousands of solar-like oscillators with TESS 2 minute cadence observations. Asteroseismic modeling yields a robust determination of the host star radius (R⋆ = 2.943 ± 0.064 R⊙), mass (M⋆ = 1.212 ± 0.074 M⊙), and age (4.9 ± 1.1 Gyr), and demonstrates that it has just started ascending the red-giant branch. Combining asteroseismology with transit modeling and radial-velocity observations, we show that the planet is a "hot Saturn" (Rp = 9.17 ± 0.33 R⊕) with an orbital period of ∼14.3 days, irradiance of F = 343 ± 24 F⊕, and moderate mass (Mp = 60.5 ± 5.7 M⊕) and density (ρp = 0.431 ± 0.062 g cm−3). The properties of HD 221416 b show that the host-star metallicity–planet mass correlation found in sub-Saturns (4–8 R⊕) does not extend to larger radii, indicating that planets in the transition between sub-Saturns and Jupiters follow a relatively narrow range of densities. With a density measured to ∼15%, HD 221416 b is one of the best characterized Saturn-size planets to date, augmenting the small number of known transiting planets around evolved stars and demonstrating the power of TESS to characterize exoplanets and their host stars using asteroseismology. acknowledgement: "The authors wish to recognize and acknowledge the very significant cultural role and reverence that the summit of Maunakea has always had within the indigenous Hawai'ian community. We are most fortunate to have the opportunity to conduct observations from this mountain. We thank Andrei Tokovinin for helpful information on the Speckle observations obtained with SOAR. D.H. acknowledges support by the National Aeronautics and Space Administration through the TESS Guest Investigator Program (80NSSC18K1585) and by the National Science Foundation (AST-1717000). A.C. acknowledges support by the National Science Foundation under the Graduate Research Fellowship Program. W.J.C., W.H.B., A.M., O.J.H., and G.R.D. acknowledge support from the Science and Technology Facilities Council and UK Space Agency. H.K. and F.G. acknowledge support from the European Social Fund via the Lithuanian Science Council grant No. 09.3.3-LMT-K-712-01-0103. Funding for the Stellar Astrophysics Centre is provided by The Danish National Research Foundation (grant DNRF106). A.J. acknowledges support from FONDECYT project 1171208, CONICYT project BASAL AFB-170002, and by the Ministry for the Economy, Development, and Tourism's Programa Iniciativa Científica Milenio through grant IC 120009, awarded to the Millennium Institute of Astrophysics (MAS). R.B. acknowledges support from FONDECYT Post-doctoral Fellowship Project 3180246, and from the Millennium Institute of Astrophysics (MAS). A.M.S. is supported by grants ESP2017-82674-R (MINECO) and SGR2017-1131 (AGAUR). R.A.G. and L.B. acknowledge the support of the PLATO grant from the CNES. The research leading to the presented results has received funding from the European Research Council under the European Community's Seventh Framework Programme (FP72007-2013)ERC grant agreement No. 338251 (StellarAges). S.M. acknowledges support from the European Research Council through the SPIRE grant 647383. This work was also supported by FCT (Portugal) through national funds and by FEDER through COMPETE2020 by these grants: UID/FIS/04434/2013 and POCI-01-0145-FEDER-007672, PTDC/FIS-AST/30389/2017, and POCI-01-0145-FEDER-030389. T.L.C. acknowledges support from the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 792848 (PULSATION). E.C. is funded by the European Union's Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No. 664931. V.S.A. acknowledges support from the Independent Research Fund Denmark (Research grant 7027-00096B). D.S. acknowledges support from the Australian Research Council. S.B. acknowledges NASA grant NNX16AI09G and NSF grant AST-1514676. T.R.W. acknowledges support from the Australian Research Council through grant DP150100250. A.M. acknowledges support from the ERC Consolidator Grant funding scheme (project ASTEROCHRONOMETRY, G.A. n. 772293). S.M. acknowledges support from the Ramon y Cajal fellowship number RYC-2015-17697. M.S.L. is supported by the Carlsberg Foundation (grant agreement No. CF17-0760). A.M. and P.R. acknowledge support from the HBCSE-NIUS programme. J.K.T. and J.T. acknowledge that support for this work was provided by NASA through Hubble Fellowship grants HST-HF2-51399.001 and HST-HF2-51424.001 awarded by the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., for NASA, under contract NAS5-26555. T.S.R. acknowledges financial support from Premiale 2015 MITiC (PI B. Garilli). This project has been supported by the NKFIH K-115709 grant and the Lendület Program of the Hungarian Academy of Sciences, project No. LP2018-7/2018.\r\n\r\nBased on observations made with the Hertzsprung SONG telescope operated on the Spanish Observatorio del Teide on the island of Tenerife by the Aarhus and Copenhagen Universities and by the Instituto de Astrofísica de Canarias. Funding for the TESS mission is provided by NASA's Science Mission directorate. We acknowledge the use of public TESS Alert data from pipelines at the TESS Science Office and at the TESS Science Processing Operations Center. This research has made use of the Exoplanet Follow-up Observation Program website, which is operated by the California Institute of Technology, under contract with the National Aeronautics and Space Administration under the Exoplanet Exploration Program. This paper includes data collected by the TESS mission, which are publicly available from the Mikulski Archive for Space Telescopes (MAST).\r\n\r\nSoftware: Astropy (Astropy Collaboration et al. 2018), Matplotlib (Hunter 2007), DIAMONDS (Corsaro & De Ridder 2014), isoclassify (Huber et al. 2017), EXOFASTv2 (Eastman 2017), ktransit (Barclay 2018)." article_number: '245' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Daniel full_name: Huber, Daniel last_name: Huber - first_name: William J. full_name: Chaplin, William J. last_name: Chaplin - first_name: Ashley full_name: Chontos, Ashley last_name: Chontos - first_name: Hans full_name: Kjeldsen, Hans last_name: Kjeldsen - first_name: Jørgen full_name: Christensen-Dalsgaard, Jørgen last_name: Christensen-Dalsgaard - first_name: Timothy R. full_name: Bedding, Timothy R. last_name: Bedding - first_name: Warrick full_name: Ball, Warrick last_name: Ball - first_name: Rafael full_name: Brahm, Rafael last_name: Brahm - first_name: Nestor full_name: Espinoza, Nestor last_name: Espinoza - first_name: Thomas full_name: Henning, Thomas last_name: Henning - first_name: Andrés full_name: Jordán, Andrés last_name: Jordán - first_name: Paula full_name: Sarkis, Paula last_name: Sarkis - first_name: Emil full_name: Knudstrup, Emil last_name: Knudstrup - first_name: Simon full_name: Albrecht, Simon last_name: Albrecht - first_name: Frank full_name: Grundahl, Frank last_name: Grundahl - first_name: Mads Fredslund full_name: Andersen, Mads Fredslund last_name: Andersen - first_name: Pere L. full_name: Pallé, Pere L. last_name: Pallé - first_name: Ian full_name: Crossfield, Ian last_name: Crossfield - first_name: Benjamin full_name: Fulton, Benjamin last_name: Fulton - first_name: Andrew W. full_name: Howard, Andrew W. last_name: Howard - first_name: Howard T. full_name: Isaacson, Howard T. last_name: Isaacson - first_name: Lauren M. full_name: Weiss, Lauren M. last_name: Weiss - first_name: Rasmus full_name: Handberg, Rasmus last_name: Handberg - first_name: Mikkel N. full_name: Lund, Mikkel N. last_name: Lund - first_name: Aldo M. full_name: Serenelli, Aldo M. last_name: Serenelli - first_name: Jakob full_name: Rørsted Mosumgaard, Jakob last_name: Rørsted Mosumgaard - first_name: Amalie full_name: Stokholm, Amalie last_name: Stokholm - first_name: Allyson full_name: Bieryla, Allyson last_name: Bieryla - first_name: Lars A. full_name: Buchhave, Lars A. last_name: Buchhave - first_name: David W. full_name: Latham, David W. last_name: Latham - first_name: Samuel N. full_name: Quinn, Samuel N. last_name: Quinn - first_name: Eric full_name: Gaidos, Eric last_name: Gaidos - first_name: Teruyuki full_name: Hirano, Teruyuki last_name: Hirano - first_name: George R. full_name: Ricker, George R. last_name: Ricker - first_name: Roland K. full_name: Vanderspek, Roland K. last_name: Vanderspek - first_name: Sara full_name: Seager, Sara last_name: Seager - first_name: Jon M. full_name: Jenkins, Jon M. last_name: Jenkins - first_name: Joshua N. full_name: Winn, Joshua N. last_name: Winn - first_name: H. M. full_name: Antia, H. M. last_name: Antia - first_name: Thierry full_name: Appourchaux, Thierry last_name: Appourchaux - first_name: Sarbani full_name: Basu, Sarbani last_name: Basu - first_name: Keaton J. full_name: Bell, Keaton J. last_name: Bell - first_name: Othman full_name: Benomar, Othman last_name: Benomar - first_name: Alfio full_name: Bonanno, Alfio last_name: Bonanno - first_name: Derek L. full_name: Buzasi, Derek L. last_name: Buzasi - first_name: Tiago L. full_name: Campante, Tiago L. last_name: Campante - first_name: Z. full_name: Çelik Orhan, Z. last_name: Çelik Orhan - first_name: Enrico full_name: Corsaro, Enrico last_name: Corsaro - first_name: Margarida S. full_name: Cunha, Margarida S. last_name: Cunha - first_name: Guy R. full_name: Davies, Guy R. last_name: Davies - first_name: Sebastien full_name: Deheuvels, Sebastien last_name: Deheuvels - first_name: Samuel K. full_name: Grunblatt, Samuel K. last_name: Grunblatt - first_name: Amir full_name: Hasanzadeh, Amir last_name: Hasanzadeh - first_name: Maria Pia full_name: Di Mauro, Maria Pia last_name: Di Mauro - first_name: Rafael full_name: A. García, Rafael last_name: A. García - first_name: Patrick full_name: Gaulme, Patrick last_name: Gaulme - first_name: Léo full_name: Girardi, Léo last_name: Girardi - first_name: Joyce A. full_name: Guzik, Joyce A. last_name: Guzik - first_name: Marc full_name: Hon, Marc last_name: Hon - first_name: Chen full_name: Jiang, Chen last_name: Jiang - first_name: Thomas full_name: Kallinger, Thomas last_name: Kallinger - first_name: Steven D. full_name: Kawaler, Steven D. last_name: Kawaler - first_name: James S. full_name: Kuszlewicz, James S. last_name: Kuszlewicz - first_name: Yveline full_name: Lebreton, Yveline last_name: Lebreton - first_name: Tanda full_name: Li, Tanda last_name: Li - first_name: Miles full_name: Lucas, Miles last_name: Lucas - first_name: Mia S. full_name: Lundkvist, Mia S. last_name: Lundkvist - first_name: Andrew W. full_name: Mann, Andrew W. last_name: Mann - first_name: Stéphane full_name: Mathis, Stéphane last_name: Mathis - first_name: Savita full_name: Mathur, Savita last_name: Mathur - first_name: Anwesh full_name: Mazumdar, Anwesh last_name: Mazumdar - first_name: Travis S. full_name: Metcalfe, Travis S. last_name: Metcalfe - first_name: Andrea full_name: Miglio, Andrea last_name: Miglio - first_name: Mário J. P. full_name: F. G. Monteiro, Mário J. P. last_name: F. G. Monteiro - first_name: Benoit full_name: Mosser, Benoit last_name: Mosser - first_name: Anthony full_name: Noll, Anthony last_name: Noll - first_name: Benard full_name: Nsamba, Benard last_name: Nsamba - first_name: Jia Mian full_name: Joel Ong, Jia Mian last_name: Joel Ong - first_name: S. full_name: Örtel, S. last_name: Örtel - first_name: Filipe full_name: Pereira, Filipe last_name: Pereira - first_name: Pritesh full_name: Ranadive, Pritesh last_name: Ranadive - first_name: Clara full_name: Régulo, Clara last_name: Régulo - first_name: Thaíse S. full_name: Rodrigues, Thaíse S. last_name: Rodrigues - first_name: Ian W. full_name: Roxburgh, Ian W. last_name: Roxburgh - first_name: Victor Silva full_name: Aguirre, Victor Silva last_name: Aguirre - first_name: Barry full_name: Smalley, Barry last_name: Smalley - first_name: Mathew full_name: Schofield, Mathew last_name: Schofield - first_name: Sérgio G. full_name: Sousa, Sérgio G. last_name: Sousa - first_name: Keivan G. full_name: Stassun, Keivan G. last_name: Stassun - first_name: Dennis full_name: Stello, Dennis last_name: Stello - first_name: Jamie full_name: Tayar, Jamie last_name: Tayar - first_name: Timothy R. full_name: White, Timothy R. last_name: White - first_name: Kuldeep full_name: Verma, Kuldeep last_name: Verma - first_name: Mathieu full_name: Vrard, Mathieu last_name: Vrard - first_name: M. full_name: Yıldız, M. last_name: Yıldız - first_name: David full_name: Baker, David last_name: Baker - first_name: Michaël full_name: Bazot, Michaël last_name: Bazot - first_name: Charles full_name: Beichmann, Charles last_name: Beichmann - first_name: Christoph full_name: Bergmann, Christoph last_name: Bergmann - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: Bryson full_name: Cale, Bryson last_name: Cale - first_name: Roberto full_name: Carlino, Roberto last_name: Carlino - first_name: Scott M. full_name: Cartwright, Scott M. last_name: Cartwright - first_name: Jessie L. full_name: Christiansen, Jessie L. last_name: Christiansen - first_name: David R. full_name: Ciardi, David R. last_name: Ciardi - first_name: Orlagh full_name: Creevey, Orlagh last_name: Creevey - first_name: Jason A. full_name: Dittmann, Jason A. last_name: Dittmann - first_name: Jose-Dias Do full_name: Nascimento, Jose-Dias Do last_name: Nascimento - first_name: Vincent Van full_name: Eylen, Vincent Van last_name: Eylen - first_name: Gabor full_name: Fürész, Gabor last_name: Fürész - first_name: Jonathan full_name: Gagné, Jonathan last_name: Gagné - first_name: Peter full_name: Gao, Peter last_name: Gao - first_name: Kosmas full_name: Gazeas, Kosmas last_name: Gazeas - first_name: Frank full_name: Giddens, Frank last_name: Giddens - first_name: Oliver J. full_name: Hall, Oliver J. last_name: Hall - first_name: Saskia full_name: Hekker, Saskia last_name: Hekker - first_name: Michael J. full_name: Ireland, Michael J. last_name: Ireland - first_name: Natasha full_name: Latouf, Natasha last_name: Latouf - first_name: Danny full_name: LeBrun, Danny last_name: LeBrun - first_name: Alan M. full_name: Levine, Alan M. last_name: Levine - first_name: William full_name: Matzko, William last_name: Matzko - first_name: Eva full_name: Natinsky, Eva last_name: Natinsky - first_name: Emma full_name: Page, Emma last_name: Page - first_name: Peter full_name: Plavchan, Peter last_name: Plavchan - first_name: Masoud full_name: Mansouri-Samani, Masoud last_name: Mansouri-Samani - first_name: Sean full_name: McCauliff, Sean last_name: McCauliff - first_name: Susan E. full_name: Mullally, Susan E. last_name: Mullally - first_name: Brendan full_name: Orenstein, Brendan last_name: Orenstein - first_name: Aylin Garcia full_name: Soto, Aylin Garcia last_name: Soto - first_name: Martin full_name: Paegert, Martin last_name: Paegert - first_name: Jennifer L. full_name: van Saders, Jennifer L. last_name: van Saders - first_name: Chloe full_name: Schnaible, Chloe last_name: Schnaible - first_name: David R. full_name: Soderblom, David R. last_name: Soderblom - first_name: Róbert full_name: Szabó, Róbert last_name: Szabó - first_name: Angelle full_name: Tanner, Angelle last_name: Tanner - first_name: C. G. full_name: Tinney, C. G. last_name: Tinney - first_name: Johanna full_name: Teske, Johanna last_name: Teske - first_name: Alexandra full_name: Thomas, Alexandra last_name: Thomas - first_name: Regner full_name: Trampedach, Regner last_name: Trampedach - first_name: Duncan full_name: Wright, Duncan last_name: Wright - first_name: Thomas T. full_name: Yuan, Thomas T. last_name: Yuan - first_name: Farzaneh full_name: Zohrabi, Farzaneh last_name: Zohrabi citation: ama: Huber D, Chaplin WJ, Chontos A, et al. A hot Saturn orbiting an oscillating late subgiant discovered by TESS. The Astronomical Journal. 2019;157(6). doi:10.3847/1538-3881/ab1488 apa: Huber, D., Chaplin, W. J., Chontos, A., Kjeldsen, H., Christensen-Dalsgaard, J., Bedding, T. R., … Zohrabi, F. (2019). A hot Saturn orbiting an oscillating late subgiant discovered by TESS. The Astronomical Journal. IOP Publishing. https://doi.org/10.3847/1538-3881/ab1488 chicago: Huber, Daniel, William J. Chaplin, Ashley Chontos, Hans Kjeldsen, Jørgen Christensen-Dalsgaard, Timothy R. Bedding, Warrick Ball, et al. “A Hot Saturn Orbiting an Oscillating Late Subgiant Discovered by TESS.” The Astronomical Journal. IOP Publishing, 2019. https://doi.org/10.3847/1538-3881/ab1488. ieee: D. Huber et al., “A hot Saturn orbiting an oscillating late subgiant discovered by TESS,” The Astronomical Journal, vol. 157, no. 6. IOP Publishing, 2019. ista: Huber D et al. 2019. A hot Saturn orbiting an oscillating late subgiant discovered by TESS. The Astronomical Journal. 157(6), 245. mla: Huber, Daniel, et al. “A Hot Saturn Orbiting an Oscillating Late Subgiant Discovered by TESS.” The Astronomical Journal, vol. 157, no. 6, 245, IOP Publishing, 2019, doi:10.3847/1538-3881/ab1488. short: D. Huber, W.J. Chaplin, A. Chontos, H. Kjeldsen, J. Christensen-Dalsgaard, T.R. Bedding, W. Ball, R. Brahm, N. Espinoza, T. Henning, A. Jordán, P. Sarkis, E. Knudstrup, S. Albrecht, F. Grundahl, M.F. Andersen, P.L. Pallé, I. Crossfield, B. Fulton, A.W. Howard, H.T. Isaacson, L.M. Weiss, R. Handberg, M.N. Lund, A.M. Serenelli, J. Rørsted Mosumgaard, A. Stokholm, A. Bieryla, L.A. Buchhave, D.W. Latham, S.N. Quinn, E. Gaidos, T. Hirano, G.R. Ricker, R.K. Vanderspek, S. Seager, J.M. Jenkins, J.N. Winn, H.M. Antia, T. Appourchaux, S. Basu, K.J. Bell, O. Benomar, A. Bonanno, D.L. Buzasi, T.L. Campante, Z. Çelik Orhan, E. Corsaro, M.S. Cunha, G.R. Davies, S. Deheuvels, S.K. Grunblatt, A. Hasanzadeh, M.P. Di Mauro, R. A. García, P. Gaulme, L. Girardi, J.A. Guzik, M. Hon, C. Jiang, T. Kallinger, S.D. Kawaler, J.S. Kuszlewicz, Y. Lebreton, T. Li, M. Lucas, M.S. Lundkvist, A.W. Mann, S. Mathis, S. Mathur, A. Mazumdar, T.S. Metcalfe, A. Miglio, M.J.P. F. G. Monteiro, B. Mosser, A. Noll, B. Nsamba, J.M. Joel Ong, S. Örtel, F. Pereira, P. Ranadive, C. Régulo, T.S. Rodrigues, I.W. Roxburgh, V.S. Aguirre, B. Smalley, M. Schofield, S.G. Sousa, K.G. Stassun, D. Stello, J. Tayar, T.R. White, K. Verma, M. Vrard, M. Yıldız, D. Baker, M. Bazot, C. Beichmann, C. Bergmann, L.A. Bugnet, B. Cale, R. Carlino, S.M. Cartwright, J.L. Christiansen, D.R. Ciardi, O. Creevey, J.A. Dittmann, J.-D.D. Nascimento, V.V. Eylen, G. Fürész, J. Gagné, P. Gao, K. Gazeas, F. Giddens, O.J. Hall, S. Hekker, M.J. Ireland, N. Latouf, D. LeBrun, A.M. Levine, W. Matzko, E. Natinsky, E. Page, P. Plavchan, M. Mansouri-Samani, S. McCauliff, S.E. Mullally, B. Orenstein, A.G. Soto, M. Paegert, J.L. van Saders, C. Schnaible, D.R. Soderblom, R. Szabó, A. Tanner, C.G. Tinney, J. Teske, A. Thomas, R. Trampedach, D. Wright, T.T. Yuan, F. Zohrabi, The Astronomical Journal 157 (2019). date_created: 2022-07-18T14:29:07Z date_published: 2019-05-30T00:00:00Z date_updated: 2022-08-22T07:38:34Z day: '30' doi: 10.3847/1538-3881/ab1488 extern: '1' external_id: arxiv: - '1901.01643' intvolume: ' 157' issue: '6' keyword: - Space and Planetary Science - Astronomy and Astrophysics language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1901.01643 month: '05' oa: 1 oa_version: Preprint publication: The Astronomical Journal publication_identifier: issn: - 0004-6256 publication_status: published publisher: IOP Publishing quality_controlled: '1' scopus_import: '1' status: public title: A hot Saturn orbiting an oscillating late subgiant discovered by TESS type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 157 year: '2019' ... --- _id: '11623' abstract: - lang: eng text: Brightness variations due to dark spots on the stellar surface encode information about stellar surface rotation and magnetic activity. In this work, we analyze the Kepler long-cadence data of 26,521 main-sequence stars of spectral types M and K in order to measure their surface rotation and photometric activity level. Rotation-period estimates are obtained by the combination of a wavelet analysis and autocorrelation function of the light curves. Reliable rotation estimates are determined by comparing the results from the different rotation diagnostics and four data sets. We also measure the photometric activity proxy Sph using the amplitude of the flux variations on an appropriate timescale. We report rotation periods and photometric activity proxies for about 60% of the sample, including 4431 targets for which McQuillan et al. did not report a rotation period. For the common targets with rotation estimates in this study and in McQuillan et al., our rotation periods agree within 99%. In this work, we also identify potential polluters, such as misclassified red giants and classical pulsator candidates. Within the parameter range we study, there is a mild tendency for hotter stars to have shorter rotation periods. The photometric activity proxy spans a wider range of values with increasing effective temperature. The rotation period and photometric activity proxy are also related, with Sph being larger for fast rotators. Similar to McQuillan et al., we find a bimodal distribution of rotation periods. acknowledgement: "The authors thank Róbert Szabó Paul G. Beck, Katrien Kolenberg, and Isabel L. Colman for helping on the classification of stars. This paper includes data collected by the Kepler mission and obtained from the MAST data archive at the Space Telescope Science Institute (STScI). Funding for the Kepler mission is provided by the National Aeronautics and Space Administration (NASA) Science Mission Directorate. STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5–26555. A.R.G.S. acknowledges the support from NASA under grant NNX17AF27G. R.A.G. and L.B. acknowledge the support from PLATO and GOLF CNES grants. S.M. acknowledges the support from the Ramon y Cajal fellowship number RYC-2015-17697. T.S.M. acknowledges support from a Visiting Fellowship at the Max Planck Institute for Solar System Research. This research has made use of the NASA Exoplanet Archive, which is operated by the California Institute of Technology, under contract with the National Aeronautics and Space Administration under the Exoplanet Exploration Program.\r\n\r\nSoftware: KADACS (García et al. 2011), NumPy (van der Walt et al. 2011), SciPy (Jones et al. 2001), Matplotlib (Hunter 2007).\r\n\r\nFacilities: MAST - , Kepler Eclipsing Binary Catalog - , Exoplanet Archive. -" article_number: '21' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: A. R. G. full_name: Santos, A. R. G. last_name: Santos - first_name: R. A. full_name: García, R. A. last_name: García - first_name: S. full_name: Mathur, S. last_name: Mathur - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: J. L. full_name: van Saders, J. L. last_name: van Saders - first_name: T. S. full_name: Metcalfe, T. S. last_name: Metcalfe - first_name: G. V. A. full_name: Simonian, G. V. A. last_name: Simonian - first_name: M. H. full_name: Pinsonneault, M. H. last_name: Pinsonneault citation: ama: Santos ARG, García RA, Mathur S, et al. Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars. The Astrophysical Journal Supplement Series. 2019;244(1). doi:10.3847/1538-4365/ab3b56 apa: Santos, A. R. G., García, R. A., Mathur, S., Bugnet, L. A., van Saders, J. L., Metcalfe, T. S., … Pinsonneault, M. H. (2019). Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars. The Astrophysical Journal Supplement Series. IOP Publishing. https://doi.org/10.3847/1538-4365/ab3b56 chicago: Santos, A. R. G., R. A. García, S. Mathur, Lisa Annabelle Bugnet, J. L. van Saders, T. S. Metcalfe, G. V. A. Simonian, and M. H. Pinsonneault. “Surface Rotation and Photometric Activity for Kepler Targets. I. M and K Main-Sequence Stars.” The Astrophysical Journal Supplement Series. IOP Publishing, 2019. https://doi.org/10.3847/1538-4365/ab3b56. ieee: A. R. G. Santos et al., “Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars,” The Astrophysical Journal Supplement Series, vol. 244, no. 1. IOP Publishing, 2019. ista: Santos ARG, García RA, Mathur S, Bugnet LA, van Saders JL, Metcalfe TS, Simonian GVA, Pinsonneault MH. 2019. Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars. The Astrophysical Journal Supplement Series. 244(1), 21. mla: Santos, A. R. G., et al. “Surface Rotation and Photometric Activity for Kepler Targets. I. M and K Main-Sequence Stars.” The Astrophysical Journal Supplement Series, vol. 244, no. 1, 21, IOP Publishing, 2019, doi:10.3847/1538-4365/ab3b56. short: A.R.G. Santos, R.A. García, S. Mathur, L.A. Bugnet, J.L. van Saders, T.S. Metcalfe, G.V.A. Simonian, M.H. Pinsonneault, The Astrophysical Journal Supplement Series 244 (2019). date_created: 2022-07-19T09:21:58Z date_published: 2019-09-19T00:00:00Z date_updated: 2022-08-22T08:10:38Z day: '19' doi: 10.3847/1538-4365/ab3b56 extern: '1' external_id: arxiv: - '1908.05222' intvolume: ' 244' issue: '1' keyword: - Space and Planetary Science - Astronomy and Astrophysics - 'methods: data analysis' - 'stars: activity' - 'stars: low-mass' - 'stars: rotation' - starspots - 'techniques: photometric' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1908.05222 month: '09' oa: 1 oa_version: Preprint publication: The Astrophysical Journal Supplement Series publication_identifier: issn: - 0067-0049 publication_status: published publisher: IOP Publishing quality_controlled: '1' scopus_import: '1' status: public title: Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 244 year: '2019' ... --- _id: '11627' abstract: - lang: eng text: 'For a solar-like star, the surface rotation evolves with time, allowing in principle to estimate the age of a star from its surface rotation period. Here we are interested in measuring surface rotation periods of solar-like stars observed by the NASA mission Kepler. Different methods have been developed to track rotation signals in Kepler photometric light curves: time-frequency analysis based on wavelet techniques, autocorrelation and composite spectrum. We use the learning abilities of random forest classifiers to take decisions during two crucial steps of the analysis. First, given some input parameters, we discriminate the considered Kepler targets between rotating MS stars, non-rotating MS stars, red giants, binaries and pulsators. We then use a second classifier only on the MS rotating targets to decide the best data analysis treatment.' article_number: '1906.09609' article_processing_charge: No arxiv: 1 author: - first_name: S. N. full_name: Breton, S. N. last_name: Breton - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: A. R. G. full_name: Santos, A. R. G. last_name: Santos - first_name: A. Le full_name: Saux, A. Le last_name: Saux - first_name: S. full_name: Mathur, S. last_name: Mathur - first_name: P. L. full_name: Palle, P. L. last_name: Palle - first_name: R. A. full_name: Garcia, R. A. last_name: Garcia citation: ama: Breton SN, Bugnet LA, Santos ARG, et al. Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques. arXiv. doi:10.48550/arXiv.1906.09609 apa: Breton, S. N., Bugnet, L. A., Santos, A. R. G., Saux, A. L., Mathur, S., Palle, P. L., & Garcia, R. A. (n.d.). Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques. arXiv. https://doi.org/10.48550/arXiv.1906.09609 chicago: Breton, S. N., Lisa Annabelle Bugnet, A. R. G. Santos, A. Le Saux, S. Mathur, P. L. Palle, and R. A. Garcia. “Determining Surface Rotation Periods of Solar-like Stars Observed by the Kepler Mission Using Machine Learning Techniques.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1906.09609. ieee: S. N. Breton et al., “Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques,” arXiv. . ista: Breton SN, Bugnet LA, Santos ARG, Saux AL, Mathur S, Palle PL, Garcia RA. Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques. arXiv, 1906.09609. mla: Breton, S. N., et al. “Determining Surface Rotation Periods of Solar-like Stars Observed by the Kepler Mission Using Machine Learning Techniques.” ArXiv, 1906.09609, doi:10.48550/arXiv.1906.09609. short: S.N. Breton, L.A. Bugnet, A.R.G. Santos, A.L. Saux, S. Mathur, P.L. Palle, R.A. Garcia, ArXiv (n.d.). date_created: 2022-07-20T11:18:53Z date_published: 2019-06-23T00:00:00Z date_updated: 2022-08-22T08:16:53Z day: '23' doi: 10.48550/arXiv.1906.09609 extern: '1' external_id: arxiv: - '1906.09609' keyword: - asteroseismology - rotation - solar-like stars - kepler - machine learning - random forest language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1906.09609 month: '06' oa: 1 oa_version: Preprint publication: arXiv publication_status: submitted status: public title: Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '11630' abstract: - lang: eng text: 'The second mission of NASA’s Kepler satellite, K2, has collected hundreds of thousands of lightcurves for stars close to the ecliptic plane. This new sample could increase the number of known pulsating stars and then improve our understanding of those stars. For the moment only a few stars have been properly classified and published. In this work, we present a method to automaticly classify K2 pulsating stars using a Machine Learning technique called Random Forest. The objective is to sort out the stars in four classes: red giant (RG), main-sequence Solar-like stars (SL), classical pulsators (PULS) and Other. To do this we use the effective temperatures and the luminosities of the stars as well as the FliPer features, that measures the amount of power contained in the power spectral density. The classifier now retrieves the right classification for more than 80% of the stars.' article_number: '1906.09611' article_processing_charge: No arxiv: 1 author: - first_name: A. Le full_name: Saux, A. Le last_name: Saux - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: S. full_name: Mathur, S. last_name: Mathur - first_name: S. N. full_name: Breton, S. N. last_name: Breton - first_name: R. A. full_name: Garcia, R. A. last_name: Garcia citation: ama: Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification of K2 pulsating stars using machine learning techniques. arXiv. doi:10.48550/arXiv.1906.09611 apa: Saux, A. L., Bugnet, L. A., Mathur, S., Breton, S. N., & Garcia, R. A. (n.d.). Automatic classification of K2 pulsating stars using machine learning techniques. arXiv. https://doi.org/10.48550/arXiv.1906.09611 chicago: Saux, A. Le, Lisa Annabelle Bugnet, S. Mathur, S. N. Breton, and R. A. Garcia. “Automatic Classification of K2 Pulsating Stars Using Machine Learning Techniques.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1906.09611. ieee: A. L. Saux, L. A. Bugnet, S. Mathur, S. N. Breton, and R. A. Garcia, “Automatic classification of K2 pulsating stars using machine learning techniques,” arXiv. . ista: Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification of K2 pulsating stars using machine learning techniques. arXiv, 1906.09611. mla: Saux, A. Le, et al. “Automatic Classification of K2 Pulsating Stars Using Machine Learning Techniques.” ArXiv, 1906.09611, doi:10.48550/arXiv.1906.09611. short: A.L. Saux, L.A. Bugnet, S. Mathur, S.N. Breton, R.A. Garcia, ArXiv (n.d.). date_created: 2022-07-21T06:57:10Z date_published: 2019-06-23T00:00:00Z date_updated: 2022-08-22T08:20:29Z day: '23' doi: 10.48550/arXiv.1906.09611 extern: '1' external_id: arxiv: - '1906.09611' keyword: - asteroseismology - methods - data analysis - thecniques - machine learning - stars - oscillations language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.1906.09611 month: '06' oa: 1 oa_version: Preprint publication: arXiv publication_status: submitted status: public title: Automatic classification of K2 pulsating stars using machine learning techniques type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '11826' abstract: - lang: eng text: "The diameter, radius and eccentricities are natural graph parameters. While these problems have been studied extensively, there are no known dynamic algorithms for them beyond the ones that follow from trivial recomputation after each update or from solving dynamic All-Pairs Shortest Paths (APSP), which is very computationally intensive. This is the situation for dynamic approximation algorithms as well, and even if only edge insertions or edge deletions need to be supported.\r\nThis paper provides a comprehensive study of the dynamic approximation of Diameter, Radius and Eccentricities, providing both conditional lower bounds, and new algorithms whose bounds are optimal under popular hypotheses in fine-grained complexity. Some of the highlights include:\r\n- Under popular hardness hypotheses, there can be no significantly better fully dynamic approximation algorithms than recomputing the answer after each update, or maintaining full APSP.\r\n- Nearly optimal partially dynamic (incremental/decremental) algorithms can be achieved via efficient reductions to (incremental/decremental) maintenance of Single-Source Shortest Paths. For instance, a nearly (3/2+epsilon)-approximation to Diameter in directed or undirected n-vertex, m-edge graphs can be maintained decrementally in total time m^{1+o(1)}sqrt{n}/epsilon^2. This nearly matches the static 3/2-approximation algorithm for the problem that is known to be conditionally optimal." alternative_title: - LIPIcs article_number: '13' article_processing_charge: No arxiv: 1 author: - first_name: Bertie full_name: Ancona, Bertie last_name: Ancona - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Liam full_name: Roditty, Liam last_name: Roditty - first_name: Virginia Vassilevska full_name: Williams, Virginia Vassilevska last_name: Williams - first_name: Nicole full_name: Wein, Nicole last_name: Wein citation: ama: 'Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. Algorithms and hardness for diameter in dynamic graphs. In: 46th International Colloquium on Automata, Languages, and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.ICALP.2019.13' apa: 'Ancona, B., Henzinger, M. H., Roditty, L., Williams, V. V., & Wein, N. (2019). Algorithms and hardness for diameter in dynamic graphs. In 46th International Colloquium on Automata, Languages, and Programming (Vol. 132). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2019.13' chicago: Ancona, Bertie, Monika H Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein. “Algorithms and Hardness for Diameter in Dynamic Graphs.” In 46th International Colloquium on Automata, Languages, and Programming, Vol. 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.13. ieee: B. Ancona, M. H. Henzinger, L. Roditty, V. V. Williams, and N. Wein, “Algorithms and hardness for diameter in dynamic graphs,” in 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132. ista: 'Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. 2019. Algorithms and hardness for diameter in dynamic graphs. 46th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 132, 13.' mla: Ancona, Bertie, et al. “Algorithms and Hardness for Diameter in Dynamic Graphs.” 46th International Colloquium on Automata, Languages, and Programming, vol. 132, 13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ICALP.2019.13. short: B. Ancona, M.H. Henzinger, L. Roditty, V.V. Williams, N. Wein, in:, 46th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. conference: end_date: 2019-07-12 location: Patras, Greece name: 'ICALP: International Colloquium on Automata, Languages, and Programming' start_date: 2019-07-09 date_created: 2022-08-12T08:14:51Z date_published: 2019-07-04T00:00:00Z date_updated: 2023-02-16T10:48:24Z day: '04' doi: 10.4230/LIPICS.ICALP.2019.13 extern: '1' external_id: arxiv: - '811.12527' intvolume: ' 132' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.ICALP.2019.13 month: '07' oa: 1 oa_version: Published Version publication: 46th International Colloquium on Automata, Languages, and Programming publication_identifier: isbn: - 978-3-95977-109-2 issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Algorithms and hardness for diameter in dynamic graphs type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 132 year: '2019' ... --- _id: '11847' abstract: - lang: eng text: This paper serves as a user guide to the Vienna graph clustering framework. We review our general memetic algorithm, VieClus, to tackle the graph clustering problem. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. Lastly, we combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time. After giving a description of the algorithms employed, we establish the connection of the graph clustering problem to protein–protein interaction networks and moreover give a description on how the software can be used, what file formats are expected, and how this can be used to find functional groups in protein–protein interaction networks. alternative_title: - Methods in Molecular Biology article_processing_charge: No author: - first_name: Sonja full_name: Biedermann, Sonja last_name: Biedermann - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Christian full_name: Schulz, Christian last_name: Schulz - first_name: Bernhard full_name: Schuster, Bernhard last_name: Schuster citation: ama: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. Vienna Graph Clustering. In: Canzar S, Rojas Ringeling F, eds. Protein-Protein Interaction Networks. Vol 2074. MIMB. Springer Nature; 2019:215–231. doi:10.1007/978-1-4939-9873-9_16' apa: Biedermann, S., Henzinger, M. H., Schulz, C., & Schuster, B. (2019). Vienna Graph Clustering. In S. Canzar & F. Rojas Ringeling (Eds.), Protein-Protein Interaction Networks (Vol. 2074, pp. 215–231). Springer Nature. https://doi.org/10.1007/978-1-4939-9873-9_16 chicago: Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster. “Vienna Graph Clustering.” In Protein-Protein Interaction Networks, edited by Stefan Canzar and Francisca Rojas Ringeling, 2074:215–231. MIMB. Springer Nature, 2019. https://doi.org/10.1007/978-1-4939-9873-9_16. ieee: S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Vienna Graph Clustering,” in Protein-Protein Interaction Networks, vol. 2074, S. Canzar and F. Rojas Ringeling, Eds. Springer Nature, 2019, pp. 215–231. ista: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. 2019.Vienna Graph Clustering. In: Protein-Protein Interaction Networks. Methods in Molecular Biology, vol. 2074, 215–231.' mla: Biedermann, Sonja, et al. “Vienna Graph Clustering.” Protein-Protein Interaction Networks, edited by Stefan Canzar and Francisca Rojas Ringeling, vol. 2074, Springer Nature, 2019, pp. 215–231, doi:10.1007/978-1-4939-9873-9_16. short: S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, S. Canzar, F. Rojas Ringeling (Eds.), Protein-Protein Interaction Networks, Springer Nature, 2019, pp. 215–231. date_created: 2022-08-16T06:54:48Z date_published: 2019-10-04T00:00:00Z date_updated: 2023-02-17T09:34:26Z day: '04' doi: 10.1007/978-1-4939-9873-9_16 editor: - first_name: Stefan full_name: Canzar, Stefan last_name: Canzar - first_name: Francisca full_name: Rojas Ringeling, Francisca last_name: Rojas Ringeling extern: '1' external_id: pmid: - '31583641' intvolume: ' 2074' language: - iso: eng month: '10' oa_version: None page: 215–231 pmid: 1 publication: Protein-Protein Interaction Networks publication_identifier: eisbn: - '9781493998739' eissn: - 1940-6029 isbn: - '9781493998722' issn: - 1064-3745 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' series_title: MIMB status: public title: Vienna Graph Clustering type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2074 year: '2019' ... --- _id: '11850' abstract: - lang: eng text: 'Modern networked systems are increasingly reconfigurable, enabling demand-aware infrastructures whose resources can be adjusted according to the workload they currently serve. Such dynamic adjustments can be exploited to improve network utilization and hence performance, by moving frequently interacting communication partners closer, e.g., collocating them in the same server or datacenter. However, dynamically changing the embedding of workloads is algorithmically challenging: communication patterns are often not known ahead of time, but must be learned. During the learning process, overheads related to unnecessary moves (i.e., re-embeddings) should be minimized. This paper studies a fundamental model which captures the tradeoff between the benefits and costs of dynamically collocating communication partners on l servers, in an online manner. Our main contribution is a distributed online algorithm which is asymptotically almost optimal, i.e., almost matches the lower bound (also derived in this paper) on the competitive ratio of any (distributed or centralized) online algorithm.' article_processing_charge: No arxiv: 1 author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Stefan full_name: Neumann, Stefan last_name: Neumann - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid citation: ama: 'Henzinger MH, Neumann S, Schmid S. Efficient distributed workload (re-)embedding. In: SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems. Association for Computing Machinery; 2019:43–44. doi:10.1145/3309697.3331503' apa: 'Henzinger, M. H., Neumann, S., & Schmid, S. (2019). Efficient distributed workload (re-)embedding. In SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems (pp. 43–44). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3309697.3331503' chicago: 'Henzinger, Monika H, Stefan Neumann, and Stefan Schmid. “Efficient Distributed Workload (Re-)Embedding.” In SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, 43–44. Association for Computing Machinery, 2019. https://doi.org/10.1145/3309697.3331503.' ieee: 'M. H. Henzinger, S. Neumann, and S. Schmid, “Efficient distributed workload (re-)embedding,” in SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Phoenix, AZ, United States, 2019, pp. 43–44.' ista: 'Henzinger MH, Neumann S, Schmid S. 2019. Efficient distributed workload (re-)embedding. SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 43–44.' mla: 'Henzinger, Monika H., et al. “Efficient Distributed Workload (Re-)Embedding.” SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2019, pp. 43–44, doi:10.1145/3309697.3331503.' short: 'M.H. Henzinger, S. Neumann, S. Schmid, in:, SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2019, pp. 43–44.' conference: end_date: 2019-06-28 location: Phoenix, AZ, United States name: 'SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems' start_date: 2019-06-24 date_created: 2022-08-16T07:14:57Z date_published: 2019-06-20T00:00:00Z date_updated: 2023-02-17T09:41:45Z day: '20' doi: 10.1145/3309697.3331503 extern: '1' external_id: arxiv: - '1904.05474' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1904.05474 month: '06' oa: 1 oa_version: Preprint page: 43–44 publication: 'SIGMETRICS''19: International Conference on Measurement and Modeling of Computer Systems' publication_identifier: isbn: - 978-1-4503-6678-6 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Efficient distributed workload (re-)embedding type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '11851' abstract: - lang: eng text: The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weighted sum of the cut edges. In this paper, we engineer the fastest known exact algorithm for the problem. State-of-the-art algorithms like the algorithm of Padberg and Rinaldi or the algorithm of Nagamochi, Ono and Ibaraki identify edges that can be contracted to reduce the graph size such that at least one minimum cut is maintained in the contracted graph. Our algorithm achieves improvements in running time over these algorithms by a multitude of techniques. First, we use a recently developed fast and parallel inexact minimum cut algorithm to obtain a better bound for the problem. Afterwards, we use reductions that depend on this bound to reduce the size of the graph much faster than previously possible. We use improved data structures to further lower the running time of our algorithm. Additionally, we parallelize the contraction routines of Nagamochi et al. . Overall, we arrive at a system that significantly outperforms the fastest state-of-the-art solvers for the exact minimum cut problem. article_number: '8820968' article_processing_charge: No arxiv: 1 author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Alexander full_name: Noe, Alexander last_name: Noe - first_name: Christian full_name: Schulz, Christian last_name: Schulz citation: ama: 'Henzinger MH, Noe A, Schulz C. Shared-memory exact minimum cuts. In: 33rd International Parallel and Distributed Processing Symposium. Institute of Electrical and Electronics Engineers; 2019. doi:10.1109/ipdps.2019.00013' apa: 'Henzinger, M. H., Noe, A., & Schulz, C. (2019). Shared-memory exact minimum cuts. In 33rd International Parallel and Distributed Processing Symposium. Rio de Janeiro, Brazil: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ipdps.2019.00013' chicago: Henzinger, Monika H, Alexander Noe, and Christian Schulz. “Shared-Memory Exact Minimum Cuts.” In 33rd International Parallel and Distributed Processing Symposium. Institute of Electrical and Electronics Engineers, 2019. https://doi.org/10.1109/ipdps.2019.00013. ieee: M. H. Henzinger, A. Noe, and C. Schulz, “Shared-memory exact minimum cuts,” in 33rd International Parallel and Distributed Processing Symposium, Rio de Janeiro, Brazil, 2019. ista: 'Henzinger MH, Noe A, Schulz C. 2019. Shared-memory exact minimum cuts. 33rd International Parallel and Distributed Processing Symposium. IPDPS: International Parallel and Distributed Processing Symposium, 8820968.' mla: Henzinger, Monika H., et al. “Shared-Memory Exact Minimum Cuts.” 33rd International Parallel and Distributed Processing Symposium, 8820968, Institute of Electrical and Electronics Engineers, 2019, doi:10.1109/ipdps.2019.00013. short: M.H. Henzinger, A. Noe, C. Schulz, in:, 33rd International Parallel and Distributed Processing Symposium, Institute of Electrical and Electronics Engineers, 2019. conference: end_date: 2019-05-24 location: Rio de Janeiro, Brazil name: 'IPDPS: International Parallel and Distributed Processing Symposium' start_date: 2019-05-20 date_created: 2022-08-16T07:25:23Z date_published: 2019-05-01T00:00:00Z date_updated: 2023-02-21T16:30:34Z day: '01' doi: 10.1109/ipdps.2019.00013 extern: '1' external_id: arxiv: - '1808.05458' language: - iso: eng main_file_link: - url: https://arxiv.org/abs/1808.05458 month: '05' oa_version: Preprint publication: 33rd International Parallel and Distributed Processing Symposium publication_identifier: eisbn: - 978-1-7281-1246-6 eissn: - 1530-2075 isbn: - 978-1-7281-1247-3 publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' related_material: record: - id: '11851' relation: later_version status: public scopus_import: '1' status: public title: Shared-memory exact minimum cuts type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '11853' abstract: - lang: eng text: We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the input set system is undergoing element insertions and deletions. Here, n denotes the number of elements, each element appears in at most f sets, and the cost of each set lies in the range [1/C, 1]. Our result, together with that of Gupta~et~al.~[STOC'17], implies that there is a deterministic algorithm for this problem with O(f log(Cn)) amortized update time and O(min(log n, f)) -approximation ratio, which nearly matches the polynomial-time hardness of approximation for minimum set cover in the static setting. Our update time is only O(log (Cn)) away from a trivial lower bound. Prior to our work, the previous best approximation ratio guaranteed by deterministic algorithms was O(f^2), which was due to Bhattacharya~et~al.~[ICALP`15]. In contrast, the only result that guaranteed O(f) -approximation was obtained very recently by Abboud~et~al.~[STOC`19], who designed a dynamic algorithm with (1+ε)f-approximation ratio and O(f^2 log n/ε) amortized update time. Besides the extra O(f) factor in the update time compared to our and Gupta~et~al.'s results, the Abboud~et~al.~algorithm is randomized, and works only when the adversary is oblivious and the sets are unweighted (each set has the same cost). We achieve our result via the primal-dual approach, by maintaining a fractional packing solution as a dual certificate. This approach was pursued previously by Bhattacharya~et~al.~and Gupta~et~al., but not in the recent paper by Abboud~et~al. Unlike previous primal-dual algorithms that try to satisfy some local constraints for individual sets at all time, our algorithm basically waits until the dual solution changes significantly globally, and fixes the solution only where the fix is needed. article_processing_charge: No arxiv: 1 author: - first_name: Sayan full_name: Bhattacharya, Sayan last_name: Bhattacharya - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Danupon full_name: Nanongkai, Danupon last_name: Nanongkai citation: ama: 'Bhattacharya S, Henzinger MH, Nanongkai D. A new deterministic algorithm for dynamic set cover. In: 60th Annual Symposium on Foundations of Computer Science. Institute of Electrical and Electronics Engineers; 2019:406-423. doi:10.1109/focs.2019.00033' apa: 'Bhattacharya, S., Henzinger, M. H., & Nanongkai, D. (2019). A new deterministic algorithm for dynamic set cover. In 60th Annual Symposium on Foundations of Computer Science (pp. 406–423). Baltimore, MD, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/focs.2019.00033' chicago: Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “A New Deterministic Algorithm for Dynamic Set Cover.” In 60th Annual Symposium on Foundations of Computer Science, 406–23. Institute of Electrical and Electronics Engineers, 2019. https://doi.org/10.1109/focs.2019.00033. ieee: S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “A new deterministic algorithm for dynamic set cover,” in 60th Annual Symposium on Foundations of Computer Science, Baltimore, MD, United States, 2019, pp. 406–423. ista: 'Bhattacharya S, Henzinger MH, Nanongkai D. 2019. A new deterministic algorithm for dynamic set cover. 60th Annual Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations of Computer Science, 406–423.' mla: Bhattacharya, Sayan, et al. “A New Deterministic Algorithm for Dynamic Set Cover.” 60th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2019, pp. 406–23, doi:10.1109/focs.2019.00033. short: S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 60th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2019, pp. 406–423. conference: end_date: 2019-11-12 location: Baltimore, MD, United States name: 'FOCS: Annual Symposium on Foundations of Computer Science' start_date: 2019-11-09 date_created: 2022-08-16T08:00:00Z date_published: 2019-11-01T00:00:00Z date_updated: 2023-02-17T09:50:37Z day: '01' doi: 10.1109/focs.2019.00033 extern: '1' external_id: arxiv: - '1909.11600' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1909.11600 month: '11' oa: 1 oa_version: Preprint page: 406-423 publication: 60th Annual Symposium on Foundations of Computer Science publication_identifier: eisbn: - 978-1-7281-4952-3 isbn: - 978-1-7281-4953-0 issn: - 2575-8454 publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' scopus_import: '1' status: public title: A new deterministic algorithm for dynamic set cover type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '11865' abstract: - lang: eng text: We present the first sublinear-time algorithm that can compute the edge connectivity λ of a network exactly on distributed message-passing networks (the CONGEST model), as long as the network contains no multi-edge. We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity λ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes Õ(n1−1/353D1/353+n1−1/706) time to compute λ and a cut of cardinality λ with high probability, where n and D are the number of nodes and the diameter of the network, respectively, and Õ hides polylogarithmic factors. This running time is sublinear in n (i.e. Õ(n1−є)) whenever D is. Previous sublinear-time distributed algorithms can solve this problem either (i) exactly only when λ=O(n1/8−є) [Thurimella PODC’95; Pritchard, Thurimella, ACM Trans. Algorithms’11; Nanongkai, Su, DISC’14] or (ii) approximately [Ghaffari, Kuhn, DISC’13; Nanongkai, Su, DISC’14]. To achieve this we develop and combine several new techniques. First, we design the first distributed algorithm that can compute a k-edge connectivity certificate for any k=O(n1−є) in time Õ(√nk+D). The previous sublinear-time algorithm can do so only when k=o(√n) [Thurimella PODC’95]. In fact, our algorithm can be turned into the first parallel algorithm with polylogarithmic depth and near-linear work. Previous near-linear work algorithms are essentially sequential and previous polylogarithmic-depth algorithms require Ω(mk) work in the worst case (e.g. [Karger, Motwani, STOC’93]). Second, we show that by combining the recent distributed expander decomposition technique of [Chang, Pettie, Zhang, SODA’19] with techniques from the sequential deterministic edge connectivity algorithm of [Kawarabayashi, Thorup, STOC’15], we can decompose the network into a sublinear number of clusters with small average diameter and without any mincut separating a cluster (except the “trivial” ones). This leads to a simplification of the Kawarabayashi-Thorup framework (except that we are randomized while they are deterministic). This might make this framework more useful in other models of computation. Finally, by extending the tree packing technique from [Karger STOC’96], we can find the minimum cut in time proportional to the number of components. As a byproduct of this technique, we obtain an Õ(n)-time algorithm for computing exact minimum cut for weighted graphs. article_processing_charge: No arxiv: 1 author: - first_name: Mohit full_name: Daga, Mohit last_name: Daga - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Danupon full_name: Nanongkai, Danupon last_name: Nanongkai - first_name: Thatchaphol full_name: Saranurak, Thatchaphol last_name: Saranurak citation: ama: 'Daga M, Henzinger MH, Nanongkai D, Saranurak T. Distributed edge connectivity in sublinear time. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery; 2019:343–354. doi:10.1145/3313276.3316346' apa: 'Daga, M., Henzinger, M. H., Nanongkai, D., & Saranurak, T. (2019). Distributed edge connectivity in sublinear time. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (pp. 343–354). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3313276.3316346' chicago: Daga, Mohit, Monika H Henzinger, Danupon Nanongkai, and Thatchaphol Saranurak. “Distributed Edge Connectivity in Sublinear Time.” In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 343–354. Association for Computing Machinery, 2019. https://doi.org/10.1145/3313276.3316346. ieee: M. Daga, M. H. Henzinger, D. Nanongkai, and T. Saranurak, “Distributed edge connectivity in sublinear time,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Phoenix, AZ, United States, 2019, pp. 343–354. ista: 'Daga M, Henzinger MH, Nanongkai D, Saranurak T. 2019. Distributed edge connectivity in sublinear time. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 343–354.' mla: Daga, Mohit, et al. “Distributed Edge Connectivity in Sublinear Time.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2019, pp. 343–354, doi:10.1145/3313276.3316346. short: M. Daga, M.H. Henzinger, D. Nanongkai, T. Saranurak, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2019, pp. 343–354. conference: end_date: 2019-06-26 location: Phoenix, AZ, United States name: 'STOC: Symposium on Theory of Computing' start_date: 2019-06-23 date_created: 2022-08-16T09:11:17Z date_published: 2019-06-01T00:00:00Z date_updated: 2023-02-17T10:26:25Z day: '01' doi: 10.1145/3313276.3316346 extern: '1' external_id: arxiv: - '1904.04341' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1904.04341 month: '06' oa: 1 oa_version: Preprint page: 343–354 publication: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing publication_identifier: isbn: - 978-1-4503-6705-9 issn: - 0737-8017 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Distributed edge connectivity in sublinear time type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '11871' abstract: - lang: eng text: "Many dynamic graph algorithms have an amortized update time, rather than a stronger worst-case guarantee. But amortized data structures are not suitable for real-time systems, where each individual operation has to be executed quickly. For this reason, there exist many recent randomized results that aim to provide a guarantee stronger than amortized expected. The strongest possible guarantee for a randomized algorithm is that it is always correct (Las Vegas), and has high-probability worst-case update time, which gives a bound on the time for each individual operation that holds with high probability.\r\n\r\nIn this paper we present the first polylogarithmic high-probability worst-case time bounds for the dynamic spanner and the dynamic maximal matching problem.\r\n\r\n1.\t\r\nFor dynamic spanner, the only known o(n) worst-case bounds were O(n3/4) high-probability worst-case update time for maintaining a 3-spanner, and O(n5/9) for maintaining a 5-spanner. We give a O(1)k log3(n) high-probability worst-case time bound for maintaining a (2k – 1)-spanner, which yields the first worst-case polylog update time for all constant k. (All the results above maintain the optimal tradeoff of stretch 2k – 1 and Õ(n1+1/k) edges.)\r\n\r\n2.\t\r\nFor dynamic maximal matching, or dynamic 2-approximate maximum matching, no algorithm with o(n) worst-case time bound was known and we present an algorithm with O(log5 (n)) high-probability worst-case time; similar worst-case bounds existed only for maintaining a matching that was (2 + ∊)-approximate, and hence not maximal.\r\n\r\nOur results are achieved using a new approach for converting amortized guarantees to worst-case ones for randomized data structures by going through a third type of guarantee, which is a middle ground between the two above: an algorithm is said to have worst-case expected update time α if for every update σ, the expected time to process σ is at most α. Although stronger than amortized expected, the worst-case expected guarantee does not resolve the fundamental problem of amortization: a worst-case expected update time of O(1) still allows for the possibility that every 1/f(n) updates requires Θ(f(n)) time to process, for arbitrarily high f(n). In this paper we present a black-box reduction that converts any data structure with worst-case expected update time into one with a high-probability worst-case update time: the query time remains the same, while the update time increases by a factor of O(log2(n)).\r\n\r\nThus we achieve our results in two steps: (1) First we show how to convert existing dynamic graph algorithms with amortized expected polylogarithmic running times into algorithms with worst-case expected polylogarithmic running times. (2) Then we use our black-box reduction to achieve the polylogarithmic high-probability worst-case time bound. All our algorithms are Las-Vegas-type algorithms." article_processing_charge: No arxiv: 1 author: - first_name: Aaron full_name: Bernstein, Aaron last_name: Bernstein - first_name: Sebastian full_name: Forster, Sebastian last_name: Forster - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 citation: ama: 'Bernstein A, Forster S, Henzinger MH. A deamortization approach for dynamic spanner and dynamic maximal matching. In: 30th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2019:1899-1918. doi:10.1137/1.9781611975482.115' apa: 'Bernstein, A., Forster, S., & Henzinger, M. H. (2019). A deamortization approach for dynamic spanner and dynamic maximal matching. In 30th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1899–1918). San Diego, CA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.115' chicago: Bernstein, Aaron, Sebastian Forster, and Monika H Henzinger. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” In 30th Annual ACM-SIAM Symposium on Discrete Algorithms, 1899–1918. Society for Industrial and Applied Mathematics, 2019. https://doi.org/10.1137/1.9781611975482.115. ieee: A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach for dynamic spanner and dynamic maximal matching,” in 30th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2019, pp. 1899–1918. ista: 'Bernstein A, Forster S, Henzinger MH. 2019. A deamortization approach for dynamic spanner and dynamic maximal matching. 30th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1899–1918.' mla: Bernstein, Aaron, et al. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” 30th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019, pp. 1899–918, doi:10.1137/1.9781611975482.115. short: A. Bernstein, S. Forster, M.H. Henzinger, in:, 30th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019, pp. 1899–1918. conference: end_date: 2019-01-09 location: San Diego, CA, United States name: 'SODA: Symposium on Discrete Algorithms' start_date: 2019-01-06 date_created: 2022-08-16T09:50:33Z date_published: 2019-01-01T00:00:00Z date_updated: 2023-02-21T16:31:21Z day: '01' doi: 10.1137/1.9781611975482.115 extern: '1' external_id: arxiv: - '1810.10932' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1810.10932 month: '01' oa: 1 oa_version: Preprint page: 1899-1918 publication: 30th Annual ACM-SIAM Symposium on Discrete Algorithms publication_identifier: eisbn: - 978-1-61197-548-2 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' related_material: record: - id: '11871' relation: earlier_version status: public scopus_import: '1' status: public title: A deamortization approach for dynamic spanner and dynamic maximal matching type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '11898' abstract: - lang: eng text: "We build upon the recent papers by Weinstein and Yu (FOCS'16), Larsen (FOCS'12), and Clifford et al. (FOCS'15) to present a general framework that gives amortized lower bounds on the update and query times of dynamic data structures. Using our framework, we present two concrete results.\r\n(1) For the dynamic polynomial evaluation problem, where the polynomial is defined over a finite field of size n1+Ω(1) and has degree n, any dynamic data structure must either have an amortized update time of Ω((lgn/lglgn)2) or an amortized query time of Ω((lgn/lglgn)2).\r\n(2) For the dynamic online matrix vector multiplication problem, where we get an n×n matrix whose entires are drawn from a finite field of size nΘ(1), any dynamic data structure must either have an amortized update time of Ω((lgn/lglgn)2) or an amortized query time of Ω(n⋅(lgn/lglgn)2).\r\nFor these two problems, the previous works by Larsen (FOCS'12) and Clifford et al. (FOCS'15) gave the same lower bounds, but only for worst case update and query times. Our bounds match the highest unconditional lower bounds known till date for any dynamic problem in the cell-probe model." article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Sayan full_name: Bhattacharya, Sayan last_name: Bhattacharya - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Stefan full_name: Neumann, Stefan last_name: Neumann citation: ama: Bhattacharya S, Henzinger MH, Neumann S. New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. 2019;779:72-87. doi:10.1016/j.tcs.2019.01.043 apa: Bhattacharya, S., Henzinger, M. H., & Neumann, S. (2019). New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.01.043 chicago: Bhattacharya, Sayan, Monika H Henzinger, and Stefan Neumann. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” Theoretical Computer Science. Elsevier, 2019. https://doi.org/10.1016/j.tcs.2019.01.043. ieee: S. Bhattacharya, M. H. Henzinger, and S. Neumann, “New amortized cell-probe lower bounds for dynamic problems,” Theoretical Computer Science, vol. 779. Elsevier, pp. 72–87, 2019. ista: Bhattacharya S, Henzinger MH, Neumann S. 2019. New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. 779, 72–87. mla: Bhattacharya, Sayan, et al. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” Theoretical Computer Science, vol. 779, Elsevier, 2019, pp. 72–87, doi:10.1016/j.tcs.2019.01.043. short: S. Bhattacharya, M.H. Henzinger, S. Neumann, Theoretical Computer Science 779 (2019) 72–87. date_created: 2022-08-17T09:02:15Z date_published: 2019-08-02T00:00:00Z date_updated: 2022-09-09T11:29:04Z day: '02' doi: 10.1016/j.tcs.2019.01.043 extern: '1' external_id: arxiv: - '1902.02304' intvolume: ' 779' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1902.02304 month: '08' oa: 1 oa_version: Preprint page: 72-87 publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: New amortized cell-probe lower bounds for dynamic problems type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 779 year: '2019' ... --- _id: '11957' abstract: - lang: eng text: Cross-coupling reactions mediated by dual nickel/photocatalysis are synthetically attractive but rely mainly on expensive, non-recyclable noble-metal complexes as photocatalysts. Heterogeneous semiconductors, which are commonly used for artificial photosynthesis and wastewater treatment, are a sustainable alternative. Graphitic carbon nitrides, a class of metal-free polymers that can be easily prepared from bulk chemicals, are heterogeneous semiconductors with high potential for photocatalytic organic transformations. Here, we demonstrate that graphitic carbon nitrides in combination with nickel catalysis can induce selective C−O cross-couplings of carboxylic acids with aryl halides, yielding the respective aryl esters in excellent yield and selectivity. The heterogeneous organic photocatalyst exhibits a broad substrate scope, is able to harvest green light, and can be recycled multiple times. In situ FTIR was used to track the reaction progress to study this transformation at different irradiation wavelengths and reaction scales. article_processing_charge: No article_type: letter_note author: - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X - first_name: Jamal A. full_name: Malik, Jamal A. last_name: Malik - first_name: Cristian full_name: Cavedon, Cristian last_name: Cavedon - first_name: Sebastian full_name: Gisbertz, Sebastian last_name: Gisbertz - first_name: Aleksandr full_name: Savateev, Aleksandr last_name: Savateev - first_name: Daniel full_name: Cruz, Daniel last_name: Cruz - first_name: Tobias full_name: Heil, Tobias last_name: Heil - first_name: Guigang full_name: Zhang, Guigang last_name: Zhang - first_name: Peter H. full_name: Seeberger, Peter H. last_name: Seeberger citation: ama: 'Pieber B, Malik JA, Cavedon C, et al. Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte Chemie International Edition. 2019;58(28):9575-9580. doi:10.1002/anie.201902785' apa: 'Pieber, B., Malik, J. A., Cavedon, C., Gisbertz, S., Savateev, A., Cruz, D., … Seeberger, P. H. (2019). Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201902785' chicago: 'Pieber, Bartholomäus, Jamal A. Malik, Cristian Cavedon, Sebastian Gisbertz, Aleksandr Savateev, Daniel Cruz, Tobias Heil, Guigang Zhang, and Peter H. Seeberger. “Semi‐heterogeneous Dual Nickel/Photocatalysis Using Carbon Nitrides: Esterification of Carboxylic Acids with Aryl Halides.” Angewandte Chemie International Edition. Wiley, 2019. https://doi.org/10.1002/anie.201902785.' ieee: 'B. Pieber et al., “Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides,” Angewandte Chemie International Edition, vol. 58, no. 28. Wiley, pp. 9575–9580, 2019.' ista: 'Pieber B, Malik JA, Cavedon C, Gisbertz S, Savateev A, Cruz D, Heil T, Zhang G, Seeberger PH. 2019. Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte Chemie International Edition. 58(28), 9575–9580.' mla: 'Pieber, Bartholomäus, et al. “Semi‐heterogeneous Dual Nickel/Photocatalysis Using Carbon Nitrides: Esterification of Carboxylic Acids with Aryl Halides.” Angewandte Chemie International Edition, vol. 58, no. 28, Wiley, 2019, pp. 9575–80, doi:10.1002/anie.201902785.' short: B. Pieber, J.A. Malik, C. Cavedon, S. Gisbertz, A. Savateev, D. Cruz, T. Heil, G. Zhang, P.H. Seeberger, Angewandte Chemie International Edition 58 (2019) 9575–9580. date_created: 2022-08-24T10:50:19Z date_published: 2019-07-08T00:00:00Z date_updated: 2023-02-21T10:09:16Z day: '08' doi: 10.1002/anie.201902785 extern: '1' external_id: pmid: - '31050132' intvolume: ' 58' issue: '28' language: - iso: eng month: '07' oa_version: None page: 9575-9580 pmid: 1 publication: Angewandte Chemie International Edition publication_identifier: eissn: - 1521-3773 issn: - 1433-7851 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: 'Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 58 year: '2019' ... --- _id: '11982' abstract: - lang: eng text: A carbon nitride material can be combined with homogeneous nickel catalysts for light-mediated cross-couplings of aryl bromides with alcohols under mild conditions. The metal-free heterogeneous semiconductor is fully recyclable and couples a broad range of electron-poor aryl bromides with primary and secondary alcohols as well as water. The application for intramolecular reactions and the synthesis of active pharmaceutical ingredients was demonstrated. The catalytic protocol is applicable for the coupling of aryl iodides with thiols as well. article_processing_charge: No article_type: letter_note author: - first_name: Cristian full_name: Cavedon, Cristian last_name: Cavedon - first_name: Amiera full_name: Madani, Amiera last_name: Madani - first_name: Peter H. full_name: Seeberger, Peter H. last_name: Seeberger - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X citation: ama: Cavedon C, Madani A, Seeberger PH, Pieber B. Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters. 2019;21(13):5331-5334. doi:10.1021/acs.orglett.9b01957 apa: Cavedon, C., Madani, A., Seeberger, P. H., & Pieber, B. (2019). Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters. American Chemical Society. https://doi.org/10.1021/acs.orglett.9b01957 chicago: Cavedon, Cristian, Amiera Madani, Peter H. Seeberger, and Bartholomäus Pieber. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using Carbon Nitrides.” Organic Letters. American Chemical Society, 2019. https://doi.org/10.1021/acs.orglett.9b01957. ieee: C. Cavedon, A. Madani, P. H. Seeberger, and B. Pieber, “Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides,” Organic Letters, vol. 21, no. 13. American Chemical Society, pp. 5331–5334, 2019. ista: Cavedon C, Madani A, Seeberger PH, Pieber B. 2019. Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters. 21(13), 5331–5334. mla: Cavedon, Cristian, et al. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using Carbon Nitrides.” Organic Letters, vol. 21, no. 13, American Chemical Society, 2019, pp. 5331–34, doi:10.1021/acs.orglett.9b01957. short: C. Cavedon, A. Madani, P.H. Seeberger, B. Pieber, Organic Letters 21 (2019) 5331–5334. date_created: 2022-08-25T11:18:00Z date_published: 2019-07-05T00:00:00Z date_updated: 2023-02-21T10:10:19Z day: '05' doi: 10.1021/acs.orglett.9b01957 extern: '1' external_id: pmid: - '31247752' intvolume: ' 21' issue: '13' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1021/acs.orglett.9b01957 month: '07' oa: 1 oa_version: Published Version page: 5331-5334 pmid: 1 publication: Organic Letters publication_identifier: eissn: - 1523-7052 issn: - 1523-7060 publication_status: published publisher: American Chemical Society quality_controlled: '1' scopus_import: '1' status: public title: Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 21 year: '2019' ... --- _id: '11984' abstract: - lang: eng text: Differentially protected galactosamine building blocks are key components for the synthesis of human and bacterial oligosaccharides. The azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal provides straightforward access to the corresponding 2-nitrogenated glycoside. Poor reproducibility and the use of azides that lead to the formation of potentially explosive and toxic species limit the scalability of this reaction and render it a bottleneck for carbohydrate synthesis. Here, we present a method for the safe, efficient, and reliable azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal at room temperature, using continuous flow chemistry. Careful analysis of the transformation resulted in reaction conditions that produce minimal side products while the reaction time was reduced drastically when compared to batch reactions. The flow setup is readily scalable to process 5 mmol of galactal in 3 h, producing 1.2 mmol/h of product. article_processing_charge: No article_type: letter_note author: - first_name: Mónica full_name: Guberman, Mónica last_name: Guberman - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X - first_name: Peter H. full_name: Seeberger, Peter H. last_name: Seeberger citation: ama: Guberman M, Pieber B, Seeberger PH. Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. Organic Process Research and Development. 2019;23(12):2764-2770. doi:10.1021/acs.oprd.9b00456 apa: Guberman, M., Pieber, B., & Seeberger, P. H. (2019). Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. Organic Process Research and Development. American Chemical Society. https://doi.org/10.1021/acs.oprd.9b00456 chicago: Guberman, Mónica, Bartholomäus Pieber, and Peter H. Seeberger. “Safe and Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine Building Blocks.” Organic Process Research and Development. American Chemical Society, 2019. https://doi.org/10.1021/acs.oprd.9b00456. ieee: M. Guberman, B. Pieber, and P. H. Seeberger, “Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks,” Organic Process Research and Development, vol. 23, no. 12. American Chemical Society, pp. 2764–2770, 2019. ista: Guberman M, Pieber B, Seeberger PH. 2019. Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. Organic Process Research and Development. 23(12), 2764–2770. mla: Guberman, Mónica, et al. “Safe and Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine Building Blocks.” Organic Process Research and Development, vol. 23, no. 12, American Chemical Society, 2019, pp. 2764–70, doi:10.1021/acs.oprd.9b00456. short: M. Guberman, B. Pieber, P.H. Seeberger, Organic Process Research and Development 23 (2019) 2764–2770. date_created: 2022-08-25T11:30:33Z date_published: 2019-12-20T00:00:00Z date_updated: 2023-02-21T10:10:23Z day: '20' doi: 10.1021/acs.oprd.9b00456 extern: '1' intvolume: ' 23' issue: '12' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1021/acs.oprd.9b00456 month: '12' oa: 1 oa_version: Published Version page: 2764-2770 publication: Organic Process Research and Development publication_identifier: eissn: - 1520-586X issn: - 1083-6160 publication_status: published publisher: American Chemical Society quality_controlled: '1' scopus_import: '1' status: public title: Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 23 year: '2019' ... --- _id: '27' abstract: - lang: eng text: The cerebral cortex is composed of a large variety of distinct cell-types including projection neurons, interneurons and glial cells which emerge from distinct neural stem cell (NSC) lineages. The vast majority of cortical projection neurons and certain classes of glial cells are generated by radial glial progenitor cells (RGPs) in a highly orchestrated manner. Recent studies employing single cell analysis and clonal lineage tracing suggest that NSC and RGP lineage progression are regulated in a profound deterministic manner. In this review we focus on recent advances based mainly on correlative phenotypic data emerging from functional genetic studies in mice. We establish hypotheses to test in future research and outline a conceptual framework how epigenetic cues modulate the generation of cell-type diversity during cortical development. This article is protected by copyright. All rights reserved. acknowledgement: " This work was supported by IST Austria institutional funds; NÖ Forschung und Bildung \r\nn[f+b] (C13-002) to SH; a program grant from \ the Human Frontiers Science Program (RGP0053/2014) to SH; the People \ Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement No 618444 to SH, and the European \ Research Council (ERC) under the European Union’s Horizon 2020 research \ and innovation programme (grant agreement No 725780 LinPro)to SH.\r\n" article_processing_charge: Yes (via OA deal) article_type: review author: - first_name: Nicole full_name: Amberg, Nicole id: 4CD6AAC6-F248-11E8-B48F-1D18A9856A87 last_name: Amberg orcid: 0000-0002-3183-8207 - first_name: Susanne full_name: Laukoter, Susanne id: 2D6B7A9A-F248-11E8-B48F-1D18A9856A87 last_name: Laukoter orcid: 0000-0002-7903-3010 - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 citation: ama: Amberg N, Laukoter S, Hippenmeyer S. Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex. Journal of Neurochemistry. 2019;149(1):12-26. doi:10.1111/jnc.14601 apa: Amberg, N., Laukoter, S., & Hippenmeyer, S. (2019). Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex. Journal of Neurochemistry. Wiley. https://doi.org/10.1111/jnc.14601 chicago: Amberg, Nicole, Susanne Laukoter, and Simon Hippenmeyer. “Epigenetic Cues Modulating the Generation of Cell Type Diversity in the Cerebral Cortex.” Journal of Neurochemistry. Wiley, 2019. https://doi.org/10.1111/jnc.14601. ieee: N. Amberg, S. Laukoter, and S. Hippenmeyer, “Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex,” Journal of Neurochemistry, vol. 149, no. 1. Wiley, pp. 12–26, 2019. ista: Amberg N, Laukoter S, Hippenmeyer S. 2019. Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex. Journal of Neurochemistry. 149(1), 12–26. mla: Amberg, Nicole, et al. “Epigenetic Cues Modulating the Generation of Cell Type Diversity in the Cerebral Cortex.” Journal of Neurochemistry, vol. 149, no. 1, Wiley, 2019, pp. 12–26, doi:10.1111/jnc.14601. short: N. Amberg, S. Laukoter, S. Hippenmeyer, Journal of Neurochemistry 149 (2019) 12–26. date_created: 2018-12-11T11:44:14Z date_published: 2019-04-01T00:00:00Z date_updated: 2023-09-11T13:40:26Z day: '01' ddc: - '570' department: - _id: SiHi doi: 10.1111/jnc.14601 ec_funded: 1 external_id: isi: - '000462680200002' file: - access_level: open_access checksum: db027721a95d36f5de36aadcd0bdf7e6 content_type: application/pdf creator: kschuh date_created: 2020-01-07T13:35:52Z date_updated: 2020-07-14T12:45:45Z file_id: '7239' file_name: 2019_Wiley_Amberg.pdf file_size: 889709 relation: main_file file_date_updated: 2020-07-14T12:45:45Z has_accepted_license: '1' intvolume: ' 149' isi: 1 issue: '1' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 12-26 project: - _id: 25D92700-B435-11E9-9278-68D0E5697425 grant_number: LS13-002 name: Mapping Cell-Type Specificity of the Genomic Imprintome in the Brain - _id: 25D7962E-B435-11E9-9278-68D0E5697425 grant_number: RGP0053/2014 name: Quantitative Structure-Function Analysis of Cerebral Cortex Assembly at Clonal Level - _id: 25D61E48-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '618444' name: Molecular Mechanisms of Cerebral Cortex Development - _id: 260018B0-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '725780' name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development publication: Journal of Neurochemistry publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 149 year: '2019' ... --- _id: '301' abstract: - lang: eng text: A representation formula for solutions of stochastic partial differential equations with Dirichlet boundary conditions is proved. The scope of our setting is wide enough to cover the general situation when the backward characteristics that appear in the usual formulation are not even defined in the Itô sense. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Mate full_name: Gerencser, Mate id: 44ECEDF2-F248-11E8-B48F-1D18A9856A87 last_name: Gerencser - first_name: István full_name: Gyöngy, István last_name: Gyöngy citation: ama: Gerencser M, Gyöngy I. A Feynman–Kac formula for stochastic Dirichlet problems. Stochastic Processes and their Applications. 2019;129(3):995-1012. doi:10.1016/j.spa.2018.04.003 apa: Gerencser, M., & Gyöngy, I. (2019). A Feynman–Kac formula for stochastic Dirichlet problems. Stochastic Processes and Their Applications. Elsevier. https://doi.org/10.1016/j.spa.2018.04.003 chicago: Gerencser, Mate, and István Gyöngy. “A Feynman–Kac Formula for Stochastic Dirichlet Problems.” Stochastic Processes and Their Applications. Elsevier, 2019. https://doi.org/10.1016/j.spa.2018.04.003. ieee: M. Gerencser and I. Gyöngy, “A Feynman–Kac formula for stochastic Dirichlet problems,” Stochastic Processes and their Applications, vol. 129, no. 3. Elsevier, pp. 995–1012, 2019. ista: Gerencser M, Gyöngy I. 2019. A Feynman–Kac formula for stochastic Dirichlet problems. Stochastic Processes and their Applications. 129(3), 995–1012. mla: Gerencser, Mate, and István Gyöngy. “A Feynman–Kac Formula for Stochastic Dirichlet Problems.” Stochastic Processes and Their Applications, vol. 129, no. 3, Elsevier, 2019, pp. 995–1012, doi:10.1016/j.spa.2018.04.003. short: M. Gerencser, I. Gyöngy, Stochastic Processes and Their Applications 129 (2019) 995–1012. date_created: 2018-12-11T11:45:42Z date_published: 2019-03-01T00:00:00Z date_updated: 2023-08-24T14:20:49Z day: '01' department: - _id: JaMa doi: 10.1016/j.spa.2018.04.003 external_id: arxiv: - '1611.04177' isi: - '000458945300012' intvolume: ' 129' isi: 1 issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1611.04177 month: '03' oa: 1 oa_version: Preprint page: 995-1012 publication: Stochastic Processes and their Applications publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: A Feynman–Kac formula for stochastic Dirichlet problems type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 129 year: '2019' ... --- _id: '319' abstract: - lang: eng text: We study spaces of modelled distributions with singular behaviour near the boundary of a domain that, in the context of the theory of regularity structures, allow one to give robust solution theories for singular stochastic PDEs with boundary conditions. The calculus of modelled distributions established in Hairer (Invent Math 198(2):269–504, 2014. https://doi.org/10.1007/s00222-014-0505-4) is extended to this setting. We formulate and solve fixed point problems in these spaces with a class of kernels that is sufficiently large to cover in particular the Dirichlet and Neumann heat kernels. These results are then used to provide solution theories for the KPZ equation with Dirichlet and Neumann boundary conditions and for the 2D generalised parabolic Anderson model with Dirichlet boundary conditions. In the case of the KPZ equation with Neumann boundary conditions, we show that, depending on the class of mollifiers one considers, a “boundary renormalisation” takes place. In other words, there are situations in which a certain boundary condition is applied to an approximation to the KPZ equation, but the limiting process is the Hopf–Cole solution to the KPZ equation with a different boundary condition. acknowledgement: "MG thanks the support of the LMS Postdoctoral Mobility Grant.\r\n\r\n" article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Mate full_name: Gerencser, Mate id: 44ECEDF2-F248-11E8-B48F-1D18A9856A87 last_name: Gerencser - first_name: Martin full_name: Hairer, Martin last_name: Hairer citation: ama: Gerencser M, Hairer M. Singular SPDEs in domains with boundaries. Probability Theory and Related Fields. 2019;173(3-4):697–758. doi:10.1007/s00440-018-0841-1 apa: Gerencser, M., & Hairer, M. (2019). Singular SPDEs in domains with boundaries. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-018-0841-1 chicago: Gerencser, Mate, and Martin Hairer. “Singular SPDEs in Domains with Boundaries.” Probability Theory and Related Fields. Springer, 2019. https://doi.org/10.1007/s00440-018-0841-1. ieee: M. Gerencser and M. Hairer, “Singular SPDEs in domains with boundaries,” Probability Theory and Related Fields, vol. 173, no. 3–4. Springer, pp. 697–758, 2019. ista: Gerencser M, Hairer M. 2019. Singular SPDEs in domains with boundaries. Probability Theory and Related Fields. 173(3–4), 697–758. mla: Gerencser, Mate, and Martin Hairer. “Singular SPDEs in Domains with Boundaries.” Probability Theory and Related Fields, vol. 173, no. 3–4, Springer, 2019, pp. 697–758, doi:10.1007/s00440-018-0841-1. short: M. Gerencser, M. Hairer, Probability Theory and Related Fields 173 (2019) 697–758. date_created: 2018-12-11T11:45:48Z date_published: 2019-04-01T00:00:00Z date_updated: 2023-08-24T14:38:32Z day: '01' ddc: - '510' department: - _id: JaMa doi: 10.1007/s00440-018-0841-1 external_id: isi: - '000463613800001' file: - access_level: open_access checksum: 288d16ef7291242f485a9660979486e3 content_type: application/pdf creator: dernst date_created: 2018-12-17T16:25:24Z date_updated: 2020-07-14T12:46:03Z file_id: '5722' file_name: 2018_ProbTheory_Gerencser.pdf file_size: 893182 relation: main_file file_date_updated: 2020-07-14T12:46:03Z has_accepted_license: '1' intvolume: ' 173' isi: 1 issue: 3-4 language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 697–758 project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Probability Theory and Related Fields publication_identifier: eissn: - '14322064' issn: - '01788051' publication_status: published publisher: Springer publist_id: '7546' quality_controlled: '1' scopus_import: '1' status: public title: Singular SPDEs in domains with boundaries tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 173 year: '2019' ... --- _id: '405' abstract: - lang: eng text: We investigate the quantum Jensen divergences from the viewpoint of joint convexity. It turns out that the set of the functions which generate jointly convex quantum Jensen divergences on positive matrices coincides with the Matrix Entropy Class which has been introduced by Chen and Tropp quite recently. acknowledgement: The author was supported by the ISTFELLOW program of the Institute of Science and Technology Austria (project code IC1027FELL01) and partially supported by the Hungarian National Research, Development and Innovation Office – NKFIH (grant no. K124152) article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Daniel full_name: Virosztek, Daniel id: 48DB45DA-F248-11E8-B48F-1D18A9856A87 last_name: Virosztek orcid: 0000-0003-1109-5511 citation: ama: Virosztek D. Jointly convex quantum Jensen divergences. Linear Algebra and Its Applications. 2019;576:67-78. doi:10.1016/j.laa.2018.03.002 apa: Virosztek, D. (2019). Jointly convex quantum Jensen divergences. Linear Algebra and Its Applications. Elsevier. https://doi.org/10.1016/j.laa.2018.03.002 chicago: Virosztek, Daniel. “Jointly Convex Quantum Jensen Divergences.” Linear Algebra and Its Applications. Elsevier, 2019. https://doi.org/10.1016/j.laa.2018.03.002. ieee: D. Virosztek, “Jointly convex quantum Jensen divergences,” Linear Algebra and Its Applications, vol. 576. Elsevier, pp. 67–78, 2019. ista: Virosztek D. 2019. Jointly convex quantum Jensen divergences. Linear Algebra and Its Applications. 576, 67–78. mla: Virosztek, Daniel. “Jointly Convex Quantum Jensen Divergences.” Linear Algebra and Its Applications, vol. 576, Elsevier, 2019, pp. 67–78, doi:10.1016/j.laa.2018.03.002. short: D. Virosztek, Linear Algebra and Its Applications 576 (2019) 67–78. date_created: 2018-12-11T11:46:17Z date_published: 2019-09-01T00:00:00Z date_updated: 2023-08-24T14:31:47Z day: '01' department: - _id: LaEr doi: 10.1016/j.laa.2018.03.002 ec_funded: 1 external_id: arxiv: - '1712.05324' isi: - '000470955300005' intvolume: ' 576' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1712.05324 month: '09' oa: 1 oa_version: Preprint page: 67-78 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Linear Algebra and Its Applications publication_status: published publisher: Elsevier publist_id: '7424' quality_controlled: '1' scopus_import: '1' status: public title: Jointly convex quantum Jensen divergences type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 576 year: '2019' ...