- 19.3. 15:15 Ari-Pekka Perkkiö (LMU Munich): Optional projection in duality – M203
In this talks we characterize topological duals of Frechet spaces of stochastic processes. This is done by analyzing the optional projection on spaces of cadlag processes whose pathwise supremum norm belongs to a given Frechet space of random variables. We employ functional analytic arguments that unify various results in the duality theory of stochastic processes and also yields new ones of both practical and theoretical interest. In particular, we find an explicit characterization of dual of the Banach space of adapted cadlag processes of class (D). When specialized to regular processes, we obtain a simple proof of a result of Bismut on projections of continuous processes.

- 7.2. 17:00 Stanislav Nagy (Charles University): Unified approach to the theory of functional data depth – M3 (M234)
Depth has become a quite popular concept in functional data analysis. In the talk we discuss its general framework. We show that most known functional depths can be classified into few groups, within which they share similar theoretical properties. We focus on uniform consistency results for the sample versions of these functionals, and demonstrate that some well-known approaches to depth assessment are hardly theoretically adequate.

- 7.2. 16:15 Joni Virta (Aalto SCI): Independent component analysis of multivariate functional data – M3 (M234)
We extend a classic method of independent component analysis, the fourth order blind identification (FOBI), to vector-valued functional data. The use of multivariate instead of univariate functions allows for natural definitions for both the marginals of a random function and their mutual independence. Our model assumes that the observed functions are mixtures of latent independent functions residing in suitable Hilbert spaces, mixed with a bounded linear operator from the product space to itself. To enable the inversion of the covariance operator we make the assumption that the dependency between the mixed component functions lies in a finite-dimensional subspace. In this subspace we define fourth cross-cumulant operators and use them to construct a novel Fisher consistent method for solving the independent component problem for vector-valued functions. Finally, both simulations and an application to hand gesture data set are used to demonstrate the advantages of the proposed method over its closest competitors.

- 7.2. 15:00 Sami Helander (Aalto SCI): On typicality of functional observations – M3 (M234)
Most of the functional depth approaches presented in the literature are solely interested in the -pointwise- centrality of the observations as a measure of (global) centrality. As a result, they are missing some important features inherent to functional data such as variation in shape, roughness or range. Thus, due to the richness of functional data, we opt to talk about typicality rather than centrality of an observation. We discuss assessing typicality of functional observations. Moreover, we provide a new concept of depth for functional data. It is based on a new multivariate Pareto depth applied after mapping the functional observations to a vector of statistics of interest. These quantities allow incorporating the inherent features of the distribution, such as shape or roughness. In particular, in contrast to most existing functional depths, the method is not limited to centrality only. Properties of the new depth are explored and the benefits of a flexible choice of features are illustrated.

- 7.2. 14:15 Germain Van Bever (Université libre de Bruxelles): Halfspace depths for scatter, concentration and shape matrices – M3 (M234)
We propose halfspace depth concepts for scatter, concentration and shape matrices. For scatter matrices, our concept extends the one from Chen, Gao and Ren (2015) to the non-centered case, and is in the same spirit as the one in Zhang (2002). Rather than focusing, as in these earlier works, on deepest scatter matrices, we thoroughly investigate the properties of the proposed depth and of the corresponding depth regions. We do so under minimal assumptions and, in particular, we do not restrict to elliptical distributions nor to absolutely continuous distributions. Interestingly, fully understanding scatter halfspace depth requires considering different geometries/topologies on the space of scatter matrices. We also discuss, in the spirit of Zuo and Serfling (2000), the structural properties a scatter depth should satisfy, and investigate whether or not these are met by the proposed depth. As mentioned above, companion concepts of depth for concentration matrices and shape matrices are also proposed and studied.

- 30.1. 10:00 Teemu Murtola (University of Tampere, Faculty of Medicine and Life Sciences): Benefits of cholesterol-lowering statins in prostate cancer – M3 (M234)
Many commonly used drugs target intracellular signaling pathways
that have importance in carcinogenesis and progression of cancer. One
example is the mevalonate pathway which is targeted by
cholesterol-lowering statin drugs. Examining possible anticancer
effects of drug groups established for other indications requires
comprehensive multidisciplinary approach including epidemiological
studies to explore associations with cancer risk and prognosis,
experimental laboratory studies to elucidate possible anticancer
mechanisms and ultimately clinical trials to test for clinical
benefit. This lecture describes such project testing statins' effects
against prostate cancer.

