[{"publication_status":"published","language":[{"iso":"eng"}],"_id":"2006","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"CaUh"}],"abstract":[{"text":"The monotone secant conjecture posits a rich class of polynomial systems, all of whose solutions are real. These systems come from the Schubert calculus on flag manifolds, and the monotone secant conjecture is a compelling generalization of the Shapiro conjecture for Grassmannians (Theorem of Mukhin, Tarasov, and Varchenko). We present some theoretical evidence for this conjecture, as well as computational evidence obtained by 1.9 teraHertz-years of computing, and we discuss some of the phenomena we observed in our data. ","lang":"eng"}],"article_processing_charge":"No","scopus_import":1,"type":"journal_article","year":"2015","doi":"10.1080/10586458.2014.980044","publist_id":"5070","oa_version":"Preprint","issue":"3","publisher":"Taylor & Francis","main_file_link":[{"url":"http://arxiv.org/abs/1109.3436","open_access":"1"}],"page":"261 - 269","quality_controlled":"1","intvolume":"        24","publication":"Experimental Mathematics","title":"The monotone secant conjecture in the real Schubert calculus","status":"public","oa":1,"author":[{"full_name":"Hein, Nicolas","first_name":"Nicolas","last_name":"Hein"},{"last_name":"Hillar","first_name":"Christopher","full_name":"Hillar, Christopher"},{"first_name":"Abraham","last_name":"Martin Del Campo Sanchez","id":"4CF47F6A-F248-11E8-B48F-1D18A9856A87","full_name":"Martin Del Campo Sanchez, Abraham"},{"full_name":"Sottile, Frank","last_name":"Sottile","first_name":"Frank"},{"last_name":"Teitler","first_name":"Zach","full_name":"Teitler, Zach"}],"citation":{"mla":"Hein, Nicolas, et al. “The Monotone Secant Conjecture in the Real Schubert Calculus.” <i>Experimental Mathematics</i>, vol. 24, no. 3, Taylor &#38; Francis, 2015, pp. 261–69, doi:<a href=\"https://doi.org/10.1080/10586458.2014.980044\">10.1080/10586458.2014.980044</a>.","ista":"Hein N, Hillar C, Martin del Campo Sanchez A, Sottile F, Teitler Z. 2015. The monotone secant conjecture in the real Schubert calculus. Experimental Mathematics. 24(3), 261–269.","ama":"Hein N, Hillar C, Martin del Campo Sanchez A, Sottile F, Teitler Z. The monotone secant conjecture in the real Schubert calculus. <i>Experimental Mathematics</i>. 2015;24(3):261-269. doi:<a href=\"https://doi.org/10.1080/10586458.2014.980044\">10.1080/10586458.2014.980044</a>","chicago":"Hein, Nicolas, Christopher Hillar, Abraham Martin del Campo Sanchez, Frank Sottile, and Zach Teitler. “The Monotone Secant Conjecture in the Real Schubert Calculus.” <i>Experimental Mathematics</i>. Taylor &#38; Francis, 2015. <a href=\"https://doi.org/10.1080/10586458.2014.980044\">https://doi.org/10.1080/10586458.2014.980044</a>.","ieee":"N. Hein, C. Hillar, A. Martin del Campo Sanchez, F. Sottile, and Z. Teitler, “The monotone secant conjecture in the real Schubert calculus,” <i>Experimental Mathematics</i>, vol. 24, no. 3. Taylor &#38; Francis, pp. 261–269, 2015.","apa":"Hein, N., Hillar, C., Martin del Campo Sanchez, A., Sottile, F., &#38; Teitler, Z. (2015). The monotone secant conjecture in the real Schubert calculus. <i>Experimental Mathematics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/10586458.2014.980044\">https://doi.org/10.1080/10586458.2014.980044</a>","short":"N. Hein, C. Hillar, A. Martin del Campo Sanchez, F. Sottile, Z. Teitler, Experimental Mathematics 24 (2015) 261–269."},"day":"23","date_updated":"2021-01-12T06:54:40Z","volume":24,"date_published":"2015-06-23T00:00:00Z","date_created":"2018-12-11T11:55:10Z","month":"06"},{"oa":1,"author":[{"id":"31934120-F248-11E8-B48F-1D18A9856A87","full_name":"Klimova, Anna","first_name":"Anna","last_name":"Klimova"},{"full_name":"Rudas, Tamás","last_name":"Rudas","first_name":"Tamás"}],"title":"Iterative scaling in curved exponential families","status":"public","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1307.3282","open_access":"1"}],"page":"832 - 847","publisher":"Wiley","publication":"Scandinavian Journal of Statistics","intvolume":"        42","issue":"3","date_published":"2015-09-01T00:00:00Z","date_created":"2018-12-11T11:55:11Z","month":"09","volume":42,"citation":{"chicago":"Klimova, Anna, and Tamás Rudas. “Iterative Scaling in Curved Exponential Families.” <i>Scandinavian Journal of Statistics</i>. Wiley, 2015. <a href=\"https://doi.org/10.1111/sjos.12139\">https://doi.org/10.1111/sjos.12139</a>.","ama":"Klimova A, Rudas T. Iterative scaling in curved exponential families. <i>Scandinavian Journal of Statistics</i>. 2015;42(3):832-847. doi:<a href=\"https://doi.org/10.1111/sjos.12139\">10.1111/sjos.12139</a>","ista":"Klimova A, Rudas T. 2015. Iterative scaling in curved exponential families. Scandinavian Journal of Statistics. 42(3), 832–847.","mla":"Klimova, Anna, and Tamás Rudas. “Iterative Scaling in Curved Exponential Families.” <i>Scandinavian Journal of Statistics</i>, vol. 42, no. 3, Wiley, 2015, pp. 832–47, doi:<a href=\"https://doi.org/10.1111/sjos.12139\">10.1111/sjos.12139</a>.","short":"A. Klimova, T. Rudas, Scandinavian Journal of Statistics 42 (2015) 832–847.","apa":"Klimova, A., &#38; Rudas, T. (2015). Iterative scaling in curved exponential families. <i>Scandinavian Journal of Statistics</i>. Wiley. <a href=\"https://doi.org/10.1111/sjos.12139\">https://doi.org/10.1111/sjos.12139</a>","ieee":"A. Klimova and T. Rudas, “Iterative scaling in curved exponential families,” <i>Scandinavian Journal of Statistics</i>, vol. 42, no. 3. Wiley, pp. 832–847, 2015."},"day":"01","date_updated":"2021-01-12T06:54:41Z","acknowledgement":"Part of the material presented here was contained in the PhD thesis of the first author to which the second author and Thomas Richardson were advisers. The authors wish to thank him for several comments and suggestions. We also thank the reviewers and the Associate Editor for helpful comments. The proof of Proposition 1 uses the idea of Olga Klimova, to whom the authors are also indebted. The second author was supported in part by Grant K-106154 from the Hungarian National Scientific Research Fund (OTKA).","abstract":[{"text":"The paper describes a generalized iterative proportional fitting procedure that can be used for maximum likelihood estimation in a special class of the general log-linear model. The models in this class, called relational, apply to multivariate discrete sample spaces that do not necessarily have a Cartesian product structure and may not contain an overall effect. When applied to the cell probabilities, the models without the overall effect are curved exponential families and the values of the sufficient statistics are reproduced by the MLE only up to a constant of proportionality. The paper shows that Iterative Proportional Fitting, Generalized Iterative Scaling, and Improved Iterative Scaling fail to work for such models. The algorithm proposed here is based on iterated Bregman projections. As a by-product, estimates of the multiplicative parameters are also obtained. An implementation of the algorithm is available as an R-package.","lang":"eng"}],"department":[{"_id":"CaUh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2008","language":[{"iso":"eng"}],"publication_status":"published","oa_version":"Preprint","publist_id":"5068","doi":"10.1111/sjos.12139","year":"2015","type":"journal_article","scopus_import":1},{"month":"07","oa_version":"Preprint","date_created":"2018-12-11T11:55:13Z","date_published":"2015-07-01T00:00:00Z","volume":87,"publist_id":"5062","doi":"10.1016/j.csda.2015.01.017","date_updated":"2021-01-12T06:54:43Z","day":"01","citation":{"chicago":"Klimova, Anna, Caroline Uhler, and Tamás Rudas. “Faithfulness and Learning Hypergraphs from Discrete Distributions.” <i>Computational Statistics &#38; Data Analysis</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.csda.2015.01.017\">https://doi.org/10.1016/j.csda.2015.01.017</a>.","mla":"Klimova, Anna, et al. “Faithfulness and Learning Hypergraphs from Discrete Distributions.” <i>Computational Statistics &#38; Data Analysis</i>, vol. 87, no. 7, Elsevier, 2015, pp. 57–72, doi:<a href=\"https://doi.org/10.1016/j.csda.2015.01.017\">10.1016/j.csda.2015.01.017</a>.","ista":"Klimova A, Uhler C, Rudas T. 2015. Faithfulness and learning hypergraphs from discrete distributions. Computational Statistics &#38; Data Analysis. 87(7), 57–72.","ama":"Klimova A, Uhler C, Rudas T. Faithfulness and learning hypergraphs from discrete distributions. <i>Computational Statistics &#38; Data Analysis</i>. 2015;87(7):57-72. doi:<a href=\"https://doi.org/10.1016/j.csda.2015.01.017\">10.1016/j.csda.2015.01.017</a>","ieee":"A. Klimova, C. Uhler, and T. Rudas, “Faithfulness and learning hypergraphs from discrete distributions,” <i>Computational Statistics &#38; Data Analysis</i>, vol. 87, no. 7. Elsevier, pp. 57–72, 2015.","apa":"Klimova, A., Uhler, C., &#38; Rudas, T. (2015). Faithfulness and learning hypergraphs from discrete distributions. <i>Computational Statistics &#38; Data Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.csda.2015.01.017\">https://doi.org/10.1016/j.csda.2015.01.017</a>","short":"A. Klimova, C. Uhler, T. Rudas, Computational Statistics &#38; Data Analysis 87 (2015) 57–72."},"scopus_import":1,"year":"2015","type":"journal_article","author":[{"last_name":"Klimova","first_name":"Anna","id":"31934120-F248-11E8-B48F-1D18A9856A87","full_name":"Klimova, Anna"},{"first_name":"Caroline","orcid":"0000-0002-7008-0216","last_name":"Uhler","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","full_name":"Uhler, Caroline"},{"first_name":"Tamás","last_name":"Rudas","full_name":"Rudas, Tamás"}],"oa":1,"status":"public","abstract":[{"lang":"eng","text":"The concepts of faithfulness and strong-faithfulness are important for statistical learning of graphical models. Graphs are not sufficient for describing the association structure of a discrete distribution. Hypergraphs representing hierarchical log-linear models are considered instead, and the concept of parametric (strong-) faithfulness with respect to a hypergraph is introduced. Strong-faithfulness ensures the existence of uniformly consistent parameter estimators and enables building uniformly consistent procedures for a hypergraph search. The strength of association in a discrete distribution can be quantified with various measures, leading to different concepts of strong-faithfulness. Lower and upper bounds for the proportions of distributions that do not satisfy strong-faithfulness are computed for different parameterizations and measures of association."}],"title":"Faithfulness and learning hypergraphs from discrete distributions","department":[{"_id":"CaUh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        87","publication":"Computational Statistics & Data Analysis","publisher":"Elsevier","page":"57 - 72","main_file_link":[{"url":"http://arxiv.org/abs/1404.6617","open_access":"1"}],"quality_controlled":"1","publication_status":"published","language":[{"iso":"eng"}],"_id":"2014","issue":"7"},{"abstract":[{"text":"Small GTP-binding proteins of the Ras superfamily play diverse roles in intracellular trafficking. Among them, the Rab, Arf, and Rho families function in successive steps of vesicle transport, in forming vesicles from donor membranes, directing vesicle trafficking toward target membranes and docking vesicles onto target membranes. These proteins act as molecular switches that are controlled by a cycle of GTP binding and hydrolysis regulated by guanine nucleotide exchange factors (GEFs) and GTPase-activating proteins (GAPs). In this study we explored the role of GAPs in the regulation of the endocytic pathway using fluorescently labeled yeast mating pheromone α-factor. Among 25 non-essential GAP mutants, we found that deletion of the GLO3 gene, encoding Arf-GAP protein, caused defective internalization of fluorescently labeled α-factor. Quantitative analysis revealed that glo3Δ cells show defective α-factor binding to the cell surface. Interestingly, Ste2p, the α-factor receptor, was mis-localized from the plasma membrane to the vacuole in glo3Δ cells. Domain deletion mutants of Glo3p revealed that a GAP-independent function, as well as the GAP activity, of Glo3p is important for both α-factor binding and Ste2p localization at the cell surface. Additionally, we found that deletion of the GLO3 gene affects the size and number of Arf1p-residing Golgi compartments and causes a defect in transport from the TGN to the plasma membrane. Furthermore, we demonstrated that glo3Δ cells were defective in the late endosome-to-TGN transport pathway, but not in the early endosome-to-TGN transport pathway. These findings suggest novel roles for Arf-GAP Glo3p in endocytic recycling of cell surface proteins.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:25Z","publication_status":"published","ddc":["570"],"_id":"2025","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"DaSi"}],"doi":"10.1016/j.bbamcr.2014.10.009","publist_id":"5047","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"oa_version":"Submitted Version","scopus_import":1,"type":"journal_article","year":"2015","pubrep_id":"615","status":"public","title":"The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins","author":[{"last_name":"Kawada","first_name":"Daiki","full_name":"Kawada, Daiki"},{"last_name":"Kobayashi","first_name":"Hiromu","full_name":"Kobayashi, Hiromu"},{"first_name":"Tsuyoshi","last_name":"Tomita","full_name":"Tomita, Tsuyoshi"},{"first_name":"Eisuke","last_name":"Nakata","full_name":"Nakata, Eisuke"},{"first_name":"Makoto","last_name":"Nagano","full_name":"Nagano, Makoto"},{"full_name":"Siekhaus, Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E","orcid":"0000-0001-8323-8353","last_name":"Siekhaus"},{"last_name":"Toshima","first_name":"Junko","full_name":"Toshima, Junko"},{"last_name":"Toshimaa","first_name":"Jiro","full_name":"Toshimaa, Jiro"}],"oa":1,"issue":"1","intvolume":"      1853","publication":"Biochimica et Biophysica Acta - Molecular Cell Research","publisher":"Elsevier","page":"144 - 156","quality_controlled":"1","volume":1853,"has_accepted_license":"1","month":"01","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","date_created":"2018-12-11T11:55:17Z","date_published":"2015-01-01T00:00:00Z","date_updated":"2021-01-12T06:54:48Z","file":[{"file_name":"IST-2016-615-v1+1_BBAMCR.pdf","date_updated":"2020-07-14T12:45:25Z","checksum":"5bb328edebb6a91337cadd7d63f961b7","date_created":"2018-12-12T10:12:18Z","file_size":926685,"file_id":"4936","creator":"system","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"citation":{"ieee":"D. Kawada <i>et al.</i>, “The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins,” <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>, vol. 1853, no. 1. Elsevier, pp. 144–156, 2015.","short":"D. Kawada, H. Kobayashi, T. Tomita, E. Nakata, M. Nagano, D.E. Siekhaus, J. Toshima, J. Toshimaa, Biochimica et Biophysica Acta - Molecular Cell Research 1853 (2015) 144–156.","apa":"Kawada, D., Kobayashi, H., Tomita, T., Nakata, E., Nagano, M., Siekhaus, D. E., … Toshimaa, J. (2015). The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins. <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.bbamcr.2014.10.009\">https://doi.org/10.1016/j.bbamcr.2014.10.009</a>","mla":"Kawada, Daiki, et al. “The Yeast Arf-GAP Glo3p Is Required for the Endocytic Recycling of Cell Surface Proteins.” <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>, vol. 1853, no. 1, Elsevier, 2015, pp. 144–56, doi:<a href=\"https://doi.org/10.1016/j.bbamcr.2014.10.009\">10.1016/j.bbamcr.2014.10.009</a>.","ama":"Kawada D, Kobayashi H, Tomita T, et al. The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins. <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>. 2015;1853(1):144-156. doi:<a href=\"https://doi.org/10.1016/j.bbamcr.2014.10.009\">10.1016/j.bbamcr.2014.10.009</a>","ista":"Kawada D, Kobayashi H, Tomita T, Nakata E, Nagano M, Siekhaus DE, Toshima J, Toshimaa J. 2015. The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins. Biochimica et Biophysica Acta - Molecular Cell Research. 1853(1), 144–156.","chicago":"Kawada, Daiki, Hiromu Kobayashi, Tsuyoshi Tomita, Eisuke Nakata, Makoto Nagano, Daria E Siekhaus, Junko Toshima, and Jiro Toshimaa. “The Yeast Arf-GAP Glo3p Is Required for the Endocytic Recycling of Cell Surface Proteins.” <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.bbamcr.2014.10.009\">https://doi.org/10.1016/j.bbamcr.2014.10.009</a>."},"day":"01"},{"volume":106,"doi":"10.1016/j.compfluid.2014.09.021","publist_id":"5042","month":"01","oa_version":"Preprint","date_created":"2018-12-11T11:55:18Z","date_published":"2015-01-01T00:00:00Z","scopus_import":1,"type":"journal_article","year":"2015","date_updated":"2021-01-12T06:54:51Z","day":"01","citation":{"ista":"Shi L, Rampp M, Hof B, Avila M. 2015. A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow. Computers and Fluids. 106(1), 1–11.","ama":"Shi L, Rampp M, Hof B, Avila M. A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow. <i>Computers and Fluids</i>. 2015;106(1):1-11. doi:<a href=\"https://doi.org/10.1016/j.compfluid.2014.09.021\">10.1016/j.compfluid.2014.09.021</a>","mla":"Shi, Liang, et al. “A Hybrid MPI-OpenMP Parallel Implementation for Pseudospectral Simulations with Application to Taylor-Couette Flow.” <i>Computers and Fluids</i>, vol. 106, no. 1, Elsevier, 2015, pp. 1–11, doi:<a href=\"https://doi.org/10.1016/j.compfluid.2014.09.021\">10.1016/j.compfluid.2014.09.021</a>.","chicago":"Shi, Liang, Markus Rampp, Björn Hof, and Marc Avila. “A Hybrid MPI-OpenMP Parallel Implementation for Pseudospectral Simulations with Application to Taylor-Couette Flow.” <i>Computers and Fluids</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.compfluid.2014.09.021\">https://doi.org/10.1016/j.compfluid.2014.09.021</a>.","short":"L. Shi, M. Rampp, B. Hof, M. Avila, Computers and Fluids 106 (2015) 1–11.","apa":"Shi, L., Rampp, M., Hof, B., &#38; Avila, M. (2015). A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow. <i>Computers and Fluids</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.compfluid.2014.09.021\">https://doi.org/10.1016/j.compfluid.2014.09.021</a>","ieee":"L. Shi, M. Rampp, B. Hof, and M. Avila, “A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow,” <i>Computers and Fluids</i>, vol. 106, no. 1. Elsevier, pp. 1–11, 2015."},"status":"public","abstract":[{"lang":"eng","text":"A hybrid-parallel direct-numerical-simulation method with application to turbulent Taylor-Couette flow is presented. The Navier-Stokes equations are discretized in cylindrical coordinates with the spectral Fourier-Galerkin method in the axial and azimuthal directions, and high-order finite differences in the radial direction. Time is advanced by a second-order, semi-implicit projection scheme, which requires the solution of five Helmholtz/Poisson equations, avoids staggered grids and renders very small slip velocities. Nonlinear terms are evaluated with the pseudospectral method. The code is parallelized using a hybrid MPI-OpenMP strategy, which, compared with a flat MPI parallelization, is simpler to implement, allows to reduce inter-node communications and MPI overhead that become relevant at high processor-core counts, and helps to contain the memory footprint. A strong scaling study shows that the hybrid code maintains scalability up to more than 20,000 processor cores and thus allows to perform simulations at higher resolutions than previously feasible. In particular, it opens up the possibility to simulate turbulent Taylor-Couette flows at Reynolds numbers up to O(105). This enables to probe hydrodynamic turbulence in Keplerian flows in experimentally relevant regimes."}],"title":"A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow","author":[{"first_name":"Liang","last_name":"Shi","full_name":"Shi, Liang","id":"374A3F1A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rampp","first_name":"Markus","full_name":"Rampp, Markus"},{"first_name":"Björn","orcid":"0000-0003-2057-2754","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Hof, Björn"},{"first_name":"Marc","last_name":"Avila","full_name":"Avila, Marc"}],"oa":1,"publication_status":"published","_id":"2030","language":[{"iso":"eng"}],"issue":"1","intvolume":"       106","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"BjHo"}],"publication":"Computers and Fluids","publisher":"Elsevier","page":"1 - 11","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1311.2481","open_access":"1"}]},{"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.4225"}],"page":"52 - 59","publisher":"Elsevier","publication":" Information Processing Letters","intvolume":"       115","issue":"1","oa":1,"author":[{"full_name":"Bérard, Béatrice","last_name":"Bérard","first_name":"Béatrice"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Nathalie","last_name":"Sznajder","full_name":"Sznajder, Nathalie"}],"title":"Probabilistic opacity for Markov decision processes","status":"public","citation":{"chicago":"Bérard, Béatrice, Krishnendu Chatterjee, and Nathalie Sznajder. “Probabilistic Opacity for Markov Decision Processes.” <i> Information Processing Letters</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">https://doi.org/10.1016/j.ipl.2014.09.001</a>.","mla":"Bérard, Béatrice, et al. “Probabilistic Opacity for Markov Decision Processes.” <i> Information Processing Letters</i>, vol. 115, no. 1, Elsevier, 2015, pp. 52–59, doi:<a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">10.1016/j.ipl.2014.09.001</a>.","ama":"Bérard B, Chatterjee K, Sznajder N. Probabilistic opacity for Markov decision processes. <i> Information Processing Letters</i>. 2015;115(1):52-59. doi:<a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">10.1016/j.ipl.2014.09.001</a>","ista":"Bérard B, Chatterjee K, Sznajder N. 2015. Probabilistic opacity for Markov decision processes.  Information Processing Letters. 115(1), 52–59.","ieee":"B. Bérard, K. Chatterjee, and N. Sznajder, “Probabilistic opacity for Markov decision processes,” <i> Information Processing Letters</i>, vol. 115, no. 1. Elsevier, pp. 52–59, 2015.","short":"B. Bérard, K. Chatterjee, N. Sznajder,  Information Processing Letters 115 (2015) 52–59.","apa":"Bérard, B., Chatterjee, K., &#38; Sznajder, N. (2015). Probabilistic opacity for Markov decision processes. <i> Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">https://doi.org/10.1016/j.ipl.2014.09.001</a>"},"day":"01","date_updated":"2021-01-12T06:54:52Z","date_created":"2018-12-11T11:55:20Z","date_published":"2015-01-01T00:00:00Z","month":"01","volume":115,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2034","language":[{"iso":"eng"}],"publication_status":"published","abstract":[{"text":"Opacity is a generic security property, that has been defined on (non-probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a subset of runs, and a function describing the view of an external observer, the value of interest for opacity is a measure of the set of runs disclosing the secret. We extend this definition to the richer framework of Markov decision processes, where non-deterministicchoice is combined with probabilistic transitions, and we study related decidability problems with partial or complete observation hypotheses for the schedulers. We prove that all questions are decidable with complete observation and ω-regular secrets. With partial observation, we prove that all quantitative questions are undecidable but the question whether a system is almost surely non-opaquebecomes decidable for a restricted class of ω-regular secrets, as well as for all ω-regular secrets under finite-memory schedulers.","lang":"eng"}],"ec_funded":1,"type":"journal_article","year":"2015","scopus_import":1,"oa_version":"Preprint","doi":"10.1016/j.ipl.2014.09.001","publist_id":"5025"},{"author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"id":"4483EF78-F248-11E8-B48F-1D18A9856A87","full_name":"Jablonski, Grzegorz","first_name":"Grzegorz","orcid":"0000-0002-3536-9866","last_name":"Jablonski"},{"last_name":"Mrozek","first_name":"Marian","full_name":"Mrozek, Marian"}],"oa":1,"status":"public","title":"The persistent homology of a self-map","publication":"Foundations of Computational Mathematics","intvolume":"        15","page":"1213 - 1244","quality_controlled":"1","publisher":"Springer","issue":"5","month":"10","date_published":"2015-10-01T00:00:00Z","date_created":"2018-12-11T11:55:20Z","volume":15,"has_accepted_license":"1","date_updated":"2021-01-12T06:54:53Z","day":"01","citation":{"chicago":"Edelsbrunner, Herbert, Grzegorz Jablonski, and Marian Mrozek. “The Persistent Homology of a Self-Map.” <i>Foundations of Computational Mathematics</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s10208-014-9223-y\">https://doi.org/10.1007/s10208-014-9223-y</a>.","ama":"Edelsbrunner H, Jablonski G, Mrozek M. The persistent homology of a self-map. <i>Foundations of Computational Mathematics</i>. 2015;15(5):1213-1244. doi:<a href=\"https://doi.org/10.1007/s10208-014-9223-y\">10.1007/s10208-014-9223-y</a>","ista":"Edelsbrunner H, Jablonski G, Mrozek M. 2015. The persistent homology of a self-map. Foundations of Computational Mathematics. 15(5), 1213–1244.","mla":"Edelsbrunner, Herbert, et al. “The Persistent Homology of a Self-Map.” <i>Foundations of Computational Mathematics</i>, vol. 15, no. 5, Springer, 2015, pp. 1213–44, doi:<a href=\"https://doi.org/10.1007/s10208-014-9223-y\">10.1007/s10208-014-9223-y</a>.","apa":"Edelsbrunner, H., Jablonski, G., &#38; Mrozek, M. (2015). The persistent homology of a self-map. <i>Foundations of Computational Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s10208-014-9223-y\">https://doi.org/10.1007/s10208-014-9223-y</a>","short":"H. Edelsbrunner, G. Jablonski, M. Mrozek, Foundations of Computational Mathematics 15 (2015) 1213–1244.","ieee":"H. Edelsbrunner, G. Jablonski, and M. Mrozek, “The persistent homology of a self-map,” <i>Foundations of Computational Mathematics</i>, vol. 15, no. 5. Springer, pp. 1213–1244, 2015."},"file":[{"date_updated":"2020-07-14T12:45:26Z","file_name":"IST-2016-486-v1+1_s10208-014-9223-y.pdf","checksum":"3566f3a8b0c1bc550e62914a88c584ff","file_size":1317546,"file_id":"4670","creator":"system","relation":"main_file","date_created":"2018-12-12T10:08:10Z","content_type":"application/pdf","access_level":"open_access"}],"acknowledgement":"This research is partially supported by the Toposys project FP7-ICT-318493-STREP, by ESF under the ACAT Research Network Programme, by the Russian Government under mega project 11.G34.31.0053, and by the Polish National Science Center under Grant No. N201 419639.","file_date_updated":"2020-07-14T12:45:26Z","ec_funded":1,"abstract":[{"lang":"eng","text":"Considering a continuous self-map and the induced endomorphism on homology, we study the eigenvalues and eigenspaces of the latter. Taking a filtration of representations, we define the persistence of the eigenspaces, effectively introducing a hierarchical organization of the map. The algorithm that computes this information for a finite sample is proved to be stable, and to give the correct answer for a sufficiently dense sample. Results computed with an implementation of the algorithm provide evidence of its practical utility.\r\n"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"318493","name":"Topological Complex Systems"}],"language":[{"iso":"eng"}],"_id":"2035","ddc":["000"],"publication_status":"published","oa_version":"Published Version","doi":"10.1007/s10208-014-9223-y","publist_id":"5022","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"pubrep_id":"486","type":"journal_article","year":"2015","scopus_import":1},{"publisher":"Springer","quality_controlled":"1","page":"381 - 417","main_file_link":[{"url":"http://arxiv.org/abs/1402.1153","open_access":"1"}],"intvolume":"       215","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"RoSe"}],"publication":"Archive for Rational Mechanics and Analysis","issue":"2","publication_status":"published","language":[{"iso":"eng"}],"_id":"2085","oa":1,"author":[{"first_name":"Phan","last_name":"Nam","full_name":"Nam, Phan","id":"404092F4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert"}],"title":"Collective excitations of Bose gases in the mean-field regime","abstract":[{"text":"We study the spectrum of a large system of N identical bosons interacting via a two-body potential with strength 1/N. In this mean-field regime, Bogoliubov's theory predicts that the spectrum of the N-particle Hamiltonian can be approximated by that of an effective quadratic Hamiltonian acting on Fock space, which describes the fluctuations around a condensed state. Recently, Bogoliubov's theory has been justified rigorously in the case that the low-energy eigenvectors of the N-particle Hamiltonian display complete condensation in the unique minimizer of the corresponding Hartree functional. In this paper, we shall justify Bogoliubov's theory for the high-energy part of the spectrum of the N-particle Hamiltonian corresponding to (non-linear) excited states of the Hartree functional. Moreover, we shall extend the existing results on the excitation spectrum to the case of non-uniqueness and/or degeneracy of the Hartree minimizer. In particular, the latter covers the case of rotating Bose gases, when the rotation speed is large enough to break the symmetry and to produce multiple quantized vortices in the Hartree minimizer. ","lang":"eng"}],"status":"public","day":"01","citation":{"ieee":"P. Nam and R. Seiringer, “Collective excitations of Bose gases in the mean-field regime,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 215, no. 2. Springer, pp. 381–417, 2015.","apa":"Nam, P., &#38; Seiringer, R. (2015). Collective excitations of Bose gases in the mean-field regime. <i>Archive for Rational Mechanics and Analysis</i>. Springer. <a href=\"https://doi.org/10.1007/s00205-014-0781-6\">https://doi.org/10.1007/s00205-014-0781-6</a>","short":"P. Nam, R. Seiringer, Archive for Rational Mechanics and Analysis 215 (2015) 381–417.","chicago":"Nam, Phan, and Robert Seiringer. “Collective Excitations of Bose Gases in the Mean-Field Regime.” <i>Archive for Rational Mechanics and Analysis</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00205-014-0781-6\">https://doi.org/10.1007/s00205-014-0781-6</a>.","mla":"Nam, Phan, and Robert Seiringer. “Collective Excitations of Bose Gases in the Mean-Field Regime.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 215, no. 2, Springer, 2015, pp. 381–417, doi:<a href=\"https://doi.org/10.1007/s00205-014-0781-6\">10.1007/s00205-014-0781-6</a>.","ista":"Nam P, Seiringer R. 2015. Collective excitations of Bose gases in the mean-field regime. Archive for Rational Mechanics and Analysis. 215(2), 381–417.","ama":"Nam P, Seiringer R. Collective excitations of Bose gases in the mean-field regime. <i>Archive for Rational Mechanics and Analysis</i>. 2015;215(2):381-417. doi:<a href=\"https://doi.org/10.1007/s00205-014-0781-6\">10.1007/s00205-014-0781-6</a>"},"date_updated":"2021-01-12T06:55:13Z","scopus_import":1,"year":"2015","type":"journal_article","oa_version":"Preprint","date_published":"2015-02-01T00:00:00Z","date_created":"2018-12-11T11:55:37Z","month":"02","volume":215,"publist_id":"4951","doi":"10.1007/s00205-014-0781-6"},{"month":"02","oa_version":"Preprint","date_created":"2018-12-11T11:56:05Z","date_published":"2015-02-01T00:00:00Z","volume":333,"publist_id":"4818","doi":"10.1007/s00220-014-2119-5","date_updated":"2021-01-12T06:55:43Z","citation":{"ieee":"L. Erdös and A. Knowles, “The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case,” <i>Communications in Mathematical Physics</i>, vol. 333, no. 3. Springer, pp. 1365–1416, 2015.","apa":"Erdös, L., &#38; Knowles, A. (2015). The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-014-2119-5\">https://doi.org/10.1007/s00220-014-2119-5</a>","short":"L. Erdös, A. Knowles, Communications in Mathematical Physics 333 (2015) 1365–1416.","mla":"Erdös, László, and Antti Knowles. “The Altshuler-Shklovskii Formulas for Random Band Matrices I: The Unimodular Case.” <i>Communications in Mathematical Physics</i>, vol. 333, no. 3, Springer, 2015, pp. 1365–416, doi:<a href=\"https://doi.org/10.1007/s00220-014-2119-5\">10.1007/s00220-014-2119-5</a>.","ama":"Erdös L, Knowles A. The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case. <i>Communications in Mathematical Physics</i>. 2015;333(3):1365-1416. doi:<a href=\"https://doi.org/10.1007/s00220-014-2119-5\">10.1007/s00220-014-2119-5</a>","ista":"Erdös L, Knowles A. 2015. The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case. Communications in Mathematical Physics. 333(3), 1365–1416.","chicago":"Erdös, László, and Antti Knowles. “The Altshuler-Shklovskii Formulas for Random Band Matrices I: The Unimodular Case.” <i>Communications in Mathematical Physics</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00220-014-2119-5\">https://doi.org/10.1007/s00220-014-2119-5</a>."},"day":"01","scopus_import":1,"year":"2015","type":"journal_article","author":[{"first_name":"László","last_name":"Erdös","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"},{"full_name":"Knowles, Antti","last_name":"Knowles","first_name":"Antti"}],"oa":1,"status":"public","title":"The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case","abstract":[{"text":"We consider the spectral statistics of large random band matrices on mesoscopic energy scales. We show that the correlation function of the local eigenvalue density exhibits a universal power law behaviour that differs from the Wigner-Dyson- Mehta statistics. This law had been predicted in the physics literature by Altshuler and Shklovskii in (Zh Eksp Teor Fiz (Sov Phys JETP) 91(64):220(127), 1986); it describes the correlations of the eigenvalue density in general metallic sampleswith weak disorder. Our result rigorously establishes the Altshuler-Shklovskii formulas for band matrices. In two dimensions, where the leading term vanishes owing to an algebraic cancellation, we identify the first non-vanishing term and show that it differs substantially from the prediction of Kravtsov and Lerner in (Phys Rev Lett 74:2563-2566, 1995). The proof is given in the current paper and its companion (Ann. H. Poincaré. arXiv:1309.5107, 2014). ","lang":"eng"}],"intvolume":"       333","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"LaEr"}],"publication":"Communications in Mathematical Physics","publisher":"Springer","main_file_link":[{"url":"http://arxiv.org/abs/1309.5106","open_access":"1"}],"page":"1365 - 1416","quality_controlled":"1","publication_status":"published","_id":"2166","language":[{"iso":"eng"}],"issue":"3"},{"date_updated":"2023-02-23T10:46:30Z","day":"01","citation":{"apa":"Kolmogorov, V., Thapper, J., &#38; Živný, S. (2015). The power of linear programming for general-valued CSPs. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/130945648\">https://doi.org/10.1137/130945648</a>","short":"V. Kolmogorov, J. Thapper, S. Živný, SIAM Journal on Computing 44 (2015) 1–36.","ieee":"V. Kolmogorov, J. Thapper, and S. Živný, “The power of linear programming for general-valued CSPs,” <i>SIAM Journal on Computing</i>, vol. 44, no. 1. SIAM, pp. 1–36, 2015.","chicago":"Kolmogorov, Vladimir, Johan Thapper, and Stanislav Živný. “The Power of Linear Programming for General-Valued CSPs.” <i>SIAM Journal on Computing</i>. SIAM, 2015. <a href=\"https://doi.org/10.1137/130945648\">https://doi.org/10.1137/130945648</a>.","ista":"Kolmogorov V, Thapper J, Živný S. 2015. The power of linear programming for general-valued CSPs. SIAM Journal on Computing. 44(1), 1–36.","ama":"Kolmogorov V, Thapper J, Živný S. The power of linear programming for general-valued CSPs. <i>SIAM Journal on Computing</i>. 2015;44(1):1-36. doi:<a href=\"https://doi.org/10.1137/130945648\">10.1137/130945648</a>","mla":"Kolmogorov, Vladimir, et al. “The Power of Linear Programming for General-Valued CSPs.” <i>SIAM Journal on Computing</i>, vol. 44, no. 1, SIAM, 2015, pp. 1–36, doi:<a href=\"https://doi.org/10.1137/130945648\">10.1137/130945648</a>."},"related_material":{"record":[{"relation":"earlier_version","id":"2518","status":"public"}]},"month":"02","date_published":"2015-02-01T00:00:00Z","date_created":"2018-12-11T11:56:41Z","volume":44,"publication":"SIAM Journal on Computing","intvolume":"        44","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1311.4219"}],"page":"1 - 36","publisher":"SIAM","issue":"1","author":[{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir"},{"last_name":"Thapper","first_name":"Johan","full_name":"Thapper, Johan"},{"full_name":"Živný, Stanislav","last_name":"Živný","first_name":"Stanislav"}],"oa":1,"status":"public","title":"The power of linear programming for general-valued CSPs","type":"journal_article","arxiv":1,"year":"2015","scopus_import":1,"oa_version":"Preprint","doi":"10.1137/130945648","publist_id":"4673","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"VlKo"}],"external_id":{"arxiv":["1311.4219"]},"language":[{"iso":"eng"}],"_id":"2271","publication_status":"published","abstract":[{"lang":"eng","text":"A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. Finite-valued constraint languages contain functions that take on rational costs and general-valued constraint languages contain functions that take on rational or infinite costs. An instance of the problem is specified by a sum of functions from the language with the goal to minimise the sum. This framework includes and generalises well-studied constraint satisfaction problems (CSPs) and maximum constraint satisfaction problems (Max-CSPs).\r\nOur main result is a precise algebraic characterisation of valued constraint languages whose instances can be solved exactly by the basic linear programming relaxation (BLP). For a general-valued constraint language Γ, BLP is a decision procedure for Γ if and only if Γ admits a symmetric fractional polymorphism of every arity. For a finite-valued constraint language Γ, BLP is a decision procedure if and only if Γ admits a symmetric fractional polymorphism of some arity, or equivalently, if Γ admits a symmetric fractional polymorphism of arity 2.\r\nUsing these results, we obtain tractability of several novel and previously widely-open classes of VCSPs, including problems over valued constraint languages that are: (1) submodular on arbitrary lattices; (2) bisubmodular (also known as k-submodular) on arbitrary finite domains; (3) weakly (and hence strongly) tree-submodular on arbitrary trees. "}]},{"oa":1,"author":[{"full_name":"Lewin, Mathieu","first_name":"Mathieu","last_name":"Lewin"},{"first_name":"Nam","last_name":"Phan Thanh","id":"404092F4-F248-11E8-B48F-1D18A9856A87","full_name":"Phan Thanh, Nam"},{"full_name":"Rougerie, Nicolas","last_name":"Rougerie","first_name":"Nicolas"}],"title":"Derivation of nonlinear gibbs measures from many-body quantum mechanics","status":"public","publisher":"Ecole Polytechnique","page":"65 - 115","quality_controlled":"1","intvolume":"         2","publication":"Journal de l'Ecole Polytechnique - Mathematiques","date_created":"2018-12-11T11:46:40Z","license":"https://creativecommons.org/licenses/by-nd/4.0/","date_published":"2015-01-01T00:00:00Z","month":"01","has_accepted_license":"1","volume":2,"file":[{"content_type":"application/pdf","access_level":"open_access","file_size":1084254,"file_id":"4974","relation":"main_file","creator":"system","date_created":"2018-12-12T10:12:53Z","checksum":"a40eb4016717ddc9927154798a4c164a","date_updated":"2020-07-14T12:46:35Z","file_name":"IST-2018-951-v1+1_2015_Thanh-Nam_Derivation_of.pdf"}],"day":"01","citation":{"chicago":"Lewin, Mathieu, Phan Nam, and Nicolas Rougerie. “Derivation of Nonlinear Gibbs Measures from Many-Body Quantum Mechanics.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique, 2015. <a href=\"https://doi.org/10.5802/jep.18\">https://doi.org/10.5802/jep.18</a>.","ama":"Lewin M, Nam P, Rougerie N. Derivation of nonlinear gibbs measures from many-body quantum mechanics. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. 2015;2:65-115. doi:<a href=\"https://doi.org/10.5802/jep.18\">10.5802/jep.18</a>","ista":"Lewin M, Nam P, Rougerie N. 2015. Derivation of nonlinear gibbs measures from many-body quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques. 2, 65–115.","mla":"Lewin, Mathieu, et al. “Derivation of Nonlinear Gibbs Measures from Many-Body Quantum Mechanics.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 2, Ecole Polytechnique, 2015, pp. 65–115, doi:<a href=\"https://doi.org/10.5802/jep.18\">10.5802/jep.18</a>.","apa":"Lewin, M., Nam, P., &#38; Rougerie, N. (2015). Derivation of nonlinear gibbs measures from many-body quantum mechanics. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique. <a href=\"https://doi.org/10.5802/jep.18\">https://doi.org/10.5802/jep.18</a>","short":"M. Lewin, P. Nam, N. Rougerie, Journal de l’Ecole Polytechnique - Mathematiques 2 (2015) 65–115.","ieee":"M. Lewin, P. Nam, and N. Rougerie, “Derivation of nonlinear gibbs measures from many-body quantum mechanics,” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 2. Ecole Polytechnique, pp. 65–115, 2015."},"date_updated":"2021-01-12T08:00:52Z","file_date_updated":"2020-07-14T12:46:35Z","abstract":[{"lang":"eng","text":"We prove that nonlinear Gibbs measures can be obtained from the corresponding many-body, grand-canonical, quantum Gibbs states, in a mean-field limit where the temperature T diverges and the interaction strength behaves as 1/T. We proceed by characterizing the interacting Gibbs state as minimizing a functional counting the free-energy relatively to the non-interacting case. We then perform an infinite-dimensional analogue of phase-space semiclassical analysis, using fine properties of the quantum relative entropy, the link between quantum de Finetti measures and upper/lower symbols in a coherent state basis, as well as Berezin-Lieb type inequalities. Our results cover the measure built on the defocusing nonlinear Schrödinger functional on a finite interval, as well as smoother interactions in dimensions d 2."}],"ec_funded":1,"project":[{"grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"RoSe"}],"ddc":["539"],"publication_status":"published","language":[{"iso":"eng"}],"_id":"473","oa_version":"Published Version","tmp":{"image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"publist_id":"7344","doi":"10.5802/jep.18","pubrep_id":"951","scopus_import":1,"year":"2015","type":"journal_article"},{"publisher":"Company of Biologists","quality_controlled":"1","page":"2866 - 2880","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MiSi"}],"intvolume":"       128","publication":"Journal of Cell Science","issue":"15","publication_status":"published","_id":"477","language":[{"iso":"eng"}],"author":[{"first_name":"Katrin","last_name":"Holst","full_name":"Holst, Katrin"},{"first_name":"Daria","last_name":"Guseva","full_name":"Guseva, Daria"},{"first_name":"Susann","last_name":"Schindler","full_name":"Schindler, Susann"},{"first_name":"Michael K","orcid":"0000-0002-6620-9179","last_name":"Sixt","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Braun, Armin","last_name":"Braun","first_name":"Armin"},{"last_name":"Chopra","first_name":"Himpriya","full_name":"Chopra, Himpriya"},{"first_name":"Oliver","last_name":"Pabst","full_name":"Pabst, Oliver"},{"full_name":"Ponimaskin, Evgeni","first_name":"Evgeni","last_name":"Ponimaskin"}],"abstract":[{"lang":"eng","text":"Dendritic cells are potent antigen-presenting cells endowed with the unique ability to initiate adaptive immune responses upon inflammation. Inflammatory processes are often associated with an increased production of serotonin, which operates by activating specific receptors. However, the functional role of serotonin receptors in regulation of dendritic cell functions is poorly understood. Here, we demonstrate that expression of serotonin receptor 5-HT7 (5-HT7TR) as well as its downstream effector Cdc42 is upregulated in dendritic cells upon maturation. Although dendritic cell maturation was independent of 5-HT7TR, receptor stimulation affected dendritic cell morphology through Cdc42-mediated signaling. In addition, basal activity of 5-HT7TR was required for the proper expression of the chemokine receptor CCR7, which is a key factor that controls dendritic cell migration. Consistent with this, we observed that 5-HT7TR enhances chemotactic motility of dendritic cells in vitro by modulating their directionality and migration velocity. Accordingly, migration of dendritic cells in murine colon explants was abolished after pharmacological receptor inhibition. Our results indicate that there is a crucial role for 5-HT7TR-Cdc42-mediated signaling in the regulation of dendritic cell morphology and motility, suggesting that 5-HT7TR could be a new target for treatment of a variety of inflammatory and immune disorders."}],"title":"The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells","status":"public","day":"15","citation":{"mla":"Holst, Katrin, et al. “The Serotonin Receptor 5-HT7R Regulates the Morphology and Migratory Properties of Dendritic Cells.” <i>Journal of Cell Science</i>, vol. 128, no. 15, Company of Biologists, 2015, pp. 2866–80, doi:<a href=\"https://doi.org/10.1242/jcs.167999\">10.1242/jcs.167999</a>.","ama":"Holst K, Guseva D, Schindler S, et al. The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. <i>Journal of Cell Science</i>. 2015;128(15):2866-2880. doi:<a href=\"https://doi.org/10.1242/jcs.167999\">10.1242/jcs.167999</a>","ista":"Holst K, Guseva D, Schindler S, Sixt MK, Braun A, Chopra H, Pabst O, Ponimaskin E. 2015. The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. Journal of Cell Science. 128(15), 2866–2880.","chicago":"Holst, Katrin, Daria Guseva, Susann Schindler, Michael K Sixt, Armin Braun, Himpriya Chopra, Oliver Pabst, and Evgeni Ponimaskin. “The Serotonin Receptor 5-HT7R Regulates the Morphology and Migratory Properties of Dendritic Cells.” <i>Journal of Cell Science</i>. Company of Biologists, 2015. <a href=\"https://doi.org/10.1242/jcs.167999\">https://doi.org/10.1242/jcs.167999</a>.","ieee":"K. Holst <i>et al.</i>, “The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells,” <i>Journal of Cell Science</i>, vol. 128, no. 15. Company of Biologists, pp. 2866–2880, 2015.","short":"K. Holst, D. Guseva, S. Schindler, M.K. Sixt, A. Braun, H. Chopra, O. Pabst, E. Ponimaskin, Journal of Cell Science 128 (2015) 2866–2880.","apa":"Holst, K., Guseva, D., Schindler, S., Sixt, M. K., Braun, A., Chopra, H., … Ponimaskin, E. (2015). The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. <i>Journal of Cell Science</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.167999\">https://doi.org/10.1242/jcs.167999</a>"},"date_updated":"2021-01-12T08:00:54Z","scopus_import":1,"year":"2015","type":"journal_article","oa_version":"None","date_created":"2018-12-11T11:46:41Z","date_published":"2015-06-15T00:00:00Z","month":"06","volume":128,"doi":"10.1242/jcs.167999","publist_id":"7343"},{"issue":"6","publication":"Information and Computation","intvolume":"       242","main_file_link":[{"url":"https://arxiv.org/abs/1302.4248","open_access":"1"}],"quality_controlled":"1","page":"25 - 52","publisher":"Elsevier","status":"public","title":"Looking at mean-payoff and total-payoff through windows","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"full_name":"Randour, Mickael","last_name":"Randour","first_name":"Mickael"},{"first_name":"Jean","last_name":"Raskin","full_name":"Raskin, Jean"}],"oa":1,"related_material":{"record":[{"relation":"earlier_version","id":"2279","status":"public"}]},"date_updated":"2023-02-23T10:36:02Z","day":"24","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.03.010\">https://doi.org/10.1016/j.ic.2015.03.010</a>.","ista":"Chatterjee K, Doyen L, Randour M, Raskin J. 2015. Looking at mean-payoff and total-payoff through windows. Information and Computation. 242(6), 25–52.","ama":"Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff through windows. <i>Information and Computation</i>. 2015;242(6):25-52. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.010\">10.1016/j.ic.2015.03.010</a>","mla":"Chatterjee, Krishnendu, et al. “Looking at Mean-Payoff and Total-Payoff through Windows.” <i>Information and Computation</i>, vol. 242, no. 6, Elsevier, 2015, pp. 25–52, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.010\">10.1016/j.ic.2015.03.010</a>.","short":"K. Chatterjee, L. Doyen, M. Randour, J. Raskin, Information and Computation 242 (2015) 25–52.","apa":"Chatterjee, K., Doyen, L., Randour, M., &#38; Raskin, J. (2015). Looking at mean-payoff and total-payoff through windows. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.03.010\">https://doi.org/10.1016/j.ic.2015.03.010</a>","ieee":"K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” <i>Information and Computation</i>, vol. 242, no. 6. Elsevier, pp. 25–52, 2015."},"volume":242,"month":"03","date_published":"2015-03-24T00:00:00Z","date_created":"2018-12-11T11:46:57Z","language":[{"iso":"eng"}],"_id":"523","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"ec_funded":1,"abstract":[{"lang":"eng","text":"We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show that (i) if the window size is polynomial, deciding the winner takes polynomial time, and (ii) the existence of a bounded window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff games. For multiple dimensions, we show that (i) the problem with fixed window size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to decide the existence of a bounded window."}],"year":"2015","type":"journal_article","scopus_import":1,"doi":"10.1016/j.ic.2015.03.010","publist_id":"7296","oa_version":"Preprint"},{"oa":1,"author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"}],"title":"Qualitative analysis of concurrent mean payoff games","status":"public","publisher":"Elsevier","page":"2 - 24","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1409.5306","open_access":"1"}],"intvolume":"       242","publication":"Information and Computation","issue":"6","date_created":"2018-12-11T11:46:57Z","date_published":"2015-10-11T00:00:00Z","month":"10","volume":242,"day":"11","citation":{"ieee":"K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” <i>Information and Computation</i>, vol. 242, no. 6. Elsevier, pp. 2–24, 2015.","short":"K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean payoff games. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.03.009\">https://doi.org/10.1016/j.ic.2015.03.009</a>","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.03.009\">https://doi.org/10.1016/j.ic.2015.03.009</a>.","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” <i>Information and Computation</i>, vol. 242, no. 6, Elsevier, 2015, pp. 2–24, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.009\">10.1016/j.ic.2015.03.009</a>.","ista":"Chatterjee K, Ibsen-Jensen R. 2015. Qualitative analysis of concurrent mean payoff games. Information and Computation. 242(6), 2–24.","ama":"Chatterjee K, Ibsen-Jensen R. Qualitative analysis of concurrent mean payoff games. <i>Information and Computation</i>. 2015;242(6):2-24. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.009\">10.1016/j.ic.2015.03.009</a>"},"date_updated":"2023-02-23T12:24:45Z","related_material":{"record":[{"relation":"earlier_version","id":"5403","status":"public"}]},"abstract":[{"lang":"eng","text":"We consider concurrent games played by two players on a finite-state graph, where in every round the players simultaneously choose a move, and the current state along with the joint moves determine the successor state. We study the most fundamental objective for concurrent games, namely, mean-payoff or limit-average objective, where a reward is associated to each transition, and the goal of player 1 is to maximize the long-run average of the rewards, and the objective of player 2 is strictly the opposite (i.e., the games are zero-sum). The path constraint for player 1 could be qualitative, i.e., the mean-payoff is the maximal reward, or arbitrarily close to it; or quantitative, i.e., a given threshold between the minimal and maximal reward. We consider the computation of the almost-sure (resp. positive) winning sets, where player 1 can ensure that the path constraint is satisfied with probability 1 (resp. positive probability). Almost-sure winning with qualitative constraint exactly corresponds to the question of whether there exists a strategy to ensure that the payoff is the maximal reward of the game. Our main results for qualitative path constraints are as follows: (1) we establish qualitative determinacy results that show that for every state either player 1 has a strategy to ensure almost-sure (resp. positive) winning against all player-2 strategies, or player 2 has a spoiling strategy to falsify almost-sure (resp. positive) winning against all player-1 strategies; (2) we present optimal strategy complexity results that precisely characterize the classes of strategies required for almost-sure and positive winning for both players; and (3) we present quadratic time algorithms to compute the almost-sure and the positive winning sets, matching the best known bound of the algorithms for much simpler problems (such as reachability objectives). For quantitative constraints we show that a polynomial time solution for the almost-sure or the positive winning set would imply a solution to a long-standing open problem (of solving the value problem of turn-based deterministic mean-payoff games) that is not known to be solvable in polynomial time."}],"external_id":{"arxiv":["1409.5306"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"publication_status":"published","_id":"524","language":[{"iso":"eng"}],"oa_version":"Preprint","publist_id":"7295","doi":"10.1016/j.ic.2015.03.009","scopus_import":1,"year":"2015","arxiv":1,"type":"journal_article"},{"issue":"3","publication_status":"published","language":[{"iso":"eng"}],"_id":"532","publisher":"Cell Press","page":"670 - 683","quality_controlled":"1","intvolume":"       163","department":[{"_id":"JiFr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Cell","abstract":[{"text":"Ethylene is a gaseous phytohormone that plays vital roles in plant growth and development. Previous studies uncovered EIN2 as an essential signal transducer linking ethylene perception on ER to transcriptional regulation in the nucleus through a “cleave and shuttle” model. In this study, we report another mechanism of EIN2-mediated ethylene signaling, whereby EIN2 imposes the translational repression of EBF1 and EBF2 mRNA. We find that the EBF1/2 3′ UTRs mediate EIN2-directed translational repression and identify multiple poly-uridylates (PolyU) motifs as functional cis elements of 3′ UTRs. Furthermore, we demonstrate that ethylene induces EIN2 to associate with 3′ UTRs and target EBF1/2 mRNA to cytoplasmic processing-body (P-body) through interacting with multiple P-body factors, including EIN5 and PABs. Our study illustrates translational regulation as a key step in ethylene signaling and presents mRNA 3′ UTR functioning as a “signal transducer” to sense and relay cellular signaling in plants.","lang":"eng"}],"title":"EIN2-directed translational regulation of ethylene signaling in arabidopsis","status":"public","author":[{"full_name":"Li, Wenyang","last_name":"Li","first_name":"Wenyang"},{"last_name":"Ma","first_name":"Mengdi","full_name":"Ma, Mengdi"},{"first_name":"Ying","last_name":"Feng","full_name":"Feng, Ying"},{"orcid":"0000-0001-5039-9660","last_name":"Li","first_name":"Hongjiang","full_name":"Li, Hongjiang","id":"33CA54A6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Yichuan","last_name":"Wang","full_name":"Wang, Yichuan"},{"full_name":"Ma, Yutong","last_name":"Ma","first_name":"Yutong"},{"full_name":"Li, Mingzhe","last_name":"Li","first_name":"Mingzhe"},{"full_name":"An, Fengying","first_name":"Fengying","last_name":"An"},{"first_name":"Hongwei","last_name":"Guo","full_name":"Guo, Hongwei"}],"scopus_import":1,"year":"2015","type":"journal_article","day":"22","citation":{"chicago":"Li, Wenyang, Mengdi Ma, Ying Feng, Hongjiang Li, Yichuan Wang, Yutong Ma, Mingzhe Li, Fengying An, and Hongwei Guo. “EIN2-Directed Translational Regulation of Ethylene Signaling in Arabidopsis.” <i>Cell</i>. Cell Press, 2015. <a href=\"https://doi.org/10.1016/j.cell.2015.09.037\">https://doi.org/10.1016/j.cell.2015.09.037</a>.","ama":"Li W, Ma M, Feng Y, et al. EIN2-directed translational regulation of ethylene signaling in arabidopsis. <i>Cell</i>. 2015;163(3):670-683. doi:<a href=\"https://doi.org/10.1016/j.cell.2015.09.037\">10.1016/j.cell.2015.09.037</a>","ista":"Li W, Ma M, Feng Y, Li H, Wang Y, Ma Y, Li M, An F, Guo H. 2015. EIN2-directed translational regulation of ethylene signaling in arabidopsis. Cell. 163(3), 670–683.","mla":"Li, Wenyang, et al. “EIN2-Directed Translational Regulation of Ethylene Signaling in Arabidopsis.” <i>Cell</i>, vol. 163, no. 3, Cell Press, 2015, pp. 670–83, doi:<a href=\"https://doi.org/10.1016/j.cell.2015.09.037\">10.1016/j.cell.2015.09.037</a>.","short":"W. Li, M. Ma, Y. Feng, H. Li, Y. Wang, Y. Ma, M. Li, F. An, H. Guo, Cell 163 (2015) 670–683.","apa":"Li, W., Ma, M., Feng, Y., Li, H., Wang, Y., Ma, Y., … Guo, H. (2015). EIN2-directed translational regulation of ethylene signaling in arabidopsis. <i>Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cell.2015.09.037\">https://doi.org/10.1016/j.cell.2015.09.037</a>","ieee":"W. Li <i>et al.</i>, “EIN2-directed translational regulation of ethylene signaling in arabidopsis,” <i>Cell</i>, vol. 163, no. 3. Cell Press, pp. 670–683, 2015."},"date_updated":"2021-01-12T08:01:27Z","volume":163,"publist_id":"7285","doi":"10.1016/j.cell.2015.09.037","oa_version":"None","date_published":"2015-10-22T00:00:00Z","date_created":"2018-12-11T11:47:00Z","month":"10"},{"month":"01","date_created":"2018-12-12T11:39:17Z","date_published":"2015-01-12T00:00:00Z","oa_version":"Published Version","doi":"10.15479/AT:IST-2015-318-v1-1","has_accepted_license":"1","date_updated":"2023-02-23T12:26:16Z","pubrep_id":"318","citation":{"apa":"Chatterjee, K., Komarkova, Z., &#38; Kretinsky, J. (2015). <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">https://doi.org/10.15479/AT:IST-2015-318-v1-1</a>","short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.","ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">https://doi.org/10.15479/AT:IST-2015-318-v1-1</a>.","ama":"Chatterjee K, Komarkova Z, Kretinsky J. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">10.15479/AT:IST-2015-318-v1-1</a>","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 41p.","mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">10.15479/AT:IST-2015-318-v1-1</a>."},"day":"12","file":[{"content_type":"application/pdf","access_level":"open_access","file_size":689863,"relation":"main_file","creator":"system","file_id":"5533","date_created":"2018-12-12T11:54:11Z","checksum":"e4869a584567c506349abda9c8ec7db3","date_updated":"2020-07-14T12:46:52Z","file_name":"IST-2015-318-v1+1_main.pdf"}],"related_material":{"record":[{"id":"1657","relation":"later_version","status":"public"},{"relation":"later_version","id":"466","status":"public"},{"status":"public","id":"5435","relation":"later_version"}]},"type":"technical_report","year":"2015","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Komarkova, Zuzana","last_name":"Komarkova","first_name":"Zuzana"},{"first_name":"Jan","last_name":"Kretinsky","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan"}],"alternative_title":["IST Austria Technical Report"],"oa":1,"file_date_updated":"2020-07-14T12:46:52Z","publication_identifier":{"issn":["2664-1690"]},"status":"public","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector.  \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics.\r\nOur problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions.\r\nFinally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.","lang":"eng"}],"department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"41","publisher":"IST Austria","language":[{"iso":"eng"}],"_id":"5429","ddc":["004"],"publication_status":"published"},{"title":"Faster algorithms for quantitative verification in constant treewidth graphs","abstract":[{"lang":"eng","text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean- payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let n denote the number of nodes of a graph, m the number of edges (for constant treewidth graphs m = O ( n ) ) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a mul- tiplicative factor of ∊ in time O ( n · log( n/∊ )) and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time O ( n · log( | a · b · n | )) = O ( n · log( n · W )) , when the output is a b , as compared to the previously best known algorithm with running time O ( n 2 · log( n · W )) . Third, for the minimum initial credit problem we show that (i) for general graphs the problem can be solved in O ( n 2 · m ) time and the associated decision problem can be solved in O ( n · m ) time, improving the previous known O ( n 3 · m · log( n · W )) and O ( n 2 · m ) bounds, respectively; and (ii) for constant treewidth graphs we present an algorithm that requires O ( n · log n ) time, improving the previous known O ( n 4 · log( n · W )) bound. We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks."}],"status":"public","oa":1,"file_date_updated":"2020-07-14T12:46:52Z","publication_identifier":{"issn":["2664-1690"]},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389"},{"last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas"}],"alternative_title":["IST Austria Technical Report"],"_id":"5430","language":[{"iso":"eng"}],"publication_status":"published","ddc":["000"],"page":"31","publisher":"IST Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"has_accepted_license":"1","doi":"10.15479/AT:IST-2015-319-v1-1","date_published":"2015-02-10T00:00:00Z","date_created":"2018-12-12T11:39:17Z","oa_version":"Published Version","month":"02","type":"technical_report","year":"2015","related_material":{"record":[{"relation":"later_version","id":"1607","status":"public"},{"relation":"later_version","id":"5437","status":"public"}]},"day":"10","citation":{"ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 31p.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-319-v1-1\">10.15479/AT:IST-2015-319-v1-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-319-v1-1\">10.15479/AT:IST-2015-319-v1-1</a>.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-319-v1-1\">https://doi.org/10.15479/AT:IST-2015-319-v1-1</a>.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2015). <i>Faster algorithms for quantitative verification in constant treewidth graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-319-v1-1\">https://doi.org/10.15479/AT:IST-2015-319-v1-1</a>","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, <i>Faster algorithms for quantitative verification in constant treewidth graphs</i>. IST Austria, 2015."},"file":[{"checksum":"62c6ea01e342553dcafb88a070fb1ad5","date_updated":"2020-07-14T12:46:52Z","file_name":"IST-2015-319-v1+1_long.pdf","content_type":"application/pdf","access_level":"open_access","file_id":"5482","creator":"system","relation":"main_file","file_size":1089651,"date_created":"2018-12-12T11:53:21Z"}],"date_updated":"2023-02-23T12:26:22Z","pubrep_id":"319"},{"day":"19","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. <i>The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-322-v1-1\">https://doi.org/10.15479/AT:IST-2015-322-v1-1</a>.","ista":"Chatterjee K, Ibsen-Jensen R, Hansen K. 2015. The patience of concurrent stochastic games with safety and reachability objectives, IST Austria, 25p.","ama":"Chatterjee K, Ibsen-Jensen R, Hansen K. <i>The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-322-v1-1\">10.15479/AT:IST-2015-322-v1-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-322-v1-1\">10.15479/AT:IST-2015-322-v1-1</a>.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Hansen, K. (2015). <i>The patience of concurrent stochastic games with safety and reachability objectives</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-322-v1-1\">https://doi.org/10.15479/AT:IST-2015-322-v1-1</a>","short":"K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, <i>The patience of concurrent stochastic games with safety and reachability objectives</i>. IST Austria, 2015."},"file":[{"checksum":"bfb858262c30445b8e472c40069178a2","date_updated":"2020-07-14T12:46:53Z","file_name":"IST-2015-322-v1+1_safetygames.pdf","content_type":"application/pdf","access_level":"open_access","creator":"system","relation":"main_file","file_id":"5491","file_size":661015,"date_created":"2018-12-12T11:53:31Z"}],"date_updated":"2021-01-12T08:02:13Z","pubrep_id":"322","type":"technical_report","year":"2015","date_created":"2018-12-12T11:39:17Z","date_published":"2015-02-19T00:00:00Z","oa_version":"Published Version","month":"02","has_accepted_license":"1","doi":"10.15479/AT:IST-2015-322-v1-1","page":"25","publisher":"IST Austria","department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5431","language":[{"iso":"eng"}],"ddc":["005","519"],"publication_status":"published","oa":1,"file_date_updated":"2020-07-14T12:46:53Z","publication_identifier":{"issn":["2664-1690"]},"alternative_title":["IST Austria Technical Report"],"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"},{"last_name":"Hansen","first_name":"Kristoffer","full_name":"Hansen, Kristoffer"}],"abstract":[{"lang":"eng","text":"We consider finite-state concurrent stochastic games, played by k>=2 players for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. We consider reachability objectives that given a target set of states require that some state in the target set is visited, and the dual safety objectives that given a target set require that only states in the target set are visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed.\r\n\r\n Our main results are as follows: We show that in two-player zero-sum concurrent stochastic games (with reachability objective for one player and the complementary safety objective for the other player): (i) the optimal bound on the patience of optimal and epsilon-optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary. In general we study the class of non-zero-sum games admitting epsilon-Nash equilibria. We show that if there is at least one player with reachability objective, then doubly-exponential patience is needed in general for epsilon-Nash equilibrium strategies, whereas in contrast if all players have safety objectives, then the optimal bound on patience for epsilon-Nash equilibrium strategies is only exponential."}],"title":"The patience of concurrent stochastic games with safety and reachability objectives","status":"public"},{"status":"public","title":"The complexity of evolutionary games on graphs","abstract":[{"lang":"eng","text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom in the context of evolution.The replacement graph specifies who competes with whom for reproduction. \r\nThe vertices of the two graphs are the same, and each vertex corresponds to an individual of the population. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. \r\nOur main results are:\r\n(1) We show that the qualitative question is NP-complete and the quantitative approximation question is #P-hard in the special case when the interaction and the replacement graphs coincide and even with the restriction that the resident individuals do not reproduce (which corresponds to an invading population taking over an empty structure).\r\n(2) We show that in general the qualitative question is PSPACE-complete and the quantitative approximation question is PSPACE-hard and can be solved in exponential time.\r\n"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:53Z","oa":1,"publication_identifier":{"issn":["2664-1690"]},"language":[{"iso":"eng"}],"_id":"5432","ddc":["005","576"],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"page":"29","publisher":"IST Austria","doi":"10.15479/AT:IST-2015-323-v1-1","has_accepted_license":"1","month":"02","date_published":"2015-02-19T00:00:00Z","date_created":"2018-12-12T11:39:18Z","oa_version":"Published Version","related_material":{"record":[{"id":"5421","relation":"earlier_version","status":"public"},{"status":"public","relation":"later_version","id":"5440"}]},"year":"2015","type":"technical_report","date_updated":"2023-02-23T12:26:33Z","pubrep_id":"323","citation":{"ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, <i>The complexity of evolutionary games on graphs</i>. IST Austria, 2015.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Nowak, M. (2015). <i>The complexity of evolutionary games on graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-323-v1-1\">https://doi.org/10.15479/AT:IST-2015-323-v1-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-323-v1-1\">10.15479/AT:IST-2015-323-v1-1</a>.","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 29p.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-323-v1-1\">10.15479/AT:IST-2015-323-v1-1</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-323-v1-1\">https://doi.org/10.15479/AT:IST-2015-323-v1-1</a>."},"day":"19","file":[{"file_name":"IST-2015-323-v1+1_main.pdf","date_updated":"2020-07-14T12:46:53Z","checksum":"546c1b291d545e7b24aaaf4199dac671","date_created":"2018-12-12T11:53:57Z","file_id":"5519","creator":"system","relation":"main_file","file_size":576347,"access_level":"open_access","content_type":"application/pdf"}]},{"year":"2015","type":"technical_report","related_material":{"record":[{"id":"1657","relation":"later_version","status":"public"},{"status":"public","relation":"later_version","id":"466"},{"status":"public","relation":"earlier_version","id":"5429"}]},"file":[{"file_size":717630,"relation":"main_file","file_id":"5525","creator":"system","date_created":"2018-12-12T11:54:03Z","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:53Z","file_name":"IST-2015-318-v2+1_main.pdf","checksum":"75284adec80baabdfe71ff9ebbc27445"}],"day":"23","citation":{"ama":"Chatterjee K, Komarkova Z, Kretinsky J. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">10.15479/AT:IST-2015-318-v2-1</a>","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 51p.","mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">10.15479/AT:IST-2015-318-v2-1</a>.","chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">https://doi.org/10.15479/AT:IST-2015-318-v2-1</a>.","short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.","apa":"Chatterjee, K., Komarkova, Z., &#38; Kretinsky, J. (2015). <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">https://doi.org/10.15479/AT:IST-2015-318-v2-1</a>","ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria, 2015."},"pubrep_id":"327","date_updated":"2023-02-23T12:26:00Z","has_accepted_license":"1","doi":"10.15479/AT:IST-2015-318-v2-1","oa_version":"Published Version","date_created":"2018-12-12T11:39:19Z","date_published":"2015-02-23T00:00:00Z","month":"02","ddc":["004"],"publication_status":"published","language":[{"iso":"eng"}],"_id":"5435","publisher":"IST Austria","page":"51","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector.  \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP.\r\nWe also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Finally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.","lang":"eng"}],"title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","status":"public","publication_identifier":{"issn":["2664-1690"]},"file_date_updated":"2020-07-14T12:46:53Z","oa":1,"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Zuzana","last_name":"Komarkova","full_name":"Komarkova, Zuzana"},{"last_name":"Kretinsky","orcid":"0000-0002-8122-2881","first_name":"Jan","full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"alternative_title":["IST Austria Technical Report"]}]