Past

This talk is devoted to Talagrand's transport-entropy inequality and its deep connections to the concentration of measure phenomenon, large deviation theory and logarithmic Sobolev inequalities. After an introductive part on the field, I will present recent results obtained with P-M Samson and C. Roberto establishing the equivalence of Talagrand's inequality to a restricted version of the Log-Sobolev inequality. If time enables, I will also present some works in progress about transport inequalities in a discrete setting.

Abstract: First we provide a survey on the long-time behaviour of stochastic delay equations with bounded memory, addressing existence and uniqueness of invariant measures, Lyapunov spectra, and exponential growth rates.

Then, we study the very simple one-dimensional equation $dX(t)=X(t-1)dW(t)$ in more detail and establish the existence of a deterministic exponential growth rate of a suitable norm of the solution via a Furstenberg-Hasminskii-type formula.

Parts of the talk are based on joint work with Martin Hairer and Jonathan Mattingly. 

The AdS/CFT correspondence is a powerful tool to analyse strongly coupled quantum field

theories. Over the past few years there has been a surge of activity aimed at finding

possible applications to condensed matter systems. One focus has been to holographically

realise various kinds of phases via the construction of fascinating new classes of black

hole solutions. In this framework, I will discuss the possibility of describing finite

temperature phase transitions leading to spontaneous breaking of translational invariance of

the dual field theory at strong coupling. Along with the general setup I will also discuss

specific string/M theory embeddings of the corresponding symmetry breaking modes leading to

the description of such phases.

The part of the West Antarctic Ice Sheet that drains into the Amundsen Sea is currently thinning at such a rate that it contributes nearly 10 percent of the observed rise in global mean sea level. Acceleration of the outlet glaciers means that the sea level contribution has grown over the past decades, while the likely future contribution remains a key unknown. The synchronous response of several independent glaciers, coupled with the observation that thinning is most rapid at their downstream ends, where the ice goes afloat, hints at an oceanic driver. The general assumption is that the changes are a response to an increase in submarine melting of the floating ice shelves that has been driven in turn by an increase in the transport of ocean heat towards the ice sheet. Understanding the causes of these changes and their relationship with climate variability is imperative if we are to make quantitative estimates of sea level into the future.

Observations made since the mid‐1990s on the Amundsen Sea continental shelf have revealed that the seabed troughs carved by previous glacial advances guide seawater around 3‐4°C above the freezing point from the deep ocean to the ice sheet margin, fuelling rapid melting of the floating ice. This talk summarises the results of several pieces of work that investigate the chain of processes linking large‐scale atmospheric processes with ocean circulation over the continental shelf and beneath the floating ice shelves and the eventual transfer of heat to the ice. While our understanding of the processes is far from complete, the pieces of the jigsaw that have been put into place give us insight into the potential causes of variability in ice shelf melting, and allow us to at least formulate some key questions that still need to be answered in order to make reliable projections of future ice sheet evolution in West Antarctica.

Algorithmic trade execution has become a standard technique

for institutional market players in recent years,

particularly in the equity market where electronic

trading is most prevalent. A trade execution algorithm

typically seeks to execute a trade decision optimally

upon receiving inputs from a human trader.

A common form of optimality criterion seeks to

strike a balance between minimizing pricing impact and

minimizing timing risk. For example, in the case of

selling a large number of shares, a fast liquidation will

cause the share price to drop, whereas a slow liquidation

will expose the seller to timing risk due to the

stochastic nature of the share price.

We compare optimal liquidation policies in continuous time in

the presence of trading impact using numerical solutions of

Hamilton Jacobi Bellman (HJB)partial differential equations

(PDE). In particular, we compare the time-consistent

mean-quadratic-variation strategy (Almgren and Chriss) with the

time-inconsistent (pre-commitment) mean-variance strategy.

The Almgren and Chriss strategy should be viewed as the

industry standard.

We show that the two different risk measures lead to very different

strategies and liquidation profiles.

In terms of the mean variance efficient frontier, the

original Almgren/Chriss strategy is signficently sub-optimal

compared to the (pre-commitment) mean-variance strategy.

This is joint work with Stephen Tse, Heath Windcliff and

Shannon Kennedy.

In recent years, surprising connections between type theory and homotopy theory have been discovered. In this talk I will recall the notions of intensional type theories and identity types. I will describe "infinity groupoids", formal algebraic models of topological spaces, and explain how identity types carry the structure of an infinity groupoid. I will finish by discussing categorical semantics of intensional type theories.

The talk will take place in Lecture Theatre B, at the Department of Computer Science.

Problem #1: (marker-less scaling) Poikos ltd. has created algorithms for matching photographs of humans to three-dimensional body scans. Due to variability in camera lenses and body sizes, the resulting three-dimensional data is normalised to have unit height and has no absolute scale. The problem is to assign an absolute scale to normalised three-dimensional data.

