[{"month":"10","doi":"10.1007/978-3-030-01602-9_9","conference":{"location":"Munich, Germany","start_date":"2017-03-30","end_date":"2017-04-01","name":"MaLiQS: Macroscopic Limits of Quantum Systems"},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1806.10843","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1806.10843"]},"project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}],"quality_controlled":"1","publist_id":"8045","ec_funded":1,"author":[{"full_name":"Leopold, Nikolai K","last_name":"Leopold","first_name":"Nikolai K","orcid":"0000-0002-0495-6822","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pickl, Peter","last_name":"Pickl","first_name":"Peter"}],"volume":270,"date_updated":"2021-01-12T06:48:16Z","date_created":"2018-12-11T11:44:08Z","year":"2018","department":[{"_id":"RoSe"}],"publisher":"Springer","publication_status":"published","day":"27","scopus_import":1,"date_published":"2018-10-27T00:00:00Z","citation":{"ama":"Leopold NK, Pickl P. Mean-field limits of particles in interaction with quantised radiation fields. In: Vol 270. Springer; 2018:185-214. doi:10.1007/978-3-030-01602-9_9","ieee":"N. K. Leopold and P. Pickl, “Mean-field limits of particles in interaction with quantised radiation fields,” presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany, 2018, vol. 270, pp. 185–214.","apa":"Leopold, N. K., & Pickl, P. (2018). Mean-field limits of particles in interaction with quantised radiation fields (Vol. 270, pp. 185–214). Presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany: Springer. https://doi.org/10.1007/978-3-030-01602-9_9","ista":"Leopold NK, Pickl P. 2018. Mean-field limits of particles in interaction with quantised radiation fields. MaLiQS: Macroscopic Limits of Quantum Systems vol. 270, 185–214.","short":"N.K. Leopold, P. Pickl, in:, Springer, 2018, pp. 185–214.","mla":"Leopold, Nikolai K., and Peter Pickl. Mean-Field Limits of Particles in Interaction with Quantised Radiation Fields. Vol. 270, Springer, 2018, pp. 185–214, doi:10.1007/978-3-030-01602-9_9.","chicago":"Leopold, Nikolai K, and Peter Pickl. “Mean-Field Limits of Particles in Interaction with Quantised Radiation Fields,” 270:185–214. Springer, 2018. https://doi.org/10.1007/978-3-030-01602-9_9."},"page":"185 - 214","abstract":[{"lang":"eng","text":"We report on a novel strategy to derive mean-field limits of quantum mechanical systems in which a large number of particles weakly couple to a second-quantized radiation field. The technique combines the method of counting and the coherent state approach to study the growth of the correlations among the particles and in the radiation field. As an instructional example, we derive the Schrödinger–Klein–Gordon system of equations from the Nelson model with ultraviolet cutoff and possibly massless scalar field. In particular, we prove the convergence of the reduced density matrices (of the nonrelativistic particles and the field bosons) associated with the exact time evolution to the projectors onto the solutions of the Schrödinger–Klein–Gordon equations in trace norm. Furthermore, we derive explicit bounds on the rate of convergence of the one-particle reduced density matrix of the nonrelativistic particles in Sobolev norm."}],"type":"conference","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11","intvolume":" 270","title":"Mean-field limits of particles in interaction with quantised radiation fields","status":"public"},{"file_date_updated":"2020-07-14T12:44:39Z","publist_id":"6119","year":"2018","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The second named author benefited partially from the support of the “FMJH Program Gaspard Monge in Optimization and Operations Research” (Project 2014-1607H). He is also grateful for the invitation to the Department of Mathematics of the University of Pisa. The third named author is grateful for the invitation to ENSTA.","publication_status":"published","publisher":"Springer","department":[{"_id":"JaMa"}],"author":[{"full_name":"Flandoli, Franco","last_name":"Flandoli","first_name":"Franco"},{"last_name":"Russo","first_name":"Francesco","full_name":"Russo, Francesco"},{"id":"47491882-F248-11E8-B48F-1D18A9856A87","first_name":"Giovanni A","last_name":"Zanco","full_name":"Zanco, Giovanni A"}],"date_created":"2018-12-11T11:50:45Z","date_updated":"2021-01-12T06:49:09Z","volume":31,"month":"06","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"doi":"10.1007/s10959-016-0724-2","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"Two generalizations of Itô formula to infinite-dimensional spaces are given.\r\nThe first one, in Hilbert spaces, extends the classical one by taking advantage of\r\ncancellations when they occur in examples and it is applied to the case of a group\r\ngenerator. The second one, based on the previous one and a limit procedure, is an Itô\r\nformula in a special class of Banach spaces having a product structure with the noise\r\nin a Hilbert component; again the key point is the extension due to a cancellation. This\r\nextension to Banach spaces and in particular the specific cancellation are motivated\r\nby path-dependent Itô calculus.","lang":"eng"}],"issue":"2","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"1215","status":"public","title":"Infinite-dimensional calculus under weak spatial regularity of the processes","ddc":["519"],"intvolume":" 31","pubrep_id":"712","oa_version":"Published Version","file":[{"file_name":"IST-2016-712-v1+1_s10959-016-0724-2.pdf","access_level":"open_access","creator":"system","file_size":671125,"content_type":"application/pdf","file_id":"5266","relation":"main_file","date_updated":"2020-07-14T12:44:39Z","date_created":"2018-12-12T10:17:13Z","checksum":"47686d58ec21c164540f1a980ff2163f"}],"scopus_import":1,"day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","publication":"Journal of Theoretical Probability","citation":{"chicago":"Flandoli, Franco, Francesco Russo, and Giovanni A Zanco. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” Journal of Theoretical Probability. Springer, 2018. https://doi.org/10.1007/s10959-016-0724-2.","short":"F. Flandoli, F. Russo, G.A. Zanco, Journal of Theoretical Probability 31 (2018) 789–826.","mla":"Flandoli, Franco, et al. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” Journal of Theoretical Probability, vol. 31, no. 2, Springer, 2018, pp. 789–826, doi:10.1007/s10959-016-0724-2.","ieee":"F. Flandoli, F. Russo, and G. A. Zanco, “Infinite-dimensional calculus under weak spatial regularity of the processes,” Journal of Theoretical Probability, vol. 31, no. 2. Springer, pp. 789–826, 2018.","apa":"Flandoli, F., Russo, F., & Zanco, G. A. (2018). Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. Springer. https://doi.org/10.1007/s10959-016-0724-2","ista":"Flandoli F, Russo F, Zanco GA. 2018. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 31(2), 789–826.","ama":"Flandoli F, Russo F, Zanco GA. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 2018;31(2):789-826. doi:10.1007/s10959-016-0724-2"},"page":"789-826","date_published":"2018-06-01T00:00:00Z"},{"oa_version":"Published Version","file":[{"file_name":"2018_LIPIcs_Fulek.pdf","access_level":"open_access","creator":"dernst","file_size":718857,"content_type":"application/pdf","file_id":"5701","relation":"main_file","date_updated":"2020-07-14T12:45:19Z","date_created":"2018-12-17T12:33:52Z","checksum":"f1b94f1a75b37c414a1f61d59fb2cd4c"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"185","intvolume":" 99","title":"Hanani-Tutte for approximating maps of graphs","status":"public","ddc":["510"],"abstract":[{"text":"We resolve in the affirmative conjectures of A. Skopenkov and Repovš (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our proof of this result is constructive and almost immediately implies an efficient algorithm for testing whether a given piecewise linear map of a graph in a surface is approximable by an embedding. More precisely, an instance of this problem consists of (i) a graph G whose vertices are partitioned into clusters and whose inter-cluster edges are partitioned into bundles, and (ii) a region R of a 2-dimensional compact surface M given as the union of a set of pairwise disjoint discs corresponding to the clusters and a set of pairwise disjoint "pipes" corresponding to the bundles, connecting certain pairs of these discs. We are to decide whether G can be embedded inside M so that the vertices in every cluster are drawn in the corresponding disc, the edges in every bundle pass only through its corresponding pipe, and every edge crosses the boundary of each disc at most once.","lang":"eng"}],"type":"conference","alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"date_published":"2018-01-01T00:00:00Z","citation":{"ama":"Fulek R, Kynčl J. Hanani-Tutte for approximating maps of graphs. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.39","ieee":"R. Fulek and J. Kynčl, “Hanani-Tutte for approximating maps of graphs,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.","apa":"Fulek, R., & Kynčl, J. (2018). Hanani-Tutte for approximating maps of graphs (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.39","ista":"Fulek R, Kynčl J. 2018. Hanani-Tutte for approximating maps of graphs. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 39.","short":"R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","mla":"Fulek, Radoslav, and Jan Kynčl. Hanani-Tutte for Approximating Maps of Graphs. Vol. 99, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.39.","chicago":"Fulek, Radoslav, and Jan Kynčl. “Hanani-Tutte for Approximating Maps of Graphs,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.39."},"has_accepted_license":"1","day":"01","scopus_import":1,"author":[{"full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek","first_name":"Radoslav"},{"full_name":"Kynčl, Jan","last_name":"Kynčl","first_name":"Jan"}],"volume":99,"date_updated":"2021-01-12T06:53:36Z","date_created":"2018-12-11T11:45:04Z","year":"2018","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"UlWa"}],"publication_status":"published","publist_id":"7735","file_date_updated":"2020-07-14T12:45:19Z","article_number":"39","doi":"10.4230/LIPIcs.SoCG.2018.39","conference":{"start_date":"2018-06-11","location":"Budapest, Hungary","end_date":"2018-06-14","name":"SoCG: Symposium on Computational Geometry"},"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"call_identifier":"FWF","name":"Eliminating intersections in drawings of graphs","grant_number":"M02281","_id":"261FA626-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","publication_identifier":{"isbn":["978-3-95977-066-8"]},"month":"01"},{"doi":"10.4230/LIPIcs.SoCG.2018.35","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2018-06-11","location":"Budapest, Hungary","end_date":"2018-06-14"},"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"name":"Persistence and stability of geometric complexes","call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","month":"06","author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"full_name":"Virk, Ziga","last_name":"Virk","first_name":"Ziga"},{"first_name":"Hubert","last_name":"Wagner","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Hubert"}],"volume":99,"date_updated":"2021-01-12T06:53:48Z","date_created":"2018-12-11T11:45:05Z","acknowledgement":"This research is partially supported by the Office of Naval Research, through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund","year":"2018","department":[{"_id":"HeEd"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","publist_id":"7733","file_date_updated":"2020-07-14T12:45:20Z","date_published":"2018-06-11T00:00:00Z","citation":{"ama":"Edelsbrunner H, Virk Z, Wagner H. Smallest enclosing spheres and Chernoff points in Bregman geometry. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:35:1-35:13. doi:10.4230/LIPIcs.SoCG.2018.35","ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Smallest enclosing spheres and Chernoff points in Bregman geometry,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 35:1-35:13.","apa":"Edelsbrunner, H., Virk, Z., & Wagner, H. (2018). Smallest enclosing spheres and Chernoff points in Bregman geometry (Vol. 99, p. 35:1-35:13). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.35","ista":"Edelsbrunner H, Virk Z, Wagner H. 2018. Smallest enclosing spheres and Chernoff points in Bregman geometry. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 35:1-35:13.","short":"H. Edelsbrunner, Z. Virk, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13.","mla":"Edelsbrunner, Herbert, et al. Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13, doi:10.4230/LIPIcs.SoCG.2018.35.","chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry,” 99:35:1-35:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.35."},"page":"35:1 - 35:13","has_accepted_license":"1","day":"11","scopus_import":1,"oa_version":"Published Version","file":[{"file_name":"2018_LIPIcs_Edelsbrunner.pdf","access_level":"open_access","file_size":489080,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"5724","date_created":"2018-12-17T16:31:31Z","date_updated":"2020-07-14T12:45:20Z","checksum":"7509403803b3ac1aee94bbc2ad293d21"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"188","intvolume":" 99","status":"public","title":"Smallest enclosing spheres and Chernoff points in Bregman geometry","ddc":["000"],"abstract":[{"lang":"eng","text":"Smallest enclosing spheres of finite point sets are central to methods in topological data analysis. Focusing on Bregman divergences to measure dissimilarity, we prove bounds on the location of the center of a smallest enclosing sphere. These bounds depend on the range of radii for which Bregman balls are convex."}],"type":"conference","alternative_title":["Leibniz International Proceedings in Information, LIPIcs"]},{"type":"journal_article","issue":"4","abstract":[{"lang":"eng","text":"A cornerstone of statistical inference, the maximum entropy framework is being increasingly applied to construct descriptive and predictive models of biological systems, especially complex biological networks, from large experimental data sets. Both its broad applicability and the success it obtained in different contexts hinge upon its conceptual simplicity and mathematical soundness. Here we try to concisely review the basic elements of the maximum entropy principle, starting from the notion of ‘entropy’, and describe its usefulness for the analysis of biological systems. As examples, we focus specifically on the problem of reconstructing gene interaction networks from expression data and on recent work attempting to expand our system-level understanding of bacterial metabolism. Finally, we highlight some extensions and potential limitations of the maximum entropy approach, and point to more recent developments that are likely to play a key role in the upcoming challenges of extracting structures and information from increasingly rich, high-throughput biological data."}],"intvolume":" 4","ddc":["530"],"title":"An introduction to the maximum entropy approach and its application to inference problems in biology","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"306","file":[{"file_size":994490,"content_type":"application/pdf","creator":"dernst","file_name":"2018_Heliyon_DeMartino.pdf","access_level":"open_access","date_created":"2019-02-06T07:36:24Z","date_updated":"2020-07-14T12:45:59Z","checksum":"67010cf5e3b3e0637c659371714a715a","relation":"main_file","file_id":"5929"}],"oa_version":"Published Version","scopus_import":1,"has_accepted_license":"1","day":"01","citation":{"chicago":"De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum Entropy Approach and Its Application to Inference Problems in Biology.” Heliyon. Elsevier, 2018. https://doi.org/10.1016/j.heliyon.2018.e00596.","mla":"De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum Entropy Approach and Its Application to Inference Problems in Biology.” Heliyon, vol. 4, no. 4, e00596, Elsevier, 2018, doi:10.1016/j.heliyon.2018.e00596.","short":"A. De Martino, D. De Martino, Heliyon 4 (2018).","ista":"De Martino A, De Martino D. 2018. An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. 4(4), e00596.","ieee":"A. De Martino and D. De Martino, “An introduction to the maximum entropy approach and its application to inference problems in biology,” Heliyon, vol. 4, no. 4. Elsevier, 2018.","apa":"De Martino, A., & De Martino, D. (2018). An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. Elsevier. https://doi.org/10.1016/j.heliyon.2018.e00596","ama":"De Martino A, De Martino D. An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. 2018;4(4). doi:10.1016/j.heliyon.2018.e00596"},"publication":"Heliyon","date_published":"2018-04-01T00:00:00Z","article_number":"e00596","ec_funded":1,"file_date_updated":"2020-07-14T12:45:59Z","publisher":"Elsevier","department":[{"_id":"GaTk"}],"publication_status":"published","year":"2018","volume":4,"date_created":"2018-12-11T11:45:44Z","date_updated":"2021-01-12T07:40:46Z","author":[{"full_name":"De Martino, Andrea","last_name":"De Martino","first_name":"Andrea"},{"orcid":"0000-0002-5214-4706","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","last_name":"De Martino","first_name":"Daniele","full_name":"De Martino, Daniele"}],"month":"04","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.heliyon.2018.e00596"}]