- 29.1. 15:15 Jari Miettinen (Aalto ELEC): Independent component analysis for graph data using graph-autocorrelation matrices – M3 (M234)
The first independent component analysis estimators were designed for i.i.d. data, and they assume that at most one of the independent components has Gaussian density. Afterwards, methods have been developed for data with dependencies between the observations, including for example time series and spatial data. Those methods utilize solely or partially the structure of the data. For the most general case, graph data, Blochl et al. introduced an ICA estimator called GraDe (graph decorrelation) which uses approximate joint diagonalization of graph-autocorrelation matrices. GraDe contains the best-known time series and spatial methods as special cases. The structure of the graph is given in an adjacency matrix which is to be known or estimated prior to performing the ICA task. As one example in our paper on the effects of adjacency matrix estimation errors in graph signal processing, we study how the GraDe method is affected by misspecification of the adjacency matrix, using both theoretical and simulation results.

- 22.1. 15:15 Mindaugas Bloznelis (U Vilnius): Local probabilities of randomly stopped sums of power law lattice random variables and clustering patterns in complex networks – M3 (M234)
Let $X_1$ and $N$ be non-negative integer valued power law random variables.
For a randomly stopped sum $S_N=X_1+\cdots+X_N$ of independent and identically distributed copies of $X_1$ we establish a first order asymptotics of the local probabilities $P(S_N=t)$ as $t\to+\infty$. Using this result we show the
$k^{-\delta}$, $0\le \delta\le 1$ scaling of the local clustering coefficient
(of a randomly selected vertex of degree $k$) in a power law affiliation
network. http://arxiv.org/abs/1801.01035

- 19.12. 15:45 Eveliina Peltola (University of Geneva): Multiple SLEs for \kappa \leq 4 (further info) – U3
- 19.12. 14:30 Mikko Pakkanen (Imperial College London): Rough volatility: towards efficient Monte Carlo pricing and calibration (further info) – U3
- 19.12. 13:30 Roland Bauerschmidt (University of Cambridge): Eigenvectors and spectral measure of random regular graphs of fixed degree (further info) – U3
- 19.12. 11:15 Lauri Viitasaari (University of Helsinki): On model fitting and estimation of stationary processes (further info) – U3
- 19.12. 10:15 Aristides Gionis (Aalto University): Mining temporal networks (further info) – U3
- 22.8. 16:10 Hoa Ngo [Stochastic afternoon]: Information spreading in a large network – M3 (M234)
A simple mathematical model for information spreading is a complete graph where everyone knows everyone and everyone relays messages at random time instants to randomly chosen neighbours independently of each other.
In this talk we will consider information spreading in the large configuration model, which is a more advanced model. One of the key quantity analysing the rumour spreading speed is the broadcast time, the time when the rumour has reached the entire population. We will also discuss the broadcast time taking into account the passive and active users.

- 22.8. 15:10 Alex Karrila [Stochastic afternoon]: Boundary branches in a uniform random spanning tree of a planar graph – M3 (M234)
A physics principle asserts that the scaling limit of a critical lattice model, as increasingly dense lattices approximate a continuum domain, is described by a conformal field theory (CFT). The aim of this talk is to prove rigorously conformal invariance properties in the scaling limit of the uniform spanning tree (UST) of a planar graph, i.e., a tree subgraph that covers all the vertices of the original graph, chosen uniformly at random. In a spanning tree, any two vertices are connected by a unique path, called a branch. We study multiple simultaneous UST boundary-to-boundary branches between given boundary vertices, as well as the boundary visits of a single such branch. The related probabilities have conformally invariant scaling limits, and solve partial differential equations as predicted by CFT. As a collection of curves, such multiple simultaneous branches converge weakly to a conformally invariant law, called the local multiple SLE(2). These are among the first verifications of third-order PDEs of CFT, as well as convergence results to multiple SLE.

- 22.8. 14:00 Armando W. Gutiérrez [Stochastic afternoon]: The horofunction compactificacion of lp spaces and Hilbert's projective metric – M3 (M234)
The horofunction compactification is the result of making any metric space into a compact topological space
by only using the metric. The elements of this compactification have been recently shown to be very useful in the study
of limit theorems for deterministic and random dynamical systems.
In this talk I will give a complete description of the horofunction compactification of the classical lp spaces.
I will also consider Hilbert's projective metric on the standard cone of positive real vectors, and describe its horofunction compactification. The latter will be used to give a new proof of the well-known Perron theorem.

- 14.8. 15:15 Mikko Kivelä (Aalto University): Randomized reference models and spreading in temporal networks – M3 (M234)
For a long time network science concentrated on static graphs as representations of networked systems. This abstraction was used to analyse shortest path lengths, spreading of disease or information in networks, and many other things. Often the underlying assumption behind such analysis was that the activation of nodes and links is controlled by homogeneous Poisson processes. More recently there has been growing interest in analysing 'temporal networks' where the link activation times are determined directly from data. In this talk I will illustrate how this approach can be used to analyse a large communication network with hundreds of millions of link activation events. I will focus on how 'reference models', in which the data is shuffled in various ways, can be used for this data and how they are used in the literature on temporal networks in general. I will also discuss the challenges in the literature that are caused by the sudden increase in use of such shuffling methods of temporal network.