14:15
14:15
"Extracting information from the signature of a financial data stream"
Abstract
Market events such as order placement and order cancellation are examples of the complex and substantial flow of data that surrounds a modern financial engineer. New mathematical techniques, developed to describe the interactions of complex oscillatory systems (known as the theory of rough paths) provides new tools for analysing and describing these data streams and extracting the vital information. In this paper we illustrate how a very small number of coefficients obtained from the signature of financial data can be sufficient to classify this data for subtle underlying features and make useful predictions.
This paper presents financial examples in which we learn from data and then proceed to classify fresh streams. The classification is based on features of streams that are specified through the coordinates of the signature of the path. At a mathematical level the signature is a faithful transform of a multidimensional time series. (Ben Hambly and Terry Lyons \cite{uniqueSig}), Hao Ni and Terry Lyons \cite{NiLyons} introduced the possibility of its use to understand financial data and pointed to the potential this approach has for machine learning and prediction.
We evaluate and refine these theoretical suggestions against practical examples of interest and present a few motivating experiments which demonstrate information the signature can easily capture in a non-parametric way avoiding traditional statistical modelling of the data. In the first experiment we identify atypical market behaviour across standard 30-minute time buckets sampled from the WTI crude oil future market (NYMEX). The second and third experiments aim to characterise the market "impact" of and distinguish between parent orders generated by two different trade execution algorithms on the FTSE 100 Index futures market listed on NYSE Liffe.
A Set of Characteristic Functions on the Space of Signatures
Abstract
Abstract: The expected signature is often viewed as a direct analogue of the Laplace transform, and as such it has been asked whether, under certain conditions, it may determine the law of a random signature. In this talk we first introduce a meaningful topology on the space of (geometric) rough paths which allows us to study it as a well-defined probability space. With the help of compact symplectic Lie groups, we then define a set of characteristic functions and show that two random variables in this space are equal in law if and only if they agree on each characteristic function. We finally show that under very general boundedness conditions, the value of each characteristic function is completely determined by the expected signature, giving an affirmative answer to the aforementioned question in many cases. In particular, we demonstrate that the Stratonovich signature is completely determined in law by its expected signature, and show how a similar technique can be used to demonstrate convergence in law of random signatures.
Background material: http://arxiv.org/abs/1307.3580
Learning an evolving system using Rough Paths Theory
Abstract
''Regression analysis aims to use observational data from multiple observations to develop a functional relationship relating explanatory variables to response variables, which is important for much of modern statistics, and econometrics, and also the field of machine learning. In this paper, we consider the special case where the explanatory variable is a stream of information, and the response is also potentially a stream. We provide an approach based on identifying carefully chosen features of the stream which allows linear regression to be used to characterise the functional relationship between explanatory variables and the conditional distribution of the response; the methods used to develop and justify this approach, such as the signature of a stream and the shue product of tensors, are standard tools in the theory of rough paths and seem appropriate in this context of regression as well and provide a surprisingly unified and non-parametric approach.''
Ascending HNN extensions and the BNS invariant
Abstract
Boundaries of Random Walks
Abstract
I will talk about random walks on groups and define the Poisson boundary of such. Studying it gives criteria for amenability or growth. I will outline how this can be used and describe recent related results and still open questions.
Constructing a sigma model for the symmetric product of $R^D$
Abstract
In this talk I will describe an attempt to construct a conformal field theory with target space a symmetric product of $R^D$ (referred to by physicists as orbifold sigma model). The construction uses branched covers of $S^2$ to lift the well studied formulation of a sigma model on $S^2$, in terms of vertex operator algebras, to higher genus surfaces. I will motivate and explain this construction.
Amenable hyperbolic groups
Abstract
The integers (while wonderful in many others respects) do not make for fascinating Geometric Group Theory. They are, however, essentially the only infinite finitely generated group which is both hyperbolic and amenable. In the class of locally compact topological groups, the intersection of these two notions is richer, and the major aim of this talk will be to give the structure of a classification of such groups due to Caprace-de Cornulier-Monod-Tessera, beginning with Milnor's proof that any connected Lie group admitting a left-invariant negatively curved Riemannian metric is necessarily soluble.
Some Decision Problems in Groups
Abstract
To continue the day's questions of how complex groups can be I will
be looking about some decision problems. I will prove that certain
properties of finitely presented groups are undecidable. These
properties are called Markov properties and include many nice properties
one may want a group to have. I will also hopefully go into an
algorithm of Whitehead on deciding if a set of n words generates F_n.