Past

There will be three discussion meetings based on aspects of the

programme open to all internal project members. Others interested in

attending should contact Carlos Mora-Corral.

Team meetings, held roughly every four weeks, are open to anyone who is

interested. OxMOS post docs and Dphil students will give updates on the

research.

If new particles are produced at the LHC, it is vital that we can extract as much information as possible from them about the underlying theory.  I will discuss some recent work on extracting spin information from invariant mass distributions of new particles.  I will then introduce the Kullback-Leibler method of quantifying our ability to distinguish different scenarios.  

Whether the 3D incompressible Euler or Navier-Stokes equations

can develop a finite time singularity from smooth initial data has been

an outstanding open problem. Here we review some existing computational

and theoretical work on possible finite blow-up of the 3D Euler equations.

We show that the geometric regularity of vortex filaments, even in an

extremely localized region, can lead to dynamic depletion of vortex

stretching, thus avoid finite time blowup of the 3D Euler equations.

Further, we perform large scale computations of the 3D Euler equations

to re-examine the two slightly perturbed anti-parallel vortex tubes which

is considered as one of the most attractive candidates for a finite time

blowup of the 3D Euler equations. We found that there is tremendous dynamic

depletion of vortex stretching and the maximum vorticity does not grow faster

than double exponential in time. Finally, we present a new class of solutions

for the 3D Euler and Navier-Stokes equations, which exhibit very interesting

dynamic growth property. By exploiting the special nonlinear structure of the

equations, we prove nonlinear stability and the global regularity of this class of solutions.

Self-interacting diffusions are solutions to SDEs with a drift term depending

on the process and its normalized occupation measure $\mu_t$ (via an interaction

potential and a confinement potential): $$\mathrm{d}X_t = \mathrm{d}B_t -\left(

\nabla V(X_t)+ \nabla W*{\mu_t}(X_t) \right) \mathrm{d}t ; \mathrm{d}\mu_t = (\delta_{X_t}

- \mu_t)\frac{\mathrm{d}t}{r+t}; X_0 = x,\,\ \mu_0=\mu$$ where $(\mu_t)$ is the

process defined by $$\mu_t := \frac{r\mu + \int_0^t \delta_{X_s}\mathrm{d}s}{r+t}.$$

We establish a relation between the asymptotic behaviour of $\mu_t$ and the

asymptotic behaviour of a deterministic dynamical flow (defined on the space of

the Borel probability measures). We will also give some sufficient conditions

for the convergence of $\mu_t$. Finally, we will illustrate our study with an

example in the case $d=2$.

A wide variety of problems arising in applications require the sampling of a

probability measure on the space of functions. Examples from econometrics,

signal processing, molecular dynamics and data assimilation will be given.

In this situation it is of interest to understand the computational

complexity of MCMC methods for sampling the desired probability measure. We

overview recent results of this type, highlighting the importance of measures

which are absolutely continuous with respect to a Guassian measure.

We consider two-stage inflationary models in which a superheavy scale F-term hybrid inflation is followed by an intermediate scale modular inflation. We confront these models with the restrictions on the power spectrum of density perturbations P_R and the spectral index n_s from the recent data within the power-law cosmological model with cold dark matter and a cosmological constant. We show that these restrictions can be met provided that the number of e-foldings N_HI* of the pivot scale k*=0.002/Mpc during hybrid inflation is appropriately restricted. The additional e-foldings required for solving the horizon and flatness problems can be naturally generated by the subsequent modular inflation realized by a string axion.
   

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be ''close enough'' to the dynamics of the continuous system (which is typically easier to analyze) provided that small -- hence many -- time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought.

In this talk we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency.

We will speak about the problem of classification of self-similar groups. The

main focus will be on groups generated by three-state  automata over an

alphabet on two letters. Numerous examples will be presented, as well as some

results concerning this class of groups.