Preparing Arbitrary Continuous Functions in Quantum Registers With Logarithmic Complexity
Rattew, A
Koczor, B
(01 May 2022)
Improving Lossless Compression Rates via Monte Carlo Bits-Back Coding
Ruan, Y
Ullrich, K
Severo, D
Townsend, J
Khisti, A
Doucet, A
Makhzani, A
Maddison, C
INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139
volume 139
(18 Jan 2021)
Monte Carlo Variational Auto-Encoders
Thin, A
Kotelevskii, N
Durmus, A
Panov, M
Moulines, E
Doucet, A
INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139
volume 139
7258-7267
(18 Jul 2021)
A casino gambling model under cumulative prospect theory: analysis and algorithm
Hu, S
Obloj, J
Zhou, X
Management Science
volume 69
issue 4
2474-2496
(06 May 2022)
The universal program of linear elasticity
Yavari, A
Goriely, A
Mathematics and Mechanics of Solids
volume 28
issue 1
251-268
(07 Jan 2023)
Today the UK funding bodies have published the results of the UK’s most recent national research assessment exercise, the Research Excellence Framework (REF) 2021.
Research from the Mathematical Institute and the Department of Statistics in Oxford was submitted together under Unit of Assessment 10. Overall, 78% of our submission was judged to be 4* (the highest score available, given for research quality that is world-leading in terms of originality, significance, and rigour).
Gromov centrality: A multi-scale measure of network centrality using triangle inequality excess
Babul, S
Devriendt, K
Lambiotte, R
Physical Review E: Statistical, Nonlinear, and Soft Matter Physics
(10 May 2022)
Investigation of a Passive Flow Control Device in an S-Duct Inlet of a Propulsion System With High Subsonic Flow
Asghar, A
Sidhu, S
Allan, W
Ingram, G
Hickling, T
Stowe, R
v001t01a033-v001t01a033
(11 Jun 2018)
Riemannian optimization via Frank-Wolfe methods
Weber, M
Sra, S
Mathematical Programming
Tue, 14 Jun 2022
14:00 -
15:00
L4
Resolution of the Erdős-Sauer problem on regular subgraphs
Benny Sudakov
(ETH Zurich)
Abstract
In this talk we discuss solution of the well-known problem of Erdős and Sauer from 1975 which asks for the maximum number of edges an $n$-vertex graph can have without containing a $k$-regular subgraph, for some fixed integer $k\geq 3$. We prove that any $n$-vertex graph with average degree at least $C_k\log\log n$ contains a $k$-regular subgraph. This matches the lower bound of Pyber, Rödl and Szemerédi and substantially
improves an old result of Pyber, who showed that average degree at least $C_k\log n$ is enough.
Our method can also be used to settle asymptotically a problem raised by Erdős and Simonovits in 1970 on almost regular subgraphs of sparse graphs and to make progress on the well-known question of Thomassen from 1983 on finding subgraphs with large girth and large average degree.
Joint work with Oliver Janzer