Past Forthcoming Seminars

21 November 2017
14:30
Zdenek Dvorak
Abstract

A class C of graphs has polynomial expansion if there exists a polynomial p such that for every graph G from C and for every integer r, each minor of G obtained by contracting disjoint subgraphs of radius at most r is p(r)-degenerate. Classes with polynomial expansion exhibit interesting structural, combinatorial, and algorithmic properties. In the talk, I will survey these properties and propose further research directions.

  • Combinatorial Theory Seminar
21 November 2017
14:30
Andrew Thompson
Abstract

I will describe a novel algorithm for computing the Walsh Hadamard Transform (WHT) which consists entirely of Haar wavelet transforms. The algorithm shares precisely the same serial complexity as the popular divide-and-conquer algorithm for the WHT. There is also a natural way to parallelize the algorithm which appears to have a number of attractive features.

  • Numerical Analysis Group Internal Seminar
21 November 2017
14:00
Joseph Field
Abstract

Medical imaging is a key diagnostic tool, and is paramount for disease detection and for patient monitoring during ongoing care. Often, to reduce the amount of radiation that a patient is subjected to, there is a strong incentive to consider image reconstruction from incomplete sets of measurements, and so the imaging process is formulated as a compressed sensing problem.

In this talk, we will focus on compressed sensing for digital tomosynthesis (DTS), in which three-dimensional images are reconstructed from a set of two-dimensional X-ray projections. We first discuss a reconstruction approach for static bodies, with a particular interest in the choice of basis for the image representation. We will then focus on the need for accurate image reconstructions when the body of interest is not stationary, but is undergoing simple motion, discussing two different approaches for tackling this dynamic problem.

  • Numerical Analysis Group Internal Seminar
21 November 2017
12:00
Alexander Strohmaier
Abstract

I will review some classical results on geometric scattering
theory for linear hyperbolic evolution equations
on globally hyperbolic spacetimes and its relation to particle and charge
creation in QFT. I will then show that some index formulae for the
scattering matrix can be interpreted as a special case of the  Lorentzian
analog of the Atyiah-Patodi-Singer index theorem. I will also discuss a
local version of this theorem and its relation to anomalies in QFT.
(Joint work with C. Baer)

  • Quantum Field Theory Seminar
21 November 2017
12:00
Abstract

A great deal of effort has gone into trying to model social influence --- including the spread of behavior, norms, and ideas --- on networks. Most models of social influence tend to assume that individuals react to changes in the states of their neighbors without any time delay, but this is often not true in social contexts, where (for various reasons) different agents can have different response times. To examine such situations, we introduce the idea of a timer into threshold models of social influence. The presence of timers on nodes delays the adoption --- i.e., change of state --- of each agent, which in turn delays the adoptions of its neighbors. With a homogeneous-distributed timer, in which all nodes exhibit the same amount of delay, adoption delays are also homogeneous, so the adoption order of nodes remains the same. However, heterogeneously-distributed timers can change the adoption order of nodes and hence the "adoption paths" through which state changes spread in a network. Using a threshold model of social contagions, we illustrate that heterogeneous timers can either accelerate or decelerate the spread of adoptions compared to an analogous situation with homogeneous timers, and we investigate the relationship of such acceleration or deceleration with respect to timer distribution and network structure. We derive an analytical approximation for the temporal evolution of the fraction of adopters by modifying a pair approximation of the Watts threshold model, and we find good agreement with numerical computations. We also examine our new timer model on networks constructed from empirical data.

Link to arxiv paper: https://arxiv.org/abs/1706.04252

20 November 2017
17:00
Professor Kate Smith-Miles
Abstract

Many industrial optimisation problems involve the challenging task of efficiently searching for optimal decisions from a huge set of possible combinations. The optimal solution is the one that best optimises a set of objectives or goals, such as maximising productivity while minimising costs. If we have a nice mathematical equation for how each objective depends on the decisions we make, then we can usually employ standard mathematical approaches, such as calculus, to find the optimal solution. But what do we do when we have no idea how our decisions affect the objectives, and thus no equations? What if all we have is a small set of experiments, where we have tried to measure the effect of some decisions? How do we make use of this limited information to try to find the best decisions?

This talk will present a common industrial optimisation problem, known as expensive black box optimisation, through a case study from the manufacturing sector. For problems like this, calculus can’t help, and trial and error is not an option! We will introduce some methods and tools for tackling expensive black-box optimisation. Finally, we will discuss new methodologies for assessing the strengths and weaknesses of optimisation methods, to ensure the right method is selected for the right problem.

20 November 2017
15:45
Mark Powell
Abstract

I will talk about the diffeomorphism classification of 4-manifolds up to 
connected sums with the complex projective plane, and how the resulting 
equivalence class of a manifold can be detected by algebraic topological 
invariants of the manifold.  I may also discuss related results when one 
takes connected sums with another favourite 4-manifold, S^2 x S^2, instead.

20 November 2017
15:45
ANDREY KORMILITZIN
Abstract

Recurrent major mood episodes and subsyndromal mood instability cause substantial disability in patients with bipolar disorder. Early identification of mood episodes enabling timely mood stabilisation is an important clinical goal. The signature method is derived from stochastic analysis (rough paths theory) and has the ability to capture important properties of complex ordered time series data. To explore whether the onset of episodes of mania and depression can be identified using self-reported mood data.

  • Stochastic Analysis Seminar
20 November 2017
14:45
Abstract

In this joint work with Amandine Aftalion we study the minimisers of an energy functional in two-dimensions describing a rotating two-component condensate. This involves in particular separating a line-energy term and a vortex term which have different orders of magnitude, and requires new estimates for functionals of the Cahn-Hilliard (or Modica-Mortola) type.

  • Partial Differential Equations Seminar

Pages