Past

In this talk, I will talk about my current approach to model customer movements and in particular congestion inside supermarkets using queuing networks. As the research question for my project is ‘How should one design supermarkets to minimize congestion?’, I will then talk about my current progress in understanding how the network structure can affect this dynamics.

Linear elasticity can be rigorously derived from finite elasticity in the case of small loadings in terms of \Gamma-convergence. This was first done by Dal Maso-Negri-Percivale in the case of one-well energies with super-quadratic growth. This has been later generalised to different settings, in particular to the case of multi-well energies where the distance between the wells is very small (comparable to the size of the load). I will discuss recent developments in the case when the distance between the wells is arbitrary. In this context linear elasticity can be derived by adding to the multi-well energy a singular higher order term which penalises jumps from one well to another. The size of the singular term has to satisfy certain scaling assumptions which turn out to be optimal. (This is joint work with Alicandro, Dal Maso and Lazzaroni.) 

Gaussian fields are prevalent throughout mathematics and the sciences, for instance in physics (wave-functions of high energy electrons), astronomy (cosmic microwave background radiation) and probability theory (connections to SLE, random tilings etc). Despite this, the geometry of such fields, for instance the connectivity properties of level sets, is poorly understood. In this talk I will discuss methods of extracting geometric information about levels sets of a planar Gaussian field through discrete observations of the field. In particular, I will present recent work that studies three such discretisation schemes, each tailored to extract geometric information about the levels set to a different level of precision, along with some applications.

Large-scale homology computations are often rendered tractable by discrete Morse theory. Every discrete Morse function on a given cell complex X produces a Morse chain complex whose chain groups are spanned by critical cells and whose homology is isomorphic to that of X. However, the space-level information is typically lost because very little is known about how critical cells are attached to each other. In this talk, we discretize a beautiful construction of Cohen, Jones and Segal in order to completely recover the homotopy type of X from an overlaid discrete Morse function.

 Monte Carlo methods are one of the main tools of modern statistics and applied mathematics. They are commonly used to approximate integrals, which allows statisticians to solve many tasks of interest such as making predictions or inferring parameter values of a given model. However, the recent surge in data available to scientists has led to an increase in the complexity of mathematical models, rendering them much more computationally expensive to evaluate. This has a particular bearing on Monte Carlo methods, which will tend to be much slower due to the high computational costs.

This talk will introduce a Monte Carlo integration scheme which makes use of properties of the integrand (e.g. smoothness or periodicity) in order to obtain fast convergence rates in the number of integrand evaluations. This will allow users to obtain much more precise estimates of integrals for a given number of model evaluations. Both theoretical properties of the methodology, including convergence rates, and practical issues, such as the tuning of parameters, will be discussed. Finally, the proposed algorithm will be illustrated on a Bayesian inverse problem for a PDE model of subsurface flow.

The construction of the moduli spaces of stable curves of fixed genus is one of the classical applications of Mumford's geometric invariant theory (GIT).  Here a projective curve is stable if it has only nodes as singularities and its automorphism group is finite. Methods from non-reductive GIT allow us to classify the singularities of unstable curves in such a way that we can construct moduli spaces of unstable curves of fixed singularity type.

A conformal field theory is characterised by the CFT data, namely the spectrum of scaling dimensions and OPE coefficients. The idea of the conformal bootstrap is to use associativity of the operator algebra together with the symmetries of the theory to constraint the CFT data. For the sector of operators with large spin one can actually use these ideas to obtain analytical results. It was recently understood how to set up a systematic expansion around this sector, leading to analytic results to all orders in inverse powers of the spin. We will show how to use this large spin perturbation theory to obtain analytic results for vast families of CFTs. Some of the applications include vector models, weakly coupled gauge theories and the computation of loops for scalar theories in AdS.

In Your Third Year & want to find out about opportunities for summer placements and future graduate study?

Why not visit Oxford and hear from graduate students about their research

Saturday 21 January 2017: 1-6pm

Mathematical Institute, University of Oxford

TALKS ON

• Dynamics of jumping elastic toys
• Vertex models in developmental biology
• Modelling of glass sheets
• Glimpse into the mathematics of information
• Network analysis of consumer data
• Complex singularities in jet and splash flows

Complementary Lunch & Drinks Reception - TRAVEL BURSARIES AVAILABLE (up to £50)

Please RSVP to @email

