TY - JOUR AB - Observations have revealed that the star formation rate (SFR) and stellar mass (Mstar) of star-forming galaxies follow a tight relation known as the galaxy main sequence. However, what physical information is encoded in this relation is under debate. Here, we use the EAGLE cosmological hydrodynamical simulation to study the mass dependence, evolution, and origin of scatter in the SFR–Mstar relation. At z = 0, we find that the scatter decreases slightly with stellar mass from 0.35 dex at Mstar ≈ 109 M⊙ to 0.30 dex at Mstar ≳ 1010.5 M⊙. The scatter decreases from z = 0 to z = 5 by 0.05 dex at Mstar ≳ 1010 M⊙ and by 0.15 dex for lower masses. We show that the scatter at z = 0.1 originates from a combination of fluctuations on short time-scales (ranging from 0.2–2 Gyr) that are presumably associated with self-regulation from cooling, star formation, and outflows, but is dominated by long time-scale (∼10 Gyr) variations related to differences in halo formation times. Shorter time-scale fluctuations are relatively more important for lower mass galaxies. At high masses, differences in black hole formation efficiency cause additional scatter, but also diminish the scatter caused by different halo formation times. While individual galaxies cross the main sequence multiple times during their evolution, they fluctuate around tracks associated with their halo properties, i.e. galaxies above/below the main sequence at z = 0.1 tend to have been above/below the main sequence for ≫1 Gyr. AU - Matthee, Jorryt J AU - Schaye, Joop ID - 11540 IS - 1 JF - Monthly Notices of the Royal Astronomical Society KW - Space and Planetary Science KW - Astronomy and Astrophysics : galaxies: evolution KW - galaxies: formation KW - galaxies: star formation KW - cosmology: theory SN - 0035-8711 TI - The origin of scatter in the star formation rate–stellar mass relation VL - 484 ER - TY - JOUR AB - 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. AU - Huber, Daniel AU - Chaplin, William J. AU - Chontos, Ashley AU - Kjeldsen, Hans AU - Christensen-Dalsgaard, Jørgen AU - Bedding, Timothy R. AU - Ball, Warrick AU - Brahm, Rafael AU - Espinoza, Nestor AU - Henning, Thomas AU - Jordán, Andrés AU - Sarkis, Paula AU - Knudstrup, Emil AU - Albrecht, Simon AU - Grundahl, Frank AU - Andersen, Mads Fredslund AU - Pallé, Pere L. AU - Crossfield, Ian AU - Fulton, Benjamin AU - Howard, Andrew W. AU - Isaacson, Howard T. AU - Weiss, Lauren M. AU - Handberg, Rasmus AU - Lund, Mikkel N. AU - Serenelli, Aldo M. AU - Rørsted Mosumgaard, Jakob AU - Stokholm, Amalie AU - Bieryla, Allyson AU - Buchhave, Lars A. AU - Latham, David W. AU - Quinn, Samuel N. AU - Gaidos, Eric AU - Hirano, Teruyuki AU - Ricker, George R. AU - Vanderspek, Roland K. AU - Seager, Sara AU - Jenkins, Jon M. AU - Winn, Joshua N. AU - Antia, H. M. AU - Appourchaux, Thierry AU - Basu, Sarbani AU - Bell, Keaton J. AU - Benomar, Othman AU - Bonanno, Alfio AU - Buzasi, Derek L. AU - Campante, Tiago L. AU - Çelik Orhan, Z. AU - Corsaro, Enrico AU - Cunha, Margarida S. AU - Davies, Guy R. AU - Deheuvels, Sebastien AU - Grunblatt, Samuel K. AU - Hasanzadeh, Amir AU - Di Mauro, Maria Pia AU - A. García, Rafael AU - Gaulme, Patrick AU - Girardi, Léo AU - Guzik, Joyce A. AU - Hon, Marc AU - Jiang, Chen AU - Kallinger, Thomas AU - Kawaler, Steven D. AU - Kuszlewicz, James S. AU - Lebreton, Yveline AU - Li, Tanda AU - Lucas, Miles AU - Lundkvist, Mia S. AU - Mann, Andrew W. AU - Mathis, Stéphane AU - Mathur, Savita AU - Mazumdar, Anwesh AU - Metcalfe, Travis S. AU - Miglio, Andrea AU - F. G. Monteiro, Mário J. P. AU - Mosser, Benoit AU - Noll, Anthony AU - Nsamba, Benard AU - Joel Ong, Jia Mian AU - Örtel, S. AU - Pereira, Filipe AU - Ranadive, Pritesh AU - Régulo, Clara AU - Rodrigues, Thaíse S. AU - Roxburgh, Ian W. AU - Aguirre, Victor Silva AU - Smalley, Barry AU - Schofield, Mathew AU - Sousa, Sérgio G. AU - Stassun, Keivan G. AU - Stello, Dennis AU - Tayar, Jamie AU - White, Timothy R. AU - Verma, Kuldeep AU - Vrard, Mathieu AU - Yıldız, M. AU - Baker, David AU - Bazot, Michaël AU - Beichmann, Charles AU - Bergmann, Christoph AU - Bugnet, Lisa Annabelle AU - Cale, Bryson AU - Carlino, Roberto AU - Cartwright, Scott M. AU - Christiansen, Jessie L. AU - Ciardi, David R. AU - Creevey, Orlagh AU - Dittmann, Jason A. AU - Nascimento, Jose-Dias Do AU - Eylen, Vincent Van AU - Fürész, Gabor AU - Gagné, Jonathan AU - Gao, Peter AU - Gazeas, Kosmas AU - Giddens, Frank AU - Hall, Oliver J. AU - Hekker, Saskia AU - Ireland, Michael J. AU - Latouf, Natasha AU - LeBrun, Danny AU - Levine, Alan M. AU - Matzko, William AU - Natinsky, Eva AU - Page, Emma AU - Plavchan, Peter AU - Mansouri-Samani, Masoud AU - McCauliff, Sean AU - Mullally, Susan E. AU - Orenstein, Brendan AU - Soto, Aylin Garcia AU - Paegert, Martin AU - van Saders, Jennifer L. AU - Schnaible, Chloe AU - Soderblom, David R. AU - Szabó, Róbert AU - Tanner, Angelle AU - Tinney, C. G. AU - Teske, Johanna AU - Thomas, Alexandra AU - Trampedach, Regner AU - Wright, Duncan AU - Yuan, Thomas T. AU - Zohrabi, Farzaneh ID - 11616 IS - 6 JF - The Astronomical Journal KW - Space and Planetary Science KW - Astronomy and Astrophysics SN - 0004-6256 TI - A hot Saturn orbiting an oscillating late subgiant discovered by TESS VL - 157 ER - TY - JOUR AB - Over 2,000 stars were observed for 1 month with a high enough cadence in order to look for acoustic modes during the survey phase of the Kepler mission. Solar-like oscillations have been detected in about 540 stars. The question of why no oscillations were detected in the remaining stars is still open. Previous works explained the non-detection of modes with the high level of magnetic activity of the stars. However, the sample of stars studied contained some classical pulsators and red giants that could have biased the results. In this work, we revisit this analysis on a cleaner sample of main-sequence solar-like stars that consists of 1,014 stars. First we compute the predicted amplitude of the modes of that sample and for the stars with detected oscillation and compare it to the noise at high frequency in the power spectrum. We find that the stars with detected modes have an amplitude to noise ratio larger than 0.94. We measure reliable rotation periods and the associated photometric magnetic index for 684 stars out of the full sample and in particular for 323 stars where the amplitude of the modes is predicted to be high enough to be detected. We find that among these 323 stars 32% of them have a level of magnetic activity larger than the Sun during its maximum activity, explaining the non-detection of acoustic modes. Interestingly, magnetic activity cannot be the primary reason responsible for the absence of detectable modes in the remaining 68% of the stars without acoustic modes detected and with reliable rotation periods. Thus, we investigate metallicity, inclination angle of the rotation axis, and binarity as possible causes of low mode amplitudes. Using spectroscopic observations for a subsample, we find that a low metallicity could be the reason for suppressed modes. No clear correlation with binarity nor inclination is found. We also derive the lower limit for our photometric activity index (of 20–30 ppm) below which rotation and magnetic activity are not detected. Finally, with our analysis we conclude that stars with a photometric activity index larger than 2,000 ppm have 98.3% probability of not having oscillations detected. AU - Mathur, Savita AU - García, Rafael A. AU - Bugnet, Lisa Annabelle AU - Santos, Ângela R.G. AU - Santiago, Netsha AU - Beck, Paul G. ID - 11613 JF - Frontiers in Astronomy and Space Sciences KW - Astronomy and Astrophysics TI - Revisiting the impact of stellar magnetic activity on the detectability of solar-like oscillations by Kepler VL - 6 ER - TY - JOUR AB - 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. AU - Hon, Marc AU - Stello, Dennis AU - García, Rafael A AU - Mathur, Savita AU - Sharma, Sanjib AU - Colman, Isabel L AU - Bugnet, Lisa Annabelle ID - 11615 IS - 4 JF - Monthly Notices of the Royal Astronomical Society KW - Space and Planetary Science KW - Astronomy and Astrophysics KW - asteroseismology KW - methods: data analysis KW - techniques: image processing KW - stars: oscillations KW - stars: statistics SN - 0035-8711 TI - A search for red giant solar-like oscillations in all Kepler data VL - 485 ER - TY - JOUR AB - The NASA Transiting Exoplanet Survey Satellite (TESS) is about to provide full-frame images of almost the entire sky. The amount of stellar data to be analysed represents hundreds of millions stars, which is several orders of magnitude more than the number of stars observed by the Convection, Rotation and planetary Transits satellite (CoRoT), and NASA Kepler and K2 missions. We aim at automatically classifying the newly observed stars with near real-time algorithms to better guide the subsequent detailed studies. In this paper, we present a classification algorithm built to recognise solar-like pulsators among classical pulsators. This algorithm relies on the global amount of power contained in the power spectral density (PSD), also known as the flicker in spectral power density (FliPer). Because each type of pulsating star has a characteristic background or pulsation pattern, the shape of the PSD at different frequencies can be used to characterise the type of pulsating star. The FliPer classifier (FliPerClass) uses different FliPer parameters along with the effective temperature as input parameters to feed a ML algorithm in order to automatically classify the pulsating stars observed by TESS. Using noisy TESS-simulated data from the TESS Asteroseismic Science Consortium (TASC), we classify pulsators with a 98% accuracy. Among them, solar-like pulsating stars are recognised with a 99% accuracy, which is of great interest for a further seismic analysis of these stars, which are like our Sun. Similar results are obtained when we trained our classifier and applied it to 27-day subsets of real Kepler data. FliPerClass is part of the large TASC classification pipeline developed by the TESS Data for Asteroseismology (T’DA) classification working group. AU - Bugnet, Lisa Annabelle AU - García, R. A. AU - Mathur, S. AU - Davies, G. R. AU - Hall, O. J. AU - Lund, M. N. AU - Rendle, B. M. ID - 11614 JF - Astronomy & Astrophysics KW - Space and Planetary Science KW - Astronomy and Astrophysics SN - 0004-6361 TI - FliPerClass: In search of solar-like pulsators among TESS targets VL - 624 ER - TY - JOUR AB - 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. AU - Santos, A. R. G. AU - García, R. A. AU - Mathur, S. AU - Bugnet, Lisa Annabelle AU - van Saders, J. L. AU - Metcalfe, T. S. AU - Simonian, G. V. A. AU - Pinsonneault, M. H. ID - 11623 IS - 1 JF - The Astrophysical Journal Supplement Series KW - Space and Planetary Science KW - Astronomy and Astrophysics KW - methods: data analysis KW - stars: activity KW - stars: low-mass KW - stars: rotation KW - starspots KW - techniques: photometric SN - 0067-0049 TI - Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars VL - 244 ER - TY - GEN AB - 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. AU - Breton, S. N. AU - Bugnet, Lisa Annabelle AU - Santos, A. R. G. AU - Saux, A. Le AU - Mathur, S. AU - Palle, P. L. AU - Garcia, R. A. ID - 11627 KW - asteroseismology KW - rotation KW - solar-like stars KW - kepler KW - machine learning KW - random forest T2 - arXiv TI - Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques ER - TY - GEN AB - 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. AU - Saux, A. Le AU - Bugnet, Lisa Annabelle AU - Mathur, S. AU - Breton, S. N. AU - Garcia, R. A. ID - 11630 KW - asteroseismology - methods KW - data analysis - thecniques KW - machine learning - stars KW - oscillations T2 - arXiv TI - Automatic classification of K2 pulsating stars using machine learning techniques ER - TY - CONF AB - 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. This 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: - 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. - 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. AU - Ancona, Bertie AU - Henzinger, Monika H AU - Roditty, Liam AU - Williams, Virginia Vassilevska AU - Wein, Nicole ID - 11826 SN - 1868-8969 T2 - 46th International Colloquium on Automata, Languages, and Programming TI - Algorithms and hardness for diameter in dynamic graphs VL - 132 ER - TY - CONF AB - 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. AU - Henzinger, Monika H AU - Neumann, Stefan AU - Schmid, Stefan ID - 11850 SN - 978-1-4503-6678-6 T2 - SIGMETRICS'19: International Conference on Measurement and Modeling of Computer Systems TI - Efficient distributed workload (re-)embedding ER - TY - CHAP AB - 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. AU - Biedermann, Sonja AU - Henzinger, Monika H AU - Schulz, Christian AU - Schuster, Bernhard ED - Canzar, Stefan ED - Rojas Ringeling, Francisca ID - 11847 SN - 1064-3745 T2 - Protein-Protein Interaction Networks TI - Vienna Graph Clustering VL - 2074 ER - TY - CONF AB - 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. AU - Bhattacharya, Sayan AU - Henzinger, Monika H AU - Nanongkai, Danupon ID - 11853 SN - 2575-8454 T2 - 60th Annual Symposium on Foundations of Computer Science TI - A new deterministic algorithm for dynamic set cover ER - TY - CONF AB - 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. AU - Henzinger, Monika H AU - Noe, Alexander AU - Schulz, Christian ID - 11851 SN - 978-1-7281-1247-3 T2 - 33rd International Parallel and Distributed Processing Symposium TI - Shared-memory exact minimum cuts ER - TY - CONF AB - 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. AU - Daga, Mohit AU - Henzinger, Monika H AU - Nanongkai, Danupon AU - Saranurak, Thatchaphol ID - 11865 SN - 0737-8017 T2 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing TI - Distributed edge connectivity in sublinear time ER - TY - CONF AB - 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. In this paper we present the first polylogarithmic high-probability worst-case time bounds for the dynamic spanner and the dynamic maximal matching problem. 1. For 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.) 2. For 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. Our 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)). Thus 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. AU - Bernstein, Aaron AU - Forster, Sebastian AU - Henzinger, Monika H ID - 11871 T2 - 30th Annual ACM-SIAM Symposium on Discrete Algorithms TI - A deamortization approach for dynamic spanner and dynamic maximal matching ER - TY - JOUR AB - 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. (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). (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). For 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. AU - Bhattacharya, Sayan AU - Henzinger, Monika H AU - Neumann, Stefan ID - 11898 JF - Theoretical Computer Science SN - 0304-3975 TI - New amortized cell-probe lower bounds for dynamic problems VL - 779 ER - TY - JOUR AB - 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. AU - Pieber, Bartholomäus AU - Malik, Jamal A. AU - Cavedon, Cristian AU - Gisbertz, Sebastian AU - Savateev, Aleksandr AU - Cruz, Daniel AU - Heil, Tobias AU - Zhang, Guigang AU - Seeberger, Peter H. ID - 11957 IS - 28 JF - Angewandte Chemie International Edition SN - 1433-7851 TI - Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides VL - 58 ER - TY - JOUR AB - 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. AU - Guberman, Mónica AU - Pieber, Bartholomäus AU - Seeberger, Peter H. ID - 11984 IS - 12 JF - Organic Process Research and Development SN - 1083-6160 TI - Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks VL - 23 ER - TY - JOUR AB - 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. AU - Cavedon, Cristian AU - Madani, Amiera AU - Seeberger, Peter H. AU - Pieber, Bartholomäus ID - 11982 IS - 13 JF - Organic Letters SN - 1523-7060 TI - Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides VL - 21 ER - TY - JOUR AB - Upper and lower bounds, of the expected order of magnitude, are obtained for the number of rational points of bounded height on any quartic del Pezzo surface over ℚ that contains a conic defined over ℚ . AU - Browning, Timothy D AU - Sofos, Efthymios ID - 170 IS - 3-4 JF - Mathematische Annalen TI - Counting rational points on quartic del Pezzo surfaces with a rational conic VL - 373 ER -