[{"type":"journal_article","abstract":[{"lang":"eng","text":"We study the properties of the maximal volume k-dimensional sections of the n-dimensional cube [−1, 1]n. We obtain a first order necessary condition for a k-dimensional subspace to be a local maximizer of the volume of such sections, which we formulate in a geometric way. We estimate the length of the projection of a vector of the standard basis of Rn onto a k-dimensional subspace that maximizes the volume of the intersection. We \u001cnd the optimal upper bound on the volume of a planar section of the cube [−1, 1]n , n ≥ 2."}],"language":[{"iso":"eng"}],"quality_controlled":"1","status":"public","date_updated":"2023-08-17T07:07:58Z","scopus_import":"1","author":[{"full_name":"Ivanov, Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","last_name":"Ivanov","first_name":"Grigory"},{"last_name":"Tsiutsiurupa","first_name":"Igor","full_name":"Tsiutsiurupa, Igor"}],"acknowledgement":"The authors acknowledge the support of the grant of the Russian Government N 075-15-\r\n2019-1926. G.I.was supported also by the SwissNational Science Foundation grant 200021-179133. The authors are very grateful to the anonymous reviewer for valuable remarks.","isi":1,"intvolume":"         9","file_date_updated":"2022-03-18T09:31:59Z","publication":"Analysis and Geometry in Metric Spaces","date_created":"2022-03-18T09:25:14Z","year":"2021","publication_status":"published","oa_version":"Published Version","citation":{"short":"G. Ivanov, I. Tsiutsiurupa, Analysis and Geometry in Metric Spaces 9 (2021) 1–18.","apa":"Ivanov, G., &#38; Tsiutsiurupa, I. (2021). On the volume of sections of the cube. <i>Analysis and Geometry in Metric Spaces</i>. De Gruyter. <a href=\"https://doi.org/10.1515/agms-2020-0103\">https://doi.org/10.1515/agms-2020-0103</a>","mla":"Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.” <i>Analysis and Geometry in Metric Spaces</i>, vol. 9, no. 1, De Gruyter, 2021, pp. 1–18, doi:<a href=\"https://doi.org/10.1515/agms-2020-0103\">10.1515/agms-2020-0103</a>.","chicago":"Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.” <i>Analysis and Geometry in Metric Spaces</i>. De Gruyter, 2021. <a href=\"https://doi.org/10.1515/agms-2020-0103\">https://doi.org/10.1515/agms-2020-0103</a>.","ama":"Ivanov G, Tsiutsiurupa I. On the volume of sections of the cube. <i>Analysis and Geometry in Metric Spaces</i>. 2021;9(1):1-18. doi:<a href=\"https://doi.org/10.1515/agms-2020-0103\">10.1515/agms-2020-0103</a>","ista":"Ivanov G, Tsiutsiurupa I. 2021. On the volume of sections of the cube. Analysis and Geometry in Metric Spaces. 9(1), 1–18.","ieee":"G. Ivanov and I. Tsiutsiurupa, “On the volume of sections of the cube,” <i>Analysis and Geometry in Metric Spaces</i>, vol. 9, no. 1. De Gruyter, pp. 1–18, 2021."},"month":"01","ddc":["510"],"publisher":"De Gruyter","date_published":"2021-01-29T00:00:00Z","_id":"10856","title":"On the volume of sections of the cube","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"UlWa"}],"fulldoi":"https://doi.org/10.1515/agms-2020-0103","page":"1-18","publication_identifier":{"issn":["2299-3274"]},"day":"29","arxiv":1,"issue":"1","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)"},"file":[{"content_type":"application/pdf","file_id":"10857","date_created":"2022-03-18T09:31:59Z","file_size":789801,"file_name":"2021_AnalysisMetricSpaces_Ivanov.pdf","checksum":"7e615ac8489f5eae580b6517debfdc53","creator":"dernst","access_level":"open_access","success":1,"relation":"main_file","date_updated":"2022-03-18T09:31:59Z"}],"keyword":["Applied Mathematics","Geometry and Topology","Analysis"],"oa":1,"doi":"10.1515/agms-2020-0103","volume":9,"has_accepted_license":"1","article_type":"original","external_id":{"arxiv":["2004.02674"],"isi":["000734286800001"]},"article_processing_charge":"No"},{"oa":1,"doi":"10.1051/0004-6361/202039947","keyword":["Space and Planetary Science","Astronomy and Astrophysics","methods: data analysis / stars: solar-type / stars: activity / stars: rotation / starspots"],"article_processing_charge":"No","external_id":{"arxiv":["2101.10152"]},"article_type":"original","volume":647,"main_file_link":[{"url":"https://arxiv.org/abs/2101.10152","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"ROOSTER: A machine-learning analysis tool for Kepler stellar rotation periods","_id":"11608","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"arxiv":1,"day":"19","fulldoi":"https://doi.org/10.1051/0004-6361/202039947","publication_status":"published","year":"2021","date_created":"2022-07-18T12:21:32Z","publication":"Astronomy & Astrophysics","intvolume":"       647","acknowledgement":"We thank Suzanne Aigrain and Joe Llama for providing us with the simulated data used in Aigrain et al. (2015). S. N. B., L. B. and R. A. G. acknowledge the support from PLATO and GOLF CNES grants. A. R. G. S. acknowledges the support from NASA under grant NNX17AF27G. S. M. acknowledges the support from the Spanish Ministry of Science and Innovation with the Ramon y Cajal fellowship number RYC-2015-17697. P. L. P. and S. M. acknowledge support from the Spanish Ministry of Science and Innovation with the grant number PID2019-107187GB-I00. 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. Software: Python (Van Rossum & Drake 2009), numpy (Oliphant 2006), pandas (The pandas development team 2020; McKinney 2010), matplotlib (Hunter 2007), scikit-learn (Pedregosa et al. 2011). The source code used to obtain the present results can be found at: https://gitlab.com/sybreton/pushkin ; https://gitlab.com/sybreton/ml_surface_rotation_paper .","article_number":"A125","date_published":"2021-03-19T00:00:00Z","publisher":"EDP Sciences","extern":"1","month":"03","citation":{"ista":"Breton SN, Santos ARG, Bugnet LA, Mathur S, García RA, Pallé PL. 2021. ROOSTER: A machine-learning analysis tool for Kepler stellar rotation periods. Astronomy &#38; Astrophysics. 647, A125.","ieee":"S. N. Breton, A. R. G. Santos, L. A. Bugnet, S. Mathur, R. A. García, and P. L. Pallé, “ROOSTER: A machine-learning analysis tool for Kepler stellar rotation periods,” <i>Astronomy &#38; Astrophysics</i>, vol. 647. EDP Sciences, 2021.","ama":"Breton SN, Santos ARG, Bugnet LA, Mathur S, García RA, Pallé PL. ROOSTER: A machine-learning analysis tool for Kepler stellar rotation periods. <i>Astronomy &#38; Astrophysics</i>. 2021;647. doi:<a href=\"https://doi.org/10.1051/0004-6361/202039947\">10.1051/0004-6361/202039947</a>","short":"S.N. Breton, A.R.G. Santos, L.A. Bugnet, S. Mathur, R.A. García, P.L. Pallé, Astronomy &#38; Astrophysics 647 (2021).","mla":"Breton, S. N., et al. “ROOSTER: A Machine-Learning Analysis Tool for Kepler Stellar Rotation Periods.” <i>Astronomy &#38; Astrophysics</i>, vol. 647, A125, EDP Sciences, 2021, doi:<a href=\"https://doi.org/10.1051/0004-6361/202039947\">10.1051/0004-6361/202039947</a>.","chicago":"Breton, S. N., A. R. G. Santos, Lisa Annabelle Bugnet, S. Mathur, R. A. García, and P. L. Pallé. “ROOSTER: A Machine-Learning Analysis Tool for Kepler Stellar Rotation Periods.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2021. <a href=\"https://doi.org/10.1051/0004-6361/202039947\">https://doi.org/10.1051/0004-6361/202039947</a>.","apa":"Breton, S. N., Santos, A. R. G., Bugnet, L. A., Mathur, S., García, R. A., &#38; Pallé, P. L. (2021). ROOSTER: A machine-learning analysis tool for Kepler stellar rotation periods. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202039947\">https://doi.org/10.1051/0004-6361/202039947</a>"},"oa_version":"Preprint","quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"abstract":[{"text":"In order to understand stellar evolution, it is crucial to efficiently determine stellar surface rotation periods. Indeed, while they are of great importance in stellar models, angular momentum transport processes inside stars are still poorly understood today. Surface rotation, which is linked to the age of the star, is one of the constraints needed to improve the way those processes are modelled. Statistics of the surface rotation periods for a large sample of stars of different spectral types are thus necessary. An efficient tool to automatically determine reliable rotation periods is needed when dealing with large samples of stellar photometric datasets. The objective of this work is to develop such a tool. For this purpose, machine learning classifiers constitute relevant bases to build our new methodology. Random forest learning abilities are exploited to automate the extraction of rotation periods in Kepler light curves. Rotation periods and complementary parameters are obtained via three different methods: a wavelet analysis, the autocorrelation function of the light curve, and the composite spectrum. We trained three different classifiers: one to detect if rotational modulations are present in the light curve, one to flag close binary or classical pulsators candidates that can bias our rotation period determination, and finally one classifier to provide the final rotation period. We tested our machine learning pipeline on 23 431 stars of the Kepler K and M dwarf reference rotation catalogue for which 60% of the stars have been visually inspected. For the sample of 21 707 stars where all the input parameters are provided to the algorithm, 94.2% of them are correctly classified (as rotating or not). Among the stars that have a rotation period in the reference catalogue, the machine learning provides a period that agrees within 10% of the reference value for 95.3% of the stars. Moreover, the yield of correct rotation periods is raised to 99.5% after visually inspecting 25.2% of the stars. Over the two main analysis steps, rotation classification and period selection, the pipeline yields a global agreement with the reference values of 92.1% and 96.9% before and after visual inspection. Random forest classifiers are efficient tools to determine reliable rotation periods in large samples of stars. The methodology presented here could be easily adapted to extract surface rotation periods for stars with different spectral types or observed by other instruments such as K2, TESS or by PLATO in the near future.","lang":"eng"}],"type":"journal_article","author":[{"first_name":"S. N.","last_name":"Breton","full_name":"Breton, S. N."},{"full_name":"Santos, A. R. G.","first_name":"A. R. G.","last_name":"Santos"},{"orcid":"0000-0003-0142-4000","last_name":"Bugnet","first_name":"Lisa Annabelle","full_name":"Bugnet, Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501"},{"first_name":"S.","last_name":"Mathur","full_name":"Mathur, S."},{"full_name":"García, R. A.","first_name":"R. A.","last_name":"García"},{"full_name":"Pallé, P. L.","last_name":"Pallé","first_name":"P. L."}],"scopus_import":"1","date_updated":"2022-08-22T08:47:47Z"},{"issue":"6","corr_author":"1","oa":1,"doi":"10.1016/j.jfa.2020.108848","keyword":["Analysis"],"volume":280,"main_file_link":[{"url":"https://doi.org/10.1016/j.jfa.2020.108848","open_access":"1"}],"article_type":"original","article_processing_charge":"No","_id":"15261","title":"Uniqueness of form extensions and domination of semigroups","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JaMa"}],"fulldoi":"https://doi.org/10.1016/j.jfa.2020.108848","publication_identifier":{"issn":["0022-1236"],"eissn":["1096-0783"]},"day":"15","intvolume":"       280","article_number":"108848","publication_status":"published","date_created":"2024-04-03T07:24:57Z","year":"2021","publication":"Journal of Functional Analysis","oa_version":"Published Version","citation":{"short":"D. Lenz, M. Schmidt, M. Wirth, Journal of Functional Analysis 280 (2021).","apa":"Lenz, D., Schmidt, M., &#38; Wirth, M. (2021). Uniqueness of form extensions and domination of semigroups. <i>Journal of Functional Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jfa.2020.108848\">https://doi.org/10.1016/j.jfa.2020.108848</a>","chicago":"Lenz, Daniel, Marcel Schmidt, and Melchior Wirth. “Uniqueness of Form Extensions and Domination of Semigroups.” <i>Journal of Functional Analysis</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.jfa.2020.108848\">https://doi.org/10.1016/j.jfa.2020.108848</a>.","mla":"Lenz, Daniel, et al. “Uniqueness of Form Extensions and Domination of Semigroups.” <i>Journal of Functional Analysis</i>, vol. 280, no. 6, 108848, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.jfa.2020.108848\">10.1016/j.jfa.2020.108848</a>.","ama":"Lenz D, Schmidt M, Wirth M. Uniqueness of form extensions and domination of semigroups. <i>Journal of Functional Analysis</i>. 2021;280(6). doi:<a href=\"https://doi.org/10.1016/j.jfa.2020.108848\">10.1016/j.jfa.2020.108848</a>","ista":"Lenz D, Schmidt M, Wirth M. 2021. Uniqueness of form extensions and domination of semigroups. Journal of Functional Analysis. 280(6), 108848.","ieee":"D. Lenz, M. Schmidt, and M. Wirth, “Uniqueness of form extensions and domination of semigroups,” <i>Journal of Functional Analysis</i>, vol. 280, no. 6. Elsevier, 2021."},"publisher":"Elsevier","ddc":["500"],"month":"03","date_published":"2021-03-15T00:00:00Z","OA_place":"publisher","type":"journal_article","language":[{"iso":"eng"}],"abstract":[{"text":"In this article, we study uniqueness of form extensions in a rather general setting. The method is based on the theory of ordered Hilbert spaces and the concept of domination of semigroups. Our main abstract result transfers uniqueness of form extension of a dominating form to that of a dominated form. This result can be applied to a multitude of examples including various magnetic Schrödinger forms on graphs and on manifolds.","lang":"eng"}],"status":"public","quality_controlled":"1","OA_type":"free access","scopus_import":"1","date_updated":"2026-06-18T17:46:54Z","author":[{"full_name":"Lenz, Daniel","last_name":"Lenz","first_name":"Daniel"},{"full_name":"Schmidt, Marcel","last_name":"Schmidt","first_name":"Marcel"},{"full_name":"Wirth, Melchior","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E","last_name":"Wirth","first_name":"Melchior","orcid":"0000-0002-0519-4241"}]},{"_id":"10549","title":"Optimal homogenization rates in stochastic homogenization of nonlinear uniformly elliptic equations and systems","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"JuFi"}],"fulldoi":"https://doi.org/10.1007/s00205-021-01686-9","arxiv":1,"publication_identifier":{"eissn":["1432-0673"],"issn":["0003-9527"]},"page":"343-452","day":"30","issue":"1","file":[{"content_type":"application/pdf","file_id":"10558","date_created":"2021-12-16T14:58:08Z","file_name":"2021_ArchRatMechAnalysis_Fischer.pdf","file_size":1640121,"checksum":"cc830b739aed83ca2e32c4e0ce266a4c","creator":"cchlebak","access_level":"open_access","success":1,"date_updated":"2021-12-16T14:58:08Z","relation":"main_file"}],"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)"},"keyword":["Mechanical Engineering","Mathematics (miscellaneous)","Analysis"],"oa":1,"doi":"10.1007/s00205-021-01686-9","volume":242,"has_accepted_license":"1","article_type":"original","external_id":{"isi":["000668431200001"],"arxiv":["1908.02273"]},"article_processing_charge":"Yes (via OA deal)","type":"journal_article","abstract":[{"text":"We derive optimal-order homogenization rates for random nonlinear elliptic PDEs with monotone nonlinearity in the uniformly elliptic case. More precisely, for a random monotone operator on \\mathbb {R}^d with stationary law (that is spatially homogeneous statistics) and fast decay of correlations on scales larger than the microscale \\varepsilon >0, we establish homogenization error estimates of the order \\varepsilon in case d\\geqq 3, and of the order \\varepsilon |\\log \\varepsilon |^{1/2} in case d=2. Previous results in nonlinear stochastic homogenization have been limited to a small algebraic rate of convergence \\varepsilon ^\\delta . We also establish error estimates for the approximation of the homogenized operator by the method of representative volumes of the order (L/\\varepsilon )^{-d/2} for a representative volume of size L. Our results also hold in the case of systems for which a (small-scale) C^{1,\\alpha } regularity theory is available.","lang":"eng"}],"language":[{"iso":"eng"}],"status":"public","quality_controlled":"1","date_updated":"2023-08-17T06:23:21Z","scopus_import":"1","author":[{"id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","full_name":"Fischer, Julian L","first_name":"Julian L","last_name":"Fischer","orcid":"0000-0002-0479-558X"},{"last_name":"Neukamm","first_name":"Stefan","full_name":"Neukamm, Stefan"}],"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). SN acknowledges partial support by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – project number 405009441.","isi":1,"intvolume":"       242","file_date_updated":"2021-12-16T14:58:08Z","year":"2021","publication":"Archive for Rational Mechanics and Analysis","date_created":"2021-12-16T12:12:33Z","publication_status":"published","oa_version":"Published Version","citation":{"short":"J.L. Fischer, S. Neukamm, Archive for Rational Mechanics and Analysis 242 (2021) 343–452.","mla":"Fischer, Julian L., and Stefan Neukamm. “Optimal Homogenization Rates in Stochastic Homogenization of Nonlinear Uniformly Elliptic Equations and Systems.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 242, no. 1, Springer Nature, 2021, pp. 343–452, doi:<a href=\"https://doi.org/10.1007/s00205-021-01686-9\">10.1007/s00205-021-01686-9</a>.","chicago":"Fischer, Julian L, and Stefan Neukamm. “Optimal Homogenization Rates in Stochastic Homogenization of Nonlinear Uniformly Elliptic Equations and Systems.” <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00205-021-01686-9\">https://doi.org/10.1007/s00205-021-01686-9</a>.","apa":"Fischer, J. L., &#38; Neukamm, S. (2021). Optimal homogenization rates in stochastic homogenization of nonlinear uniformly elliptic equations and systems. <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00205-021-01686-9\">https://doi.org/10.1007/s00205-021-01686-9</a>","ieee":"J. L. Fischer and S. Neukamm, “Optimal homogenization rates in stochastic homogenization of nonlinear uniformly elliptic equations and systems,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 242, no. 1. Springer Nature, pp. 343–452, 2021.","ista":"Fischer JL, Neukamm S. 2021. Optimal homogenization rates in stochastic homogenization of nonlinear uniformly elliptic equations and systems. Archive for Rational Mechanics and Analysis. 242(1), 343–452.","ama":"Fischer JL, Neukamm S. Optimal homogenization rates in stochastic homogenization of nonlinear uniformly elliptic equations and systems. <i>Archive for Rational Mechanics and Analysis</i>. 2021;242(1):343-452. doi:<a href=\"https://doi.org/10.1007/s00205-021-01686-9\">10.1007/s00205-021-01686-9</a>"},"month":"06","ddc":["530"],"publisher":"Springer Nature","date_published":"2021-06-30T00:00:00Z"},{"quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"abstract":[{"text":"We consider the sum of two large Hermitian matrices A and B with a Haar unitary conjugation bringing them into a general relative position. We prove that the eigenvalue density on the scale slightly above the local eigenvalue spacing is asymptotically given by the free additive convolution of the laws of A and B as the dimension of the matrix increases. This implies optimal rigidity of the eigenvalues and optimal rate of convergence in Voiculescu's theorem. Our previous works [4], [5] established these results in the bulk spectrum, the current paper completely settles the problem at the spectral edges provided they have the typical square-root behavior. The key element of our proof is to compensate the deterioration of the stability of the subordination equations by sharp error estimates that properly account for the local density near the edge. Our results also hold if the Haar unitary matrix is replaced by the Haar orthogonal matrix.","lang":"eng"}],"type":"journal_article","author":[{"id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","full_name":"Bao, Zhigang","first_name":"Zhigang","last_name":"Bao","orcid":"0000-0003-3036-1475"},{"last_name":"Erdös","first_name":"László","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603"},{"last_name":"Schnelli","first_name":"Kevin","full_name":"Schnelli, Kevin"}],"scopus_import":"1","date_updated":"2025-04-15T08:05:01Z","publication_status":"published","year":"2020","publication":"Journal of Functional Analysis","date_created":"2022-03-18T10:18:59Z","intvolume":"       279","acknowledgement":"Partially supported by ERC Advanced Grant RANMAT No. 338804.","isi":1,"article_number":"108639","date_published":"2020-10-15T00:00:00Z","publisher":"Elsevier","month":"10","citation":{"ama":"Bao Z, Erdös L, Schnelli K. Spectral rigidity for addition of random matrices at the regular edge. <i>Journal of Functional Analysis</i>. 2020;279(7). doi:<a href=\"https://doi.org/10.1016/j.jfa.2020.108639\">10.1016/j.jfa.2020.108639</a>","ista":"Bao Z, Erdös L, Schnelli K. 2020. Spectral rigidity for addition of random matrices at the regular edge. Journal of Functional Analysis. 279(7), 108639.","ieee":"Z. Bao, L. Erdös, and K. Schnelli, “Spectral rigidity for addition of random matrices at the regular edge,” <i>Journal of Functional Analysis</i>, vol. 279, no. 7. Elsevier, 2020.","apa":"Bao, Z., Erdös, L., &#38; Schnelli, K. (2020). Spectral rigidity for addition of random matrices at the regular edge. <i>Journal of Functional Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jfa.2020.108639\">https://doi.org/10.1016/j.jfa.2020.108639</a>","mla":"Bao, Zhigang, et al. “Spectral Rigidity for Addition of Random Matrices at the Regular Edge.” <i>Journal of Functional Analysis</i>, vol. 279, no. 7, 108639, Elsevier, 2020, doi:<a href=\"https://doi.org/10.1016/j.jfa.2020.108639\">10.1016/j.jfa.2020.108639</a>.","chicago":"Bao, Zhigang, László Erdös, and Kevin Schnelli. “Spectral Rigidity for Addition of Random Matrices at the Regular Edge.” <i>Journal of Functional Analysis</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.jfa.2020.108639\">https://doi.org/10.1016/j.jfa.2020.108639</a>.","short":"Z. Bao, L. Erdös, K. Schnelli, Journal of Functional Analysis 279 (2020)."},"oa_version":"Preprint","ec_funded":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Spectral rigidity for addition of random matrices at the regular edge","_id":"10862","publication_identifier":{"issn":["0022-1236"]},"arxiv":1,"day":"15","fulldoi":"https://doi.org/10.1016/j.jfa.2020.108639","department":[{"_id":"LaEr"}],"oa":1,"doi":"10.1016/j.jfa.2020.108639","project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"keyword":["Analysis"],"corr_author":"1","issue":"7","article_processing_charge":"No","external_id":{"isi":["000559623200009"],"arxiv":["1708.01597"]},"article_type":"original","volume":279,"main_file_link":[{"url":"https://arxiv.org/abs/1708.01597","open_access":"1"}]},{"date_published":"2020-09-05T00:00:00Z","month":"09","extern":"1","publisher":"Elsevier","citation":{"apa":"Koudjinan, E. (2020). A KAM theorem for finitely differentiable Hamiltonian systems. <i>Journal of Differential Equations</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jde.2020.03.044\">https://doi.org/10.1016/j.jde.2020.03.044</a>","chicago":"Koudjinan, Edmond. “A KAM Theorem for Finitely Differentiable Hamiltonian Systems.” <i>Journal of Differential Equations</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.jde.2020.03.044\">https://doi.org/10.1016/j.jde.2020.03.044</a>.","mla":"Koudjinan, Edmond. “A KAM Theorem for Finitely Differentiable Hamiltonian Systems.” <i>Journal of Differential Equations</i>, vol. 269, no. 6, Elsevier, 2020, pp. 4720–50, doi:<a href=\"https://doi.org/10.1016/j.jde.2020.03.044\">10.1016/j.jde.2020.03.044</a>.","short":"E. Koudjinan, Journal of Differential Equations 269 (2020) 4720–4750.","ama":"Koudjinan E. A KAM theorem for finitely differentiable Hamiltonian systems. <i>Journal of Differential Equations</i>. 2020;269(6):4720-4750. doi:<a href=\"https://doi.org/10.1016/j.jde.2020.03.044\">10.1016/j.jde.2020.03.044</a>","ista":"Koudjinan E. 2020. A KAM theorem for finitely differentiable Hamiltonian systems. Journal of Differential Equations. 269(6), 4720–4750.","ieee":"E. Koudjinan, “A KAM theorem for finitely differentiable Hamiltonian systems,” <i>Journal of Differential Equations</i>, vol. 269, no. 6. Elsevier, pp. 4720–4750, 2020."},"oa_version":"Preprint","date_created":"2020-10-21T15:03:05Z","year":"2020","publication":"Journal of Differential Equations","publication_status":"published","intvolume":"       269","author":[{"last_name":"Koudjinan","first_name":"Edmond","full_name":"Koudjinan, Edmond","id":"52DF3E68-AEFA-11EA-95A4-124A3DDC885E","orcid":"0000-0003-2640-4049"}],"date_updated":"2021-01-12T08:20:33Z","quality_controlled":"1","status":"public","abstract":[{"lang":"eng","text":"Given l>2ν>2d≥4, we prove the persistence of a Cantor--family of KAM tori of measure O(ε1/2−ν/l) for any non--degenerate nearly integrable Hamiltonian system of class Cl(D×Td), where D⊂Rd is a bounded domain, provided that the size ε of the perturbation is sufficiently small. This extends a result by D. Salamon in \\cite{salamon2004kolmogorov} according to which we do have the persistence of a single KAM torus in the same framework. Moreover, it is well--known that, for the persistence of a single torus, the regularity assumption can not be improved."}],"language":[{"iso":"eng"}],"type":"journal_article","article_processing_charge":"No","article_type":"original","external_id":{"arxiv":["1909.04099"]},"main_file_link":[{"url":"https://arxiv.org/abs/1909.04099","open_access":"1"}],"volume":269,"keyword":["Analysis"],"oa":1,"doi":"10.1016/j.jde.2020.03.044","issue":"6","day":"05","page":"4720-4750","publication_identifier":{"issn":["0022-0396"]},"arxiv":1,"fulldoi":"https://doi.org/10.1016/j.jde.2020.03.044","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A KAM theorem for finitely differentiable Hamiltonian systems","_id":"8691"},{"author":[{"orcid":"0000-0003-0002-1867","last_name":"Cubero","first_name":"Ryan J","full_name":"Cubero, Ryan J","id":"850B2E12-9CD4-11E9-837F-E719E6697425"},{"full_name":"Marsili, Matteo","first_name":"Matteo","last_name":"Marsili"},{"last_name":"Roudi","first_name":"Yasser","full_name":"Roudi, Yasser"}],"scopus_import":"1","date_updated":"2025-04-14T07:44:02Z","status":"public","quality_controlled":"1","language":[{"iso":"eng"}],"abstract":[{"text":"Neuronal responses to complex stimuli and tasks can encompass a wide range of time scales. Understanding these responses requires measures that characterize how the information on these response patterns are represented across multiple temporal resolutions. In this paper we propose a metric – which we call multiscale relevance (MSR) – to capture the dynamical variability of the activity of single neurons across different time scales. The MSR is a non-parametric, fully featureless indicator in that it uses only the time stamps of the firing activity without resorting to any a priori covariate or invoking any specific structure in the tuning curve for neural activity. When applied to neural data from the mEC and from the ADn and PoS regions of freely-behaving rodents, we found that neurons having low MSR tend to have low mutual information and low firing sparsity across the correlates that are believed to be encoded by the region of the brain where the recordings were made. In addition, neurons with high MSR contain significant information on spatial navigation and allow to decode spatial position or head direction as efficiently as those neurons whose firing activity has high mutual information with the covariate to be decoded and significantly better than the set of neurons with high local variations in their interspike intervals. Given these results, we propose that the MSR can be used as a measure to rank and select neurons for their information content without the need to appeal to any a priori covariate.","lang":"eng"}],"type":"journal_article","date_published":"2020-02-01T00:00:00Z","publisher":"Springer Nature","ddc":["004","519","570"],"month":"02","citation":{"ama":"Cubero RJ, Marsili M, Roudi Y. Multiscale relevance and informative encoding in neuronal spike trains. <i>Journal of Computational Neuroscience</i>. 2020;48:85-102. doi:<a href=\"https://doi.org/10.1007/s10827-020-00740-x\">10.1007/s10827-020-00740-x</a>","ieee":"R. J. Cubero, M. Marsili, and Y. Roudi, “Multiscale relevance and informative encoding in neuronal spike trains,” <i>Journal of Computational Neuroscience</i>, vol. 48. Springer Nature, pp. 85–102, 2020.","ista":"Cubero RJ, Marsili M, Roudi Y. 2020. Multiscale relevance and informative encoding in neuronal spike trains. Journal of Computational Neuroscience. 48, 85–102.","short":"R.J. Cubero, M. Marsili, Y. Roudi, Journal of Computational Neuroscience 48 (2020) 85–102.","apa":"Cubero, R. J., Marsili, M., &#38; Roudi, Y. (2020). Multiscale relevance and informative encoding in neuronal spike trains. <i>Journal of Computational Neuroscience</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10827-020-00740-x\">https://doi.org/10.1007/s10827-020-00740-x</a>","mla":"Cubero, Ryan J., et al. “Multiscale Relevance and Informative Encoding in Neuronal Spike Trains.” <i>Journal of Computational Neuroscience</i>, vol. 48, Springer Nature, 2020, pp. 85–102, doi:<a href=\"https://doi.org/10.1007/s10827-020-00740-x\">10.1007/s10827-020-00740-x</a>.","chicago":"Cubero, Ryan J, Matteo Marsili, and Yasser Roudi. “Multiscale Relevance and Informative Encoding in Neuronal Spike Trains.” <i>Journal of Computational Neuroscience</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s10827-020-00740-x\">https://doi.org/10.1007/s10827-020-00740-x</a>."},"oa_version":"Published Version","publication_status":"published","year":"2020","publication":"Journal of Computational Neuroscience","date_created":"2020-01-28T10:34:00Z","file_date_updated":"2020-07-14T12:47:56Z","intvolume":"        48","acknowledgement":"This research was supported by the Kavli Foundation and the Centre of Excellence scheme of the Research Council of Norway (Centre for Neural Computation). RJC is currently receiving funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411.","isi":1,"publication_identifier":{"eissn":["1573-6873"],"issn":["0929-5313"]},"page":"85-102","day":"01","fulldoi":"https://doi.org/10.1007/s10827-020-00740-x","department":[{"_id":"SaSi"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","ec_funded":1,"title":"Multiscale relevance and informative encoding in neuronal spike trains","_id":"7369","article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000515321800006"]},"article_type":"original","volume":48,"has_accepted_license":"1","doi":"10.1007/s10827-020-00740-x","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"oa":1,"keyword":["Time series analysis","Multiple time scale analysis","Spike train data","Information theory","Bayesian decoding"],"file":[{"access_level":"open_access","date_updated":"2020-07-14T12:47:56Z","relation":"supplementary_material","file_id":"7380","date_created":"2020-01-28T09:31:09Z","content_type":"application/pdf","creator":"rcubero","checksum":"036e9451d6cd0c190ad25791bf82393b","file_size":1941355,"file_name":"10827_2020_740_MOESM1_ESM.pdf"},{"access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:47:56Z","date_created":"2020-01-28T09:31:09Z","file_id":"7381","content_type":"application/pdf","checksum":"4dd8b1fd4b54486f79d82ac7b2a412b2","creator":"rcubero","file_size":3257880,"file_name":"Cubero2020_Article_MultiscaleRelevanceAndInformat.pdf"}],"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)"},"corr_author":"1"},{"oa_version":"Published Version","citation":{"short":"R. Grah, (2020).","apa":"Grah, R. (2020). Matlab scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression regulation. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7383\">https://doi.org/10.15479/AT:ISTA:7383</a>","chicago":"Grah, Rok. “Matlab Scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression Regulation.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:7383\">https://doi.org/10.15479/AT:ISTA:7383</a>.","mla":"Grah, Rok. <i>Matlab Scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression Regulation</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7383\">10.15479/AT:ISTA:7383</a>.","ama":"Grah R. Matlab scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression regulation. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7383\">10.15479/AT:ISTA:7383</a>","ieee":"R. Grah, “Matlab scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression regulation.” Institute of Science and Technology Austria, 2020.","ista":"Grah R. 2020. Matlab scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression regulation, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:7383\">10.15479/AT:ISTA:7383</a>."},"has_accepted_license":"1","date_published":"2020-01-28T00:00:00Z","article_processing_charge":"No","month":"01","publisher":"Institute of Science and Technology Austria","corr_author":"1","file_date_updated":"2020-07-14T12:47:57Z","year":"2020","keyword":["Matlab scripts","analysis of microfluidics","mathematical model"],"date_created":"2020-01-28T10:41:49Z","oa":1,"contributor":[{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_leader","first_name":"Calin C","last_name":"Guet","orcid":"0000-0001-6220-2052"}],"doi":"10.15479/AT:ISTA:7383","file":[{"content_type":"application/zip","date_created":"2020-01-28T10:39:40Z","file_id":"7384","file_size":73363365,"file_name":"Scripts.zip","checksum":"9d292cf5207b3829225f44c044cdb3fd","creator":"rgrah","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:47:57Z"},{"file_id":"7385","date_created":"2020-01-28T10:39:30Z","content_type":"text/plain","checksum":"4076ceab32ef588cc233802bab24c1ab","creator":"rgrah","file_size":962,"file_name":"READ_ME_MAIN.txt","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:47:57Z"}],"date_updated":"2025-06-12T07:34:12Z","fulldoi":"https://doi.org/10.15479/AT:ISTA:7383","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"day":"28","author":[{"orcid":"0000-0003-2539-3560","last_name":"Grah","first_name":"Rok","full_name":"Grah, Rok","id":"483E70DE-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"7652"}]},"abstract":[{"text":"Organisms cope with change by employing transcriptional regulators. However, when faced with rare environments, the evolution of transcriptional regulators and their promoters may be too slow. We ask whether the intrinsic instability of gene duplication and amplification provides a generic alternative to canonical gene regulation. By real-time monitoring of gene copy number mutations in E. coli, we show that gene duplications and amplifications enable adaptation to fluctuating environments by rapidly generating copy number, and hence expression level, polymorphism. This ‘amplification-mediated gene expression tuning’ occurs on timescales similar to canonical gene regulation and can deal with rapid environmental changes. Mathematical modeling shows that amplifications also tune gene expression in stochastic environments where transcription factor-based schemes are hard to evolve or maintain. The fleeting nature of gene amplifications gives rise to a generic population-level mechanism that relies on genetic heterogeneity to rapidly tune expression of any gene, without leaving any genomic signature.","lang":"eng"}],"title":"Matlab scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression regulation","type":"research_data","_id":"7383","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public"},{"publication":"SIAM Journal on Mathematical Analysis","year":"2020","date_created":"2021-08-06T07:34:16Z","publication_status":"published","acknowledgement":"We are grateful for the hospitality at the Mittag-Leffler Institute, where part of this work has been done. The work of the authors was supported by the European Research Council (ERC)under the European Union's Horizon 2020 research and innovation programme grant 694227.","isi":1,"intvolume":"        52","date_published":"2020-02-12T00:00:00Z","ddc":["510"],"month":"02","publisher":"Society for Industrial and Applied Mathematics","oa_version":"Preprint","citation":{"ista":"Feliciangeli D, Seiringer R. 2020. Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball. SIAM Journal on Mathematical Analysis. 52(1), 605–622.","ieee":"D. Feliciangeli and R. Seiringer, “Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 52, no. 1. Society for Industrial and Applied Mathematics, pp. 605–622, 2020.","ama":"Feliciangeli D, Seiringer R. Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball. <i>SIAM Journal on Mathematical Analysis</i>. 2020;52(1):605-622. doi:<a href=\"https://doi.org/10.1137/19m126284x\">10.1137/19m126284x</a>","short":"D. Feliciangeli, R. Seiringer, SIAM Journal on Mathematical Analysis 52 (2020) 605–622.","mla":"Feliciangeli, Dario, and Robert Seiringer. “Uniqueness and Nondegeneracy of Minimizers of the Pekar Functional on a Ball.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 52, no. 1, Society for Industrial and Applied Mathematics, 2020, pp. 605–22, doi:<a href=\"https://doi.org/10.1137/19m126284x\">10.1137/19m126284x</a>.","chicago":"Feliciangeli, Dario, and Robert Seiringer. “Uniqueness and Nondegeneracy of Minimizers of the Pekar Functional on a Ball.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics, 2020. <a href=\"https://doi.org/10.1137/19m126284x\">https://doi.org/10.1137/19m126284x</a>.","apa":"Feliciangeli, D., &#38; Seiringer, R. (2020). Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/19m126284x\">https://doi.org/10.1137/19m126284x</a>"},"status":"public","quality_controlled":"1","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"9733"}]},"abstract":[{"text":"We consider the Pekar functional on a ball in ℝ3. We prove uniqueness of minimizers, and a quadratic lower bound in terms of the distance to the minimizer. The latter follows from nondegeneracy of the Hessian at the minimum.","lang":"eng"}],"language":[{"iso":"eng"}],"type":"journal_article","author":[{"first_name":"Dario","last_name":"Feliciangeli","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","full_name":"Feliciangeli, Dario","orcid":"0000-0003-0754-8530"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","first_name":"Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521"}],"date_updated":"2026-07-06T14:02:25Z","scopus_import":"1","keyword":["Applied Mathematics","Computational Mathematics","Analysis"],"doi":"10.1137/19m126284x","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227"}],"oa":1,"tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"corr_author":"1","issue":"1","article_processing_charge":"No","external_id":{"isi":["000546967700022"],"arxiv":["1904.08647 "]},"article_type":"original","das_tickbox":"1","main_file_link":[{"url":"https://arxiv.org/abs/1904.08647","open_access":"1"}],"volume":52,"has_accepted_license":"1","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball","_id":"9781","day":"12","publication_identifier":{"eissn":["1095-7154"],"issn":["0036-1410"]},"arxiv":1,"page":"605-622","fulldoi":"https://doi.org/10.1137/19m126284x","department":[{"_id":"RoSe"}]},{"date_updated":"2022-08-22T07:35:19Z","scopus_import":"1","author":[{"full_name":"Hon, Marc","last_name":"Hon","first_name":"Marc"},{"full_name":"Stello, Dennis","first_name":"Dennis","last_name":"Stello"},{"first_name":"Rafael A","last_name":"García","full_name":"García, Rafael A"},{"full_name":"Mathur, Savita","last_name":"Mathur","first_name":"Savita"},{"full_name":"Sharma, Sanjib","first_name":"Sanjib","last_name":"Sharma"},{"full_name":"Colman, Isabel L","first_name":"Isabel L","last_name":"Colman"},{"orcid":"0000-0003-0142-4000","first_name":"Lisa Annabelle","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","full_name":"Bugnet, Lisa Annabelle"}],"type":"journal_article","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."}],"language":[{"iso":"eng"}],"quality_controlled":"1","status":"public","citation":{"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.","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.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2019. <a href=\"https://doi.org/10.1093/mnras/stz622\">https://doi.org/10.1093/mnras/stz622</a>.","mla":"Hon, Marc, et al. “A Search for Red Giant Solar-like Oscillations in All Kepler Data.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 485, no. 4, Oxford University Press, 2019, pp. 5616–30, doi:<a href=\"https://doi.org/10.1093/mnras/stz622\">10.1093/mnras/stz622</a>.","apa":"Hon, M., Stello, D., García, R. A., Mathur, S., Sharma, S., Colman, I. L., &#38; Bugnet, L. A. (2019). A search for red giant solar-like oscillations in all Kepler data. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stz622\">https://doi.org/10.1093/mnras/stz622</a>","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.","ieee":"M. Hon <i>et al.</i>, “A search for red giant solar-like oscillations in all Kepler data,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 485, no. 4. Oxford University Press, pp. 5616–5630, 2019.","ama":"Hon M, Stello D, García RA, et al. A search for red giant solar-like oscillations in all Kepler data. <i>Monthly Notices of the Royal Astronomical Society</i>. 2019;485(4):5616-5630. doi:<a href=\"https://doi.org/10.1093/mnras/stz622\">10.1093/mnras/stz622</a>"},"oa_version":"Preprint","extern":"1","month":"06","publisher":"Oxford University Press","date_published":"2019-06-01T00:00:00Z","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.","intvolume":"       485","year":"2019","publication":"Monthly Notices of the Royal Astronomical Society","date_created":"2022-07-18T14:26:03Z","publication_status":"published","fulldoi":"https://doi.org/10.1093/mnras/stz622","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"arxiv":1,"day":"01","page":"5616-5630","_id":"11615","title":"A search for red giant solar-like oscillations in all Kepler data","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1903.00115"}],"volume":485,"external_id":{"arxiv":["1903.00115"]},"article_type":"original","article_processing_charge":"No","issue":"4","keyword":["Space and Planetary Science","Astronomy and Astrophysics","asteroseismology","methods: data analysis","techniques: image processing","stars: oscillations","stars: statistics"],"doi":"10.1093/mnras/stz622","oa":1},{"language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"type":"journal_article","quality_controlled":"1","status":"public","scopus_import":"1","date_updated":"2022-08-22T08:10:38Z","author":[{"last_name":"Santos","first_name":"A. R. G.","full_name":"Santos, A. R. G."},{"full_name":"García, R. A.","last_name":"García","first_name":"R. A."},{"first_name":"S.","last_name":"Mathur","full_name":"Mathur, S."},{"last_name":"Bugnet","first_name":"Lisa Annabelle","full_name":"Bugnet, Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501","orcid":"0000-0003-0142-4000"},{"last_name":"van Saders","first_name":"J. L.","full_name":"van Saders, J. L."},{"first_name":"T. S.","last_name":"Metcalfe","full_name":"Metcalfe, T. S."},{"last_name":"Simonian","first_name":"G. V. A.","full_name":"Simonian, G. V. A."},{"first_name":"M. H.","last_name":"Pinsonneault","full_name":"Pinsonneault, M. H."}],"intvolume":"       244","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","publication_status":"published","date_created":"2022-07-19T09:21:58Z","year":"2019","publication":"The Astrophysical Journal Supplement Series","oa_version":"Preprint","citation":{"ieee":"A. R. G. Santos <i>et al.</i>, “Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars,” <i>The Astrophysical Journal Supplement Series</i>, 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.","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. <i>The Astrophysical Journal Supplement Series</i>. 2019;244(1). doi:<a href=\"https://doi.org/10.3847/1538-4365/ab3b56\">10.3847/1538-4365/ab3b56</a>","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.” <i>The Astrophysical Journal Supplement Series</i>. IOP Publishing, 2019. <a href=\"https://doi.org/10.3847/1538-4365/ab3b56\">https://doi.org/10.3847/1538-4365/ab3b56</a>.","mla":"Santos, A. R. G., et al. “Surface Rotation and Photometric Activity for Kepler Targets. I. M and K Main-Sequence Stars.” <i>The Astrophysical Journal Supplement Series</i>, vol. 244, no. 1, 21, IOP Publishing, 2019, doi:<a href=\"https://doi.org/10.3847/1538-4365/ab3b56\">10.3847/1538-4365/ab3b56</a>.","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. <i>The Astrophysical Journal Supplement Series</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/1538-4365/ab3b56\">https://doi.org/10.3847/1538-4365/ab3b56</a>","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_published":"2019-09-19T00:00:00Z","publisher":"IOP Publishing","extern":"1","month":"09","title":"Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars","_id":"11623","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.3847/1538-4365/ab3b56","arxiv":1,"day":"19","publication_identifier":{"issn":["0067-0049"]},"issue":"1","doi":"10.3847/1538-4365/ab3b56","oa":1,"keyword":["Space and Planetary Science","Astronomy and Astrophysics","methods: data analysis","stars: activity","stars: low-mass","stars: rotation","starspots","techniques: photometric"],"volume":244,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.05222"}],"article_processing_charge":"No","external_id":{"arxiv":["1908.05222"]},"article_type":"original"},{"extern":"1","month":"06","external_id":{"arxiv":["1906.09611"]},"date_published":"2019-06-23T00:00:00Z","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1906.09611"}],"citation":{"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,” <i>arXiv</i>. .","ista":"Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification of K2 pulsating stars using machine learning techniques. arXiv, 1906.09611.","ama":"Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification of K2 pulsating stars using machine learning techniques. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1906.09611\">10.48550/arXiv.1906.09611</a>","short":"A.L. Saux, L.A. Bugnet, S. Mathur, S.N. Breton, R.A. Garcia, ArXiv (n.d.).","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.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1906.09611\">https://doi.org/10.48550/arXiv.1906.09611</a>.","mla":"Saux, A. Le, et al. “Automatic Classification of K2 Pulsating Stars Using Machine Learning Techniques.” <i>ArXiv</i>, 1906.09611, doi:<a href=\"https://doi.org/10.48550/arXiv.1906.09611\">10.48550/arXiv.1906.09611</a>.","apa":"Saux, A. L., Bugnet, L. A., Mathur, S., Breton, S. N., &#38; Garcia, R. A. (n.d.). Automatic classification of K2 pulsating stars using machine learning techniques. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1906.09611\">https://doi.org/10.48550/arXiv.1906.09611</a>"},"oa_version":"Preprint","date_created":"2022-07-21T06:57:10Z","publication":"arXiv","keyword":["asteroseismology - methods","data analysis - thecniques","machine learning - stars","oscillations"],"year":"2019","doi":"10.48550/arXiv.1906.09611","oa":1,"publication_status":"submitted","article_number":"1906.09611","author":[{"full_name":"Saux, A. Le","last_name":"Saux","first_name":"A. Le"},{"first_name":"Lisa Annabelle","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","full_name":"Bugnet, Lisa Annabelle","orcid":"0000-0003-0142-4000"},{"full_name":"Mathur, S.","first_name":"S.","last_name":"Mathur"},{"last_name":"Breton","first_name":"S. N.","full_name":"Breton, S. N."},{"last_name":"Garcia","first_name":"R. A.","full_name":"Garcia, R. A."}],"day":"23","arxiv":1,"date_updated":"2022-08-22T08:20:29Z","fulldoi":"https://doi.org/10.48550/arXiv.1906.09611","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","_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."}],"language":[{"iso":"eng"}],"title":"Automatic classification of K2 pulsating stars using machine learning techniques"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"_id":"6035","title":"JuliaReach: A toolbox for set-based reachability","page":"39-44","publication_identifier":{"isbn":["9781450362825"]},"arxiv":1,"day":"16","department":[{"_id":"ToHe"}],"fulldoi":"https://doi.org/10.1145/3302504.3311804","file":[{"content_type":"application/pdf","file_id":"6067","date_created":"2019-03-05T09:27:18Z","file_name":"hscc19.pdf","file_size":3784414,"checksum":"28ed56439aea5991c3122d4730fd828f","creator":"cschilli","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:47:17Z"}],"project":[{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"}],"oa":1,"doi":"10.1145/3302504.3311804","keyword":["reachability analysis","hybrid systems","lazy computation"],"conference":{"name":"HSCC: Hybrid Systems - Computation and Control","start_date":"2019-04-16","location":"Montreal, QC, Canada","end_date":"2019-04-18"},"external_id":{"isi":["000516713900005"],"arxiv":["1901.10736"]},"article_processing_charge":"No","has_accepted_license":"1","volume":22,"status":"public","quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We present JuliaReach, a toolbox for set-based reachability analysis of dynamical systems. JuliaReach consists of two main packages: Reachability, containing implementations of reachability algorithms for continuous and hybrid systems, and LazySets, a standalone library that implements state-of-the-art algorithms for calculus with convex sets. The library offers both concrete and lazy set representations, where the latter stands for the ability to delay set computations until they are needed. The choice of the programming language Julia and the accompanying documentation of our toolbox allow researchers to easily translate set-based algorithms from mathematics to software in a platform-independent way, while achieving runtime performance that is comparable to statically compiled languages. Combining lazy operations in high dimensions and explicit computations in low dimensions, JuliaReach can be applied to solve complex, large-scale problems."}],"author":[{"full_name":"Bogomolov, Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","last_name":"Bogomolov","first_name":"Sergiy","orcid":"0000-0002-0686-0365"},{"last_name":"Forets","first_name":"Marcelo","full_name":"Forets, Marcelo"},{"full_name":"Frehse, Goran","first_name":"Goran","last_name":"Frehse"},{"full_name":"Potomkin, Kostiantyn","last_name":"Potomkin","first_name":"Kostiantyn"},{"orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","full_name":"Schilling, Christian","first_name":"Christian","last_name":"Schilling"}],"scopus_import":"1","date_updated":"2025-07-10T11:53:09Z","publication_status":"published","year":"2019","publication":"Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control","date_created":"2019-02-18T14:43:28Z","intvolume":"        22","isi":1,"file_date_updated":"2020-07-14T12:47:17Z","publisher":"ACM","ddc":["000"],"month":"04","date_published":"2019-04-16T00:00:00Z","citation":{"chicago":"Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin, and Christian Schilling. “JuliaReach: A Toolbox for Set-Based Reachability.” In <i>Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control</i>, 22:39–44. ACM, 2019. <a href=\"https://doi.org/10.1145/3302504.3311804\">https://doi.org/10.1145/3302504.3311804</a>.","mla":"Bogomolov, Sergiy, et al. “JuliaReach: A Toolbox for Set-Based Reachability.” <i>Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control</i>, vol. 22, ACM, 2019, pp. 39–44, doi:<a href=\"https://doi.org/10.1145/3302504.3311804\">10.1145/3302504.3311804</a>.","apa":"Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., &#38; Schilling, C. (2019). JuliaReach: A toolbox for set-based reachability. In <i>Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control</i> (Vol. 22, pp. 39–44). Montreal, QC, Canada: ACM. <a href=\"https://doi.org/10.1145/3302504.3311804\">https://doi.org/10.1145/3302504.3311804</a>","short":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, C. Schilling, in:, Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control, ACM, 2019, pp. 39–44.","ieee":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, and C. Schilling, “JuliaReach: A toolbox for set-based reachability,” in <i>Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control</i>, Montreal, QC, Canada, 2019, vol. 22, pp. 39–44.","ista":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. 2019. JuliaReach: A toolbox for set-based reachability. Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control vol. 22, 39–44.","ama":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. JuliaReach: A toolbox for set-based reachability. In: <i>Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control</i>. Vol 22. ACM; 2019:39-44. doi:<a href=\"https://doi.org/10.1145/3302504.3311804\">10.1145/3302504.3311804</a>"},"oa_version":"Submitted Version"},{"day":"12","publication_identifier":{"issn":["0003-9527","1432-0673"]},"page":"799-836","fulldoi":"https://doi.org/10.1007/s00205-019-01368-7","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8418","title":"Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem","article_type":"original","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s00205-019-01368-7"}],"volume":233,"keyword":["Mechanical Engineering","Mathematics (miscellaneous)","Analysis"],"doi":"10.1007/s00205-019-01368-7","oa":1,"issue":"2","author":[{"full_name":"Guardia, Marcel","first_name":"Marcel","last_name":"Guardia"},{"full_name":"Kaloshin, Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","last_name":"Kaloshin","first_name":"Vadim","orcid":"0000-0002-6051-2628"},{"first_name":"Jianlu","last_name":"Zhang","full_name":"Zhang, Jianlu"}],"date_updated":"2021-01-12T08:19:09Z","quality_controlled":"1","status":"public","type":"journal_article","abstract":[{"lang":"eng","text":"For the Restricted Circular Planar 3 Body Problem, we show that there exists an open set U in phase space of fixed measure, where the set of initial points which lead to collision is O(μ120) dense as μ→0."}],"language":[{"iso":"eng"}],"month":"03","extern":"1","publisher":"Springer Nature","date_published":"2019-03-12T00:00:00Z","oa_version":"Published Version","citation":{"ista":"Guardia M, Kaloshin V, Zhang J. 2019. Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem. Archive for Rational Mechanics and Analysis. 233(2), 799–836.","ieee":"M. Guardia, V. Kaloshin, and J. Zhang, “Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 233, no. 2. Springer Nature, pp. 799–836, 2019.","ama":"Guardia M, Kaloshin V, Zhang J. Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem. <i>Archive for Rational Mechanics and Analysis</i>. 2019;233(2):799-836. doi:<a href=\"https://doi.org/10.1007/s00205-019-01368-7\">10.1007/s00205-019-01368-7</a>","mla":"Guardia, Marcel, et al. “Asymptotic Density of Collision Orbits in the Restricted Circular Planar 3 Body Problem.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 233, no. 2, Springer Nature, 2019, pp. 799–836, doi:<a href=\"https://doi.org/10.1007/s00205-019-01368-7\">10.1007/s00205-019-01368-7</a>.","chicago":"Guardia, Marcel, Vadim Kaloshin, and Jianlu Zhang. “Asymptotic Density of Collision Orbits in the Restricted Circular Planar 3 Body Problem.” <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/s00205-019-01368-7\">https://doi.org/10.1007/s00205-019-01368-7</a>.","apa":"Guardia, M., Kaloshin, V., &#38; Zhang, J. (2019). Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem. <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00205-019-01368-7\">https://doi.org/10.1007/s00205-019-01368-7</a>","short":"M. Guardia, V. Kaloshin, J. Zhang, Archive for Rational Mechanics and Analysis 233 (2019) 799–836."},"date_created":"2020-09-17T10:41:51Z","publication":"Archive for Rational Mechanics and Analysis","year":"2019","publication_status":"published","intvolume":"       233"},{"corr_author":"1","oa":1,"doi":"10.15479/AT:ISTA:6473","keyword":["Information estimation","Time-series","data analysis"],"file":[{"content_type":"application/zip","date_created":"2019-05-23T11:18:16Z","file_id":"6480","file_name":"Thesis_Cepeda.zip","file_size":23937464,"checksum":"75f9184c1346e10a5de5f9cc7338309a","creator":"scepeda","access_level":"closed","relation":"source_file","date_updated":"2020-07-14T12:47:31Z"},{"creator":"scepeda","checksum":"afdc0633ddbd71d5b13550d7fb4f4454","file_size":16646985,"file_name":"CepedaThesis.pdf","date_created":"2019-05-23T11:18:13Z","file_id":"6481","content_type":"application/pdf","date_updated":"2020-07-14T12:47:31Z","relation":"main_file","access_level":"open_access"}],"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)"},"has_accepted_license":"1","article_processing_charge":"No","alternative_title":["ISTA Thesis"],"title":"Estimating information flow in single cells","_id":"6473","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/AT:ISTA:6473","department":[{"_id":"GaTk"}],"supervisor":[{"full_name":"Tkačik, Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkačik","first_name":"Gašper","orcid":"0000-0002-6699-1455"}],"page":"135","day":"23","publication_identifier":{"issn":["2663-337X"]},"file_date_updated":"2020-07-14T12:47:31Z","publication_status":"published","date_created":"2019-05-21T00:11:23Z","year":"2019","oa_version":"Published Version","citation":{"ieee":"S. A. Cepeda Humerez, “Estimating information flow in single cells,” Institute of Science and Technology Austria, 2019.","ista":"Cepeda Humerez SA. 2019. Estimating information flow in single cells. Institute of Science and Technology Austria.","ama":"Cepeda Humerez SA. Estimating information flow in single cells. 2019. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6473\">10.15479/AT:ISTA:6473</a>","short":"S.A. Cepeda Humerez, Estimating Information Flow in Single Cells, Institute of Science and Technology Austria, 2019.","mla":"Cepeda Humerez, Sarah A. <i>Estimating Information Flow in Single Cells</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6473\">10.15479/AT:ISTA:6473</a>.","chicago":"Cepeda Humerez, Sarah A. “Estimating Information Flow in Single Cells.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/AT:ISTA:6473\">https://doi.org/10.15479/AT:ISTA:6473</a>.","apa":"Cepeda Humerez, S. A. (2019). <i>Estimating information flow in single cells</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:6473\">https://doi.org/10.15479/AT:ISTA:6473</a>"},"date_published":"2019-05-23T00:00:00Z","publisher":"Institute of Science and Technology Austria","ddc":["004"],"month":"05","language":[{"iso":"eng"}],"related_material":{"record":[{"id":"2016","relation":"dissertation_contains","status":"public"},{"relation":"dissertation_contains","id":"281","status":"public"},{"id":"1576","relation":"dissertation_contains","status":"public"},{"relation":"dissertation_contains","id":"6900","status":"public"}]},"abstract":[{"text":"Single cells are constantly interacting with their environment and each other, more importantly, the accurate perception of environmental cues is crucial for growth, survival, and reproduction. This communication between cells and their environment can be formalized in mathematical terms and be quantified as the information flow between them, as prescribed by information theory. \r\nThe recent availability of real–time dynamical patterns of signaling molecules in single cells has allowed us to identify encoding about the identity of the environment in the time–series. However, efficient estimation of the information transmitted by these signals has been a data–analysis challenge due to the high dimensionality of the trajectories and the limited number of samples. In the first part of this thesis, we develop and evaluate decoding–based estimation methods to lower bound the mutual information and derive model–based precise information estimates for biological reaction networks governed by the chemical master equation. This is followed by applying the decoding-based methods to study the intracellular representation of extracellular changes in budding yeast, by observing the transient dynamics of nuclear translocation of 10 transcription factors in response to 3 stress conditions. Additionally, we apply these estimators to previously published data on ERK and Ca2+ signaling and yeast stress response. We argue that this single cell decoding-based measure of information provides an unbiased, quantitative and interpretable measure for the fidelity of biological signaling processes. \r\nFinally, in the last section, we deal with gene regulation which is primarily controlled by transcription factors (TFs) that bind to the DNA to activate gene expression. The possibility that non-cognate TFs activate transcription diminishes the accuracy of regulation with potentially disastrous effects for the cell. This ’crosstalk’ acts as a previously unexplored source of noise in biochemical networks and puts a strong constraint on their performance. To mitigate erroneous initiation we propose an out of equilibrium scheme that implements kinetic proofreading. We show that such architectures are favored  over their equilibrium counterparts for complex organisms despite introducing noise in gene expression. ","lang":"eng"}],"OA_place":"publisher","type":"dissertation","status":"public","date_updated":"2026-04-16T08:37:38Z","author":[{"full_name":"Cepeda Humerez, Sarah A","id":"3DEE19A4-F248-11E8-B48F-1D18A9856A87","last_name":"Cepeda Humerez","first_name":"Sarah A"}]},{"intvolume":"        39","isi":1,"acknowledgement":"The second author has been partially supported by INdAM through the GNAMPA Research\r\nProject (2017) “Sistemi stocastici singolari: buona posizione e problemi di controllo”. The third\r\nauthor was partly funded by the Austrian Science Fund (FWF) project F 65.","publication_status":"published","date_created":"2022-03-18T12:33:34Z","year":"2019","publication":"Discrete and Continuous Dynamical Systems","oa_version":"Preprint","citation":{"ista":"Flandoli F, Priola E, Zanco GA. 2019. A mean-field model with discontinuous coefficients for neurons with spatial interaction. Discrete and Continuous Dynamical Systems. 39(6), 3037–3067.","ieee":"F. Flandoli, E. Priola, and G. A. Zanco, “A mean-field model with discontinuous coefficients for neurons with spatial interaction,” <i>Discrete and Continuous Dynamical Systems</i>, vol. 39, no. 6. AIMS, pp. 3037–3067, 2019.","ama":"Flandoli F, Priola E, Zanco GA. A mean-field model with discontinuous coefficients for neurons with spatial interaction. <i>Discrete and Continuous Dynamical Systems</i>. 2019;39(6):3037-3067. doi:<a href=\"https://doi.org/10.3934/dcds.2019126\">10.3934/dcds.2019126</a>","mla":"Flandoli, Franco, et al. “A Mean-Field Model with Discontinuous Coefficients for Neurons with Spatial Interaction.” <i>Discrete and Continuous Dynamical Systems</i>, vol. 39, no. 6, AIMS, 2019, pp. 3037–67, doi:<a href=\"https://doi.org/10.3934/dcds.2019126\">10.3934/dcds.2019126</a>.","chicago":"Flandoli, Franco, Enrico Priola, and Giovanni A Zanco. “A Mean-Field Model with Discontinuous Coefficients for Neurons with Spatial Interaction.” <i>Discrete and Continuous Dynamical Systems</i>. AIMS, 2019. <a href=\"https://doi.org/10.3934/dcds.2019126\">https://doi.org/10.3934/dcds.2019126</a>.","apa":"Flandoli, F., Priola, E., &#38; Zanco, G. A. (2019). A mean-field model with discontinuous coefficients for neurons with spatial interaction. <i>Discrete and Continuous Dynamical Systems</i>. AIMS. <a href=\"https://doi.org/10.3934/dcds.2019126\">https://doi.org/10.3934/dcds.2019126</a>","short":"F. Flandoli, E. Priola, G.A. Zanco, Discrete and Continuous Dynamical Systems 39 (2019) 3037–3067."},"date_published":"2019-06-01T00:00:00Z","publisher":"AIMS","month":"06","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Starting from a microscopic model for a system of neurons evolving in time which individually follow a stochastic integrate-and-fire type model, we study a mean-field limit of the system. Our model is described by a system of SDEs with discontinuous coefficients for the action potential of each neuron and takes into account the (random) spatial configuration of neurons allowing the interaction to depend on it. In the limit as the number of particles tends to infinity, we obtain a nonlinear Fokker-Planck type PDE in two variables, with derivatives only with respect to one variable and discontinuous coefficients. We also study strong well-posedness of the system of SDEs and prove the existence and uniqueness of a weak measure-valued solution to the PDE, obtained as the limit of the laws of the empirical measures for the system of particles."}],"type":"journal_article","quality_controlled":"1","status":"public","scopus_import":"1","date_updated":"2026-08-12T06:18:59Z","author":[{"last_name":"Flandoli","first_name":"Franco","full_name":"Flandoli, Franco"},{"full_name":"Priola, Enrico","first_name":"Enrico","last_name":"Priola"},{"id":"47491882-F248-11E8-B48F-1D18A9856A87","full_name":"Zanco, Giovanni A","first_name":"Giovanni A","last_name":"Zanco","orcid":"0000-0002-4680-9740"}],"corr_author":"1","issue":"6","oa":1,"doi":"10.3934/dcds.2019126","project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"}],"keyword":["Applied Mathematics","Discrete Mathematics and Combinatorics","Analysis"],"volume":39,"main_file_link":[{"url":"https://arxiv.org/abs/1708.04156","open_access":"1"}],"article_processing_charge":"No","article_type":"original","external_id":{"isi":["000459954800003"],"arxiv":["1708.04156"]},"title":"A mean-field model with discontinuous coefficients for neurons with spatial interaction","_id":"10878","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.3934/dcds.2019126","department":[{"_id":"JaMa"}],"day":"01","arxiv":1,"publication_identifier":{"issn":["1553-5231"]},"page":"3037-3067"},{"status":"public","quality_controlled":"1","type":"conference","related_material":{"record":[{"id":"5457","relation":"earlier_version","status":"public"},{"relation":"dissertation_contains","id":"8934","status":"public"}]},"abstract":[{"text":"We consider the problem of expected cost analysis over nondeterministic probabilistic programs,\r\nwhich aims at automated methods for analyzing the resource-usage of such programs.\r\nPrevious approaches for this problem could only handle nonnegative bounded costs.\r\nHowever, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols,\r\nboth positive and negative costs are necessary and the costs are unbounded as well.\r\n\r\nIn this work, we present a sound and efficient approach to obtain polynomial bounds on the\r\nexpected accumulated cost of nondeterministic probabilistic programs.\r\nOur approach can handle (a) general positive and negative costs with bounded updates in\r\nvariables; and (b) nonnegative costs with general updates to variables.\r\nWe show that several natural examples which could not be\r\nhandled by previous approaches are captured in our framework.\r\n\r\nMoreover, our approach leads to an efficient polynomial-time algorithm, while no\r\nprevious approach for cost analysis of probabilistic programs could guarantee polynomial runtime.\r\nFinally, we show the effectiveness of our approach using experimental results on a variety of programs for which we efficiently synthesize tight resource-usage bounds.","lang":"eng"}],"language":[{"iso":"eng"}],"author":[{"last_name":"Wang","first_name":"Peixin","full_name":"Wang, Peixin"},{"first_name":"Hongfei","last_name":"Fu","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","full_name":"Fu, Hongfei"},{"orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar","first_name":"Amir Kafshdar","last_name":"Goharshady"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Qin","first_name":"Xudong","full_name":"Qin, Xudong"},{"full_name":"Shi, Wenjun","first_name":"Wenjun","last_name":"Shi"}],"date_updated":"2026-11-10T23:30:49Z","scopus_import":"1","year":"2019","publication":"PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","date_created":"2019-03-25T10:13:25Z","publication_status":"published","isi":1,"file_date_updated":"2020-07-14T12:47:20Z","month":"06","ddc":["000"],"publisher":"Association for Computing Machinery","date_published":"2019-06-08T00:00:00Z","citation":{"ama":"Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of nondeterministic probabilistic programs. In: <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>. Association for Computing Machinery; 2019:204-220. doi:<a href=\"https://doi.org/10.1145/3314221.3314581\">10.1145/3314221.3314581</a>","ieee":"P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, Phoenix, AZ, United States, 2019, pp. 204–220.","ista":"Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation, 204–220.","short":"P. Wang, H. Fu, A.K. Goharshady, K. Chatterjee, X. Qin, W. Shi, in:, PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2019, pp. 204–220.","apa":"Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., &#38; Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i> (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3314221.3314581\">https://doi.org/10.1145/3314221.3314581</a>","mla":"Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.” <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, Association for Computing Machinery, 2019, pp. 204–20, doi:<a href=\"https://doi.org/10.1145/3314221.3314581\">10.1145/3314221.3314581</a>.","chicago":"Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.” In <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, 204–20. Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3314221.3314581\">https://doi.org/10.1145/3314221.3314581</a>."},"oa_version":"Submitted Version","ec_funded":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6175","title":"Cost analysis of nondeterministic probabilistic programs","day":"08","arxiv":1,"page":"204-220","department":[{"_id":"KrCh"}],"fulldoi":"https://doi.org/10.1145/3314221.3314581","file":[{"access_level":"open_access","date_updated":"2020-07-14T12:47:20Z","relation":"main_file","content_type":"application/pdf","date_created":"2019-03-25T10:11:22Z","file_id":"6176","file_size":4051066,"file_name":"paper.pdf","creator":"akafshda","checksum":"703a5e9b8c8587f2a44085ffd9a4db64"}],"keyword":["Program Cost Analysis","Program Termination","Probabilistic Programs","Martingales"],"doi":"10.1145/3314221.3314581","oa":1,"project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"}],"conference":{"name":"PLDI: Conference on Programming Language Design and Implementation","location":"Phoenix, AZ, United States","start_date":"2019-06-22","end_date":"2019-06-26"},"external_id":{"arxiv":["1902.04659"],"isi":["000523190300014"]},"article_processing_charge":"No","has_accepted_license":"1"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.05105"}],"volume":620,"external_id":{"arxiv":["1809.05105"]},"article_type":"original","article_processing_charge":"No","keyword":["Space and Planetary Science","Astronomy and Astrophysics","asteroseismology / methods","data analysis / stars","oscillations"],"oa":1,"doi":"10.1051/0004-6361/201833106","fulldoi":"https://doi.org/10.1051/0004-6361/201833106","day":"01","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"arxiv":1,"_id":"11618","title":"FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"L.A. Bugnet, R.A. García, G.R. Davies, S. Mathur, E. Corsaro, O.J. Hall, B.M. Rendle, Astronomy &#38; Astrophysics 620 (2018).","chicago":"Bugnet, Lisa Annabelle, R. A. García, G. R. Davies, S. Mathur, E. Corsaro, O. J. Hall, and B. M. Rendle. “FliPer: A Global Measure of Power Density to Estimate Surface Gravities of Main-Sequence Solar-like Stars and Red Giants.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2018. <a href=\"https://doi.org/10.1051/0004-6361/201833106\">https://doi.org/10.1051/0004-6361/201833106</a>.","mla":"Bugnet, Lisa Annabelle, et al. “FliPer: A Global Measure of Power Density to Estimate Surface Gravities of Main-Sequence Solar-like Stars and Red Giants.” <i>Astronomy &#38; Astrophysics</i>, vol. 620, A38, EDP Sciences, 2018, doi:<a href=\"https://doi.org/10.1051/0004-6361/201833106\">10.1051/0004-6361/201833106</a>.","apa":"Bugnet, L. A., García, R. A., Davies, G. R., Mathur, S., Corsaro, E., Hall, O. J., &#38; Rendle, B. M. (2018). FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/201833106\">https://doi.org/10.1051/0004-6361/201833106</a>","ista":"Bugnet LA, García RA, Davies GR, Mathur S, Corsaro E, Hall OJ, Rendle BM. 2018. FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants. Astronomy &#38; Astrophysics. 620, A38.","ieee":"L. A. Bugnet <i>et al.</i>, “FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants,” <i>Astronomy &#38; Astrophysics</i>, vol. 620. EDP Sciences, 2018.","ama":"Bugnet LA, García RA, Davies GR, et al. FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants. <i>Astronomy &#38; Astrophysics</i>. 2018;620. doi:<a href=\"https://doi.org/10.1051/0004-6361/201833106\">10.1051/0004-6361/201833106</a>"},"oa_version":"Preprint","extern":"1","month":"12","publisher":"EDP Sciences","date_published":"2018-12-01T00:00:00Z","article_number":"A38","acknowledgement":"We thank the anonymous referee for the very useful comments. We would also like to thank M. Benbakoura for his help in analyzing the light curves of several binary systems included in our set of stars. L.B. and R.A.G. acknowledge the support from PLATO and GOLF CNES grants. S.M. acknowledges support from the National Aeronautics and Space Administration under Grant NNX15AF13G, the National Science Foundation grant AST-1411685, and the Ramon y Cajal fellowship no. RYC-2015-17697. E.C. is funded by the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement no. 664931. O.J.H and B.M.R. acknowledge the support of the UK Science and Technology Facilities Council (STFC). Funding for the Stellar Astrophysics Centre is provided by the Danish National Research Foundation (Grant DNRF106). This research has made use of NASA’s Astrophysics Data System. Data presented in this paper were obtained from the Mikulski Archive for Space Telescopes (MAST). STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS5-26555.","intvolume":"       620","year":"2018","date_created":"2022-07-18T14:37:39Z","publication":"Astronomy & Astrophysics","publication_status":"published","date_updated":"2024-10-14T11:40:17Z","scopus_import":"1","author":[{"orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501","last_name":"Bugnet","first_name":"Lisa Annabelle"},{"first_name":"R. A.","last_name":"García","full_name":"García, R. A."},{"full_name":"Davies, G. R.","first_name":"G. R.","last_name":"Davies"},{"last_name":"Mathur","first_name":"S.","full_name":"Mathur, S."},{"full_name":"Corsaro, E.","first_name":"E.","last_name":"Corsaro"},{"first_name":"O. J.","last_name":"Hall","full_name":"Hall, O. J."},{"full_name":"Rendle, B. M.","last_name":"Rendle","first_name":"B. M."}],"type":"journal_article","abstract":[{"text":"Asteroseismology provides global stellar parameters such as masses, radii, or surface gravities using mean global seismic parameters and effective temperature for thousands of low-mass stars (0.8 M⊙ < M < 3 M⊙). This methodology has been successfully applied to stars in which acoustic modes excited by turbulent convection are measured. Other methods such as the Flicker technique can also be used to determine stellar surface gravities, but only works for log g above 2.5 dex. In this work, we present a new metric called FliPer (Flicker in spectral power density, in opposition to the standard Flicker measurement which is computed in the time domain); it is able to extend the range for which reliable surface gravities can be obtained (0.1 < log g < 4.6 dex) without performing any seismic analysis for stars brighter than Kp < 14. FliPer takes into account the average variability of a star measured in the power density spectrum in a given range of frequencies. However, FliPer values calculated on several ranges of frequency are required to better characterize a star. Using a large set of asteroseismic targets it is possible to calibrate the behavior of surface gravity with FliPer through machine learning. This calibration made with a random forest regressor covers a wide range of surface gravities from main-sequence stars to subgiants and red giants, with very small uncertainties from 0.04 to 0.1 dex. FliPer values can be inserted in automatic global seismic pipelines to either give an estimation of the stellar surface gravity or to assess the quality of the seismic results by detecting any outliers in the obtained νmax values. FliPer also constrains the surface gravities of main-sequence dwarfs using only long-cadence data for which the Nyquist frequency is too low to measure the acoustic-mode properties.","lang":"eng"}],"language":[{"iso":"eng"}],"status":"public","quality_controlled":"1"},{"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11631","type":"preprint","title":"FliPer: Classifying TESS pulsating stars","language":[{"iso":"eng"}],"abstract":[{"text":"The recently launched NASA Transiting Exoplanet Survey Satellite (TESS) mission is going to collect lightcurves for a few hundred million of stars and we expect to increase the number of pulsating stars to analyze compared to the few thousand stars observed by the CoRoT, Kepler and K2 missions. However, most of the TESS targets have not yet been properly classified and characterized. In order to improve the analysis of the TESS data, it is crucial to determine the type of stellar pulsations in a timely manner. We propose an automatic method to classify stars attending to their pulsation properties, in particular, to identify solar-like pulsators among all TESS targets. It relies on the use of the global amount of power contained in the power spectrum (already known as the FliPer method) as a key parameter, along with\r\nthe effective temperature, to feed into a machine learning classifier. Our study, based on TESS simulated datasets, shows that we are able to classify pulsators with a 98% accuracy.","lang":"eng"}],"author":[{"first_name":"Lisa Annabelle","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","full_name":"Bugnet, Lisa Annabelle","orcid":"0000-0003-0142-4000"},{"last_name":"García","first_name":"R. A.","full_name":"García, R. A."},{"full_name":"Davies, G. R.","last_name":"Davies","first_name":"G. R."},{"last_name":"Mathur","first_name":"S.","full_name":"Mathur, S."},{"first_name":"O. J.","last_name":"Hall","full_name":"Hall, O. J."},{"full_name":"Rendle, B. M.","last_name":"Rendle","first_name":"B. M."}],"day":"29","arxiv":1,"fulldoi":"https://doi.org/10.48550/arXiv.1811.12140","date_updated":"2022-08-22T08:41:55Z","oa":1,"doi":"10.48550/arXiv.1811.12140","publication_status":"submitted","year":"2018","publication":"arXiv","keyword":["asteroseismology - methods","data analysis - stars","oscillations"],"date_created":"2022-07-21T07:05:23Z","article_number":"1811.12140","extern":"1","external_id":{"arxiv":["1811.12140"]},"month":"11","article_processing_charge":"No","date_published":"2018-11-29T00:00:00Z","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1811.12140","open_access":"1"}],"citation":{"ista":"Bugnet LA, García RA, Davies GR, Mathur S, Hall OJ, Rendle BM. FliPer: Classifying TESS pulsating stars. arXiv, 1811.12140.","ieee":"L. A. Bugnet, R. A. García, G. R. Davies, S. Mathur, O. J. Hall, and B. M. Rendle, “FliPer: Classifying TESS pulsating stars,” <i>arXiv</i>. .","ama":"Bugnet LA, García RA, Davies GR, Mathur S, Hall OJ, Rendle BM. FliPer: Classifying TESS pulsating stars. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1811.12140\">10.48550/arXiv.1811.12140</a>","short":"L.A. Bugnet, R.A. García, G.R. Davies, S. Mathur, O.J. Hall, B.M. Rendle, ArXiv (n.d.).","chicago":"Bugnet, Lisa Annabelle, R. A. García, G. R. Davies, S. Mathur, O. J. Hall, and B. M. Rendle. “FliPer: Classifying TESS Pulsating Stars.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1811.12140\">https://doi.org/10.48550/arXiv.1811.12140</a>.","mla":"Bugnet, Lisa Annabelle, et al. “FliPer: Classifying TESS Pulsating Stars.” <i>ArXiv</i>, 1811.12140, doi:<a href=\"https://doi.org/10.48550/arXiv.1811.12140\">10.48550/arXiv.1811.12140</a>.","apa":"Bugnet, L. A., García, R. A., Davies, G. R., Mathur, S., Hall, O. J., &#38; Rendle, B. M. (n.d.). FliPer: Classifying TESS pulsating stars. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1811.12140\">https://doi.org/10.48550/arXiv.1811.12140</a>"},"oa_version":"Preprint"},{"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"research_data","_id":"5574","abstract":[{"text":"Comparison of Scopus' and publisher's data on Austrian publication output at IOP. ","lang":"ger"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"278"}]},"title":"Data Check IOP Scopus vs. Publisher","day":"16","author":[{"orcid":"0000-0001-8126-0426","first_name":"Márton","last_name":"Villányi","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","full_name":"Villányi, Márton"}],"department":[{"_id":"E-Lib"}],"date_updated":"2026-06-18T18:35:06Z","fulldoi":"https://doi.org/10.15479/AT:ISTA:86","datarep_id":"86","file":[{"access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:47:05Z","date_created":"2018-12-12T13:05:14Z","file_id":"5642","content_type":"application/zip","creator":"system","checksum":"c7a61147bd15cb4ae45878d270628c06","file_name":"IST-2018-86-v1+1_Data_Check_IOP_Scopus_vs._Publisher.zip","file_size":12283857}],"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"year":"2018","keyword":["Publication analysis","Bibliography","Open Access"],"date_created":"2018-12-12T12:31:37Z","oa":1,"doi":"10.15479/AT:ISTA:86","file_date_updated":"2020-07-14T12:47:05Z","ddc":["020"],"month":"01","publisher":"Institute of Science and Technology Austria","license":"https://creativecommons.org/publicdomain/zero/1.0/","date_published":"2018-01-16T00:00:00Z","article_processing_charge":"No","has_accepted_license":"1","citation":{"short":"M. Villányi, (2018).","apa":"Villányi, M. (2018). Data Check IOP Scopus vs. Publisher. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:86\">https://doi.org/10.15479/AT:ISTA:86</a>","mla":"Villányi, Márton. <i>Data Check IOP Scopus vs. Publisher</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:86\">10.15479/AT:ISTA:86</a>.","chicago":"Villányi, Márton. “Data Check IOP Scopus vs. Publisher.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:86\">https://doi.org/10.15479/AT:ISTA:86</a>.","ama":"Villányi M. Data Check IOP Scopus vs. Publisher. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:86\">10.15479/AT:ISTA:86</a>","ieee":"M. Villányi, “Data Check IOP Scopus vs. Publisher.” Institute of Science and Technology Austria, 2018.","ista":"Villányi M. 2018. Data Check IOP Scopus vs. Publisher, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:86\">10.15479/AT:ISTA:86</a>."},"oa_version":"Submitted Version"}]