[{"quality_controlled":0,"abstract":[{"lang":"eng","text":"We show that weak solutions of the Derrida-Lebowitz-Speer-Spohn (DLSS) equation display infinite speed of support propagation. We apply our method to the case of the quantum drift-diffusion equation which augments the DLSS equation with a drift term and possibly a second-order diffusion term. The proof is accomplished using weighted entropy estimates, Hardy's inequality and a family of singular weight functions to derive a differential inequality; the differential inequality shows exponential growth of the weighted entropy, with the growth constant blowing up very fast as the singularity of the weight becomes sharper. To the best of our knowledge, this is the first example of a nonnegativity-preserving higher-order parabolic equation displaying infinite speed of support propagation."}],"publication_status":"published","status":"public","intvolume":"        21","date_updated":"2021-01-12T06:49:47Z","author":[{"id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","first_name":"Julian L","full_name":"Julian Fischer","last_name":"Fischer","orcid":"0000-0002-0479-558X"}],"publist_id":"5960","issue":"1","citation":{"mla":"Fischer, Julian L. “Infinite Speed of Support Propagation for the Derrida-Lebowitz-Speer-Spohn Equation and Quantum Drift-Diffusion Models.” <i>Nonlinear Differential Equations and Applications</i>, vol. 21, no. 1, Birkhäuser, 2014, pp. 27–50, doi:<a href=\"https://doi.org/10.1007/s00030-013-0235-0\">10.1007/s00030-013-0235-0</a>.","apa":"Fischer, J. L. (2014). Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn equation and quantum drift-diffusion models. <i>Nonlinear Differential Equations and Applications</i>. Birkhäuser. <a href=\"https://doi.org/10.1007/s00030-013-0235-0\">https://doi.org/10.1007/s00030-013-0235-0</a>","ista":"Fischer JL. 2014. Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn equation and quantum drift-diffusion models. Nonlinear Differential Equations and Applications. 21(1), 27–50.","chicago":"Fischer, Julian L. “Infinite Speed of Support Propagation for the Derrida-Lebowitz-Speer-Spohn Equation and Quantum Drift-Diffusion Models.” <i>Nonlinear Differential Equations and Applications</i>. Birkhäuser, 2014. <a href=\"https://doi.org/10.1007/s00030-013-0235-0\">https://doi.org/10.1007/s00030-013-0235-0</a>.","ama":"Fischer JL. Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn equation and quantum drift-diffusion models. <i>Nonlinear Differential Equations and Applications</i>. 2014;21(1):27-50. doi:<a href=\"https://doi.org/10.1007/s00030-013-0235-0\">10.1007/s00030-013-0235-0</a>","ieee":"J. L. Fischer, “Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn equation and quantum drift-diffusion models,” <i>Nonlinear Differential Equations and Applications</i>, vol. 21, no. 1. Birkhäuser, pp. 27–50, 2014.","short":"J.L. Fischer, Nonlinear Differential Equations and Applications 21 (2014) 27–50."},"_id":"1309","page":"27 - 50","month":"01","year":"2014","title":"Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn equation and quantum drift-diffusion models","date_created":"2018-12-11T11:51:17Z","extern":1,"day":"01","publication":"Nonlinear Differential Equations and Applications","volume":21,"type":"journal_article","doi":"10.1007/s00030-013-0235-0","date_published":"2014-01-01T00:00:00Z","publisher":"Birkhäuser"},{"citation":{"chicago":"Fischer, Julian L. “Upper Bounds on Waiting Times for the Thin-Film Equation: The Case of Weak Slippage.” <i>Archive for Rational Mechanics and Analysis</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00205-013-0690-0\">https://doi.org/10.1007/s00205-013-0690-0</a>.","ama":"Fischer JL. Upper bounds on waiting times for the Thin-film equation: The case of weak slippage. <i>Archive for Rational Mechanics and Analysis</i>. 2014;211(3):771-818. doi:<a href=\"https://doi.org/10.1007/s00205-013-0690-0\">10.1007/s00205-013-0690-0</a>","ista":"Fischer JL. 2014. Upper bounds on waiting times for the Thin-film equation: The case of weak slippage. Archive for Rational Mechanics and Analysis. 211(3), 771–818.","apa":"Fischer, J. L. (2014). Upper bounds on waiting times for the Thin-film equation: The case of weak slippage. <i>Archive for Rational Mechanics and Analysis</i>. Springer. <a href=\"https://doi.org/10.1007/s00205-013-0690-0\">https://doi.org/10.1007/s00205-013-0690-0</a>","mla":"Fischer, Julian L. “Upper Bounds on Waiting Times for the Thin-Film Equation: The Case of Weak Slippage.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 211, no. 3, Springer, 2014, pp. 771–818, doi:<a href=\"https://doi.org/10.1007/s00205-013-0690-0\">10.1007/s00205-013-0690-0</a>.","short":"J.L. Fischer, Archive for Rational Mechanics and Analysis 211 (2014) 771–818.","ieee":"J. L. Fischer, “Upper bounds on waiting times for the Thin-film equation: The case of weak slippage,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 211, no. 3. Springer, pp. 771–818, 2014."},"issue":"3","author":[{"orcid":"0000-0002-0479-558X","first_name":"Julian L","full_name":"Julian Fischer","last_name":"Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5959","page":"771 - 818","_id":"1312","status":"public","quality_controlled":0,"abstract":[{"lang":"eng","text":"We derive upper bounds on the waiting time of solutions to the thin-film equation in the regime of weak slippage n ∈ [2, 32\\11). In particular, we give sufficient conditions on the initial data for instantaneous forward motion of the free boundary. For n ∈ (2, 32\\11), our estimates are sharp, for n = 2, they are sharp up to a logarithmic correction term. Note that the case n = 2 corresponds-with a grain of salt-to the assumption of the Navier slip condition at the fluid-solid interface. We also obtain results in the regime of strong slippage n ∈ (1,2); however, in this regime we expect them not to be optimal. Our method is based on weighted backward entropy estimates, Hardy's inequality and singular weight functions; we deduce a differential inequality which would enforce blowup of the weighted entropy if the contact line were to remain stationary for too long."}],"publication_status":"published","date_updated":"2021-01-12T06:49:48Z","intvolume":"       211","type":"journal_article","doi":"10.1007/s00205-013-0690-0","volume":211,"publisher":"Springer","date_published":"2014-01-01T00:00:00Z","date_created":"2018-12-11T11:51:18Z","title":"Upper bounds on waiting times for the Thin-film equation: The case of weak slippage","month":"01","year":"2014","publication":"Archive for Rational Mechanics and Analysis","day":"01","extern":1},{"page":"113 - 130","file":[{"checksum":"dab6ab36a5f6af94f2b597e6404ed11d","date_updated":"2020-07-14T12:45:28Z","relation":"main_file","file_size":492310,"content_type":"application/pdf","date_created":"2018-12-12T10:13:17Z","file_name":"IST-2016-682-v1+1_578.pdf","access_level":"open_access","creator":"system","file_id":"4999"}],"abstract":[{"lang":"eng","text":"NMAC is a mode of operation which turns a fixed input-length keyed hash function f into a variable input-length function. A practical single-key variant of NMAC called HMAC is a very popular and widely deployed message authentication code (MAC). Security proofs and attacks for NMAC can typically be lifted to HMAC. NMAC was introduced by Bellare, Canetti and Krawczyk [Crypto'96], who proved it to be a secure pseudorandom function (PRF), and thus also a MAC, assuming that (1) f is a PRF and (2) the function we get when cascading f is weakly collision-resistant. Unfortunately, HMAC is typically instantiated with cryptographic hash functions like MD5 or SHA-1 for which (2) has been found to be wrong. To restore the provable guarantees for NMAC, Bellare [Crypto'06] showed its security based solely on the assumption that f is a PRF, albeit via a non-uniform reduction. - Our first contribution is a simpler and uniform proof for this fact: If f is an ε-secure PRF (against q queries) and a δ-non-adaptively secure PRF (against q queries), then NMAC f is an (ε+ℓqδ)-secure PRF against q queries of length at most ℓ blocks each. - We then show that this ε+ℓqδ bound is basically tight. For the most interesting case where ℓqδ ≥ ε we prove this by constructing an f for which an attack with advantage ℓqδ exists. This also violates the bound O(ℓε) on the PRF-security of NMAC recently claimed by Koblitz and Menezes. - Finally, we analyze the PRF-security of a modification of NMAC called NI [An and Bellare, Crypto'99] that differs mainly by using a compression function with an additional keying input. This avoids the constant rekeying on multi-block messages in NMAC and allows for a security proof starting by the standard switch from a PRF to a random function, followed by an information-theoretic analysis. We carry out such an analysis, obtaining a tight ℓq2/2 c bound for this step, improving over the trivial bound of ℓ2q2/2c. The proof borrows combinatorial techniques originally developed for proving the security of CBC-MAC [Bellare et al., Crypto'05]."}],"publication_status":"published","status":"public","intvolume":"      8616","pubrep_id":"682","volume":8616,"department":[{"_id":"KrPi"}],"ec_funded":1,"alternative_title":["LNCS"],"scopus_import":"1","year":"2014","has_accepted_license":"1","title":"The exact PRF-security of NMAC and HMAC","day":"01","author":[{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","full_name":"Gazi, Peter","last_name":"Gazi"},{"orcid":"0000-0002-9139-1654","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","last_name":"Rybar","first_name":"Michal","full_name":"Rybar, Michal"}],"publist_id":"4955","citation":{"ieee":"P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact PRF-security of NMAC and HMAC,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA, 2014, vol. 8616, no. 1, pp. 113–130.","short":"P. Gazi, K.Z. Pietrzak, M. Rybar, in:, J. Garay, R. Gennaro (Eds.), Springer, 2014, pp. 113–130.","mla":"Gazi, Peter, et al. <i>The Exact PRF-Security of NMAC and HMAC</i>. Edited by Juan Garay and Rosario Gennaro, vol. 8616, no. 1, Springer, 2014, pp. 113–30, doi:<a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">10.1007/978-3-662-44371-2_7</a>.","apa":"Gazi, P., Pietrzak, K. Z., &#38; Rybar, M. (2014). The exact PRF-security of NMAC and HMAC. In J. Garay &#38; R. Gennaro (Eds.) (Vol. 8616, pp. 113–130). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">https://doi.org/10.1007/978-3-662-44371-2_7</a>","ama":"Gazi P, Pietrzak KZ, Rybar M. The exact PRF-security of NMAC and HMAC. In: Garay J, Gennaro R, eds. Vol 8616. Springer; 2014:113-130. doi:<a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">10.1007/978-3-662-44371-2_7</a>","ista":"Gazi P, Pietrzak KZ, Rybar M. 2014. The exact PRF-security of NMAC and HMAC. CRYPTO: International Cryptology Conference, LNCS, vol. 8616, 113–130.","chicago":"Gazi, Peter, Krzysztof Z Pietrzak, and Michal Rybar. “The Exact PRF-Security of NMAC and HMAC.” edited by Juan Garay and Rosario Gennaro, 8616:113–30. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">https://doi.org/10.1007/978-3-662-44371-2_7</a>."},"issue":"1","_id":"2082","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","corr_author":"1","date_updated":"2026-04-08T14:18:39Z","oa":1,"type":"conference","doi":"10.1007/978-3-662-44371-2_7","conference":{"end_date":"2014-08-21","location":"Santa Barbara, USA","name":"CRYPTO: International Cryptology Conference","start_date":"2014-08-17"},"file_date_updated":"2020-07-14T12:45:28Z","date_published":"2014-01-01T00:00:00Z","publisher":"Springer","related_material":{"record":[{"relation":"dissertation_contains","id":"838","status":"public"}]},"language":[{"iso":"eng"}],"month":"01","oa_version":"Submitted Version","date_created":"2018-12-11T11:55:36Z","ddc":["000","004"],"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","grant_number":"259668","call_identifier":"FP7"}],"editor":[{"last_name":"Garay","full_name":"Garay, Juan","first_name":"Juan"},{"last_name":"Gennaro","first_name":"Rosario","full_name":"Gennaro, Rosario"}]},{"intvolume":"        68","status":"public","isi":1,"file":[{"access_level":"open_access","creator":"dernst","file_id":"7845","checksum":"8d459b07e4a11bb5fde92d969184fe48","relation":"main_file","file_size":467254,"date_updated":"2020-07-14T12:45:28Z","content_type":"application/pdf","date_created":"2020-05-14T16:40:31Z","file_name":"2014_Evolution_Lagator.pdf"}],"publication_status":"published","abstract":[{"lang":"eng","text":"Understanding the effects of sex and migration on adaptation to novel environments remains a key problem in evolutionary biology. Using a single-cell alga Chlamydomonas reinhardtii, we investigated how sex and migration affected rates of evolutionary rescue in a sink environment, and subsequent changes in fitness following evolutionary rescue. We show that sex and migration affect both the rate of evolutionary rescue and subsequent adaptation. However, their combined effects change as the populations adapt to a sink habitat. Both sex and migration independently increased rates of evolutionary rescue, but the effect of sex on subsequent fitness improvements, following initial rescue, changed with migration, as sex was beneficial in the absence of migration but constraining adaptation when combined with migration. These results suggest that sex and migration are beneficial during the initial stages of adaptation, but can become detrimental as the population adapts to its environment."}],"page":"2296 - 2305","article_processing_charge":"No","publication":"Evolution","day":"25","has_accepted_license":"1","title":"Role of sex and migration in adaptation to sink environments","year":"2014","scopus_import":"1","volume":68,"department":[{"_id":"CaGu"}],"oa":1,"date_updated":"2025-09-29T11:46:47Z","article_type":"original","corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","_id":"2083","issue":"8","acknowledgement":"The authors are grateful to the Leverhulme Trust (F/00 215/AW) for funding this work.","citation":{"mla":"Lagator, Mato, et al. “Role of Sex and Migration in Adaptation to Sink Environments.” <i>Evolution</i>, vol. 68, no. 8, Wiley, 2014, pp. 2296–305, doi:<a href=\"https://doi.org/10.1111/evo.12440\">10.1111/evo.12440</a>.","apa":"Lagator, M., Morgan, A., Neve, P., &#38; Colegrave, N. (2014). Role of sex and migration in adaptation to sink environments. <i>Evolution</i>. Wiley. <a href=\"https://doi.org/10.1111/evo.12440\">https://doi.org/10.1111/evo.12440</a>","ama":"Lagator M, Morgan A, Neve P, Colegrave N. Role of sex and migration in adaptation to sink environments. <i>Evolution</i>. 2014;68(8):2296-2305. doi:<a href=\"https://doi.org/10.1111/evo.12440\">10.1111/evo.12440</a>","chicago":"Lagator, Mato, Andrew Morgan, Paul Neve, and Nick Colegrave. “Role of Sex and Migration in Adaptation to Sink Environments.” <i>Evolution</i>. Wiley, 2014. <a href=\"https://doi.org/10.1111/evo.12440\">https://doi.org/10.1111/evo.12440</a>.","ista":"Lagator M, Morgan A, Neve P, Colegrave N. 2014. Role of sex and migration in adaptation to sink environments. Evolution. 68(8), 2296–2305.","ieee":"M. Lagator, A. Morgan, P. Neve, and N. Colegrave, “Role of sex and migration in adaptation to sink environments,” <i>Evolution</i>, vol. 68, no. 8. Wiley, pp. 2296–2305, 2014.","short":"M. Lagator, A. Morgan, P. Neve, N. Colegrave, Evolution 68 (2014) 2296–2305."},"publist_id":"4954","author":[{"id":"345D25EC-F248-11E8-B48F-1D18A9856A87","last_name":"Lagator","first_name":"Mato","full_name":"Lagator, Mato"},{"first_name":"Andrew","full_name":"Morgan, Andrew","last_name":"Morgan"},{"last_name":"Neve","full_name":"Neve, Paul","first_name":"Paul"},{"last_name":"Colegrave","full_name":"Colegrave, Nick","first_name":"Nick"}],"ddc":["570"],"external_id":{"isi":["000340470600012"]},"date_created":"2018-12-11T11:55:36Z","oa_version":"Published Version","month":"04","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"research_data","id":"9747","status":"public"}]},"date_published":"2014-04-25T00:00:00Z","publisher":"Wiley","doi":"10.1111/evo.12440","file_date_updated":"2020-07-14T12:45:28Z","type":"journal_article"},{"article_processing_charge":"No","page":"1713 - 1726","publication_status":"published","abstract":[{"lang":"eng","text":"Receptor tyrosine kinases (RTKs) are a large family of cell surface receptors that sense growth factors and hormones and regulate a variety of cell behaviours in health and disease. Contactless activation of RTKs with spatial and temporal precision is currently not feasible. Here, we generated RTKs that are insensitive to endogenous ligands but can be selectively activated by low-intensity blue light. We screened light-oxygen-voltage (LOV)-sensing domains for their ability to activate RTKs by light-activated dimerization. Incorporation of LOV domains found in aureochrome photoreceptors of stramenopiles resulted in robust activation of the fibroblast growth factor receptor 1 (FGFR1), epidermal growth factor receptor (EGFR) and rearranged during transfection (RET). In human cancer and endothelial cells, light induced cellular signalling with spatial and temporal precision. Furthermore, light faithfully mimicked complex mitogenic and morphogenic cell behaviour induced by growth factors. RTKs under optical control (Opto-RTKs) provide a powerful optogenetic approach to actuate cellular signals and manipulate cell behaviour."}],"isi":1,"status":"public","intvolume":"        33","volume":33,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4194103/","open_access":"1"}],"department":[{"_id":"HaJa"}],"scopus_import":"1","year":"2014","title":"Spatio-temporally precise activation of engineered receptor tyrosine kinases by light","day":"01","publication":"EMBO Journal","author":[{"first_name":"Michael","full_name":"Grusch, Michael","last_name":"Grusch"},{"full_name":"Schelch, Karin","first_name":"Karin","last_name":"Schelch"},{"last_name":"Riedler","first_name":"Robert","full_name":"Riedler, Robert"},{"full_name":"Gschaider-Reichhart, Eva","first_name":"Eva","last_name":"Gschaider-Reichhart","orcid":"0000-0002-7218-7738","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Differ, Christopher","first_name":"Christopher","last_name":"Differ"},{"first_name":"Walter","full_name":"Berger, Walter","last_name":"Berger"},{"first_name":"Álvaro","full_name":"Inglés Prieto, Álvaro","last_name":"Inglés Prieto","orcid":"0000-0002-5409-8571","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87"},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L","first_name":"Harald L","last_name":"Janovjak","orcid":"0000-0002-8023-9315"}],"publist_id":"4953","acknowledgement":"European Union Seventh Framework Programme; Human Frontier Science Program; Oesterreichische Nationalbank Anniversary Fund 14211; Austrian Research Promotion Agency; FemTech","citation":{"ista":"Grusch M, Schelch K, Riedler R, Gschaider-Reichhart E, Differ C, Berger W, Inglés Prieto Á, Janovjak HL. 2014. Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. EMBO Journal. 33(15), 1713–1726.","ama":"Grusch M, Schelch K, Riedler R, et al. Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. <i>EMBO Journal</i>. 2014;33(15):1713-1726. doi:<a href=\"https://doi.org/10.15252/embj.201387695\">10.15252/embj.201387695</a>","chicago":"Grusch, Michael, Karin Schelch, Robert Riedler, Eva Gschaider-Reichhart, Christopher Differ, Walter Berger, Álvaro Inglés Prieto, and Harald L Janovjak. “Spatio-Temporally Precise Activation of Engineered Receptor Tyrosine Kinases by Light.” <i>EMBO Journal</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.15252/embj.201387695\">https://doi.org/10.15252/embj.201387695</a>.","apa":"Grusch, M., Schelch, K., Riedler, R., Gschaider-Reichhart, E., Differ, C., Berger, W., … Janovjak, H. L. (2014). Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.15252/embj.201387695\">https://doi.org/10.15252/embj.201387695</a>","mla":"Grusch, Michael, et al. “Spatio-Temporally Precise Activation of Engineered Receptor Tyrosine Kinases by Light.” <i>EMBO Journal</i>, vol. 33, no. 15, Wiley-Blackwell, 2014, pp. 1713–26, doi:<a href=\"https://doi.org/10.15252/embj.201387695\">10.15252/embj.201387695</a>.","short":"M. Grusch, K. Schelch, R. Riedler, E. Gschaider-Reichhart, C. Differ, W. Berger, Á. Inglés Prieto, H.L. Janovjak, EMBO Journal 33 (2014) 1713–1726.","ieee":"M. Grusch <i>et al.</i>, “Spatio-temporally precise activation of engineered receptor tyrosine kinases by light,” <i>EMBO Journal</i>, vol. 33, no. 15. Wiley-Blackwell, pp. 1713–1726, 2014."},"issue":"15","_id":"2084","quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","corr_author":"1","date_updated":"2026-04-08T14:11:53Z","oa":1,"type":"journal_article","doi":"10.15252/embj.201387695","date_published":"2014-07-01T00:00:00Z","publisher":"Wiley-Blackwell","related_material":{"record":[{"id":"418","relation":"dissertation_contains","status":"public"}]},"language":[{"iso":"eng"}],"month":"07","oa_version":"Submitted Version","date_created":"2018-12-11T11:55:37Z","external_id":{"isi":["000339917000011"]}},{"department":[{"_id":"SyCr"}],"volume":9,"article_number":"e103989","has_accepted_license":"1","title":"So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees","year":"2014","scopus_import":"1","publication":"PLoS One","day":"06","article_processing_charge":"No","isi":1,"status":"public","abstract":[{"lang":"eng","text":"Pathogens may gain a fitness advantage through manipulation of the behaviour of their hosts. Likewise, host behavioural changes can be a defence mechanism, counteracting the impact of pathogens on host fitness. We apply harmonic radar technology to characterize the impact of an emerging pathogen - Nosema ceranae (Microsporidia) - on honeybee (Apis mellifera) flight and orientation performance in the field. Honeybees are the most important commercial pollinators. Emerging diseases have been proposed to play a prominent role in colony decline, partly through sub-lethal behavioural manipulation of their hosts. We found that homing success was significantly reduced in diseased (65.8%) versus healthy foragers (92.5%). Although lost bees had significantly reduced continuous flight times and prolonged resting times, other flight characteristics and navigational abilities showed no significant difference between infected and non-infected bees. Our results suggest that infected bees express normal flight characteristics but are constrained in their homing ability, potentially compromising the colony by reducing its resource inputs, but also counteracting the intra-colony spread of infection. We provide the first high-resolution analysis of sub-lethal effects of an emerging disease on insect flight behaviour. The potential causes and the implications for both host and parasite are discussed."}],"publication_status":"published","file":[{"checksum":"2fc62c6739eada4bddf026afbae669db","date_updated":"2020-07-14T12:45:28Z","relation":"main_file","file_size":1013386,"content_type":"application/pdf","date_created":"2018-12-12T10:13:55Z","file_name":"IST-2016-437-v1+1_journal.pone.0103989.pdf","access_level":"open_access","creator":"system","file_id":"5042"}],"pubrep_id":"437","intvolume":"         9","type":"journal_article","doi":"10.1371/journal.pone.0103989","file_date_updated":"2020-07-14T12:45:28Z","related_material":{"record":[{"relation":"research_data","id":"9888","status":"public"}]},"language":[{"iso":"eng"}],"date_published":"2014-08-06T00:00:00Z","publisher":"Public Library of Science","date_created":"2018-12-11T11:55:37Z","oa_version":"Published Version","month":"08","ddc":["570"],"external_id":{"isi":["000339995100042"]},"issue":"8","acknowledgement":"This study was funded jointly by a grant from BBSRC, Defra, NERC, the Scottish Government and the Wellcome Trust, under the Insect Pollinators Initiative (grant numbers BB/I00097/1 and BB/I000100/1). Rothamsted Research is a national institute of bioscience strategically funded by the UK Biotechnology and Biological Sciences Research Council (BBSRC).","citation":{"chicago":"Wolf, Stephan, Dino Mcmahon, Ka Lim, Christopher Pull, Suzanne Clark, Robert Paxton, and Juliet Osborne. “So near and yet so Far: Harmonic Radar Reveals Reduced Homing Ability of Nosema Infected Honeybees.” <i>PLoS One</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pone.0103989\">https://doi.org/10.1371/journal.pone.0103989</a>.","ista":"Wolf S, Mcmahon D, Lim K, Pull C, Clark S, Paxton R, Osborne J. 2014. So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees. PLoS One. 9(8), e103989.","ama":"Wolf S, Mcmahon D, Lim K, et al. So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees. <i>PLoS One</i>. 2014;9(8). doi:<a href=\"https://doi.org/10.1371/journal.pone.0103989\">10.1371/journal.pone.0103989</a>","apa":"Wolf, S., Mcmahon, D., Lim, K., Pull, C., Clark, S., Paxton, R., &#38; Osborne, J. (2014). So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0103989\">https://doi.org/10.1371/journal.pone.0103989</a>","mla":"Wolf, Stephan, et al. “So near and yet so Far: Harmonic Radar Reveals Reduced Homing Ability of Nosema Infected Honeybees.” <i>PLoS One</i>, vol. 9, no. 8, e103989, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pone.0103989\">10.1371/journal.pone.0103989</a>.","short":"S. Wolf, D. Mcmahon, K. Lim, C. Pull, S. Clark, R. Paxton, J. Osborne, PLoS One 9 (2014).","ieee":"S. Wolf <i>et al.</i>, “So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees,” <i>PLoS One</i>, vol. 9, no. 8. Public Library of Science, 2014."},"author":[{"last_name":"Wolf","full_name":"Wolf, Stephan","first_name":"Stephan"},{"first_name":"Dino","full_name":"Mcmahon, Dino","last_name":"Mcmahon"},{"full_name":"Lim, Ka","first_name":"Ka","last_name":"Lim"},{"id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1122-3982","full_name":"Pull, Christopher","first_name":"Christopher","last_name":"Pull"},{"last_name":"Clark","full_name":"Clark, Suzanne","first_name":"Suzanne"},{"first_name":"Robert","full_name":"Paxton, Robert","last_name":"Paxton"},{"full_name":"Osborne, Juliet","first_name":"Juliet","last_name":"Osborne"}],"publist_id":"4949","_id":"2086","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","date_updated":"2025-09-29T11:45:41Z","tmp":{"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)","image":"/images/cc_by.png"},"oa":1},{"intvolume":"        53","abstract":[{"text":"Racemates increase the chances of crystallization by allowing molecular contacts to be formed in a greater number of ways. With the advent of protein synthesis, the production of protein racemates and racemic‐protein crystallography are now possible. Curiously, racemic DNA crystallography had not been investigated despite the commercial availability of L- and D‐deoxyribo‐oligonucleotides. Here, we report a study into racemic DNA crystallography showing the strong propensity of racemic DNA mixtures to form racemic crystals. We describe racemic crystal structures of various DNA sequences and folded conformations, including duplexes, quadruplexes, and a four‐way junction, showing that the advantages of racemic crystallography should extend to DNA.","lang":"eng"}],"publication_status":"published","status":"public","page":"14424-14427","article_processing_charge":"No","publication":"Angewandte Chemie International Edition","year":"2014","title":"Racemic DNA crystallography","has_accepted_license":"1","OA_type":"free access","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/anie.201409014"}],"volume":53,"article_type":"original","date_updated":"2026-02-23T09:12:57Z","oa":1,"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"21102","OA_place":"publisher","author":[{"id":"6a3def15-d4b4-11ef-9fa9-a24c1f545ec3","first_name":"Pradeep K","full_name":"Mandal, Pradeep K","last_name":"Mandal","orcid":"0000-0001-5996-956X"},{"full_name":"Collie, Gavin W.","first_name":"Gavin W.","last_name":"Collie"},{"last_name":"Kauffmann","full_name":"Kauffmann, Brice","first_name":"Brice"},{"full_name":"Huc, Ivan","first_name":"Ivan","last_name":"Huc"}],"citation":{"mla":"Mandal, Pradeep K., et al. “Racemic DNA Crystallography.” <i>Angewandte Chemie International Edition</i>, vol. 53, no. 52, Wiley, 2014, pp. 14424–27, doi:<a href=\"https://doi.org/10.1002/anie.201409014\">10.1002/anie.201409014</a>.","apa":"Mandal, P. K., Collie, G. W., Kauffmann, B., &#38; Huc, I. (2014). Racemic DNA crystallography. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201409014\">https://doi.org/10.1002/anie.201409014</a>","ista":"Mandal PK, Collie GW, Kauffmann B, Huc I. 2014. Racemic DNA crystallography. Angewandte Chemie International Edition. 53(52), 14424–14427.","chicago":"Mandal, Pradeep K, Gavin W. Collie, Brice Kauffmann, and Ivan Huc. “Racemic DNA Crystallography.” <i>Angewandte Chemie International Edition</i>. Wiley, 2014. <a href=\"https://doi.org/10.1002/anie.201409014\">https://doi.org/10.1002/anie.201409014</a>.","ama":"Mandal PK, Collie GW, Kauffmann B, Huc I. Racemic DNA crystallography. <i>Angewandte Chemie International Edition</i>. 2014;53(52):14424-14427. doi:<a href=\"https://doi.org/10.1002/anie.201409014\">10.1002/anie.201409014</a>","ieee":"P. K. Mandal, G. W. Collie, B. Kauffmann, and I. Huc, “Racemic DNA crystallography,” <i>Angewandte Chemie International Edition</i>, vol. 53, no. 52. Wiley, pp. 14424–14427, 2014.","short":"P.K. Mandal, G.W. Collie, B. Kauffmann, I. Huc, Angewandte Chemie International Edition 53 (2014) 14424–14427."},"issue":"52","extern":"1","publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"month":"10","date_created":"2026-01-29T21:49:27Z","oa_version":"Published Version","date_published":"2014-10-01T00:00:00Z","publisher":"Wiley","language":[{"iso":"eng"}],"type":"journal_article","doi":"10.1002/anie.201409014"},{"title":"Facial performance enhancement using dynamic shape space analysis","oa_version":"None","date_created":"2018-12-11T11:55:48Z","year":"2014","month":"03","publication":"ACM Transactions on Graphics","day":"01","extern":"1","doi":"10.1145/2546276","type":"journal_article","volume":33,"article_number":"13","language":[{"iso":"eng"}],"publisher":"ACM","date_published":"2014-03-01T00:00:00Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"The facial performance of an individual is inherently rich in subtle deformation and timing details. Although these subtleties make the performance realistic and compelling, they often elude both motion capture and hand animation. We present a technique for adding fine-scale details and expressiveness to low-resolution art-directed facial performances, such as those created manually using a rig, via marker-based capture, by fitting a morphable model to a video, or through Kinect reconstruction using recent faceshift technology. We employ a high-resolution facial performance capture system to acquire a representative performance of an individual in which he or she explores the full range of facial expressiveness. From the captured data, our system extracts an expressiveness model that encodes subtle spatial and temporal deformation details specific to that particular individual. Once this model has been built, these details can be transferred to low-resolution art-directed performances. We demonstrate results on various forms of input; after our enhancement, the resulting animations exhibit the same nuances and fine spatial details as the captured performance, with optional temporal enhancement to match the dynamics of the actor. Finally, we show that our technique outperforms the current state-of-the-art in example-based facial animation.","lang":"eng"}],"publication_status":"published","date_updated":"2025-08-05T14:26:43Z","intvolume":"        33","citation":{"mla":"Bermano, Amit, et al. “Facial Performance Enhancement Using Dynamic Shape Space Analysis.” <i>ACM Transactions on Graphics</i>, vol. 33, no. 2, 13, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2546276\">10.1145/2546276</a>.","apa":"Bermano, A., Bradley, D., Beeler, T., Zund, F., Nowrouzezahrai, D., Baran, I., … Groß, M. (2014). Facial performance enhancement using dynamic shape space analysis. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2546276\">https://doi.org/10.1145/2546276</a>","ama":"Bermano A, Bradley D, Beeler T, et al. Facial performance enhancement using dynamic shape space analysis. <i>ACM Transactions on Graphics</i>. 2014;33(2). doi:<a href=\"https://doi.org/10.1145/2546276\">10.1145/2546276</a>","chicago":"Bermano, Amit, Derek Bradley, Thabo Beeler, Fabio Zund, Derek Nowrouzezahrai, Ilya Baran, Olga Sorkine Hornung, et al. “Facial Performance Enhancement Using Dynamic Shape Space Analysis.” <i>ACM Transactions on Graphics</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2546276\">https://doi.org/10.1145/2546276</a>.","ista":"Bermano A, Bradley D, Beeler T, Zund F, Nowrouzezahrai D, Baran I, Sorkine Hornung O, Pfister H, Sumner R, Bickel B, Groß M. 2014. Facial performance enhancement using dynamic shape space analysis. ACM Transactions on Graphics. 33(2), 13.","ieee":"A. Bermano <i>et al.</i>, “Facial performance enhancement using dynamic shape space analysis,” <i>ACM Transactions on Graphics</i>, vol. 33, no. 2. ACM, 2014.","short":"A. Bermano, D. Bradley, T. Beeler, F. Zund, D. Nowrouzezahrai, I. Baran, O. Sorkine Hornung, H. Pfister, R. Sumner, B. Bickel, M. Groß, ACM Transactions on Graphics 33 (2014)."},"issue":"2","publist_id":"4919","article_processing_charge":"No","author":[{"last_name":"Bermano","full_name":"Bermano, Amit","first_name":"Amit"},{"full_name":"Bradley, Derek","first_name":"Derek","last_name":"Bradley"},{"full_name":"Beeler, Thabo","first_name":"Thabo","last_name":"Beeler"},{"last_name":"Zund","first_name":"Fabio","full_name":"Zund, Fabio"},{"full_name":"Nowrouzezahrai, Derek","first_name":"Derek","last_name":"Nowrouzezahrai"},{"last_name":"Baran","first_name":"Ilya","full_name":"Baran, Ilya"},{"first_name":"Olga","full_name":"Sorkine Hornung, Olga","last_name":"Sorkine Hornung"},{"last_name":"Pfister","full_name":"Pfister, Hanspeter","first_name":"Hanspeter"},{"last_name":"Sumner","full_name":"Sumner, Robert","first_name":"Robert"},{"orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Groß, Markus","first_name":"Markus","last_name":"Groß"}],"_id":"2115"},{"date_created":"2026-02-06T12:22:51Z","oa_version":"None","month":"07","publication_identifier":{"issn":["2053-230X"]},"extern":"1","doi":"10.1107/s2053230x1401084x","type":"journal_article","language":[{"iso":"eng"}],"date_published":"2014-07-01T00:00:00Z","publisher":"International Union of Crystallography","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","date_updated":"2026-02-23T08:21:48Z","article_type":"original","issue":"7","citation":{"short":"M. Purushothaman, A. Varghese, P.K. Mandal, N. Gautham, Acta Crystallographica Section F Structural Biology Communications 70 (2014) 860–865.","ieee":"M. Purushothaman, A. Varghese, P. K. Mandal, and N. Gautham, “Structure of d(CCCCGGTACCGGGG)2 at 1.65 Å resolution,” <i>Acta Crystallographica Section F Structural Biology Communications</i>, vol. 70, no. 7. International Union of Crystallography, pp. 860–865, 2014.","chicago":"Purushothaman, Monica, Anna Varghese, Pradeep K Mandal, and Namasivayam Gautham. “Structure of d(CCCCGGTACCGGGG)2 at 1.65 Å Resolution.” <i>Acta Crystallographica Section F Structural Biology Communications</i>. International Union of Crystallography, 2014. <a href=\"https://doi.org/10.1107/s2053230x1401084x\">https://doi.org/10.1107/s2053230x1401084x</a>.","ista":"Purushothaman M, Varghese A, Mandal PK, Gautham N. 2014. Structure of d(CCCCGGTACCGGGG)2 at 1.65 Å resolution. Acta Crystallographica Section F Structural Biology Communications. 70(7), 860–865.","ama":"Purushothaman M, Varghese A, Mandal PK, Gautham N. Structure of d(CCCCGGTACCGGGG)2 at 1.65 Å resolution. <i>Acta Crystallographica Section F Structural Biology Communications</i>. 2014;70(7):860-865. doi:<a href=\"https://doi.org/10.1107/s2053230x1401084x\">10.1107/s2053230x1401084x</a>","apa":"Purushothaman, M., Varghese, A., Mandal, P. K., &#38; Gautham, N. (2014). Structure of d(CCCCGGTACCGGGG)2 at 1.65 Å resolution. <i>Acta Crystallographica Section F Structural Biology Communications</i>. International Union of Crystallography. <a href=\"https://doi.org/10.1107/s2053230x1401084x\">https://doi.org/10.1107/s2053230x1401084x</a>","mla":"Purushothaman, Monica, et al. “Structure of d(CCCCGGTACCGGGG)2 at 1.65 Å Resolution.” <i>Acta Crystallographica Section F Structural Biology Communications</i>, vol. 70, no. 7, International Union of Crystallography, 2014, pp. 860–65, doi:<a href=\"https://doi.org/10.1107/s2053230x1401084x\">10.1107/s2053230x1401084x</a>."},"author":[{"first_name":"Monica","full_name":"Purushothaman, Monica","last_name":"Purushothaman"},{"first_name":"Anna","full_name":"Varghese, Anna","last_name":"Varghese"},{"id":"6a3def15-d4b4-11ef-9fa9-a24c1f545ec3","orcid":"0000-0001-5996-956X","last_name":"Mandal","first_name":"Pradeep K","full_name":"Mandal, Pradeep K"},{"last_name":"Gautham","full_name":"Gautham, Namasivayam","first_name":"Namasivayam"}],"_id":"21155","title":"Structure of d(CCCCGGTACCGGGG)2 at 1.65 Å resolution","has_accepted_license":"1","year":"2014","publication":"Acta Crystallographica Section F Structural Biology Communications","day":"01","volume":70,"OA_type":"closed access","status":"public","abstract":[{"lang":"eng","text":"The crystal structure of the tetradecanucleotide d(CCCCGGTACCGGGG)2 has previously been reported as an A-type double helix at a resolution of 2.5 Å in space group P41. Here, the structure of this sequence was determined at a significantly higher resolution of 1.65 Å in space group P41212. The differences in crystal packing between the former and latter are described. The crystallographic asymmetric unit consists of one tetradecanucleotide duplex that spans more than one full turn of the A-helix. This structure allowed the unambiguous identification of solvent interactions."}],"publication_status":"published","intvolume":"        70","article_processing_charge":"No","page":"860-865"},{"status":"public","abstract":[{"lang":"eng","text":"We study approximations to a class of vector-valued equations of Burgers type driven by a multiplicative space-time white noise. A solution theory for this class of equations has been developed recently in Probability Theory Related Fields by Hairer and Weber. The key idea was to use the theory of controlled rough paths to give definitions of weak/mild solutions and to set up a Picard iteration argument. In this article the limiting behavior of a rather large class of (spatial) approximations to these equations is studied. These approximations are shown to converge and convergence rates are given, but the limit may depend on the particular choice of approximation. This effect is a spatial analogue to the Itô-Stratonovich correction in the theory of stochastic ordinary differential equations, where it is well known that different approximation schemes may converge to different solutions."}],"publication_status":"published","intvolume":"        67","article_processing_charge":"No","page":"776 - 870","title":"Approximating rough stochastic PDEs","year":"2014","publication":"Communications on Pure and Applied Mathematics","day":"01","volume":67,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1202.3094 "}],"arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"date_updated":"2025-08-05T14:22:59Z","issue":"5","citation":{"apa":"Hairer, M., Maas, J., &#38; Weber, H. (2014). Approximating rough stochastic PDEs. <i>Communications on Pure and Applied Mathematics</i>. Wiley. <a href=\"https://doi.org/10.1002/cpa.21495\">https://doi.org/10.1002/cpa.21495</a>","mla":"Hairer, Martin, et al. “Approximating Rough Stochastic PDEs.” <i>Communications on Pure and Applied Mathematics</i>, vol. 67, no. 5, Wiley, 2014, pp. 776–870, doi:<a href=\"https://doi.org/10.1002/cpa.21495\">10.1002/cpa.21495</a>.","ama":"Hairer M, Maas J, Weber H. Approximating rough stochastic PDEs. <i>Communications on Pure and Applied Mathematics</i>. 2014;67(5):776-870. doi:<a href=\"https://doi.org/10.1002/cpa.21495\">10.1002/cpa.21495</a>","chicago":"Hairer, Martin, Jan Maas, and Hendrik Weber. “Approximating Rough Stochastic PDEs.” <i>Communications on Pure and Applied Mathematics</i>. Wiley, 2014. <a href=\"https://doi.org/10.1002/cpa.21495\">https://doi.org/10.1002/cpa.21495</a>.","ista":"Hairer M, Maas J, Weber H. 2014. Approximating rough stochastic PDEs. Communications on Pure and Applied Mathematics. 67(5), 776–870.","ieee":"M. Hairer, J. Maas, and H. Weber, “Approximating rough stochastic PDEs,” <i>Communications on Pure and Applied Mathematics</i>, vol. 67, no. 5. Wiley, pp. 776–870, 2014.","short":"M. Hairer, J. Maas, H. Weber, Communications on Pure and Applied Mathematics 67 (2014) 776–870."},"acknowledgement":"JM is supported by Rubicon grant 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO). MH is supported by EPSRC grant EP/D071593/1 and by the Royal Society through a Wolfson Research Merit Award. Both MH and HW are supported by the Le","publist_id":"4902","author":[{"last_name":"Hairer","full_name":"Hairer, Martin","first_name":"Martin"},{"first_name":"Jan","full_name":"Maas, Jan","last_name":"Maas","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Weber","first_name":"Hendrik","full_name":"Weber, Hendrik"}],"_id":"2131","oa_version":"None","date_created":"2018-12-11T11:55:53Z","month":"05","external_id":{"arxiv":["1202.3094 "]},"extern":"1","doi":"10.1002/cpa.21495","type":"journal_article","language":[{"iso":"eng"}],"date_published":"2014-05-01T00:00:00Z","publisher":"Wiley"},{"title":"Gradient flow structures for discrete porous medium equations","year":"2014","publication":"Discrete and Continuous Dynamical Systems- Series A","day":"01","main_file_link":[{"url":"http://arxiv.org/abs/1212.1129","open_access":"1"}],"volume":34,"OA_type":"green","arxiv":1,"status":"public","abstract":[{"text":"We consider discrete porous medium equations of the form ∂tρt=Δϕ(ρt), where Δ is the generator of a reversible continuous time Markov chain on a finite set χ, and ϕ is an increasing function. We show that these equations arise as gradient flows of certain entropy functionals with respect to suitable non-local transportation metrics. This may be seen as a discrete analogue of the Wasserstein gradient flow structure for porous medium equations in ℝn discovered by Otto. We present a one-dimensional counterexample to geodesic convexity and discuss Gromov-Hausdorff convergence to the Wasserstein metric.","lang":"eng"}],"publication_status":"published","intvolume":"        34","article_processing_charge":"No","page":"1355 - 1374","date_created":"2018-12-11T11:55:54Z","oa_version":"Preprint","month":"04","extern":"1","external_id":{"arxiv":["1212.1129"]},"type":"journal_article","doi":"10.3934/dcds.2014.34.1355  ","language":[{"iso":"eng"}],"date_published":"2014-04-01T00:00:00Z","publisher":"Southwest Missouri State University","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","date_updated":"2025-08-05T14:24:47Z","oa":1,"citation":{"apa":"Erbar, M., &#38; Maas, J. (2014). Gradient flow structures for discrete porous medium equations. <i>Discrete and Continuous Dynamical Systems- Series A</i>. Southwest Missouri State University. <a href=\"https://doi.org/10.3934/dcds.2014.34.1355  \">https://doi.org/10.3934/dcds.2014.34.1355  </a>","mla":"Erbar, Matthias, and Jan Maas. “Gradient Flow Structures for Discrete Porous Medium Equations.” <i>Discrete and Continuous Dynamical Systems- Series A</i>, vol. 34, no. 4, Southwest Missouri State University, 2014, pp. 1355–74, doi:<a href=\"https://doi.org/10.3934/dcds.2014.34.1355  \">10.3934/dcds.2014.34.1355  </a>.","ama":"Erbar M, Maas J. Gradient flow structures for discrete porous medium equations. <i>Discrete and Continuous Dynamical Systems- Series A</i>. 2014;34(4):1355-1374. doi:<a href=\"https://doi.org/10.3934/dcds.2014.34.1355  \">10.3934/dcds.2014.34.1355  </a>","chicago":"Erbar, Matthias, and Jan Maas. “Gradient Flow Structures for Discrete Porous Medium Equations.” <i>Discrete and Continuous Dynamical Systems- Series A</i>. Southwest Missouri State University, 2014. <a href=\"https://doi.org/10.3934/dcds.2014.34.1355  \">https://doi.org/10.3934/dcds.2014.34.1355  </a>.","ista":"Erbar M, Maas J. 2014. Gradient flow structures for discrete porous medium equations. Discrete and Continuous Dynamical Systems- Series A. 34(4), 1355–1374.","ieee":"M. Erbar and J. Maas, “Gradient flow structures for discrete porous medium equations,” <i>Discrete and Continuous Dynamical Systems- Series A</i>, vol. 34, no. 4. Southwest Missouri State University, pp. 1355–1374, 2014.","short":"M. Erbar, J. Maas, Discrete and Continuous Dynamical Systems- Series A 34 (2014) 1355–1374."},"issue":"4","author":[{"last_name":"Erbar","full_name":"Erbar, Matthias","first_name":"Matthias"},{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","full_name":"Maas, Jan","first_name":"Jan","last_name":"Maas","orcid":"0000-0002-0845-1338"}],"publist_id":"4903","OA_place":"repository","_id":"2132"},{"publication":"Communications in Mathematical Physics","extern":"1","day":"01","title":"An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy","date_created":"2018-12-11T11:55:54Z","oa_version":"Submitted Version","year":"2014","month":"11","language":[{"iso":"eng"}],"publisher":"Springer","date_published":"2014-11-01T00:00:00Z","doi":"10.1007/s00220-014-2124-8","type":"journal_article","volume":331,"main_file_link":[{"url":"http://arxiv.org/abs/1203.5377 ","open_access":"1"}],"oa":1,"date_updated":"2021-01-12T06:55:30Z","intvolume":"       331","status":"public","publication_status":"published","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","abstract":[{"text":"Let ℭ denote the Clifford algebra over ℝ𝑛, which is the von Neumann algebra generated by n self-adjoint operators Q j , j = 1,…,n satisfying the canonical anticommutation relations, Q i Q j  + Q j Q i =  2δ ij I, and let τ denote the normalized trace on ℭ. This algebra arises in quantum mechanics as the algebra of observables generated by n fermionic degrees of freedom. Let 𝔓 denote the set of all positive operators 𝜌∈ℭ such that τ(ρ) = 1; these are the non-commutative analogs of probability densities in the non-commutative probability space (ℭ,𝜏). The fermionic Fokker–Planck equation is a quantum-mechanical analog of the classical Fokker–Planck equation with which it has much in common, such as the same optimal hypercontractivity properties. In this paper we construct a Riemannian metric on 𝔓 that we show to be a natural analog of the classical 2-Wasserstein metric, and we show that, in analogy with the classical case, the fermionic Fokker–Planck equation is gradient flow in this metric for the relative entropy with respect to the ground state. We derive a number of consequences of this, such as a sharp Talagrand inequality for this metric, and we prove a number of results pertaining to this metric. Several open problems are raised.","lang":"eng"}],"page":"887 - 926","_id":"2133","citation":{"chicago":"Carlen, Eric, and Jan Maas. “An Analog of the 2-Wasserstein Metric in Non-Commutative Probability under Which the Fermionic Fokker-Planck Equation Is Gradient Flow for the Entropy.” <i>Communications in Mathematical Physics</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00220-014-2124-8\">https://doi.org/10.1007/s00220-014-2124-8</a>.","ama":"Carlen E, Maas J. An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy. <i>Communications in Mathematical Physics</i>. 2014;331(3):887-926. doi:<a href=\"https://doi.org/10.1007/s00220-014-2124-8\">10.1007/s00220-014-2124-8</a>","ista":"Carlen E, Maas J. 2014. An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy. Communications in Mathematical Physics. 331(3), 887–926.","apa":"Carlen, E., &#38; Maas, J. (2014). An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-014-2124-8\">https://doi.org/10.1007/s00220-014-2124-8</a>","mla":"Carlen, Eric, and Jan Maas. “An Analog of the 2-Wasserstein Metric in Non-Commutative Probability under Which the Fermionic Fokker-Planck Equation Is Gradient Flow for the Entropy.” <i>Communications in Mathematical Physics</i>, vol. 331, no. 3, Springer, 2014, pp. 887–926, doi:<a href=\"https://doi.org/10.1007/s00220-014-2124-8\">10.1007/s00220-014-2124-8</a>.","short":"E. Carlen, J. Maas, Communications in Mathematical Physics 331 (2014) 887–926.","ieee":"E. Carlen and J. Maas, “An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy,” <i>Communications in Mathematical Physics</i>, vol. 331, no. 3. Springer, pp. 887–926, 2014."},"issue":"3","publist_id":"4901","author":[{"last_name":"Carlen","full_name":"Carlen, Eric","first_name":"Eric"},{"orcid":"0000-0002-0845-1338","last_name":"Maas","full_name":"Maas, Jan","first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"}]},{"status":"public","abstract":[{"text":"We propose a technique for engineering momentum-dependent dissipation in Bose-Einstein condensates with non-local interactions. The scheme relies on the use of momentum-dependent dark-states in close analogy to velocity-selective coherent population trapping. During the short-time dissipative dynamics, the system is driven into a particular finite-momentum phonon mode, which in real space corresponds to an ordered structure with non-local density-density correlations. Dissipation-induced ordering can be observed and studied in present-day experiments using cold atoms with dipole-dipole or off-resonant Rydberg interactions. Due to its dissipative nature, the ordering does not require artificial breaking of translational symmetry by an opticallattice or harmonic trap. This opens up a perspective of direct cooling of quantum gases into strongly-interacting phases.","lang":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_updated":"2021-01-12T06:55:33Z","oa":1,"intvolume":"       113","acknowledgement":"This work was supported by NSF through a grant for the Institute for Theoretical Atomic, Molecular, and Optical Physics at Harvard University and Smithsonian Astrophysical Observatory as well as the Harvard Quantum Optics Center.","citation":{"ieee":"J. Otterbach and M. Lemeshko, “Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates,” <i>Physical Review Letters</i>, vol. 113, no. 7. American Physical Society, 2014.","short":"J. Otterbach, M. Lemeshko, Physical Review Letters 113 (2014).","mla":"Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of Spatial Order in Rydberg-Dressed Bose-Einstein Condensates.” <i>Physical Review Letters</i>, vol. 113, no. 7, 070401, American Physical Society, 2014, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.113.070401\">10.1103/PhysRevLett.113.070401</a>.","apa":"Otterbach, J., &#38; Lemeshko, M. (2014). Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.113.070401\">https://doi.org/10.1103/PhysRevLett.113.070401</a>","chicago":"Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of Spatial Order in Rydberg-Dressed Bose-Einstein Condensates.” <i>Physical Review Letters</i>. American Physical Society, 2014. <a href=\"https://doi.org/10.1103/PhysRevLett.113.070401\">https://doi.org/10.1103/PhysRevLett.113.070401</a>.","ista":"Otterbach J, Lemeshko M. 2014. Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. 113(7), 070401.","ama":"Otterbach J, Lemeshko M. Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. <i>Physical Review Letters</i>. 2014;113(7). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.113.070401\">10.1103/PhysRevLett.113.070401</a>"},"issue":"7","author":[{"last_name":"Otterbach","first_name":"Johannes","full_name":"Otterbach, Johannes"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","first_name":"Mikhail","full_name":"Lemeshko, Mikhail","last_name":"Lemeshko"}],"publist_id":"4884","_id":"2140","oa_version":"Submitted Version","title":"Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates","date_created":"2018-12-11T11:55:56Z","month":"08","year":"2014","publication":"Physical Review Letters","day":"11","extern":"1","type":"journal_article","doi":"10.1103/PhysRevLett.113.070401","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1308.5905"}],"article_number":"070401","volume":113,"language":[{"iso":"eng"}],"date_published":"2014-08-11T00:00:00Z","publisher":"American Physical Society"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","date_updated":"2025-09-29T11:45:13Z","oa":1,"citation":{"ista":"Chatterjee K, Henzinger M. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3), a15.","chicago":"Chatterjee, Krishnendu, and Monika Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” <i>Journal of the ACM</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2597631\">https://doi.org/10.1145/2597631</a>.","ama":"Chatterjee K, Henzinger M. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. <i>Journal of the ACM</i>. 2014;61(3). doi:<a href=\"https://doi.org/10.1145/2597631\">10.1145/2597631</a>","mla":"Chatterjee, Krishnendu, and Monika Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” <i>Journal of the ACM</i>, vol. 61, no. 3, a15, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2597631\">10.1145/2597631</a>.","apa":"Chatterjee, K., &#38; Henzinger, M. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2597631\">https://doi.org/10.1145/2597631</a>","short":"K. Chatterjee, M. Henzinger, Journal of the ACM 61 (2014).","ieee":"K. Chatterjee and M. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” <i>Journal of the ACM</i>, vol. 61, no. 3. ACM, 2014."},"issue":"3","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}],"publist_id":"4883","_id":"2141","oa_version":"Submitted Version","date_created":"2018-12-11T11:55:57Z","month":"05","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"external_id":{"isi":["000337201400001"]},"type":"journal_article","doi":"10.1145/2597631","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3165"}]},"language":[{"iso":"eng"}],"date_published":"2014-05-01T00:00:00Z","publisher":"ACM","isi":1,"status":"public","publication_status":"published","abstract":[{"lang":"eng","text":"The computation of the winning set for Büchi objectives in alternating games on graphs is a central problem in computer-aided verification with a large number of applications. The long-standing best known upper bound for solving the problem is Õ(n ⋅ m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the Õ(n ⋅ m) boundary by presenting a new technique that reduces the running time to O(n2). This bound also leads to O(n2)-time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of Õ(n ⋅ m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n3)), and (3) in Markov decision processes (improving for m&gt;n4/3 an earlier bound of O(m ⋅ √m)). We then show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. Our algorithms are the first dynamic algorithms for this problem. We then consider another core graph theoretic problem in verification of probabilistic systems, namely computing the maximal end-component decomposition of a graph. We present two improved static algorithms for the maximal end-component decomposition problem. Our first algorithm is an O(m ⋅ √m)-time algorithm, and our second algorithm is an O(n2)-time algorithm which is obtained using the same technique as for alternating Büchi games. Thus, we obtain an O(min &amp;lcu;m ⋅ √m,n2})-time algorithm improving the long-standing O(n ⋅ m) time bound. Finally, we show how to maintain the maximal end-component decomposition of a graph under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per edge deletion, and O(m) worst-case time per edge insertion. Again, our algorithms are the first dynamic algorithms for this problem."}],"intvolume":"        61","article_processing_charge":"No","title":"Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition","year":"2014","scopus_import":"1","publication":"Journal of the ACM","day":"01","main_file_link":[{"open_access":"1","url":"https://eprints.cs.univie.ac.at/3933/"}],"volume":61,"article_number":"a15","department":[{"_id":"KrCh"}],"ec_funded":1},{"publication":"Proceedings of the Annual Symposium on Computational Geometry","day":"01","title":"Induced matchings of barcodes and the algebraic stability of persistence","year":"2014","scopus_import":"1","arxiv":1,"ec_funded":1,"main_file_link":[{"url":"http://arxiv.org/abs/1311.3681","open_access":"1"}],"department":[{"_id":"HeEd"}],"status":"public","publication_status":"published","abstract":[{"text":"We define a simple, explicit map sending a morphism f : M → N of pointwise finite dimensional persistence modules to a matching between the barcodes of M and N. Our main result is that, in a precise sense, the quality of this matching is tightly controlled by the lengths of the longest intervals in the barcodes of ker f and coker f . As an immediate corollary, we obtain a new proof of the algebraic stability theorem for persistence barcodes [5, 9], a fundamental result in the theory of persistent homology. In contrast to previous proofs, ours shows explicitly how a δ-interleaving morphism between two persistence modules induces a δ-matching between the barcodes of the two modules. Our main result also specializes to a structure theorem for submodules and quotients of persistence modules. Copyright is held by the owner/author(s).","lang":"eng"}],"page":"355 - 364","article_processing_charge":"No","project":[{"grant_number":"318493","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425","name":"Topological Complex Systems"}],"external_id":{"arxiv":["1311.3681"]},"date_created":"2018-12-11T11:56:01Z","oa_version":"Submitted Version","month":"06","language":[{"iso":"eng"}],"publisher":"ACM","date_published":"2014-06-01T00:00:00Z","doi":"10.1145/2582112.2582168","conference":{"end_date":"2014-06-11","location":"Kyoto, Japan","name":"SoCG: Symposium on Computational Geometry","start_date":"2014-06-08"},"type":"conference","oa":1,"date_updated":"2025-06-11T07:57:54Z","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2153","citation":{"ieee":"U. Bauer and M. Lesnick, “Induced matchings of barcodes and the algebraic stability of persistence,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 355–364.","short":"U. Bauer, M. Lesnick, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–364.","mla":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 355–64, doi:<a href=\"https://doi.org/10.1145/2582112.2582168\">10.1145/2582112.2582168</a>.","apa":"Bauer, U., &#38; Lesnick, M. (2014). Induced matchings of barcodes and the algebraic stability of persistence. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 355–364). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582168\">https://doi.org/10.1145/2582112.2582168</a>","ama":"Bauer U, Lesnick M. Induced matchings of barcodes and the algebraic stability of persistence. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:355-364. doi:<a href=\"https://doi.org/10.1145/2582112.2582168\">10.1145/2582112.2582168</a>","ista":"Bauer U, Lesnick M. 2014. Induced matchings of barcodes and the algebraic stability of persistence. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 355–364.","chicago":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 355–64. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582168\">https://doi.org/10.1145/2582112.2582168</a>."},"publist_id":"4853","author":[{"first_name":"Ulrich","full_name":"Bauer, Ulrich","last_name":"Bauer","orcid":"0000-0002-9683-0724","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lesnick","first_name":"Michael","full_name":"Lesnick, Michael"}]},{"intvolume":"        52","abstract":[{"text":"A result of Boros and Füredi (d = 2) and of Bárány (arbitrary d) asserts that for every d there exists cd &gt; 0 such that for every n-point set P ⊂ ℝd, some point of ℝd is covered by at least (Formula presented.) of the d-simplices spanned by the points of P. The largest possible value of cd has been the subject of ongoing research. Recently Gromov improved the existing lower bounds considerably by introducing a new, topological proof method. We provide an exposition of the combinatorial component of Gromov's approach, in terms accessible to combinatorialists and discrete geometers, and we investigate the limits of his method. In particular, we give tighter bounds on the cofilling profiles for the (n - 1)-simplex. These bounds yield a minor improvement over Gromov's lower bounds on cd for large d, but they also show that the room for further improvement through the cofilling profiles alone is quite small. We also prove a slightly better lower bound for c3 by an approach using an additional structure besides the cofilling profiles. We formulate a combinatorial extremal problem whose solution might perhaps lead to a tight lower bound for cd.","lang":"eng"}],"publication_status":"published","isi":1,"status":"public","page":"1 - 33","article_processing_charge":"No","day":"01","publication":"Discrete & Computational Geometry","year":"2014","scopus_import":"1","title":"On Gromov's method of selecting heavily covered points","arxiv":1,"department":[{"_id":"UlWa"}],"volume":52,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1102.3515"}],"date_updated":"2025-09-29T11:44:29Z","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","_id":"2154","author":[{"full_name":"Matoušek, Jiří","first_name":"Jiří","last_name":"Matoušek"},{"orcid":"0000-0002-1494-0568","first_name":"Uli","full_name":"Wagner, Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"4852","acknowledgement":"Swiss National Science Foundation (SNF 200021-125309, 200020-138230, 200020-12507)","citation":{"ieee":"J. Matoušek and U. Wagner, “On Gromov’s method of selecting heavily covered points,” <i>Discrete &#38; Computational Geometry</i>, vol. 52, no. 1. Springer, pp. 1–33, 2014.","short":"J. Matoušek, U. Wagner, Discrete &#38; Computational Geometry 52 (2014) 1–33.","apa":"Matoušek, J., &#38; Wagner, U. (2014). On Gromov’s method of selecting heavily covered points. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-014-9584-7\">https://doi.org/10.1007/s00454-014-9584-7</a>","mla":"Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” <i>Discrete &#38; Computational Geometry</i>, vol. 52, no. 1, Springer, 2014, pp. 1–33, doi:<a href=\"https://doi.org/10.1007/s00454-014-9584-7\">10.1007/s00454-014-9584-7</a>.","ama":"Matoušek J, Wagner U. On Gromov’s method of selecting heavily covered points. <i>Discrete &#38; Computational Geometry</i>. 2014;52(1):1-33. doi:<a href=\"https://doi.org/10.1007/s00454-014-9584-7\">10.1007/s00454-014-9584-7</a>","chicago":"Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00454-014-9584-7\">https://doi.org/10.1007/s00454-014-9584-7</a>.","ista":"Matoušek J, Wagner U. 2014. On Gromov’s method of selecting heavily covered points. Discrete &#38; Computational Geometry. 52(1), 1–33."},"issue":"1","external_id":{"isi":["000339382600001"],"arxiv":["1102.3515"]},"project":[{"name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","_id":"25FA3206-B435-11E9-9278-68D0E5697425","grant_number":"PP00P2_138948"}],"month":"07","oa_version":"Submitted Version","date_created":"2018-12-11T11:56:01Z","publisher":"Springer","date_published":"2014-07-01T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","doi":"10.1007/s00454-014-9584-7"},{"status":"public","publication_status":"published","abstract":[{"lang":"eng","text":"Given a finite set of points in Rn and a positive radius, we study the Čech, Delaunay-Čech, alpha, and wrap complexes as instances of a generalized discrete Morse theory. We prove that the latter three complexes are simple-homotopy equivalent. Our results have applications in topological data analysis and in the reconstruction of shapes from sampled data. Copyright is held by the owner/author(s)."}],"page":"484 - 490","article_processing_charge":"No","publication":"Proceedings of the Annual Symposium on Computational Geometry","day":"01","title":"The morse theory of Čech and Delaunay filtrations","year":"2014","scopus_import":"1","arxiv":1,"ec_funded":1,"department":[{"_id":"HeEd"}],"main_file_link":[{"url":"http://arxiv.org/abs/1312.1231","open_access":"1"}],"oa":1,"date_updated":"2025-06-11T07:58:27Z","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","_id":"2155","citation":{"chicago":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 484–90. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582167\">https://doi.org/10.1145/2582112.2582167</a>.","ama":"Bauer U, Edelsbrunner H. The morse theory of Čech and Delaunay filtrations. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:484-490. doi:<a href=\"https://doi.org/10.1145/2582112.2582167\">10.1145/2582112.2582167</a>","ista":"Bauer U, Edelsbrunner H. 2014. The morse theory of Čech and Delaunay filtrations. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 484–490.","mla":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 484–90, doi:<a href=\"https://doi.org/10.1145/2582112.2582167\">10.1145/2582112.2582167</a>.","apa":"Bauer, U., &#38; Edelsbrunner, H. (2014). The morse theory of Čech and Delaunay filtrations. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 484–490). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582167\">https://doi.org/10.1145/2582112.2582167</a>","short":"U. Bauer, H. Edelsbrunner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–490.","ieee":"U. Bauer and H. Edelsbrunner, “The morse theory of Čech and Delaunay filtrations,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 484–490."},"acknowledgement":"This research is partially supported by ESF under the ACAT Research Network Programme, and by the Russian Government under mega project 11.G34.31.0053","publist_id":"4851","author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","full_name":"Bauer, Ulrich","first_name":"Ulrich","last_name":"Bauer","orcid":"0000-0002-9683-0724"},{"orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"project":[{"call_identifier":"FP7","grant_number":"318493","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"external_id":{"arxiv":["1312.1231"]},"date_created":"2018-12-11T11:56:01Z","oa_version":"Submitted Version","month":"06","language":[{"iso":"eng"}],"date_published":"2014-06-01T00:00:00Z","publisher":"ACM","doi":"10.1145/2582112.2582167","conference":{"end_date":"2014-06-11","location":"Kyoto, Japan","start_date":"2014-06-08","name":"SoCG: Symposium on Computational Geometry"},"type":"conference"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","oa":1,"date_updated":"2025-06-11T07:58:42Z","publist_id":"4850","author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","first_name":"Ulrich","full_name":"Bauer, Ulrich","last_name":"Bauer","orcid":"0000-0002-9683-0724"},{"last_name":"Ge","full_name":"Ge, Xiaoyin","first_name":"Xiaoyin"},{"last_name":"Wang","first_name":"Yusu","full_name":"Wang, Yusu"}],"acknowledgement":"National Science Foundation under grants CCF-1319406, CCF-1116258.","citation":{"short":"U. Bauer, X. Ge, Y. Wang, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–473.","ieee":"U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 464–473.","ama":"Bauer U, Ge X, Wang Y. Measuring distance between Reeb graphs. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:464-473. doi:<a href=\"https://doi.org/10.1145/2582112.2582169\">10.1145/2582112.2582169</a>","chicago":"Bauer, Ulrich, Xiaoyin Ge, and Yusu Wang. “Measuring Distance between Reeb Graphs.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 464–73. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582169\">https://doi.org/10.1145/2582112.2582169</a>.","ista":"Bauer U, Ge X, Wang Y. 2014. Measuring distance between Reeb graphs. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 464–473.","apa":"Bauer, U., Ge, X., &#38; Wang, Y. (2014). Measuring distance between Reeb graphs. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 464–473). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582169\">https://doi.org/10.1145/2582112.2582169</a>","mla":"Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 464–73, doi:<a href=\"https://doi.org/10.1145/2582112.2582169\">10.1145/2582112.2582169</a>."},"_id":"2156","month":"06","oa_version":"Submitted Version","date_created":"2018-12-11T11:56:02Z","external_id":{"arxiv":["1307.2839"]},"project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","name":"Topological Complex Systems","grant_number":"318493","call_identifier":"FP7"}],"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2014-06-08","location":"Kyoto, Japan","end_date":"2014-06-11"},"doi":"10.1145/2582112.2582169","type":"conference","publisher":"ACM","date_published":"2014-06-01T00:00:00Z","language":[{"iso":"eng"}],"publication_status":"published","abstract":[{"lang":"eng","text":"We propose a metric for Reeb graphs, called the functional distortion distance. Under this distance, the Reeb graph is stable against small changes of input functions. At the same time, it remains discriminative at differentiating input functions. In particular, the main result is that the functional distortion distance between two Reeb graphs is bounded from below by the bottleneck distance between both the ordinary and extended persistence diagrams for appropriate dimensions. As an application of our results, we analyze a natural simplification scheme for Reeb graphs, and show that persistent features in Reeb graph remains persistent under simplification. Understanding the stability of important features of the Reeb graph under simplification is an interesting problem on its own right, and critical to the practical usage of Reeb graphs. Copyright is held by the owner/author(s)."}],"status":"public","article_processing_charge":"No","page":"464 - 473","scopus_import":"1","year":"2014","title":"Measuring distance between Reeb graphs","day":"01","publication":"Proceedings of the Annual Symposium on Computational Geometry","main_file_link":[{"url":"http://arxiv.org/abs/1307.2839","open_access":"1"}],"department":[{"_id":"HeEd"}],"ec_funded":1,"arxiv":1},{"date_updated":"2025-06-11T07:59:02Z","oa":1,"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2157","acknowledgement":"ERC Advanced Grant No. 267165; Grant GRADR Eurogiga GIG/11/E023  (SNSF-PP00P2-138948); Swiss National Science Foundation  (SNSF-200020-138230).","citation":{"short":"J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 78–84.","ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the 3 sphere is decidable,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 78–84.","ama":"Matoušek J, Sedgwick E, Tancer M, Wagner U. Embeddability in the 3 sphere is decidable. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:78-84. doi:<a href=\"https://doi.org/10.1145/2582112.2582137\">10.1145/2582112.2582137</a>","chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Embeddability in the 3 Sphere Is Decidable.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 78–84. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582137\">https://doi.org/10.1145/2582112.2582137</a>.","ista":"Matoušek J, Sedgwick E, Tancer M, Wagner U. 2014. Embeddability in the 3 sphere is decidable. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 78–84.","mla":"Matoušek, Jiří, et al. “Embeddability in the 3 Sphere Is Decidable.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 78–84, doi:<a href=\"https://doi.org/10.1145/2582112.2582137\">10.1145/2582112.2582137</a>.","apa":"Matoušek, J., Sedgwick, E., Tancer, M., &#38; Wagner, U. (2014). Embeddability in the 3 sphere is decidable. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 78–84). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582137\">https://doi.org/10.1145/2582112.2582137</a>"},"author":[{"full_name":"Matoušek, Jiří","first_name":"Jiří","last_name":"Matoušek"},{"last_name":"Sedgwick","first_name":"Eric","full_name":"Sedgwick, Eric"},{"id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714","first_name":"Martin","full_name":"Tancer, Martin","last_name":"Tancer"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","full_name":"Wagner, Uli","first_name":"Uli","orcid":"0000-0002-1494-0568"}],"publist_id":"4849","external_id":{"arxiv":["1402.0815"]},"date_created":"2018-12-11T11:56:02Z","oa_version":"Submitted Version","month":"06","related_material":{"record":[{"status":"public","relation":"later_version","id":"425"}]},"language":[{"iso":"eng"}],"publisher":"ACM","date_published":"2014-06-01T00:00:00Z","type":"conference","doi":"10.1145/2582112.2582137","conference":{"start_date":"2014-06-08","name":"SoCG: Symposium on Computational Geometry","location":"Kyoto, Japan","end_date":"2014-06-11"},"status":"public","publication_status":"published","abstract":[{"text":"We show that the following algorithmic problem is decidable: given a 2-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in ℝ3? By a known reduction, it suffices to decide the embeddability of a given triangulated 3-manifold X into the 3-sphere S3. The main step, which allows us to simplify X and recurse, is in proving that if X can be embedded in S3, then there is also an embedding in which X has a short meridian, i.e., an essential curve in the boundary of X bounding a disk in S3 nX with length bounded by a computable function of the number of tetrahedra of X.","lang":"eng"}],"page":"78 - 84","article_processing_charge":"No","publication":"Proceedings of the Annual Symposium on Computational Geometry","day":"01","title":"Embeddability in the 3 sphere is decidable","scopus_import":"1","year":"2014","arxiv":1,"department":[{"_id":"UlWa"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.0815"}]},{"month":"10","oa_version":"Submitted Version","date_created":"2018-12-11T11:56:03Z","external_id":{"pmid":["24959970"],"isi":["000343620300006"]},"type":"journal_article","doi":"10.1016/j.ceb.2014.05.010","date_published":"2014-10-01T00:00:00Z","publisher":"Elsevier","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","date_updated":"2025-09-29T11:43:11Z","oa":1,"author":[{"full_name":"Majumdar, Ritankar","first_name":"Ritankar","last_name":"Majumdar"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","full_name":"Sixt, Michael K","last_name":"Sixt"},{"full_name":"Parent, Carole","first_name":"Carole","last_name":"Parent"}],"publist_id":"4848","pmid":1,"issue":"1","acknowledgement":"This effort was supported by the Intramural Research Program of the Center for Cancer Research, NCI, National Institutes of Health and the European Research Council (ERC).","citation":{"mla":"Majumdar, Ritankar, et al. “New Paradigms in the Establishment and Maintenance of Gradients during Directed Cell Migration.” <i>Current Opinion in Cell Biology</i>, vol. 30, no. 1, Elsevier, 2014, pp. 33–40, doi:<a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">10.1016/j.ceb.2014.05.010</a>.","apa":"Majumdar, R., Sixt, M. K., &#38; Parent, C. (2014). New paradigms in the establishment and maintenance of gradients during directed cell migration. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">https://doi.org/10.1016/j.ceb.2014.05.010</a>","ama":"Majumdar R, Sixt MK, Parent C. New paradigms in the establishment and maintenance of gradients during directed cell migration. <i>Current Opinion in Cell Biology</i>. 2014;30(1):33-40. doi:<a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">10.1016/j.ceb.2014.05.010</a>","chicago":"Majumdar, Ritankar, Michael K Sixt, and Carole Parent. “New Paradigms in the Establishment and Maintenance of Gradients during Directed Cell Migration.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">https://doi.org/10.1016/j.ceb.2014.05.010</a>.","ista":"Majumdar R, Sixt MK, Parent C. 2014. New paradigms in the establishment and maintenance of gradients during directed cell migration. Current Opinion in Cell Biology. 30(1), 33–40.","ieee":"R. Majumdar, M. K. Sixt, and C. Parent, “New paradigms in the establishment and maintenance of gradients during directed cell migration,” <i>Current Opinion in Cell Biology</i>, vol. 30, no. 1. Elsevier, pp. 33–40, 2014.","short":"R. Majumdar, M.K. Sixt, C. Parent, Current Opinion in Cell Biology 30 (2014) 33–40."},"_id":"2158","scopus_import":"1","year":"2014","title":"New paradigms in the establishment and maintenance of gradients during directed cell migration","day":"01","publication":"Current Opinion in Cell Biology","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4177954/"}],"volume":30,"department":[{"_id":"MiSi"}],"abstract":[{"lang":"eng","text":"Directional guidance of migrating cells is relatively well explored in the reductionist setting of cell culture experiments. Here spatial gradients of chemical cues as well as gradients of mechanical substrate characteristics prove sufficient to attract single cells as well as their collectives. How such gradients present and act in the context of an organism is far less clear. Here we review recent advances in understanding how guidance cues emerge and operate in the physiological context."}],"publication_status":"published","status":"public","isi":1,"intvolume":"        30","article_processing_charge":"No","page":"33 - 40"}]