Forthcoming Seminars
|
Thu, 06/06 12:00 |
Mayte Pérez-Llanos (Universidad Autonoma de Madrid) |
OxPDE Lunchtime Seminar |
Gibson 1st Floor SR |
-Laplacian type diffusion equation,
goes to infinity.
goes to infinity in these approximations and obtain a discrete model for the evolution of a sandpile.
|
|||
|
Thu, 06/06 13:00 |
Mathematical Finance Internal Seminar |
||
|
Thu, 06/06 14:00 |
Professor Clint Dawson (University of Texas at Austin) |
Computational Mathematics and Applications |
Gibson Grd floor SR |
|
Thu, 06/06 15:00 |
Laura Schaposnik (University of Heidelberg) |
Junior Geometry and Topology Seminar |
SR1 |
|
Thu, 06/06 16:00 |
NOMURA LECTURE |
Industrial and Applied Mathematics Seminar |
DH 1st floor SR |
|
Thu, 06/06 17:00 |
François Golse (Ecole Polytechnique) |
Partial Differential Equations Seminar |
Gibson 1st Floor SR |
|
Thu, 06/06 17:00 |
Marcus Tressl (Manchester) |
Logic Seminar |
L3 |
|
Thu, 06/06 17:30 |
Paul Milgrom (Stanford University) |
Nomura Lecture |
Martin Wood Lecture |
| Some real resource allocation problems are so large and complex that optimization would computationally infeasible, even with complete information about all the relevant values. For example, the proposal in the US to use television broadcasters' bids to determine which stations go off air to make room for wireless broadband is characterized by hundreds of thousands of integer constraints. We use game theory and auction theory to characterize a class of simple, strategy-proof auctions for such problems and show their equivalence to a class of "clock auctions," which make the optimal bidding strategy obvious to all bidders. We adapt the results of optimal auction theory to reduce expected procurement costs and prove that the procurement cost of each clock auction is the same as that of the full information equilibrium of its related paid-as-bid (sealed-bid) auction. | |||
|
Fri, 07/06 10:00 |
Bhaskar Choubey (Department of Engineering Science, University of Oxford) |
Industrial and Interdisciplinary Workshops |
DH 1st floor SR |
|
Fri, 07/06 14:00 |
Professor Sandhya Samarasinghe (C-fACS Lincoln University) |
Mathematical Biology and Ecology Seminar |
L1 |
|
Fri, 07/06 16:00 |
Nizar Touzi (Ecole Polytechnique (ParisTech)) |
Nomura Seminar |
DH 1st floor SR |
| tba | |||
|
Fri, 07/06 16:30 |
Professor Laurent Lafforgue (IHES) |
Colloquia |
L2 |
|
"We introduce some type of generalized Poisson formula which is equivalent |
|||
|
Mon, 10/06 12:00 |
Chris Pope (Texas A&M and Cambridge) |
String Theory Seminar |
L3 |
|
Mon, 10/06 14:15 |
tba |
Geometry and Analysis Seminar |
L3 |
|
Mon, 10/06 14:15 |
PHILIPPE BRIAND (Universite Savoie) |
Stochastic Analysis Seminar |
Oxford-Man Institute |
| This talk is based on a joint work with Céline Labart. We are interested in this paper in the numerical simulation of solutions to Backward Stochastic Differential Equations. There are several existing methods to handle this problem and one of the main difficulty is always to compute conditional expectations. Even though our approach can also be applied in the case of the dynamic programmation equation, our starting point is the use of Picard's iterations that we write in a forward way In order to compute the conditional expectations, we use Wiener Chaos expansions of the underlying random variables. From a practical point of view, we keep only a finite number of terms in the expansions and we get explicit formulas. We will present numerical experiments and results on the error analysis. | |||
|
Mon, 10/06 15:45 |
Derek Holt (Southampton) |
Topology Seminar |
L3 |
|
The class of sofic groups was introduced by Gromov in 1999. It |
|||
|
Mon, 10/06 15:45 |
NI HAO (University of Oxford) |
Stochastic Analysis Seminar |
Oxford-Man Institute |
| In this talk, we consider the setting: a random realization of an evolving dynamical system, and explain how, using notions common in the theory of rough paths, such as the signature, and shuffle product, one can provide a new united approach to the fundamental problem of predicting the conditional distribution of the near future given the past. We will explain how the problem can be reduced to a linear regression and least squaresanalysis. The approach is clean and systematic and provides a clear gradation of finite dimensional approximations. The approach is also non-parametric and very general but still presents itself in computationally tractable and flexible restricted forms for concrete problems. Popular techniques in time series analysis such as GARCH can be seen to be restricted special cases of our approach but it is not clear they are always the best or most informative choices. Some numerical examples will be shown in order to compare our approach and standard time series models. | |||
|
Tue, 11/06 12:00 |
Christian Saemann (Heriot Watt University Edinburgh) |
Relativity Seminar |
L3 |
|
Tue, 11/06 17:00 |
Alex Belton (Lancaster) |
Functional Analysis Seminar |
L3 |
|
Tue, 11/06 17:00 |
Benjamin Klopsch (Magdeburg) |
Algebra Seminar |
L2 |

-Laplacian type diffusion equation,
![\[
u_t (t, x) = \int_\Omega J(x − y)|u(t, y) − u(t, x)|^{p-2} (u(t, y) − u(t, x)) dy.
\]](/files/tex/0989274637b8c8711707f5b470f0f753cfabd54c.png)
goes to infinity.