In Your Third Year & want to find out about opportunities for

summer placements and future graduate study?

Why not visit Oxford and hear from graduate students about their research

TALKS ON

Dynamics of jumping elastic toys

Vertex models in developmental biology

Modelling of glass sheets

Glimpse into the mathematics of information

Network analysis of consumer data

Complex singularities in jet and splash flows

Complementary Lunch & Drinks Reception - TRAVEL BURSARIES AVAILABLE (up to £50)

Please RSVP to @email

A continuum of expanders -- David Hume

Expanders are a holy grail of networking; robustly connected networks of arbitrary size which require minimal resources. Like the grail, they are also notoriously difficult to construct. In this talk I will introduce expanders, give a brief overview of just a few aspects of their diverse history, and outline a very recent result of mine, which states that there are a continuum of expanders with fundamentally different large-scale geometry.

What makes cities successful? A complex systems approach to modelling urban economies -- Neave O'Clery

Urban centres draw a diverse range of people, attracted by opportunity, amenities, and the energy of crowds. Yet, while benefiting from density and proximity of people, cities also suffer from issues surrounding crime, congestion and density. Seeking to uncover the mechanisms behind the success of cities using novel tools from the mathematical and data sciences, this work uses network techniques to model the opportunity landscape of cities. Under the theory that cities move into new economic activities that share inputs with existing capabilities, path dependent industrial diversification can be described using a network of industries. Edges represent shared necessary capabilities, and are empirically estimated via flows of workers moving between industries. The position of a city in this network (i.e., the subnetwork of its current industries) will determine its future diversification potential. A city located in a central well-connected region has many options, but one with only few peripheral industries has limited opportunities.

We develop this framework to explain the large variation in labour formality rates across cities in the developing world, using data from Colombia. We show that, as cities become larger, they move into increasingly complex industries as firms combine complementary capabilities derived from a more diverse pool of workers. We further show that a level of agglomeration equivalent to between 45 and 75 minutes of commuting time maximizes the ability of cities to generate formal employment using the variety of skills available. Our results suggest that rather than discouraging the expansion of metropolitan areas, cities should invest in transportation to enable firms to take advantage of urban diversity.

This talk will be based on joint work with Eduardo Lora and Andres Gomez at Harvard University.

Abstract: Triangulations of surfaces serve as important examples for cluster theory, with the natural operation of “diagonal flips” encoding mutation in cluster algebras and categories. In this talk we will focus on the combinatorics of mutation on marked surfaces with infinitely many marked points, which have gained importance recently with the rising interest in cluster algebras and categories of infinite rank. In this setting, it is no longer possible to reach any triangulation from any other triangulation in finitely many steps. We introduce the notion of mutation along infinite admissible sequences and show that this induces a preorder on the set of triangulations of a fixed infinitely marked surface. Finally, in the example of the completed infinity-gon we define transfinite mutations and show that any triangulation of the completed infinity-gon can be reached from any other of its triangulations via a transfinite mutation. The content of this talk is joint work with Karin Baur.

There are several conjectures in the literature suggesting that absolute Galois groups of fields tend to be "as free as possible," given their "almost-abelian" data.
This can be made precise in various ways, one of which is via the notion of "1-formality" arising in analogy with the concept in rational homotopy theory.
In this talk, I will discuss several examples which illustrate this phenomenon, as well as some surprising diophantine consequences.
This discussion will also include some recent joint work with Guillot, Mináč, Tân and Wittenberg, concerning the vanishing of mod-2 4-fold Massey products in the Galois cohomology of number fields.

Averaging, either spatial or temporal, is a powerful technique in complex multi-scale systems.

However, in some situations it can be difficult to justify.

For example, many real-world networks in technology, engineering and biology have a function and exhibit dynamics that cannot always be adequately reproduced using network models given by the smooth dynamical systems and fixed network topology that typically result from averaging. Motivated by examples from neuroscience and engineering, we describe a model for what we call a "functional asynchronous network". The model allows for changes in network topology through decoupling of nodes and stopping and restarting of nodes, local times, adaptivity and control. Our long-term goal is to obtain an understanding of structure (why the network works) and how function is optimized (through bifurcation).

We describe a prototypical theorem that yields a functional decomposition for a large class of functional asynchronous networks. The result allows us to express the function of a dynamical network in terms of individual nodes and constituent subnetworks.

