[{"author":[{"orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389"},{"orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","last_name":"Tkadlec","full_name":"Tkadlec, Josef"}],"conference":{"location":"New York, NY, United States","start_date":"2020-02-07","name":"AAAI: Conference on Artificial Intelligence","end_date":"2020-02-12"},"type":"journal_article","oa_version":"Preprint","publisher":"Association for the Advancement of Artificial Intelligence","doi":"10.1609/aaai.v34i02.5546","year":"2020","title":"All-pay bidding games on graphs","status":"public","acknowledgement":"This research was supported by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).","publication_identifier":{"issn":["2159-5399"],"isbn":["9781577358350"],"eissn":["2374-3468"]},"article_processing_charge":"No","month":"04","_id":"9197","quality_controlled":"1","date_published":"2020-04-03T00:00:00Z","language":[{"iso":"eng"}],"page":"1798-1805","issue":"02","external_id":{"arxiv":["1911.08360"]},"date_updated":"2023-09-05T12:40:00Z","article_type":"original","day":"03","scopus_import":"1","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"citation":{"ama":"Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 2020;34(02):1798-1805. doi:10.1609/aaai.v34i02.5546","ista":"Avni G, Ibsen-Jensen R, Tkadlec J. 2020. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 34(02), 1798–1805.","short":"G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.","ieee":"G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020.","apa":"Avni, G., Ibsen-Jensen, R., & Tkadlec, J. (2020). All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i02.5546","chicago":"Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i02.5546.","mla":"Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:10.1609/aaai.v34i02.5546."},"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","arxiv":1,"project":[{"grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF"}],"abstract":[{"text":"In this paper we introduce and study all-pay bidding games, a class of two player, zero-sum games on graphs. The game proceeds as follows. We place a token on some vertex in the graph and assign budgets to the two players. Each turn, each player submits a sealed legal bid (non-negative and below their remaining budget), which is deducted from their budget and the highest bidder moves the token onto an adjacent vertex. The game ends once a sink is reached, and Player 1 pays Player 2 the outcome that is associated with the sink. The players attempt to maximize their expected outcome. Our games model settings where effort (of no inherent value) needs to be invested in an ongoing and stateful manner. On the negative side, we show that even in simple games on DAGs, optimal strategies may require a distribution over bids with infinite support. A central quantity in bidding games is the ratio of the players budgets. On the positive side, we show a simple FPTAS for DAGs, that, for each budget ratio, outputs an approximation for the optimal strategy for that ratio. We also implement it, show that it performs well, and suggests interesting properties of these games. Then, given an outcome c, we show an algorithm for finding the necessary and sufficient initial ratio for guaranteeing outcome c with probability 1 and a strategy ensuring such. Finally, while the general case has not previously been studied, solving the specific game in which Player 1 wins iff he wins the first two auctions, has been long stated as an open question, which we solve.","lang":"eng"}],"publication_status":"published","date_created":"2021-02-25T09:05:18Z","intvolume":" 34","volume":34,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"day":"13","department":[{"_id":"MaMo"}],"citation":{"ama":"Shevchenko A, Mondelli M. Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks. In: Proceedings of the 37th International Conference on Machine Learning. Vol 119. ML Research Press; 2020:8773-8784.","ista":"Shevchenko A, Mondelli M. 2020. Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks. Proceedings of the 37th International Conference on Machine Learning. vol. 119, 8773–8784.","short":"A. Shevchenko, M. Mondelli, in:, Proceedings of the 37th International Conference on Machine Learning, ML Research Press, 2020, pp. 8773–8784.","ieee":"A. Shevchenko and M. Mondelli, “Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks,” in Proceedings of the 37th International Conference on Machine Learning, 2020, vol. 119, pp. 8773–8784.","apa":"Shevchenko, A., & Mondelli, M. (2020). Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks. In Proceedings of the 37th International Conference on Machine Learning (Vol. 119, pp. 8773–8784). ML Research Press.","chicago":"Shevchenko, Alexander, and Marco Mondelli. “Landscape Connectivity and Dropout Stability of SGD Solutions for Over-Parameterized Neural Networks.” In Proceedings of the 37th International Conference on Machine Learning, 119:8773–84. ML Research Press, 2020.","mla":"Shevchenko, Alexander, and Marco Mondelli. “Landscape Connectivity and Dropout Stability of SGD Solutions for Over-Parameterized Neural Networks.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, ML Research Press, 2020, pp. 8773–84."},"publication":"Proceedings of the 37th International Conference on Machine Learning","oa":1,"abstract":[{"text":"The optimization of multilayer neural networks typically leads to a solution\r\nwith zero training error, yet the landscape can exhibit spurious local minima\r\nand the minima can be disconnected. In this paper, we shed light on this\r\nphenomenon: we show that the combination of stochastic gradient descent (SGD)\r\nand over-parameterization makes the landscape of multilayer neural networks\r\napproximately connected and thus more favorable to optimization. More\r\nspecifically, we prove that SGD solutions are connected via a piecewise linear\r\npath, and the increase in loss along this path vanishes as the number of\r\nneurons grows large. This result is a consequence of the fact that the\r\nparameters found by SGD are increasingly dropout stable as the network becomes\r\nwider. We show that, if we remove part of the neurons (and suitably rescale the\r\nremaining ones), the change in loss is independent of the total number of\r\nneurons, and it depends only on how many neurons are left. Our results exhibit\r\na mild dependence on the input dimension: they are dimension-free for two-layer\r\nnetworks and depend linearly on the dimension for multilayer networks. We\r\nvalidate our theoretical findings with numerical experiments for different\r\narchitectures and classification tasks.","lang":"eng"}],"publication_status":"published","arxiv":1,"project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"date_created":"2021-02-25T09:36:22Z","volume":119,"intvolume":" 119","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","author":[{"first_name":"Alexander","last_name":"Shevchenko","full_name":"Shevchenko, Alexander"},{"last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020"}],"file_date_updated":"2021-03-02T15:38:14Z","publisher":"ML Research Press","ddc":["000"],"status":"public","title":"Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks","year":"2020","acknowledgement":"M. Mondelli was partially supported by the 2019 LopezLoreta Prize. The authors thank Phan-Minh Nguyen for helpful discussions and the IST Distributed Algorithms and Systems Lab for providing computational resources.","has_accepted_license":"1","oa_version":"Published Version","article_processing_charge":"No","month":"07","_id":"9198","file":[{"content_type":"application/pdf","file_name":"2020_PMLR_Shevchenko.pdf","access_level":"open_access","relation":"main_file","checksum":"f042c8d4316bd87c6361aa76f1fbdbbe","date_created":"2021-03-02T15:38:14Z","file_id":"9217","success":1,"creator":"dernst","file_size":5336380,"date_updated":"2021-03-02T15:38:14Z"}],"page":"8773-8784","external_id":{"arxiv":["1912.10095"]},"date_updated":"2024-09-10T13:03:19Z","quality_controlled":"1","date_published":"2020-07-13T00:00:00Z","language":[{"iso":"eng"}]},{"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"8f97f229316c3b3a6f0cf99297aa0941","file_name":"main.pdf","creator":"mgarcias","file_id":"9203","date_created":"2021-02-26T16:38:14Z","date_updated":"2021-02-26T16:38:14Z","file_size":1125794}],"page":"244-256","date_updated":"2024-02-22T13:25:19Z","external_id":{"isi":["000680435100021"]},"date_published":"2020-12-01T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"article_processing_charge":"No","month":"12","_id":"9202","publication_identifier":{"eisbn":["9781728183244"],"eissn":["2576-3172"]},"ddc":["000"],"publisher":"IEEE","doi":"10.1109/RTSS49844.2020.00031","title":"Hybridization for stability verification of nonlinear switched systems","year":"2020","status":"public","acknowledgement":"Miriam Garc´ıa Soto was partially supported by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Pavithra Prabhakar was partially supported by NSF CAREER Award No. 1552668, NSF Award No. 2008957 and ONR YIP Award No. N000141712577.","has_accepted_license":"1","oa_version":"Submitted Version","type":"conference","conference":{"location":"Houston, TX, USA ","start_date":"2020-12-01","end_date":"2020-12-04","name":"RTTS: Real-Time Systems Symposium"},"author":[{"orcid":"0000-0003-2936-5719","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","last_name":"Garcia Soto","first_name":"Miriam","full_name":"Garcia Soto, Miriam"},{"first_name":"Pavithra","last_name":"Prabhakar","full_name":"Prabhakar, Pavithra"}],"file_date_updated":"2021-02-26T16:38:14Z","date_created":"2021-02-26T16:38:24Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We propose a novel hybridization method for stability analysis that over-approximates nonlinear dynamical systems by switched systems with linear inclusion dynamics. We observe that existing hybridization techniques for safety analysis that over-approximate nonlinear dynamical systems by switched affine inclusion dynamics and provide fixed approximation error, do not suffice for stability analysis. Hence, we propose a hybridization method that provides a state-dependent error which converges to zero as the state tends to the equilibrium point. The crux of our hybridization computation is an elegant recursive algorithm that uses partial derivatives of a given function to obtain upper and lower bound matrices for the over-approximating linear inclusion. We illustrate our method on some examples to demonstrate the application of the theory for stability analysis. In particular, our method is able to establish stability of a nonlinear system which does not admit a polynomial Lyapunov function.","lang":"eng"}],"publication_status":"published","project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"citation":{"short":"M. Garcia Soto, P. Prabhakar, in:, 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–256.","ista":"Garcia Soto M, Prabhakar P. 2020. Hybridization for stability verification of nonlinear switched systems. 2020 IEEE Real-Time Systems Symposium. RTTS: Real-Time Systems Symposium, 244–256.","ama":"Garcia Soto M, Prabhakar P. Hybridization for stability verification of nonlinear switched systems. In: 2020 IEEE Real-Time Systems Symposium. IEEE; 2020:244-256. doi:10.1109/RTSS49844.2020.00031","apa":"Garcia Soto, M., & Prabhakar, P. (2020). Hybridization for stability verification of nonlinear switched systems. In 2020 IEEE Real-Time Systems Symposium (pp. 244–256). Houston, TX, USA : IEEE. https://doi.org/10.1109/RTSS49844.2020.00031","ieee":"M. Garcia Soto and P. Prabhakar, “Hybridization for stability verification of nonlinear switched systems,” in 2020 IEEE Real-Time Systems Symposium, Houston, TX, USA , 2020, pp. 244–256.","mla":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–56, doi:10.1109/RTSS49844.2020.00031.","chicago":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” In 2020 IEEE Real-Time Systems Symposium, 244–56. IEEE, 2020. https://doi.org/10.1109/RTSS49844.2020.00031."},"department":[{"_id":"ToHe"}],"publication":"2020 IEEE Real-Time Systems Symposium","oa":1,"isi":1,"day":"01"},{"oa_version":"None","publisher":"Springer Nature","doi":"10.1007/s42452-020-03305-w","year":"2020","status":"public","title":"A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion","acknowledgement":"The FlexMaps Pavilion has been awarded First Prize at the “Competition and Exhibition of innovative lightweight structures” organized by the IASS Working Group 21 within the FORM and FORCE, joint international conference of IASS Symposium 2019 and Structural Membranes 2019 (Barcelona, 7-11 October 2019) with the following motivation: “for its structural innovation of bending-twisting system, connection constructability and exquisite craftmanship”[20]. The authors would like to acknowledge the Visual Computing Lab Staff of ISTI - CNR, in particular Thomas Alderighi, Marco Callieri, Paolo Pingi; Antonio Rizzo of IPCF - CNR; and the Administrative Staff of ISTI - CNR. This research was partially funded by the EU H2020 Programme EVOCATION: Advanced Visual and Geometric Computing for 3D Capture, Display, and Fabrication (grant no. 813170).","author":[{"first_name":"Francesco","last_name":"Laccone","full_name":"Laccone, Francesco"},{"full_name":"Malomo, Luigi","first_name":"Luigi","last_name":"Malomo"},{"id":"2DC83906-F248-11E8-B48F-1D18A9856A87","full_name":"Perez Rodriguez, Jesus","first_name":"Jesus","last_name":"Perez Rodriguez"},{"full_name":"Pietroni, Nico","first_name":"Nico","last_name":"Pietroni"},{"first_name":"Federico","last_name":"Ponchio","full_name":"Ponchio, Federico"},{"orcid":"0000-0001-6511-9385","last_name":"Bickel","first_name":"Bernd","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cignoni, Paolo","last_name":"Cignoni","first_name":"Paolo"}],"type":"journal_article","quality_controlled":"1","date_published":"2020-09-01T00:00:00Z","language":[{"iso":"eng"}],"issue":"9","date_updated":"2021-03-03T09:43:14Z","article_type":"original","publication_identifier":{"eissn":["25233971"]},"article_processing_charge":"No","month":"09","_id":"9208","citation":{"ama":"Laccone F, Malomo L, Perez Rodriguez J, et al. A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. SN Applied Sciences. 2020;2(9). doi:10.1007/s42452-020-03305-w","ista":"Laccone F, Malomo L, Perez Rodriguez J, Pietroni N, Ponchio F, Bickel B, Cignoni P. 2020. A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. SN Applied Sciences. 2(9), 1505.","short":"F. Laccone, L. Malomo, J. Perez Rodriguez, N. Pietroni, F. Ponchio, B. Bickel, P. Cignoni, SN Applied Sciences 2 (2020).","chicago":"Laccone, Francesco, Luigi Malomo, Jesus Perez Rodriguez, Nico Pietroni, Federico Ponchio, Bernd Bickel, and Paolo Cignoni. “A Bending-Active Twisted-Arch Plywood Structure: Computational Design and Fabrication of the FlexMaps Pavilion.” SN Applied Sciences. Springer Nature, 2020. https://doi.org/10.1007/s42452-020-03305-w.","mla":"Laccone, Francesco, et al. “A Bending-Active Twisted-Arch Plywood Structure: Computational Design and Fabrication of the FlexMaps Pavilion.” SN Applied Sciences, vol. 2, no. 9, 1505, Springer Nature, 2020, doi:10.1007/s42452-020-03305-w.","ieee":"F. Laccone et al., “A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion,” SN Applied Sciences, vol. 2, no. 9. Springer Nature, 2020.","apa":"Laccone, F., Malomo, L., Perez Rodriguez, J., Pietroni, N., Ponchio, F., Bickel, B., & Cignoni, P. (2020). A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. SN Applied Sciences. Springer Nature. https://doi.org/10.1007/s42452-020-03305-w"},"department":[{"_id":"BeBi"}],"publication":"SN Applied Sciences","day":"01","scopus_import":"1","date_created":"2021-02-28T23:01:25Z","intvolume":" 2","volume":2,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"1505","abstract":[{"text":"Bending-active structures are able to efficiently produce complex curved shapes from flat panels. The desired deformation of the panels derives from the proper selection of their elastic properties. Optimized panels, called FlexMaps, are designed such that, once they are bent and assembled, the resulting static equilibrium configuration matches a desired input 3D shape. The FlexMaps elastic properties are controlled by locally varying spiraling geometric mesostructures, which are optimized in size and shape to match specific bending requests, namely the global curvature of the target shape. The design pipeline starts from a quad mesh representing the input 3D shape, which defines the edge size and the total amount of spirals: every quad will embed one spiral. Then, an optimization algorithm tunes the geometry of the spirals by using a simplified pre-computed rod model. This rod model is derived from a non-linear regression algorithm which approximates the non-linear behavior of solid FEM spiral models subject to hundreds of load combinations. This innovative pipeline has been applied to the project of a lightweight plywood pavilion named FlexMaps Pavilion, which is a single-layer piecewise twisted arch that fits a bounding box of 3.90x3.96x3.25 meters. This case study serves to test the applicability of this methodology at the architectural scale. The structure is validated via FE analyses and the fabrication of the full scale prototype.","lang":"eng"}],"publication_status":"published"},{"oa":1,"department":[{"_id":"MaMo"}],"citation":{"mla":"Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology.” 34th Conference on Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 11961–11972.","chicago":"Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology.” In 34th Conference on Neural Information Processing Systems, 33:11961–11972. Curran Associates, 2020.","apa":"Nguyen, Q., & Mondelli, M. (2020). Global convergence of deep networks with one wide layer followed by pyramidal topology. In 34th Conference on Neural Information Processing Systems (Vol. 33, pp. 11961–11972). Vancouver, Canada: Curran Associates.","ieee":"Q. Nguyen and M. Mondelli, “Global convergence of deep networks with one wide layer followed by pyramidal topology,” in 34th Conference on Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 11961–11972.","short":"Q. Nguyen, M. Mondelli, in:, 34th Conference on Neural Information Processing Systems, Curran Associates, 2020, pp. 11961–11972.","ama":"Nguyen Q, Mondelli M. Global convergence of deep networks with one wide layer followed by pyramidal topology. In: 34th Conference on Neural Information Processing Systems. Vol 33. Curran Associates; 2020:11961–11972.","ista":"Nguyen Q, Mondelli M. 2020. Global convergence of deep networks with one wide layer followed by pyramidal topology. 34th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 33, 11961–11972."},"publication":"34th Conference on Neural Information Processing Systems","day":"07","date_created":"2021-03-03T12:06:02Z","intvolume":" 33","volume":33,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","arxiv":1,"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"abstract":[{"text":"Recent works have shown that gradient descent can find a global minimum for over-parameterized neural networks where the widths of all the hidden layers scale polynomially with N (N being the number of training samples). In this paper, we prove that, for deep networks, a single layer of width N following the input layer suffices to ensure a similar guarantee. In particular, all the remaining layers are allowed to have constant widths, and form a pyramidal topology. We show an application of our result to the widely used LeCun’s initialization and obtain an over-parameterization requirement for the single wide layer of order N2.\r\n","lang":"eng"}],"publication_status":"published","oa_version":"Preprint","publisher":"Curran Associates","year":"2020","title":"Global convergence of deep networks with one wide layer followed by pyramidal topology","status":"public","acknowledgement":"The authors would like to thank Jan Maas, Mahdi Soltanolkotabi, and Daniel Soudry for the helpful discussions, Marius Kloft, Matthias Hein and Quoc Dinh Tran for proofreading portions of a prior version of this paper, and James Martens for a clarification concerning LeCun’s initialization. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. Q. Nguyen was partially supported by the German Research Foundation (DFG) award KL 2698/2-1.","author":[{"full_name":"Nguyen, Quynh","last_name":"Nguyen","first_name":"Quynh"},{"full_name":"Mondelli, Marco","first_name":"Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020"}],"main_file_link":[{"url":"https://arxiv.org/abs/2002.07867","open_access":"1"}],"conference":{"start_date":"2020-12-06","name":"NeurIPS: Neural Information Processing Systems","end_date":"2020-12-12","location":"Vancouver, Canada"},"type":"conference","quality_controlled":"1","date_published":"2020-07-07T00:00:00Z","language":[{"iso":"eng"}],"page":"11961–11972","date_updated":"2024-09-10T13:03:17Z","external_id":{"arxiv":["2002.07867"]},"article_processing_charge":"No","month":"07","_id":"9221"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2020-03-16T00:00:00Z","date_created":"2021-03-05T18:00:47Z","date_updated":"2024-02-21T12:42:13Z","file":[{"content_type":"application/x-zip-compressed","checksum":"41b66e195ed3dbd73077feee77b05652","access_level":"open_access","relation":"main_file","file_name":"DOI_SiteControlledHWs.zip","file_id":"9223","creator":"gkatsaro","date_created":"2021-03-05T17:50:45Z","date_updated":"2021-03-05T17:50:45Z","file_size":13317557},{"file_name":"Readme.txt","access_level":"open_access","relation":"main_file","checksum":"a1dc5f710ba4b3bb7f248195ba754ab2","content_type":"text/plain","file_size":3515,"date_updated":"2021-03-10T07:31:50Z","date_created":"2021-03-10T07:31:50Z","creator":"dernst","file_id":"9233","success":1}],"contributor":[{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","contributor_type":"research_group","last_name":"Katsaros","first_name":"Georgios"}],"_id":"9222","article_processing_charge":"No","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"month":"03","oa":1,"has_accepted_license":"1","oa_version":"Published Version","title":"Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling","year":"2020","status":"public","publisher":"Institute of Science and Technology Austria","ddc":["530"],"citation":{"ieee":"G. Katsaros, “Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling.” Institute of Science and Technology Austria, 2020.","apa":"Katsaros, G. (2020). Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9222","mla":"Katsaros, Georgios. Transport Data for: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:9222.","chicago":"Katsaros, Georgios. “Transport Data for: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:9222.","short":"G. Katsaros, (2020).","ama":"Katsaros G. Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling. 2020. doi:10.15479/AT:ISTA:9222","ista":"Katsaros G. 2020. Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling, Institute of Science and Technology Austria, 10.15479/AT:ISTA:9222."},"department":[{"_id":"GeKa"}],"doi":"10.15479/AT:ISTA:9222","file_date_updated":"2021-03-10T07:31:50Z","author":[{"orcid":"0000-0001-8342-202X","last_name":"Katsaros","first_name":"Georgios","full_name":"Katsaros, Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"7541"}]},"day":"16","license":"https://creativecommons.org/publicdomain/zero/1.0/","type":"research_data"},{"project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes"}],"publication_status":"published","abstract":[{"text":"Rhombic dodecahedron is a space filling polyhedron which represents the close packing of spheres in 3D space and the Voronoi structures of the face centered cubic (FCC) lattice. In this paper, we describe a new coordinate system where every 3-integer coordinates grid point corresponds to a rhombic dodecahedron centroid. In order to illustrate the interest of the new coordinate system, we propose the characterization of 3D digital plane with its topological features, such as the interrelation between the thickness of the digital plane and the separability constraint we aim to obtain. We also present the characterization of 3D digital lines and study it as the intersection of multiple digital planes. Characterization of 3D digital sphere with relevant topological features is proposed as well along with the 48-symmetry appearing in the new coordinate system.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":4,"intvolume":" 4","date_created":"2021-03-16T08:55:19Z","day":"17","oa":1,"ec_funded":1,"publication":"Mathematical Morphology - Theory and Applications","citation":{"chicago":"Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Digital Objects in Rhombic Dodecahedron Grid.” Mathematical Morphology - Theory and Applications. De Gruyter, 2020. https://doi.org/10.1515/mathm-2020-0106.","mla":"Biswas, Ranita, et al. “Digital Objects in Rhombic Dodecahedron Grid.” Mathematical Morphology - Theory and Applications, vol. 4, no. 1, De Gruyter, 2020, pp. 143–58, doi:10.1515/mathm-2020-0106.","ieee":"R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Digital objects in rhombic dodecahedron grid,” Mathematical Morphology - Theory and Applications, vol. 4, no. 1. De Gruyter, pp. 143–158, 2020.","apa":"Biswas, R., Largeteau-Skapin, G., Zrour, R., & Andres, E. (2020). Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. De Gruyter. https://doi.org/10.1515/mathm-2020-0106","ama":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. 2020;4(1):143-158. doi:10.1515/mathm-2020-0106","ista":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2020. Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. 4(1), 143–158.","short":"R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, Mathematical Morphology - Theory and Applications 4 (2020) 143–158."},"department":[{"_id":"HeEd"}],"publication_identifier":{"issn":["2353-3390"]},"_id":"9249","month":"11","article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2020-11-17T00:00:00Z","article_type":"original","date_updated":"2021-03-22T09:01:50Z","issue":"1","page":"143-158","file":[{"file_size":3668725,"date_updated":"2021-03-22T08:56:37Z","date_created":"2021-03-22T08:56:37Z","file_id":"9272","success":1,"creator":"dernst","file_name":"2020_MathMorpholTheoryAppl_Biswas.pdf","relation":"main_file","access_level":"open_access","checksum":"4a1043fa0548a725d464017fe2483ce0","content_type":"application/pdf"}],"file_date_updated":"2021-03-22T08:56:37Z","author":[{"orcid":"0000-0002-5372-7890","first_name":"Ranita","last_name":"Biswas","full_name":"Biswas, Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Largeteau-Skapin","first_name":"Gaëlle","full_name":"Largeteau-Skapin, Gaëlle"},{"last_name":"Zrour","first_name":"Rita","full_name":"Zrour, Rita"},{"full_name":"Andres, Eric","last_name":"Andres","first_name":"Eric"}],"type":"journal_article","oa_version":"Published Version","has_accepted_license":"1","acknowledgement":"This work has been partially supported by the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme, grant no. 788183, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35. ","title":"Digital objects in rhombic dodecahedron grid","year":"2020","status":"public","doi":"10.1515/mathm-2020-0106","ddc":["510"],"publisher":"De Gruyter"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":12590,"intvolume":" 12590","date_created":"2021-03-28T22:01:44Z","project":[{"grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"arxiv":1,"abstract":[{"text":"We call a multigraph non-homotopic if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can be shrunk to its end-vertex in the same way. It is easy to see that a non-homotopic multigraph on n>1 vertices can have arbitrarily many edges. We prove that the number of crossings between the edges of a non-homotopic multigraph with n vertices and m>4n edges is larger than cm2n for some constant c>0 , and that this bound is tight up to a polylogarithmic factor. We also show that the lower bound is not asymptotically sharp as n is fixed and m⟶∞ .","lang":"eng"}],"publication_status":"published","oa":1,"publication":"28th International Symposium on Graph Drawing and Network Visualization","department":[{"_id":"HeEd"}],"citation":{"apa":"Pach, J., Tardos, G., & Tóth, G. (2020). Crossings between non-homotopic edges. In 28th International Symposium on Graph Drawing and Network Visualization (Vol. 12590, pp. 359–371). Virtual, Online: Springer Nature. https://doi.org/10.1007/978-3-030-68766-3_28","ieee":"J. Pach, G. Tardos, and G. Tóth, “Crossings between non-homotopic edges,” in 28th International Symposium on Graph Drawing and Network Visualization, Virtual, Online, 2020, vol. 12590, pp. 359–371.","mla":"Pach, János, et al. “Crossings between Non-Homotopic Edges.” 28th International Symposium on Graph Drawing and Network Visualization, vol. 12590, Springer Nature, 2020, pp. 359–71, doi:10.1007/978-3-030-68766-3_28.","chicago":"Pach, János, Gábor Tardos, and Géza Tóth. “Crossings between Non-Homotopic Edges.” In 28th International Symposium on Graph Drawing and Network Visualization, 12590:359–71. LNCS. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-68766-3_28.","short":"J. Pach, G. Tardos, G. Tóth, in:, 28th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2020, pp. 359–371.","ama":"Pach J, Tardos G, Tóth G. Crossings between non-homotopic edges. In: 28th International Symposium on Graph Drawing and Network Visualization. Vol 12590. LNCS. Springer Nature; 2020:359-371. doi:10.1007/978-3-030-68766-3_28","ista":"Pach J, Tardos G, Tóth G. 2020. Crossings between non-homotopic edges. 28th International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network VisualizationLNCS vol. 12590, 359–371."},"scopus_import":"1","day":"20","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2020-09-20T00:00:00Z","date_updated":"2021-04-06T11:32:32Z","external_id":{"arxiv":["2006.14908"]},"series_title":"LNCS","page":"359-371","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030687656"]},"_id":"9299","month":"09","article_processing_charge":"No","oa_version":"Preprint","acknowledgement":"Supported by the National Research, Development and Innovation Office, NKFIH, KKP-133864, K-131529, K-116769, K-132696, by the Higher Educational Institutional Excellence Program 2019 NKFIH-1158-6/2019, the Austrian Science Fund (FWF), grant Z 342-N31, by the Ministry of Education and Science of the Russian Federation MegaGrant No. 075-15-2019-1926, and by the ERC Synergy Grant “Dynasnet” No. 810115. A full version can be found at https://arxiv.org/abs/2006.14908.","year":"2020","title":"Crossings between non-homotopic edges","status":"public","doi":"10.1007/978-3-030-68766-3_28","publisher":"Springer Nature","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.14908"}],"author":[{"full_name":"Pach, János","last_name":"Pach","first_name":"János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4"},{"last_name":"Tardos","first_name":"Gábor","full_name":"Tardos, Gábor"},{"full_name":"Tóth, Géza","last_name":"Tóth","first_name":"Géza"}],"conference":{"start_date":"2020-09-16","name":"GD: Graph Drawing and Network Visualization","end_date":"2020-09-18","location":"Virtual, Online"},"type":"conference"},{"day":"01","scopus_import":"1","isi":1,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"8183"},{"id":"10220","relation":"later_version","status":"public"}]},"publication":"Russian Mathematical Surveys","citation":{"mla":"Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical Surveys, vol. 75, no. 6, IOP Publishing, 2020, pp. 1156–58, doi:10.1070/RM9943.","chicago":"Avvakumov, Sergey, Uli Wagner, Isaac Mabillard, and A. B. Skopenkov. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical Surveys. IOP Publishing, 2020. https://doi.org/10.1070/RM9943.","apa":"Avvakumov, S., Wagner, U., Mabillard, I., & Skopenkov, A. B. (2020). Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. IOP Publishing. https://doi.org/10.1070/RM9943","ieee":"S. Avvakumov, U. Wagner, I. Mabillard, and A. B. Skopenkov, “Eliminating higher-multiplicity intersections, III. Codimension 2,” Russian Mathematical Surveys, vol. 75, no. 6. IOP Publishing, pp. 1156–1158, 2020.","short":"S. Avvakumov, U. Wagner, I. Mabillard, A.B. Skopenkov, Russian Mathematical Surveys 75 (2020) 1156–1158.","ama":"Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 2020;75(6):1156-1158. doi:10.1070/RM9943","ista":"Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. 2020. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 75(6), 1156–1158."},"department":[{"_id":"UlWa"}],"oa":1,"publication_status":"published","arxiv":1,"intvolume":" 75","volume":75,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2021-04-04T22:01:22Z","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.03501"}],"author":[{"first_name":"Sergey","last_name":"Avvakumov","full_name":"Avvakumov, Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli","full_name":"Wagner, Uli"},{"full_name":"Mabillard, Isaac","last_name":"Mabillard","first_name":"Isaac","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Skopenkov, A. B.","last_name":"Skopenkov","first_name":"A. B."}],"status":"public","title":"Eliminating higher-multiplicity intersections, III. Codimension 2","year":"2020","acknowledgement":"This research was carried out with the support of the Russian Foundation for Basic Research(grant no. 19-01-00169)","publisher":"IOP Publishing","doi":"10.1070/RM9943","oa_version":"Preprint","_id":"9308","article_processing_charge":"No","month":"12","publication_identifier":{"issn":["0036-0279"]},"date_updated":"2023-08-14T11:43:54Z","external_id":{"isi":["000625983100001"],"arxiv":["1511.03501"]},"article_type":"original","issue":"6","page":"1156-1158","language":[{"iso":"eng"}],"date_published":"2020-12-01T00:00:00Z","quality_controlled":"1"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"article_processing_charge":"No","month":"05","abstract":[{"lang":"eng","text":"The mitochondrial respiratory chain, formed by five protein complexes, utilizes energy from catabolic processes to synthesize ATP. Complex I, the first and the largest protein complex of the chain, harvests electrons from NADH to reduce quinone, while pumping protons across the mitochondrial membrane. Detailed knowledge of the working principle of such coupled charge-transfer processes remains, however, fragmentary due to bottlenecks in understanding redox-driven conformational transitions and their interplay with the hydrated proton pathways. Complex I from Thermus thermophilus encases 16 subunits with nine iron–sulfur clusters, reduced by electrons from NADH. Here, employing the latest crystal structure of T. thermophilus complex I, we have used microsecond-scale molecular dynamics simulations to study the chemo-mechanical coupling between redox changes of the iron–sulfur clusters and conformational transitions across complex I. First, we identify the redox switches within complex I, which allosterically couple the dynamics of the quinone binding pocket to the site of NADH reduction. Second, our free-energy calculations reveal that the affinity of the quinone, specifically menaquinone, for the binding-site is higher than that of its reduced, menaquinol forma design essential for menaquinol release. Remarkably, the barriers to diffusive menaquinone dynamics are lesser than that of the more ubiquitous ubiquinone, and the naphthoquinone headgroup of the former furnishes stronger binding interactions with the pocket, favoring menaquinone for charge transport in T. thermophilus. Our computations are consistent with experimentally validated mutations and hierarchize the key residues into three functional classes, identifying new mutation targets. Third, long-range hydrogen-bond networks connecting the quinone-binding site to the transmembrane subunits are found to be responsible for proton pumping. Put together, the simulations reveal the molecular design principles linking redox reactions to quinone turnover to proton translocation in complex I."}],"_id":"9326","date_published":"2020-05-20T00:00:00Z","date_created":"2021-04-14T12:05:20Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-08-22T07:49:37Z","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"8040"}]},"author":[{"full_name":"Gupta, Chitrak","first_name":"Chitrak","last_name":"Gupta"},{"last_name":"Khaniya","first_name":"Umesh","full_name":"Khaniya, Umesh"},{"full_name":"Chan, Chun","last_name":"Chan","first_name":"Chun"},{"full_name":"Dehez, Francois","first_name":"Francois","last_name":"Dehez"},{"first_name":"Mrinal","last_name":"Shekhar","full_name":"Shekhar, Mrinal"},{"full_name":"Gunner, M. R.","first_name":"M. R.","last_name":"Gunner"},{"orcid":"0000-0002-0977-7989","full_name":"Sazanov, Leonid A","last_name":"Sazanov","first_name":"Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chipot","first_name":"Christophe","full_name":"Chipot, Christophe"},{"full_name":"Singharoy, Abhishek","last_name":"Singharoy","first_name":"Abhishek"}],"main_file_link":[{"open_access":"1"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","type":"research_data_reference","day":"20","oa_version":"Published Version","oa":1,"publisher":"American Chemical Society","doi":"10.1021/jacs.9b13450.s002","citation":{"short":"C. Gupta, U. Khaniya, C. Chan, F. Dehez, M. Shekhar, M.R. Gunner, L.A. Sazanov, C. Chipot, A. Singharoy, (2020).","ama":"Gupta C, Khaniya U, Chan C, et al. Charge transfer and chemo-mechanical coupling in respiratory complex I. 2020. doi:10.1021/jacs.9b13450.s002","ista":"Gupta C, Khaniya U, Chan C, Dehez F, Shekhar M, Gunner MR, Sazanov LA, Chipot C, Singharoy A. 2020. Charge transfer and chemo-mechanical coupling in respiratory complex I, American Chemical Society, 10.1021/jacs.9b13450.s002.","mla":"Gupta, Chitrak, et al. Charge Transfer and Chemo-Mechanical Coupling in Respiratory Complex I. American Chemical Society, 2020, doi:10.1021/jacs.9b13450.s002.","chicago":"Gupta, Chitrak, Umesh Khaniya, Chun Chan, Francois Dehez, Mrinal Shekhar, M. R. Gunner, Leonid A Sazanov, Christophe Chipot, and Abhishek Singharoy. “Charge Transfer and Chemo-Mechanical Coupling in Respiratory Complex I.” American Chemical Society, 2020. https://doi.org/10.1021/jacs.9b13450.s002.","apa":"Gupta, C., Khaniya, U., Chan, C., Dehez, F., Shekhar, M., Gunner, M. R., … Singharoy, A. (2020). Charge transfer and chemo-mechanical coupling in respiratory complex I. American Chemical Society. https://doi.org/10.1021/jacs.9b13450.s002","ieee":"C. Gupta et al., “Charge transfer and chemo-mechanical coupling in respiratory complex I.” American Chemical Society, 2020."},"department":[{"_id":"LeSa"}],"status":"public","year":"2020","title":"Charge transfer and chemo-mechanical coupling in respiratory complex I"},{"publication_identifier":{"issn":["2640-3498"]},"_id":"9415","article_processing_charge":"No","month":"07","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2020-07-12T00:00:00Z","date_updated":"2023-02-23T13:57:24Z","file":[{"date_created":"2021-05-25T09:51:36Z","creator":"kschuh","file_id":"9421","success":1,"file_size":741899,"date_updated":"2021-05-25T09:51:36Z","content_type":"application/pdf","file_name":"2020_PMLR_Kurtz.pdf","access_level":"open_access","checksum":"2aaaa7d7226e49161311d91627cf783b","relation":"main_file"}],"page":"5533-5543","file_date_updated":"2021-05-25T09:51:36Z","author":[{"full_name":"Kurtz, Mark","first_name":"Mark","last_name":"Kurtz"},{"last_name":"Kopinsky","first_name":"Justin","full_name":"Kopinsky, Justin"},{"last_name":"Gelashvili","first_name":"Rati","full_name":"Gelashvili, Rati"},{"first_name":"Alexander","last_name":"Matveev","full_name":"Matveev, Alexander"},{"full_name":"Carr, John","first_name":"John","last_name":"Carr"},{"full_name":"Goin, Michael","first_name":"Michael","last_name":"Goin"},{"first_name":"William","last_name":"Leiserson","full_name":"Leiserson, William"},{"full_name":"Moore, Sage","first_name":"Sage","last_name":"Moore"},{"full_name":"Nell, Bill","first_name":"Bill","last_name":"Nell"},{"full_name":"Shavit, Nir","first_name":"Nir","last_name":"Shavit"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian"}],"conference":{"location":"Online","name":"ICML: International Conference on Machine Learning","end_date":"2020-07-18","start_date":"2020-07-12"},"type":"conference","has_accepted_license":"1","oa_version":"Published Version","status":"public","year":"2020","title":"Inducing and exploiting activation sparsity for fast neural network inference","ddc":["000"],"abstract":[{"lang":"eng","text":"Optimizing convolutional neural networks for fast inference has recently become an extremely active area of research. One of the go-to solutions in this context is weight pruning, which aims to reduce computational and memory footprint by removing large subsets of the connections in a neural network. Surprisingly, much less attention has been given to exploiting sparsity in the activation maps, which tend to be naturally sparse in many settings thanks to the structure of rectified linear (ReLU) activation functions. In this paper, we present an in-depth analysis of methods for maximizing the sparsity of the activations in a trained neural network, and show that, when coupled with an efficient sparse-input convolution algorithm, we can leverage this sparsity for significant performance gains. To induce highly sparse activation maps without accuracy loss, we introduce a new regularization technique, coupled with a new threshold-based sparsification method based on a parameterized activation function called Forced-Activation-Threshold Rectified Linear Unit (FATReLU). We examine the impact of our methods on popular image classification models, showing that most architectures can adapt to significantly sparser activation maps without any accuracy loss. Our second contribution is showing that these these compression gains can be translated into inference speedups: we provide a new algorithm to enable fast convolution operations over networks with sparse activations, and show that it can enable significant speedups for end-to-end inference on a range of popular models on the large-scale ImageNet image classification task on modern Intel CPUs, with little or no retraining cost. "}],"volume":119,"intvolume":" 119","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2021-05-23T22:01:45Z","scopus_import":"1","day":"12","oa":1,"publication":"37th International Conference on Machine Learning, ICML 2020","department":[{"_id":"DaAl"}],"citation":{"short":"M. Kurtz, J. Kopinsky, R. Gelashvili, A. Matveev, J. Carr, M. Goin, W. Leiserson, S. Moore, B. Nell, N. Shavit, D.-A. Alistarh, in:, 37th International Conference on Machine Learning, ICML 2020, 2020, pp. 5533–5543.","ama":"Kurtz M, Kopinsky J, Gelashvili R, et al. Inducing and exploiting activation sparsity for fast neural network inference. In: 37th International Conference on Machine Learning, ICML 2020. Vol 119. ; 2020:5533-5543.","ista":"Kurtz M, Kopinsky J, Gelashvili R, Matveev A, Carr J, Goin M, Leiserson W, Moore S, Nell B, Shavit N, Alistarh D-A. 2020. Inducing and exploiting activation sparsity for fast neural network inference. 37th International Conference on Machine Learning, ICML 2020. ICML: International Conference on Machine Learning vol. 119, 5533–5543.","apa":"Kurtz, M., Kopinsky, J., Gelashvili, R., Matveev, A., Carr, J., Goin, M., … Alistarh, D.-A. (2020). Inducing and exploiting activation sparsity for fast neural network inference. In 37th International Conference on Machine Learning, ICML 2020 (Vol. 119, pp. 5533–5543). Online.","ieee":"M. Kurtz et al., “Inducing and exploiting activation sparsity for fast neural network inference,” in 37th International Conference on Machine Learning, ICML 2020, Online, 2020, vol. 119, pp. 5533–5543.","mla":"Kurtz, Mark, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” 37th International Conference on Machine Learning, ICML 2020, vol. 119, 2020, pp. 5533–43.","chicago":"Kurtz, Mark, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John Carr, Michael Goin, William Leiserson, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” In 37th International Conference on Machine Learning, ICML 2020, 119:5533–43, 2020."}},{"_id":"9526","month":"01","article_processing_charge":"No","publication_identifier":{"issn":["1097-2765"],"eissn":["1097-4164"]},"article_type":"original","date_updated":"2021-12-14T07:51:15Z","external_id":{"pmid":["31732458"]},"issue":"2","page":"310-323.e7","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2020-01-16T00:00:00Z","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.molcel.2019.10.011"}],"author":[{"full_name":"Choi, Jaemyung","first_name":"Jaemyung","last_name":"Choi"},{"full_name":"Lyons, David B.","last_name":"Lyons","first_name":"David B."},{"full_name":"Kim, M. Yvonne","last_name":"Kim","first_name":"M. Yvonne"},{"full_name":"Moore, Jonathan D.","first_name":"Jonathan D.","last_name":"Moore"},{"orcid":"0000-0002-0123-8649","last_name":"Zilberman","first_name":"Daniel","full_name":"Zilberman, Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1"}],"title":"DNA methylation and histone H1 jointly repress transposable elements and aberrant intragenic transcripts","status":"public","year":"2020","doi":"10.1016/j.molcel.2019.10.011","publisher":"Elsevier","oa_version":"Published Version","abstract":[{"lang":"eng","text":"DNA methylation and histone H1 mediate transcriptional silencing of genes and transposable elements, but how they interact is unclear. In plants and animals with mosaic genomic methylation, functionally mysterious methylation is also common within constitutively active housekeeping genes. Here, we show that H1 is enriched in methylated sequences, including genes, of Arabidopsis thaliana, yet this enrichment is independent of DNA methylation. Loss of H1 disperses heterochromatin, globally alters nucleosome organization, and activates H1-bound genes, but only weakly de-represses transposable elements. However, H1 loss strongly activates transposable elements hypomethylated through mutation of DNA methyltransferase MET1. Hypomethylation of genes also activates antisense transcription, which is modestly enhanced by H1 loss. Our results demonstrate that H1 and DNA methylation jointly maintain transcriptional homeostasis by silencing transposable elements and aberrant intragenic transcripts. Such functionality plausibly explains why DNA methylation, a well-known mutagen, has been maintained within coding sequences of crucial plant and animal genes."}],"publication_status":"published","extern":"1","pmid":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","volume":77,"intvolume":" 77","date_created":"2021-06-08T06:37:09Z","scopus_import":"1","day":"16","publication":"Molecular Cell","citation":{"ieee":"J. Choi, D. B. Lyons, M. Y. Kim, J. D. Moore, and D. Zilberman, “DNA methylation and histone H1 jointly repress transposable elements and aberrant intragenic transcripts,” Molecular Cell, vol. 77, no. 2. Elsevier, p. 310–323.e7, 2020.","apa":"Choi, J., Lyons, D. B., Kim, M. Y., Moore, J. D., & Zilberman, D. (2020). DNA methylation and histone H1 jointly repress transposable elements and aberrant intragenic transcripts. Molecular Cell. Elsevier. https://doi.org/10.1016/j.molcel.2019.10.011","chicago":"Choi, Jaemyung, David B. Lyons, M. Yvonne Kim, Jonathan D. Moore, and Daniel Zilberman. “DNA Methylation and Histone H1 Jointly Repress Transposable Elements and Aberrant Intragenic Transcripts.” Molecular Cell. Elsevier, 2020. https://doi.org/10.1016/j.molcel.2019.10.011.","mla":"Choi, Jaemyung, et al. “DNA Methylation and Histone H1 Jointly Repress Transposable Elements and Aberrant Intragenic Transcripts.” Molecular Cell, vol. 77, no. 2, Elsevier, 2020, p. 310–323.e7, doi:10.1016/j.molcel.2019.10.011.","ama":"Choi J, Lyons DB, Kim MY, Moore JD, Zilberman D. DNA methylation and histone H1 jointly repress transposable elements and aberrant intragenic transcripts. Molecular Cell. 2020;77(2):310-323.e7. doi:10.1016/j.molcel.2019.10.011","ista":"Choi J, Lyons DB, Kim MY, Moore JD, Zilberman D. 2020. DNA methylation and histone H1 jointly repress transposable elements and aberrant intragenic transcripts. Molecular Cell. 77(2), 310–323.e7.","short":"J. Choi, D.B. Lyons, M.Y. Kim, J.D. Moore, D. Zilberman, Molecular Cell 77 (2020) 310–323.e7."},"department":[{"_id":"DaZi"}],"oa":1},{"arxiv":1,"abstract":[{"lang":"eng","text":"It is a classical fact that for any ε>0, a random permutation of length n=(1+ε)k2/4 typically contains a monotone subsequence of length k. As a far-reaching generalization, Alon conjectured that a random permutation of this same length n is typically k-universal, meaning that it simultaneously contains every pattern of length k. He also made the simple observation that for n=O(k2logk), a random length-n permutation is typically k-universal. We make the first significant progress towards Alon's conjecture by showing that n=2000k2loglogk suffices."}],"publication_status":"published","date_created":"2021-06-21T06:23:42Z","volume":52,"intvolume":" 52","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","extern":"1","day":"01","scopus_import":"1","oa":1,"citation":{"apa":"He, X., & Kwan, M. A. (2020). Universality of random permutations. Bulletin of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.12345","ieee":"X. He and M. A. Kwan, “Universality of random permutations,” Bulletin of the London Mathematical Society, vol. 52, no. 3. Wiley, pp. 515–529, 2020.","mla":"He, Xiaoyu, and Matthew Alan Kwan. “Universality of Random Permutations.” Bulletin of the London Mathematical Society, vol. 52, no. 3, Wiley, 2020, pp. 515–29, doi:10.1112/blms.12345.","chicago":"He, Xiaoyu, and Matthew Alan Kwan. “Universality of Random Permutations.” Bulletin of the London Mathematical Society. Wiley, 2020. https://doi.org/10.1112/blms.12345.","short":"X. He, M.A. Kwan, Bulletin of the London Mathematical Society 52 (2020) 515–529.","ama":"He X, Kwan MA. Universality of random permutations. Bulletin of the London Mathematical Society. 2020;52(3):515-529. doi:10.1112/blms.12345","ista":"He X, Kwan MA. 2020. Universality of random permutations. Bulletin of the London Mathematical Society. 52(3), 515–529."},"publication":"Bulletin of the London Mathematical Society","publication_identifier":{"issn":["0024-6093"],"eissn":["1469-2120"]},"article_processing_charge":"No","month":"06","_id":"9573","quality_controlled":"1","date_published":"2020-06-01T00:00:00Z","language":[{"iso":"eng"}],"issue":"3","page":"515-529","external_id":{"arxiv":["1911.12878"]},"date_updated":"2023-02-23T14:01:23Z","article_type":"original","author":[{"full_name":"He, Xiaoyu","last_name":"He","first_name":"Xiaoyu"},{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","full_name":"Kwan, Matthew Alan","first_name":"Matthew Alan","last_name":"Kwan","orcid":"0000-0002-4003-7567"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1911.12878"}],"type":"journal_article","oa_version":"Preprint","publisher":"Wiley","doi":"10.1112/blms.12345","title":"Universality of random permutations","year":"2020","status":"public"},{"day":"01","scopus_import":"1","citation":{"ama":"Bucić M, Kwan MA, Pokrovskiy A, Sudakov B. Halfway to Rota’s basis conjecture. International Mathematics Research Notices. 2020;2020(21):8007-8026. doi:10.1093/imrn/rnaa004","ista":"Bucić M, Kwan MA, Pokrovskiy A, Sudakov B. 2020. Halfway to Rota’s basis conjecture. International Mathematics Research Notices. 2020(21), 8007–8026.","short":"M. Bucić, M.A. Kwan, A. Pokrovskiy, B. Sudakov, International Mathematics Research Notices 2020 (2020) 8007–8026.","chicago":"Bucić, Matija, Matthew Alan Kwan, Alexey Pokrovskiy, and Benny Sudakov. “Halfway to Rota’s Basis Conjecture.” International Mathematics Research Notices. Oxford University Press, 2020. https://doi.org/10.1093/imrn/rnaa004.","mla":"Bucić, Matija, et al. “Halfway to Rota’s Basis Conjecture.” International Mathematics Research Notices, vol. 2020, no. 21, Oxford University Press, 2020, pp. 8007–26, doi:10.1093/imrn/rnaa004.","ieee":"M. Bucić, M. A. Kwan, A. Pokrovskiy, and B. Sudakov, “Halfway to Rota’s basis conjecture,” International Mathematics Research Notices, vol. 2020, no. 21. Oxford University Press, pp. 8007–8026, 2020.","apa":"Bucić, M., Kwan, M. A., Pokrovskiy, A., & Sudakov, B. (2020). Halfway to Rota’s basis conjecture. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnaa004"},"publication":"International Mathematics Research Notices","oa":1,"abstract":[{"lang":"eng","text":"In 1989, Rota made the following conjecture. Given n bases B1,…,Bn in an n-dimensional vector space V⁠, one can always find n disjoint bases of V⁠, each containing exactly one element from each Bi (we call such bases transversal bases). Rota’s basis conjecture remains wide open despite its apparent simplicity and the efforts of many researchers (e.g., the conjecture was recently the subject of the collaborative “Polymath” project). In this paper we prove that one can always find (1/2−o(1))n disjoint transversal bases, improving on the previous best bound of Ω(n/logn)⁠. Our results also apply to the more general setting of matroids."}],"publication_status":"published","arxiv":1,"extern":"1","date_created":"2021-06-21T08:12:30Z","volume":2020,"intvolume":" 2020","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","type":"journal_article","author":[{"first_name":"Matija","last_name":"Bucić","full_name":"Bucić, Matija"},{"orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan","last_name":"Kwan","full_name":"Kwan, Matthew Alan"},{"last_name":"Pokrovskiy","first_name":"Alexey","full_name":"Pokrovskiy, Alexey"},{"full_name":"Sudakov, Benny","first_name":"Benny","last_name":"Sudakov"}],"main_file_link":[{"open_access":"1","url":"http://arxiv-export-lb.library.cornell.edu/abs/1810.07462"}],"publisher":"Oxford University Press","doi":"10.1093/imrn/rnaa004","year":"2020","title":"Halfway to Rota’s basis conjecture","status":"public","oa_version":"Preprint","article_processing_charge":"No","month":"11","_id":"9576","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"page":"8007-8026","issue":"21","date_updated":"2023-02-23T14:01:30Z","external_id":{"arxiv":["1810.07462"]},"article_type":"original","quality_controlled":"1","date_published":"2020-11-01T00:00:00Z","language":[{"iso":"eng"}]},{"type":"journal_article","author":[{"orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan","last_name":"Kwan","full_name":"Kwan, Matthew Alan"},{"full_name":"Sudakov, Benny","first_name":"Benny","last_name":"Sudakov"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/imrn/rny064"}],"doi":"10.1093/imrn/rny064","publisher":"Oxford University Press","title":"Ramsey graphs induce subgraphs of quadratically many sizes","status":"public","year":"2020","oa_version":"Published Version","month":"03","article_processing_charge":"No","_id":"9577","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"issue":"6","page":"1621–1638","article_type":"original","date_updated":"2023-02-23T14:01:33Z","external_id":{"arxiv":["1711.02937"]},"quality_controlled":"1","date_published":"2020-03-01T00:00:00Z","language":[{"iso":"eng"}],"scopus_import":"1","day":"01","citation":{"ieee":"M. A. Kwan and B. Sudakov, “Ramsey graphs induce subgraphs of quadratically many sizes,” International Mathematics Research Notices, vol. 2020, no. 6. Oxford University Press, pp. 1621–1638, 2020.","apa":"Kwan, M. A., & Sudakov, B. (2020). Ramsey graphs induce subgraphs of quadratically many sizes. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rny064","mla":"Kwan, Matthew Alan, and Benny Sudakov. “Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes.” International Mathematics Research Notices, vol. 2020, no. 6, Oxford University Press, 2020, pp. 1621–1638, doi:10.1093/imrn/rny064.","chicago":"Kwan, Matthew Alan, and Benny Sudakov. “Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes.” International Mathematics Research Notices. Oxford University Press, 2020. https://doi.org/10.1093/imrn/rny064.","short":"M.A. Kwan, B. Sudakov, International Mathematics Research Notices 2020 (2020) 1621–1638.","ama":"Kwan MA, Sudakov B. Ramsey graphs induce subgraphs of quadratically many sizes. International Mathematics Research Notices. 2020;2020(6):1621–1638. doi:10.1093/imrn/rny064","ista":"Kwan MA, Sudakov B. 2020. Ramsey graphs induce subgraphs of quadratically many sizes. International Mathematics Research Notices. 2020(6), 1621–1638."},"publication":"International Mathematics Research Notices","oa":1,"abstract":[{"text":"An n-vertex graph is called C-Ramsey if it has no clique or independent set of size Clogn⁠. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in fact all Ramsey graphs must obey certain “richness” properties characteristic of random graphs. Motivated by an old problem of Erd̋s and McKay, recently Narayanan, Sahasrabudhe, and Tomon conjectured that for any fixed C, every n-vertex C-Ramsey graph induces subgraphs of Θ(n2) different sizes. In this paper we prove this conjecture.","lang":"eng"}],"publication_status":"published","arxiv":1,"extern":"1","date_created":"2021-06-21T08:30:12Z","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","volume":2020,"intvolume":" 2020"},{"oa_version":"Preprint","doi":"10.1007/s11856-020-2035-7","publisher":"Springer","year":"2020","status":"public","title":"Nearly-linear monotone paths in edge-ordered graphs","author":[{"first_name":"Matija","last_name":"Bucić","full_name":"Bucić, Matija"},{"orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan","last_name":"Kwan","first_name":"Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3"},{"full_name":"Pokrovskiy, Alexey","last_name":"Pokrovskiy","first_name":"Alexey"},{"full_name":"Sudakov, Benny","last_name":"Sudakov","first_name":"Benny"},{"full_name":"Tran, Tuan","last_name":"Tran","first_name":"Tuan"},{"first_name":"Adam Zsolt","last_name":"Wagner","full_name":"Wagner, Adam Zsolt"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01468"}],"type":"journal_article","quality_controlled":"1","date_published":"2020-07-01T00:00:00Z","language":[{"iso":"eng"}],"page":"663-685","issue":"2","article_type":"original","date_updated":"2023-02-23T14:01:35Z","external_id":{"arxiv":["1809.01468"]},"publication_identifier":{"eissn":["1565-8511"],"issn":["0021-2172"]},"month":"07","article_processing_charge":"No","_id":"9578","oa":1,"citation":{"chicago":"Bucić, Matija, Matthew Alan Kwan, Alexey Pokrovskiy, Benny Sudakov, Tuan Tran, and Adam Zsolt Wagner. “Nearly-Linear Monotone Paths in Edge-Ordered Graphs.” Israel Journal of Mathematics. Springer, 2020. https://doi.org/10.1007/s11856-020-2035-7.","mla":"Bucić, Matija, et al. “Nearly-Linear Monotone Paths in Edge-Ordered Graphs.” Israel Journal of Mathematics, vol. 238, no. 2, Springer, 2020, pp. 663–85, doi:10.1007/s11856-020-2035-7.","apa":"Bucić, M., Kwan, M. A., Pokrovskiy, A., Sudakov, B., Tran, T., & Wagner, A. Z. (2020). Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-020-2035-7","ieee":"M. Bucić, M. A. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, and A. Z. Wagner, “Nearly-linear monotone paths in edge-ordered graphs,” Israel Journal of Mathematics, vol. 238, no. 2. Springer, pp. 663–685, 2020.","ista":"Bucić M, Kwan MA, Pokrovskiy A, Sudakov B, Tran T, Wagner AZ. 2020. Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. 238(2), 663–685.","ama":"Bucić M, Kwan MA, Pokrovskiy A, Sudakov B, Tran T, Wagner AZ. Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. 2020;238(2):663-685. doi:10.1007/s11856-020-2035-7","short":"M. Bucić, M.A. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, A.Z. Wagner, Israel Journal of Mathematics 238 (2020) 663–685."},"publication":"Israel Journal of Mathematics","day":"01","scopus_import":"1","date_created":"2021-06-21T13:24:35Z","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","intvolume":" 238","volume":238,"extern":"1","arxiv":1,"publication_status":"published","abstract":[{"lang":"eng","text":"How long a monotone path can one always find in any edge-ordering of the complete graph Kn? This appealing question was first asked by Chvátal and Komlós in 1971, and has since attracted the attention of many researchers, inspiring a variety of related problems. The prevailing conjecture is that one can always find a monotone path of linear length, but until now the best known lower bound was n2/3-o(1). In this paper we almost close this gap, proving that any edge-ordering of the complete graph contains a monotone path of length n1-o(1)."}]},{"scopus_import":"1","day":"01","oa":1,"publication":"Proceedings of the London Mathematical Society","citation":{"apa":"Kwan, M. A. (2020). Almost all Steiner triple systems have perfect matchings. Proceedings of the London Mathematical Society. Wiley. https://doi.org/10.1112/plms.12373","ieee":"M. A. Kwan, “Almost all Steiner triple systems have perfect matchings,” Proceedings of the London Mathematical Society, vol. 121, no. 6. Wiley, pp. 1468–1495, 2020.","chicago":"Kwan, Matthew Alan. “Almost All Steiner Triple Systems Have Perfect Matchings.” Proceedings of the London Mathematical Society. Wiley, 2020. https://doi.org/10.1112/plms.12373.","mla":"Kwan, Matthew Alan. “Almost All Steiner Triple Systems Have Perfect Matchings.” Proceedings of the London Mathematical Society, vol. 121, no. 6, Wiley, 2020, pp. 1468–95, doi:10.1112/plms.12373.","ista":"Kwan MA. 2020. Almost all Steiner triple systems have perfect matchings. Proceedings of the London Mathematical Society. 121(6), 1468–1495.","ama":"Kwan MA. Almost all Steiner triple systems have perfect matchings. Proceedings of the London Mathematical Society. 2020;121(6):1468-1495. doi:10.1112/plms.12373","short":"M.A. Kwan, Proceedings of the London Mathematical Society 121 (2020) 1468–1495."},"arxiv":1,"abstract":[{"text":"We show that for any 𝑛 divisible by 3, almost all order- 𝑛 Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a Steiner triple system and show that almost all Steiner triple systems essentially attain this maximum. We accomplish this via a general theorem comparing a uniformly random Steiner triple system to the outcome of the triangle removal process, which we hope will be useful for other problems. Our methods can also be adapted to other types of designs; for example, we sketch a proof of the theorem that almost all Latin squares have transversals.","lang":"eng"}],"publication_status":"published","intvolume":" 121","volume":121,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_created":"2021-06-22T06:35:16Z","extern":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.02246"}],"author":[{"full_name":"Kwan, Matthew Alan","first_name":"Matthew Alan","last_name":"Kwan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567"}],"type":"journal_article","oa_version":"Preprint","year":"2020","title":"Almost all Steiner triple systems have perfect matchings","status":"public","publisher":"Wiley","doi":"10.1112/plms.12373","publication_identifier":{"eissn":["1460-244X"],"issn":["0024-6115"]},"_id":"9581","article_processing_charge":"No","month":"12","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2020-12-01T00:00:00Z","date_updated":"2023-02-23T14:01:43Z","external_id":{"arxiv":["1611.02246"]},"article_type":"original","page":"1468-1495","issue":"6"},{"title":"Dense induced bipartite subgraphs in triangle-free graphs","status":"public","year":"2020","publisher":"Springer","doi":"10.1007/s00493-019-4086-0","oa_version":"Preprint","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1810.12144"}],"author":[{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","full_name":"Kwan, Matthew Alan","first_name":"Matthew Alan","last_name":"Kwan","orcid":"0000-0002-4003-7567"},{"full_name":"Letzter, Shoham","last_name":"Letzter","first_name":"Shoham"},{"last_name":"Sudakov","first_name":"Benny","full_name":"Sudakov, Benny"},{"first_name":"Tuan","last_name":"Tran","full_name":"Tran, Tuan"}],"date_updated":"2023-02-23T14:01:45Z","external_id":{"arxiv":["1810.12144"]},"article_type":"original","page":"283-305","issue":"2","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2020-04-01T00:00:00Z","_id":"9582","article_processing_charge":"No","month":"04","publication_identifier":{"issn":["0209-9683"],"eissn":["1439-6912"]},"publication":"Combinatorica","citation":{"apa":"Kwan, M. A., Letzter, S., Sudakov, B., & Tran, T. (2020). Dense induced bipartite subgraphs in triangle-free graphs. Combinatorica. Springer. https://doi.org/10.1007/s00493-019-4086-0","ieee":"M. A. Kwan, S. Letzter, B. Sudakov, and T. Tran, “Dense induced bipartite subgraphs in triangle-free graphs,” Combinatorica, vol. 40, no. 2. Springer, pp. 283–305, 2020.","chicago":"Kwan, Matthew Alan, Shoham Letzter, Benny Sudakov, and Tuan Tran. “Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.” Combinatorica. Springer, 2020. https://doi.org/10.1007/s00493-019-4086-0.","mla":"Kwan, Matthew Alan, et al. “Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.” Combinatorica, vol. 40, no. 2, Springer, 2020, pp. 283–305, doi:10.1007/s00493-019-4086-0.","ama":"Kwan MA, Letzter S, Sudakov B, Tran T. Dense induced bipartite subgraphs in triangle-free graphs. Combinatorica. 2020;40(2):283-305. doi:10.1007/s00493-019-4086-0","ista":"Kwan MA, Letzter S, Sudakov B, Tran T. 2020. Dense induced bipartite subgraphs in triangle-free graphs. Combinatorica. 40(2), 283–305.","short":"M.A. Kwan, S. Letzter, B. Sudakov, T. Tran, Combinatorica 40 (2020) 283–305."},"oa":1,"scopus_import":"1","day":"01","extern":"1","volume":40,"intvolume":" 40","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_created":"2021-06-22T06:42:26Z","publication_status":"published","abstract":[{"lang":"eng","text":"The problem of finding dense induced bipartite subgraphs in H-free graphs has a long history, and was posed 30 years ago by Erdős, Faudree, Pach and Spencer. In this paper, we obtain several results in this direction. First we prove that any H-free graph with minimum degree at least d contains an induced bipartite subgraph of minimum degree at least cH log d/log log d, thus nearly confirming one and proving another conjecture of Esperet, Kang and Thomassé. Complementing this result, we further obtain optimal bounds for this problem in the case of dense triangle-free graphs, and we also answer a question of Erdœs, Janson, Łuczak and Spencer."}],"arxiv":1},{"abstract":[{"lang":"eng","text":"We show that for any n divisible by 3, almost all order-n Steiner triple systems admit a decomposition of almost all their triples into disjoint perfect matchings (that is, almost all Steiner triple systems are almost resolvable)."}],"publication_status":"published","article_number":"e39","pmid":1,"extern":"1","volume":8,"intvolume":" 8","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_created":"2021-06-22T09:12:23Z","scopus_import":"1","day":"03","publication":"Forum of Mathematics","citation":{"short":"A. Ferber, M.A. Kwan, Forum of Mathematics 8 (2020).","ama":"Ferber A, Kwan MA. Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. 2020;8. doi:10.1017/fms.2020.29","ista":"Ferber A, Kwan MA. 2020. Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. 8, e39.","mla":"Ferber, Asaf, and Matthew Alan Kwan. “Almost All Steiner Triple Systems Are Almost Resolvable.” Forum of Mathematics, vol. 8, e39, Cambridge University Press, 2020, doi:10.1017/fms.2020.29.","chicago":"Ferber, Asaf, and Matthew Alan Kwan. “Almost All Steiner Triple Systems Are Almost Resolvable.” Forum of Mathematics. Cambridge University Press, 2020. https://doi.org/10.1017/fms.2020.29.","apa":"Ferber, A., & Kwan, M. A. (2020). Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. Cambridge University Press. https://doi.org/10.1017/fms.2020.29","ieee":"A. Ferber and M. A. Kwan, “Almost all Steiner triple systems are almost resolvable,” Forum of Mathematics, vol. 8. Cambridge University Press, 2020."},"oa":1,"_id":"9583","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"No","month":"11","publication_identifier":{"eissn":["2050-5094"]},"external_id":{"pmid":["1907.06744"]},"date_updated":"2023-02-23T14:01:48Z","article_type":"original","file":[{"file_size":601516,"date_updated":"2021-06-22T09:23:59Z","date_created":"2021-06-22T09:23:59Z","file_id":"9584","creator":"asandaue","success":1,"file_name":"2020_CambridgeUniversityPress_Ferber.pdf","access_level":"open_access","checksum":"5553c596bb4db0f38226a56bee9c87a1","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"date_published":"2020-11-03T00:00:00Z","quality_controlled":"1","type":"journal_article","file_date_updated":"2021-06-22T09:23:59Z","author":[{"last_name":"Ferber","first_name":"Asaf","full_name":"Ferber, Asaf"},{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","full_name":"Kwan, Matthew Alan","last_name":"Kwan","first_name":"Matthew Alan","orcid":"0000-0002-4003-7567"}],"title":"Almost all Steiner triple systems are almost resolvable","year":"2020","status":"public","publisher":"Cambridge University Press","ddc":["510"],"doi":"10.1017/fms.2020.29","oa_version":"Published Version","has_accepted_license":"1"},{"article_processing_charge":"Yes","tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"month":"12","_id":"9630","publication_identifier":{"eissn":["1920180X"]},"file":[{"date_updated":"2021-08-11T11:55:11Z","file_size":1449234,"file_id":"9882","creator":"asandaue","success":1,"date_created":"2021-08-11T11:55:11Z","checksum":"f02d0b2b3838e7891a6c417fc34ffdcd","relation":"main_file","access_level":"open_access","file_name":"2020_JournalOfComputationalGeometry_Edelsbrunner.pdf","content_type":"application/pdf"}],"issue":"2","page":"162-182","date_updated":"2021-08-11T12:26:34Z","article_type":"original","quality_controlled":"1","date_published":"2020-12-14T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Virk, Ziga","first_name":"Ziga","last_name":"Virk","id":"2E36B656-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wagner","first_name":"Hubert","full_name":"Wagner, Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2021-08-11T11:55:11Z","publisher":"Carleton University","ddc":["510","000"],"doi":"10.20382/jocg.v11i2a7","title":"Topological data analysis in information space","year":"2020","status":"public","acknowledgement":"This research is partially supported by the Office of Naval Research, through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","has_accepted_license":"1","oa_version":"Published Version","abstract":[{"text":"Various kinds of data are routinely represented as discrete probability distributions. Examples include text documents summarized by histograms of word occurrences and images represented as histograms of oriented gradients. Viewing a discrete probability distribution as a point in the standard simplex of the appropriate dimension, we can understand collections of such objects in geometric and topological terms. Importantly, instead of using the standard Euclidean distance, we look into dissimilarity measures with information-theoretic justification, and we develop the theory needed for applying topological data analysis in this setting. In doing so, we emphasize constructions that enable the usage of existing computational topology software in this context.","lang":"eng"}],"publication_status":"published","project":[{"name":"Discretization in Geometry and Dynamics","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316","grant_number":"I4887"}],"date_created":"2021-07-04T22:01:26Z","intvolume":" 11","volume":11,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","license":"https://creativecommons.org/licenses/by/3.0/","day":"14","scopus_import":"1","department":[{"_id":"HeEd"}],"citation":{"ama":"Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information space. Journal of Computational Geometry. 2020;11(2):162-182. doi:10.20382/jocg.v11i2a7","ista":"Edelsbrunner H, Virk Z, Wagner H. 2020. Topological data analysis in information space. Journal of Computational Geometry. 11(2), 162–182.","short":"H. Edelsbrunner, Z. Virk, H. Wagner, Journal of Computational Geometry 11 (2020) 162–182.","chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.” Journal of Computational Geometry. Carleton University, 2020. https://doi.org/10.20382/jocg.v11i2a7.","mla":"Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.” Journal of Computational Geometry, vol. 11, no. 2, Carleton University, 2020, pp. 162–82, doi:10.20382/jocg.v11i2a7.","ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information space,” Journal of Computational Geometry, vol. 11, no. 2. Carleton University, pp. 162–182, 2020.","apa":"Edelsbrunner, H., Virk, Z., & Wagner, H. (2020). Topological data analysis in information space. Journal of Computational Geometry. Carleton University. https://doi.org/10.20382/jocg.v11i2a7"},"publication":"Journal of Computational Geometry","oa":1}]