Past

*****     PLEASE NOTE THIS SEMINAR WILL TAKE PLACE ON MONDAY 17TH JUNE 2013     *****

Computing is an exercise of discretization of the real world into space, time, and value. While discretization in time and space is well understood in the sciences, discretization of value is a scientific domain full of opportunity. Maxeler's Multiscale Dataflow Computing allows the programmer to finely trade off discretization of value with real performance measured in wallclock time.

In this talk I will show the connection between discretization of value and Kolmogorov Complexity on one hand and approximation theory on the other. Utilizing the above concepts together with building general purpose computing systems based on dataflow concepts, has enabled us to deliver production systems for Oil & Gas imaging (modelling, multiple elimination, RTM, Geomechanics), Finance Risk (derivatives modelling and scenario analysis), as well as many scientific application such as computing weather models, Astrochemistry, and brain simulations. Algorithms range from 3D Finite Difference, Finite Elements (sparse matrix solvers), pattern matching, conjugate gradient optimization, to communication protocols and bitcoin calculations. Published results of users of our machines show a 20-50x total advantage in computations per unit space (1U) and computations per Watt.

*****     PLEASE NOTE THIS SEMINAR WILL TAKE PLACE ON MONDAY 17TH JUNE 2013     *****

Advanced models such as Lévy models require advanced numerical methods for developing efficient pricing algorithms. Here we focus on PIDE based methods. There is a large arsenal of numerical methods for solving parabolic equations that arise in this context. Especially Galerkin and Galerkin inspired methods have an impressive potential. In order to apply these methods, what is required is a formulation of the equation in the weak sense.

We therefore classify Lévy processes according to the solution spaces of the associated parabolic PIDEs. We define the Sobolev index of a Lévy process by a certain growth condition on the symbol. It follows that for Lévy processes with a certain Sobolev index b the corresponding evolution problem has a unique weak solution in the Sobolev-Slobodeckii space with index b/2. We show that this classification applies to a wide range of processes. Examples are the Brownian motion with or without drift, generalised hyperbolic (GH), CGMY and (semi) stable Lévy processes.

A comparison of the Sobolev index with the Blumenthal-Getoor index sheds light on the structural implication of the classification. More precisely, we discuss the Sobolev index as an indicator of the smoothness of the distribution and of the variation of the paths of the process.

An application to financial models requires in particular to admit pure jump processes as well as unbounded domains of the equation. In order to deal at the same time with the typical payoffs which can arise, the weak formulation of the equation has to be based on exponentially weighted Sobolev-Slobodeckii spaces. We provide a number of examples of models that are covered by this general framework. Examples of options for which such an analysis is required are calls, puts, digital and power options as well as basket options.

The talk is based on joint work with Ernst Eberlein.

Colloidal suspensions do not freeze uniformly; rather, the frozen phase (e.g. ice) becomes segregated, trapping bulk regions of the colloid within, which leads to a fascinating variety of patterns that impact both nature and technology. Yet, despite the central importance of ice segregation in several applications, the physics are poorly understood in concentrated systems and continuum models are available only in restricted cases. I will discuss a particular set of steady-state ice segregation patterns that were obtained during a series of directional solidification experiments on concentrated suspensions. As a case study, I will focus of one of these patterns, which is very reminiscent of ice lenses observed in freezing soils and rocks; a form of ice segregation which underlies frost heave and frost weathering. I will compare these observations against an extended version of a 'rigid-ice' model used in previous frost heave studies. The comparison between theory and experiment is qualitatively correct, but fails to quantitatively predict the ice-lensing pattern. This leaves open questions about the validity of the assumptions in 'rigid-ice' models. Moreover, 'rigid-ice' models are inapplicable to the study of other ice segregation patterns. I conclude this talk with some possibilities for a more general model of freezing colloidal suspensions.

Please see http://www.cs.ox.ac.uk/seminars/CompBioPublicSeminars/

The optimal function spaces for the local-in-time well-posedness theory of the Navier-Stokes equations are closely related to the scaling symmetry of the equations. This might appear to be tied to particular methods used in the proofs, but in this talk we will raise the possibility that the equations are actually ill-posed for finite-energy initial data just at the borderline of some of the most benign scale-invariant spaces. This is related to debates about the adequacy of the Leray-Hopf weak solutions for predicting the time evolution of the system. (Joint work with Hao Jia.)

• Fabian Spill - Stochastic and continuum modelling of angiogenesis
• Matt Saxton - Modelling the contact-line dynamics of an evaporating drop
• Almut Eisentraeger - Water purification by (high gradient) magnetic separation

Note early start to avoid a clash with the OCCAM group meeting.

Sela showed that the theory of the non abelian free groups is stable. In a joint work with Sklinos, we give some characterization of the forking independence relation between elements of the free group F over a set of parameters A in terms of the Grushko and cyclic JSJ decomposition of F relative to A. The cyclic JSJ decomposition of F relative to A is a geometric group theory tool that encodes all the splittings of F as an amalgamated product (or HNN extension) over cyclic subgroups in which A lies in one of the factors.

So far, the circle method has been a very useful tool to prove
many cases of Manin's conjecture. Work of B. Birch back in 1961 establishes
this for smooth complete intersections in projective space as soon as the
number of variables is large enough depending on the degree and number of
equations. In this talk we are interested in subvarieties of biprojective
space. There is not much known so far, unless the underlying polynomials are
of bidegree (1,1). In this talk we present recent work which combines the
circle method with the generalised hyperbola method developed by V. Blomer
and J. Bruedern. This allows us to verify Manin's conjecture for certain
smooth hypersurfaces in biprojective space of general bidegree.