There are several conjectures in the literature suggesting that absolute Galois groups of fields tend to be "as free as possible," given their "almost-abelian" data.
This can be made precise in various ways, one of which is via the notion of "1-formality" arising in analogy with the concept in rational homotopy theory.
In this talk, I will discuss several examples which illustrate this phenomenon, as well as some surprising diophantine consequences.
This discussion will also include some recent joint work with Guillot, Mináč, Tân and Wittenberg, concerning the vanishing of mod-2 4-fold Massey products in the Galois cohomology of number fields.

We consider the Cauchy (or steepest descent) method with exact line search applied to a strongly convex function with Lipschitz continuous gradient. We establish the exact worst-case rate of convergence of this scheme, and show that this worst-case behavior is exhibited by a certain convex quadratic function. We also give worst-case complexity bound for a noisy variant of gradient descent method. Finally, we show that these results may be applied to study the worst-case performance of Newton's method for the minimization of self-concordant functions.

The proofs are computer-assisted, and rely on the resolution of semidefinite programming performance estimation problems as introduced in the paper [Y. Drori and M. Teboulle.  Performance of first-order methods for smooth convex minimization: a novel approach. Mathematical Programming, 145(1-2):451-482, 2014].

Joint work with F. Glineur and A.B. Taylor.

In this talk I will present some answers to the question when every specialisation from a \kappa-saturated extension of 
a Zariski structure is \kappa-universal? I will show that for algebraically closed fields, all specialisations from a \kappa-
saturated extension is \kappa-universal. More importantly, I will consider this question for finite and infinite covers of
Zariski structures. In these cases I will present a counterexample to show that there are covers of Zariski structures 
which have specialisations from a \kappa-saturated extension that are not \kappa-universal. I will present some natural 
conditions on the fibres under which all specialisations from a \kappa-saturated extension of a cover is \kappa-universal. 
I will explain how this work points towards a prospective Ladder Theorem for Specialisations and explain difficulties and 
further works that needs to be considered.
 

In recognition of a lifetime's contribution across the mathematical sciences, we are initiating a series of annual Public Lectures in honour of Roger Penrose. The first lecture will be given by his long-time collaborator and friend Stephen Hawking.

Registration will open at 10am on 4 January 2017. Please email:

@email from that time only.

When registering please give your name and affiliation - your position, department & organisation/institution as appropriate. Or if you are a member of the General Public, please say so. Places will be allocated on a first come, first served basis with only one place per person. We will only be able to respond if you have a place or are on the waiting list.

We will be podcasting the lecture live. More details to follow.

I'll show how a simple universal property attaches a category of derived manifolds to any category with finite products and some suitable notion of "topology". Starting with the category of real Euclidean spaces and infinitely differentiable maps yields the category of derived smooth manifolds studied by D. Spivak and others, while starting with affine spaces over some ring and polynomial maps produces a flavour of the derived algebraic geometry of Lurie and Toen-Vezzosi.

I'll motivate this from the differentiable setting by showing that the universal property easily implies all of D. Spivak's axioms for being "good for intersection theory on manifolds".

Consider the following particle system. We are given a uniform random rooted tree on vertices labelled by $[n] = \{1,2,\ldots,n\}$, with edges directed towards the root. Each node of the tree has space for a single particle (we think of them as cars). A number $m \le n$ of cars arrive one by one, and car $i$ wishes to park at node $S_i$, $1 \le i \le m$, where $S_1, S_2, \ldots, S_m$ are i.i.d. uniform random variables on $[n]$. If a car wishes to park at a space which is already occupied, it follows the unique path oriented towards the root until it encounters an empty space, in which case it parks there; if there is no empty space, it leaves the tree. Let $A_{n,m}$ denote the event that all $m$ cars find spaces in the tree. Lackner and Panholzer proved (via analytic combinatorics methods) that there is a phase transition in this model. Set $m = \lfloor \alpha n \rfloor$. Then if $\alpha \le 1/2$, $\mathbb{P}(A_{n,\lfloor \alpha n \rfloor}) \to \frac{\sqrt{1-2\alpha}}{1-\alpha}$, whereas if $\alpha > 1/2$ we have $\mathbb{P}(A_{n,\lfloor \alpha n \rfloor}) \to 0$. In this talk, we will give a probabilistic explanation for this phenomenon, and an alternative proof via the objective method.

Joint work with Christina Goldschmidt.