Prior Knowledge: A database of similar (but different) reference objects with known scales. An imperfect 1:1 mapping from the input coordinates to the coordinates of each object within the reference database. A projection matrix mapping the three-dimensional data to the two-dimensional space of the photograph (involves a non-linear and non-invertible transform; x=(M*v)_x/(M*v)_z, y=(M*v)_y/(M*v)_z).

Problem #2: (improved silhouette fitting) Poikos ltd. has created algorithms for converting RGB photographs of humans in (approximate) poses into silhouettes. Currently, a multivariate Gaussian mixture model is used as a first pass. This is imperfect, and would benefit from an improved statistical method. The problem is to determine the probability that a given three-component colour at a given two-component location should be considered as "foreground" or "background".

Prior Knowledge: A sparse set of colours which are very likely to be skin (foreground), and their locations. May include some outliers. A (larger) sparse set of colours which are very likely to be clothing (foreground), and their locations. May include several distributions in the case of multi-coloured clothing, and will probably include vast variations in luminosity. A (larger still) sparse set of colours which are very likely to be background. Will probably overlap with skin and/or clothing colours. A very approximate skeleton for the subject.

Limitations: Sample colours are chosen "safely". That is, they are chosen in areas known to be away from edges. This causes two problems; highlights and shadows are not accounted for, and colours from arms and legs are under-represented in the model. All colours may be "saturated"; that is, information is lost about colours which are "brighter than white". All colours are subject to noise; each colour can be considered as a true colour plus a random variable from a gaussian distribution. The weight of this gaussian model is constant across all luminosities, that is, darker colours contain more relative noise than brighter colours.

The inverse acoustic obstacle scattering problem, in its most general

form, seeks to determine the nature of an unknown scatterer from knowl-

edge of its far eld or radiation pattern. The problem which is the main

concern here is:

If the scattering cross section, i.e the absolute value of the radiation

pattern, of an unknown scatterer is known determine its shape.

In this talk we explore the problem from a number of points of view.

These include questions of uniqueness, methods of solution including it-

erative methods, the Minkowski problem and level set methods. We con-

clude by looking at the problem of acoustically invisible gateways and its

connections with cloaking

Standard numerical schemes for acoustic scattering problems suffer from the restriction that the number of degrees of freedom required to achieve a prescribed level of accuracy must grow at least linearly with respect to frequency in order to maintain accuracy as frequency increases. In this talk, we review recent progress on the development and analysis of hybrid numerical-asymptotic boundary integral equation methods for these problems. The key idea of this approach is to form an ansatz for the solution based on knowledge of the high frequency asymptotics, allowing one to achieve any required accuracy via the approximation of only (in many cases provably) non-oscillatory functions. In particular, we discuss very recent work extending these ideas for the first time to non-convex scatterers.

After giving a brief physical motivation I will define the notion of generalized pseudo-holomorphic curves, as well as tamed and compatible generalized complex structures. The latter can be used to give a generalization of an energy identity. Moreover, I will explain some aspects of the local and global theory of generalized pseudo-holomorphic curves.

I will explain how moduli spaces of quadratic differentials on Riemann surfaces can be interpreted as spaces of stability conditions for certain 3-Calabi-Yau triangulated categories. These categories are defined via quivers with potentials, but can also be interpreted as Fukaya categories. This work (joint with Ivan Smith) was inspired by the papers of  Gaiotto, Moore and Neitzke, but connections with hyperkahler metrics, Fock-Goncharov coordinates etc. will not be covered in this talk.

Rado introduced the following `lion and man' game in the 1930's: two players (the lion and the man) are in the closed unit disc and they can run at the same speed. The lion would like to catch the man and the man would like to avoid being captured.

This game has a chequered history with several false `winning strategies' before Besicovitch finally gave a genuine winning strategy.

We ask the surprising question: can both players win?

 Determining the price at which to conduct a trade is an age-old problem. The first (albeit primitive) pricing mechanism dates back to the Neolithic era, when people met in physical proximity in order to agree upon mutually beneficial exchanges of goods and services, and over time increasingly complex mechanisms have played a role in determining prices. In the highly competitive and relentlessly fast-paced markets of today’s financial world, it is the limit order book that matches buyers and sellers to trade at an agreed price in more than half of the world’s markets.  In this talk I will describe the limit order book trade-matching mechanism, and explain how the extra flexibility it provides has vastly impacted the problem of how a market participant should optimally behave in a given set of circumstances.

Abstract:

Motivated by the correlation functions-Wilson loop correspondence in maximally supersymmetric Yang-Mills theory, we will investigate a conjecture of Alday, Buchbinder, and Tseytlin regarding correlators of null polygonal Wilson loops with local operators in general position.  By translating the problem to twistor space, we can show that such correlators arise by taking null limits of correlation functions in the gauge theory, thereby providing a proof for the conjecture.  Additionally, twistor methods allow us to derive a recursive formula for computing these correlators, akin to the BCFW recursion for scattering amplitudes.