Lattice rules are equal-weight quadrature/cubature rules for the approximation of multivariate integrals which use lattice points as the cubature nodes. The quality of such cubature rules is directly related to the discrepancy between the uniform distribution and the discrete distribution of these points in the unit cube, and so, they are a kind of low-discrepancy sampling points. As low-discrepancy based cubature rules look like Monte Carlo rules, except that they use cleverly chosen deterministic points, they are sometimes called quasi-Monte Carlo rules.

\\

\\

The talk starts by motivating the usage of Monte Carlo and then quasi-Monte Carlo methods after which some more recent developments are discussed. Topics include: worst-case errors in reproducing kernel Hilbert spaces, weighted spaces and the construction of lattice rules and sequences.

\\

\\

In the minds of many, quasi-Monte Carlo methods seem to share the bad stanza of the Monte Carlo method: a brute force method of last resort with slow order of convergence, i.e., $O(N^{-1/2})$. This is not so.

While the standard rate of convergence for quasi-Monte Carlo is rather slow, being $O(N^{-1})$, the theory shows that these methods achieve the optimal rate of convergence in many interesting function spaces.

E.g., in function spaces with higher smoothness one can have $O(N^{-\alpha})$, $\alpha > 1$. This will be illustrated by numerical examples.

More than half of the world's financial markets use a limit order book

mechanism to facilitate trade. For markets where trade is conducted

through a central counterparty, trading platforms disseminate the same

information about the limit order book to all market participants in

real time, and all market participants are able to trade with all

others. By contrast, in markets that operate under bilateral trade

agreements, market participants are only able to view the limit order

book activity from their bilateral trading partners, and are unable to

trade with the market participants with whom they do not possess a

bilateral trade agreement. In this talk, I discuss the implications

of such a market structure for price formation. I then introduce a

simple model of such a market, which is able to reproduce several

important empirical properties of traded price series. By identifying and

matching several robust moment conditions to the empirical data, I make

model-based inference about the network of bilateral trade partnerships

in the market. I discuss the implications of these findings for market

stability and suggest how the regulator might improve market conditions

by implementing simple restrictions on how market participants form their

bilateral trade agreements.

Symplectic reflection algebras are an important class of algebras related to an incredibly high number of different topics such as combinatorics, noncommutative geometry and resolutions of singularities and have themselves a rich representation theory. We will recall their definition and classification coming from symplectic reflection groups and outline some of the results that have characterised their representation theory over the last decade, focusing on the link with representations of quivers.

We review the theory of $E_n$-algebras (roughly, algebras with $n$ compatible multiplications) and discuss $E_n$-deformation theory in the sense of Lurie. We then describe, to the best of our ability, the use of $E_n$-deformation theory in the on-going work of Calaque, Pantev, Toen, Vezzosi, and Vaquie about deformation quantization of derived stacks with shifted Poisson structure.

We review the theory of $E_n$-algebras (roughly, algebras with $n$ compatible multiplications) and discuss $E_n$-deformation theory in

the sense of Lurie. We then describe, to the best of our ability, the use of $E_n$-deformation theory in the on-going work of Calaque, Pantev, Toen,

Vezzosi, and Vaquie about deformation quantization of derived stacks with shifted Poisson structure.

***** PLEASE NOTE THAT THIS WILL TAKE PLACE ON TUESDAY 11TH JUNE ****

Signal transduction pathways are sophisticated information processing machinery in the cell that is arguably taking advantage of highly non-idealistic natures of intracellular environments for its optimum operations. In this study, we focused on effects of intracellular macromolecular crowding on signal transduction pathways using single-particle simulations. We have previously shown that rebinding of kinases to substrates can remarkably increase processivity of dual-phosphorylation reactions and change both steady-state and transient responses of the reaction network. We found that molecular crowding drastically enhances the rebinding effect, and it shows nonlinear time dependency although kinetics at the macroscopic level still follows the conventional model in dilute media. We applied the rate law revised on the basis of these calculations to MEK-ERK system and compared it with experimental measurements.

***** PLEASE NOTE THAT THIS WILL TAKE PLACE ON TUESDAY 11TH JUNE ****

The class of sofic groups was introduced by Gromov in 1999. It
includes all residually finite and all amenable groups. In fact, no group has been proved
not to be sofic, so it remains possible that all groups are sofic. Their
defining property is that, roughly speaking, for any finite subset F of
the group G, there is a map from G to a finite symmetric group, which is
approximates to an injective homomorphism on F. The widespread interest in
these group results partly from their connections with other branches of
mathematics, including dynamical systems. In the talk, we will concentrate
on their definition and algebraic properties.

In this talk, we consider the setting: a random realization of an evolving dynamical system, and explain how, using notions common in the theory of rough paths, such as the signature, and shuffle product, one can provide a new united approach to the fundamental problem of predicting the conditional distribution of the near future given the past. We will explain how the problem can be reduced to a linear regression and least squaresanalysis. The approach is clean and systematic and provides a clear gradation of finite dimensional approximations. The approach is also non-parametric and very general but still presents itself in computationally tractable and flexible restricted forms for concrete problems. Popular techniques in time series analysis such as GARCH can be seen to be restricted special cases of our approach but it is not clear they are always the best or most informative choices. Some numerical examples will be shown in order to compare our approach and standard time series models.

This talk is based on a joint work with Céline Labart. We are interested in this paper in the numerical simulation of solutions to Backward Stochastic Differential Equations. There are several existing methods to handle this problem and one of the main difficulty is always to compute conditional expectations.

Even though our approach can also be applied in the case of the dynamic programmation equation, our starting point is the use of Picard's iterations that we write in a forward way

In order to compute the conditional expectations, we use Wiener Chaos expansions of the underlying random variables. From a practical point of view, we keep only a finite number of terms in the expansions and we get explicit formulas.

We will present numerical experiments and results on the error analysis.