Oxford-Man Institute

Suppose we have a collection of blocks, which gradually split apart as time goes on. Each block waits an exponential amount
of time with parameter given by its size to some power alpha, independently of the other blocks. Every block then splits randomly,but according to the same distribution. In this talk, I will focus on the case where alpha is negative, which
means that smaller blocks split faster than larger ones. This gives rise to the phenomenon of loss of mass, whereby the smaller blocks split faster and faster until they are reduced to ``dust''. Indeed, it turns out that the whole state is reduced to dust in a finite time, almost surely (we call this the extinction time). A natural question is then: how do the block sizes behave as the process approaches its extinction time? The answer turns out to involve a somewhat unusual ``spine'' decomposition for the fragmentation, and Markov renewal theory.

This is joint work with Bénédicte Haas (Paris-Dauphine).

We consider a broker who has to place a large order which consumes a sizable part of average daily trading volume. By contrast to the previous literature, we allow the liquidity parameters of market depth and resilience to vary deterministically over the course of the trading period. The resulting singular optimal control problem is shown to be tractable by methods from convex analysis and, under

minimal assumptions, we construct an explicit solution to the scheduling problem in terms of some concave envelope of the resilience adjusted market depth.

 In this talk, we describe how to compute the critical point for various lattice models of planar statistical physics. We will first introduce the percolation, Ising, Potts and random-cluster models on the square lattice. Then, we will discuss how critical points of these different models are related. In a final part, we will compute the critical point of these models. This last part harnesses two main ingredients that we will describe in details: duality and sharp threshold theorems. No background is necessary.

We present a general valuation framework for commodity storage facilities, for non-perishable commodities. Modeling commodity prices with a mean reverting process we provide analytical expressions for the value obtainable from the storage for any admissible injection/withdrawal policy. Then we present an iterative numerical algorithm to find the optimal injection and withdrawal policies, along with the necessary theoretical guarantees for convergence. Together, the analytical expressions and the numerical algorithm present an extremely efficient way of solving not only commodity storage problems but in general the problem of optimally controlling a mean reverting processes with transaction costs.

Edge-reinforced random walk (ERRW), introduced by Coppersmith and Diaconis in 1986, is a random process which takes values in the vertex set of a graph G, and is more likely to cross edges it has visited before. We show that it can be represented in terms of a Vertex-reinforced jump process (VRJP) with independent gamma

conductances: the VRJP was conceived by Werner and first studied by Davis and Volkov (2002,2004), and is a continuous-time process favouring sites with more local time. We show that the VRJP is a mixture of time-changed Markov jump processes and calculate the mixing measure. The mixing measure is interpreted as a marginal of the supersymmetric hyperbolic sigma model introduced by Disertori, Spencer and Zirnbauer.

This enables us to deduce that VRJP and ERRW are strongly recurrent in any dimension for large reinforcement (in fact, on graphs of bounded degree), using a localisation result of Disertori and Spencer (2010).

(Joint work with Pierre Tarrès.)

abstract:In this talk, we describe how to compute the critical point for various lattice models of planar statistical physics. We will first introduce the percolation, Ising, Potts and random-cluster models on the square lattice. Then, we will discuss how critical points of these different models are related. In a final part, we will compute the critical point of these models. This last part harnesses two main ingredients that we will describe in details: duality and sharp threshold theorems. No background is necessary.

The Schramm-Loewner evolution (SLE(\kappa)) is a family of random fractal curves that arise in a natural way as scaling limits of interfaces in critical models in statistical physics. The SLE curves are constructed by solving the Loewner differential equation driven by a scaled Brownian motion. We will give an overview of some of the almost sure properties of SLE curves, concentrating in particular on properties that can be derived by studying the the geometry of growing curve locally at the tip. We will discuss a multifractual spectrum of harmonic measure at the tip, regularity in the capacity parameterization, and continuity of the curves as the \kappa-parameter is varied while the driving Brownian motion sample is kept fixed.

This is based on joint work with Greg Lawler, and with Steffen Rohde and Carto Wong.

There are two main statistical mechanical models of ferromagnetism: the simpler and better-understood Ising model, and the more realistic and more challenging classical Heisenberg model, where the spins are in the 2-sphere instead of in {-1,+1}. In dimensions one and two, the classical Heisenberg model with nearest-neighbor interactions has no phase transition, but in three dimensions it has been intractable.

To shed some light on the qualitative behavior of the 3D Heisenberg model, we use the versatile tools of mean-field theory and Stein's method in recent work with Elizabeth Meckes, studying the Heisenberg model on a complete graph with the number of vertices going to infinity. Our results include detailed descriptions of the magnetization, the empirical spin distribution, the free energy, and a second-order phase transition.

We will give a quick overview of the semigroup perspective on splitting schemes for S(P)DEs which present a robust, "easy to implement" numerical method for calculating the expected value of a certain payoff of a stochastic process driven by a S(P)DE. Having a high numerical order of convergence enables us to replace the Monte Carlo integration technique by alternative, faster techniques. The numerical order of splitting schemes for S(P)DEs is bounded by 2. The technique of combining several splittings using linear combinations which kills some additional terms in the error expansion and thus raises the order of the numerical method is called the extrapolation. In the presentation we will focus on a special extrapolation of the Lie-Trotter splitting: the symmetrically weighted sequential splitting, and its subsequent extrapolations. Using the semigroup technique their convergence will be investigated. At the end several applications to the S(P)DEs will be given.

Based on ideas from rough path analysis and operator splitting, the Kusuoka-Lyons-Victoir scheme provides a family of higher order methods for the weak approximation of stochastic differential equations. Out of this family, the Ninomiya-Victoir method is especially simple to implement and to adjust to various different models. We give some examples of models used in financial engineering and comment on the performance of the Ninomiya-Victoir scheme and some modifications when applied to these models.