[{"citation":{"short":"M. Gerencser, M. Hairer, Probability Theory and Related Fields 173 (2019) 697–758.","mla":"Gerencser, Mate, and Martin Hairer. “Singular SPDEs in Domains with Boundaries.” Probability Theory and Related Fields, vol. 173, no. 3–4, Springer, 2019, pp. 697–758, doi:10.1007/s00440-018-0841-1.","chicago":"Gerencser, Mate, and Martin Hairer. “Singular SPDEs in Domains with Boundaries.” Probability Theory and Related Fields. Springer, 2019. https://doi.org/10.1007/s00440-018-0841-1.","ama":"Gerencser M, Hairer M. Singular SPDEs in domains with boundaries. Probability Theory and Related Fields. 2019;173(3-4):697–758. doi:10.1007/s00440-018-0841-1","ieee":"M. Gerencser and M. Hairer, “Singular SPDEs in domains with boundaries,” Probability Theory and Related Fields, vol. 173, no. 3–4. Springer, pp. 697–758, 2019.","apa":"Gerencser, M., & Hairer, M. (2019). Singular SPDEs in domains with boundaries. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-018-0841-1","ista":"Gerencser M, Hairer M. 2019. Singular SPDEs in domains with boundaries. Probability Theory and Related Fields. 173(3–4), 697–758."},"publication":"Probability Theory and Related Fields","page":"697–758","article_type":"original","date_published":"2019-04-01T00:00:00Z","scopus_import":"1","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"01","_id":"319","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 173","title":"Singular SPDEs in domains with boundaries","ddc":["510"],"status":"public","oa_version":"Published Version","file":[{"checksum":"288d16ef7291242f485a9660979486e3","date_created":"2018-12-17T16:25:24Z","date_updated":"2020-07-14T12:46:03Z","file_id":"5722","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":893182,"access_level":"open_access","file_name":"2018_ProbTheory_Gerencser.pdf"}],"type":"journal_article","issue":"3-4","abstract":[{"lang":"eng","text":"We study spaces of modelled distributions with singular behaviour near the boundary of a domain that, in the context of the theory of regularity structures, allow one to give robust solution theories for singular stochastic PDEs with boundary conditions. The calculus of modelled distributions established in Hairer (Invent Math 198(2):269–504, 2014. https://doi.org/10.1007/s00222-014-0505-4) is extended to this setting. We formulate and solve fixed point problems in these spaces with a class of kernels that is sufficiently large to cover in particular the Dirichlet and Neumann heat kernels. These results are then used to provide solution theories for the KPZ equation with Dirichlet and Neumann boundary conditions and for the 2D generalised parabolic Anderson model with Dirichlet boundary conditions. In the case of the KPZ equation with Neumann boundary conditions, we show that, depending on the class of mollifiers one considers, a “boundary renormalisation” takes place. In other words, there are situations in which a certain boundary condition is applied to an approximation to the KPZ equation, but the limiting process is the Hopf–Cole solution to the KPZ equation with a different boundary condition."}],"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"},"external_id":{"isi":["000463613800001"]},"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"quality_controlled":"1","isi":1,"doi":"10.1007/s00440-018-0841-1","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["14322064"],"issn":["01788051"]},"month":"04","year":"2019","acknowledgement":"MG thanks the support of the LMS Postdoctoral Mobility Grant.\r\n\r\n","department":[{"_id":"JaMa"}],"publisher":"Springer","publication_status":"published","author":[{"first_name":"Mate","last_name":"Gerencser","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","full_name":"Gerencser, Mate"},{"full_name":"Hairer, Martin","last_name":"Hairer","first_name":"Martin"}],"volume":173,"date_created":"2018-12-11T11:45:48Z","date_updated":"2023-08-24T14:38:32Z","publist_id":"7546","file_date_updated":"2020-07-14T12:46:03Z"},{"project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000459396500007"]},"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.1007/s00440-018-0835-z","publication_identifier":{"eissn":["14322064"],"issn":["01788051"]},"month":"02","publisher":"Springer","department":[{"_id":"LaEr"}],"publication_status":"published","year":"2019","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).\r\n","volume":173,"date_created":"2018-12-11T11:46:25Z","date_updated":"2023-08-24T14:39:00Z","author":[{"full_name":"Ajanki, Oskari H","id":"36F2FB7E-F248-11E8-B48F-1D18A9856A87","last_name":"Ajanki","first_name":"Oskari H"},{"last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"},{"orcid":"0000-0002-4821-3297","id":"3020C786-F248-11E8-B48F-1D18A9856A87","last_name":"Krüger","first_name":"Torben H","full_name":"Krüger, Torben H"}],"publist_id":"7394","ec_funded":1,"file_date_updated":"2020-07-14T12:46:26Z","page":"293–373","article_type":"original","citation":{"ista":"Ajanki OH, Erdös L, Krüger TH. 2019. Stability of the matrix Dyson equation and random matrices with correlations. Probability Theory and Related Fields. 173(1–2), 293–373.","apa":"Ajanki, O. H., Erdös, L., & Krüger, T. H. (2019). Stability of the matrix Dyson equation and random matrices with correlations. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-018-0835-z","ieee":"O. H. Ajanki, L. Erdös, and T. H. Krüger, “Stability of the matrix Dyson equation and random matrices with correlations,” Probability Theory and Related Fields, vol. 173, no. 1–2. Springer, pp. 293–373, 2019.","ama":"Ajanki OH, Erdös L, Krüger TH. Stability of the matrix Dyson equation and random matrices with correlations. Probability Theory and Related Fields. 2019;173(1-2):293–373. doi:10.1007/s00440-018-0835-z","chicago":"Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Stability of the Matrix Dyson Equation and Random Matrices with Correlations.” Probability Theory and Related Fields. Springer, 2019. https://doi.org/10.1007/s00440-018-0835-z.","mla":"Ajanki, Oskari H., et al. “Stability of the Matrix Dyson Equation and Random Matrices with Correlations.” Probability Theory and Related Fields, vol. 173, no. 1–2, Springer, 2019, pp. 293–373, doi:10.1007/s00440-018-0835-z.","short":"O.H. Ajanki, L. Erdös, T.H. Krüger, Probability Theory and Related Fields 173 (2019) 293–373."},"publication":"Probability Theory and Related Fields","date_published":"2019-02-01T00:00:00Z","scopus_import":"1","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"01","intvolume":" 173","status":"public","title":"Stability of the matrix Dyson equation and random matrices with correlations","ddc":["510"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"429","file":[{"file_name":"2018_ProbTheory_Ajanki.pdf","access_level":"open_access","content_type":"application/pdf","file_size":1201840,"creator":"dernst","relation":"main_file","file_id":"5720","date_updated":"2020-07-14T12:46:26Z","date_created":"2018-12-17T16:12:08Z","checksum":"f9354fa5c71f9edd17132588f0dc7d01"}],"oa_version":"Published Version","type":"journal_article","issue":"1-2","abstract":[{"lang":"eng","text":"We consider real symmetric or complex hermitian random matrices with correlated entries. We prove local laws for the resolvent and universality of the local eigenvalue statistics in the bulk of the spectrum. The correlations have fast decay but are otherwise of general form. The key novelty is the detailed stability analysis of the corresponding matrix valued Dyson equation whose solution is the deterministic limit of the resolvent."}]},{"date_published":"2019-01-04T00:00:00Z","page":"168-177","publication":"ACM International Conference Proceeding Series","citation":{"ama":"Chatterjee B, Peri S, Sa M, Singhal N. A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. In: ACM International Conference Proceeding Series. ACM; 2019:168-177. doi:10.1145/3288599.3288617","ista":"Chatterjee B, Peri S, Sa M, Singhal N. 2019. A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. ACM International Conference Proceeding Series. ICDCN: Conference on Distributed Computing and Networking, 168–177.","apa":"Chatterjee, B., Peri, S., Sa, M., & Singhal, N. (2019). A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. In ACM International Conference Proceeding Series (pp. 168–177). Bangalore, India: ACM. https://doi.org/10.1145/3288599.3288617","ieee":"B. Chatterjee, S. Peri, M. Sa, and N. Singhal, “A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries,” in ACM International Conference Proceeding Series, Bangalore, India, 2019, pp. 168–177.","mla":"Chatterjee, Bapi, et al. “A Simple and Practical Concurrent Non-Blocking Unbounded Graph with Linearizable Reachability Queries.” ACM International Conference Proceeding Series, ACM, 2019, pp. 168–77, doi:10.1145/3288599.3288617.","short":"B. Chatterjee, S. Peri, M. Sa, N. Singhal, in:, ACM International Conference Proceeding Series, ACM, 2019, pp. 168–177.","chicago":"Chatterjee, Bapi, Sathya Peri, Muktikanta Sa, and Nandini Singhal. “A Simple and Practical Concurrent Non-Blocking Unbounded Graph with Linearizable Reachability Queries.” In ACM International Conference Proceeding Series, 168–77. ACM, 2019. https://doi.org/10.1145/3288599.3288617."},"day":"04","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","title":"A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"5947","abstract":[{"lang":"eng","text":"Graph algorithms applied in many applications, including social networks, communication networks, VLSI design, graphics, and several others, require dynamic modifications - addition and removal of vertices and/or edges - in the graph. This paper presents a novel concurrent non-blocking algorithm to implement a dynamic unbounded directed graph in a shared-memory machine. The addition and removal operations of vertices and edges are lock-free. For a finite sized graph, the lookup operations are wait-free. Most significant component of the presented algorithm is the reachability query in a concurrent graph. The reachability queries in our algorithm are obstruction-free and thus impose minimal additional synchronization cost over other operations. We prove that each of the data structure operations are linearizable. We extensively evaluate a sample C/C++ implementation of the algorithm through a number of micro-benchmarks. The experimental results show that the proposed algorithm scales well with the number of threads and on an average provides 5 to 7x performance improvement over a concurrent graph implementation using coarse-grained locking."}],"type":"conference","language":[{"iso":"eng"}],"conference":{"end_date":"2019-01-07","start_date":"2019-01-04","location":"Bangalore, India","name":"ICDCN: Conference on Distributed Computing and Networking"},"doi":"10.1145/3288599.3288617","isi":1,"quality_controlled":"1","oa":1,"external_id":{"isi":["000484491600019"],"arxiv":["1809.00896"]},"main_file_link":[{"url":"https://arxiv.org/abs/1809.00896","open_access":"1"}],"month":"01","publication_identifier":{"isbn":["978-1-4503-6094-4 "]},"date_created":"2019-02-10T22:59:17Z","date_updated":"2023-08-24T14:41:53Z","author":[{"full_name":"Chatterjee, Bapi","last_name":"Chatterjee","first_name":"Bapi","orcid":"0000-0002-2742-4028","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Peri, Sathya","last_name":"Peri","first_name":"Sathya"},{"last_name":"Sa","first_name":"Muktikanta","full_name":"Sa, Muktikanta"},{"first_name":"Nandini","last_name":"Singhal","full_name":"Singhal, Nandini"}],"publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"ACM","year":"2019"},{"issue":"4","abstract":[{"lang":"eng","text":"A thrackle is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are defined similarly, except that every pair of edges that do not share a vertex are allowed to cross an odd number of times. It is also shown that the maximum number of edges of a quasi-thrackle on n vertices is [Formula presented](n−1), and that this bound is best possible for infinitely many values of n."}],"type":"journal_article","oa_version":"Preprint","intvolume":" 259","title":"Thrackles: An improved upper bound","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"5857","article_processing_charge":"No","day":"30","scopus_import":"1","date_published":"2019-04-30T00:00:00Z","page":"266-231","article_type":"original","citation":{"chicago":"Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.” Discrete Applied Mathematics. Elsevier, 2019. https://doi.org/10.1016/j.dam.2018.12.025.","short":"R. Fulek, J. Pach, Discrete Applied Mathematics 259 (2019) 266–231.","mla":"Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.” Discrete Applied Mathematics, vol. 259, no. 4, Elsevier, 2019, pp. 266–231, doi:10.1016/j.dam.2018.12.025.","apa":"Fulek, R., & Pach, J. (2019). Thrackles: An improved upper bound. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2018.12.025","ieee":"R. Fulek and J. Pach, “Thrackles: An improved upper bound,” Discrete Applied Mathematics, vol. 259, no. 4. Elsevier, pp. 266–231, 2019.","ista":"Fulek R, Pach J. 2019. Thrackles: An improved upper bound. Discrete Applied Mathematics. 259(4), 266–231.","ama":"Fulek R, Pach J. Thrackles: An improved upper bound. Discrete Applied Mathematics. 2019;259(4):266-231. doi:10.1016/j.dam.2018.12.025"},"publication":"Discrete Applied Mathematics","volume":259,"date_created":"2019-01-20T22:59:17Z","date_updated":"2023-08-24T14:39:33Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"433"}]},"author":[{"full_name":"Fulek, Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","first_name":"Radoslav","last_name":"Fulek"},{"full_name":"Pach, János","last_name":"Pach","first_name":"János"}],"department":[{"_id":"UlWa"}],"publisher":"Elsevier","publication_status":"published","year":"2019","publication_identifier":{"issn":["0166218X"]},"month":"04","language":[{"iso":"eng"}],"doi":"10.1016/j.dam.2018.12.025","project":[{"grant_number":"M02281","_id":"261FA626-B435-11E9-9278-68D0E5697425","name":"Eliminating intersections in drawings of graphs","call_identifier":"FWF"}],"quality_controlled":"1","isi":1,"main_file_link":[{"url":"https://arxiv.org/abs/1708.08037","open_access":"1"}],"external_id":{"arxiv":["1708.08037"],"isi":["000466061100020"]},"oa":1},{"language":[{"iso":"eng"}],"doi":"10.3390/life9010009","isi":1,"quality_controlled":"1","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"},"external_id":{"isi":["000464125500001"]},"month":"01","publication_identifier":{"eissn":["20751729"]},"date_created":"2019-02-10T22:59:15Z","date_updated":"2023-08-24T14:43:41Z","volume":9,"author":[{"full_name":"Corominas-Murtra, Bernat","id":"43BE2298-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9806-5643","first_name":"Bernat","last_name":"Corominas-Murtra"}],"publication_status":"published","department":[{"_id":"EdHa"}],"publisher":"MDPI","year":"2019","file_date_updated":"2020-07-14T12:47:13Z","article_number":"9","date_published":"2019-01-15T00:00:00Z","publication":"Life","citation":{"chicago":"Corominas-Murtra, Bernat. “Thermodynamics of Duplication Thresholds in Synthetic Protocell Systems.” Life. MDPI, 2019. https://doi.org/10.3390/life9010009.","mla":"Corominas-Murtra, Bernat. “Thermodynamics of Duplication Thresholds in Synthetic Protocell Systems.” Life, vol. 9, no. 1, 9, MDPI, 2019, doi:10.3390/life9010009.","short":"B. Corominas-Murtra, Life 9 (2019).","ista":"Corominas-Murtra B. 2019. Thermodynamics of duplication thresholds in synthetic protocell systems. Life. 9(1), 9.","ieee":"B. Corominas-Murtra, “Thermodynamics of duplication thresholds in synthetic protocell systems,” Life, vol. 9, no. 1. MDPI, 2019.","apa":"Corominas-Murtra, B. (2019). Thermodynamics of duplication thresholds in synthetic protocell systems. Life. MDPI. https://doi.org/10.3390/life9010009","ama":"Corominas-Murtra B. Thermodynamics of duplication thresholds in synthetic protocell systems. Life. 2019;9(1). doi:10.3390/life9010009"},"day":"15","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":963454,"creator":"dernst","access_level":"open_access","file_name":"2019_Life_Corominas.pdf","checksum":"7d2322cd96ace41959909b66702d5cf4","date_created":"2019-02-11T10:45:27Z","date_updated":"2020-07-14T12:47:13Z","relation":"main_file","file_id":"5951"}],"title":"Thermodynamics of duplication thresholds in synthetic protocell systems","ddc":["570"],"status":"public","intvolume":" 9","_id":"5944","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"Understanding the thermodynamics of the duplication process is a fundamental step towards a comprehensive physical theory of biological systems. However, the immense complexity of real cells obscures the fundamental tensions between energy gradients and entropic contributions that underlie duplication. The study of synthetic, feasible systems reproducing part of the key ingredients of living entities but overcoming major sources of biological complexity is of great relevance to deepen the comprehension of the fundamental thermodynamic processes underlying life and its prevalence. In this paper an abstract—yet realistic—synthetic system made of small synthetic protocell aggregates is studied in detail. A fundamental relation between free energy and entropic gradients is derived for a general, non-equilibrium scenario, setting the thermodynamic conditions for the occurrence and prevalence of duplication phenomena. This relation sets explicitly how the energy gradients invested in creating and maintaining structural—and eventually, functional—elements of the system must always compensate the entropic gradients, whose contributions come from changes in the translational, configurational, and macrostate entropies, as well as from dissipation due to irreversible transitions. Work/energy relations are also derived, defining lower bounds on the energy required for the duplication event to take place. A specific example including real ternary emulsions is provided in order to grasp the orders of magnitude involved in the problem. It is found that the minimal work invested over the system to trigger a duplication event is around ~ 10−13J , which results, in the case of duplication of all the vesicles contained in a liter of emulsion, in an amount of energy around ~ 1kJ . Without aiming to describe a truly biological process of duplication, this theoretical contribution seeks to explicitly define and identify the key actors that participate in it."}],"issue":"1","type":"journal_article"}]