- 25.6. 11:15 Mihaela Mihaylova (Aalto U): Correlations studies of LDL-aggregation, LDL-lipidome and clinical data of bariatric surgery patients – M2 (M233)
Atherosclerotic cardiovascular disease (ASCVD), also known as coronary artery disease (CAD), is one of the leading causes of death in the world. A consensus has been reached that the main cause of ASCVD are low-density lipoproteins (LDL).  ASCVD develops in the innermost layer of the coronary artery wall (intima). Once LDL particles enter the wall, they are retained, modified, and accumulate there. 
There are several well-known risk factors of ASCVD, among which obesity, smoking, hypertension and LDL-cholesterol concentration in the plasma. A novel approach to assessing the risk of ASCVD however suggests that, not only the concentration, but also the quality of LDL might be associated with ASCVD.  It shows that the susceptibility of LDL particles to aggregate (in the presence of the enzyme hrSMase) varies between humans and depends on the composition of the LDL particles.  The presence of aggregation-prone LDL in the plasma was found to be associated with future coronary artery disease (CAD) deaths.  This makes investigating LDL-aggregation further particularly important.
This masters thesis studies LDL aggregation of patients who underwent bariatric surgery - a procedure performed on people with obesity, for the purpose of weight loss.
It focuses on four main points:
● Creating a nonlinear mixed-effects model of LDL-aggregation and obtaining a single quantitative measure of LDL-aggregation.
● Investigating whether there is a significant difference in LDL-aggregation in patients before and after bariatric surgery
● Studying correlations between LDL-aggregation and lipids from the LDL-lipidome, as well as correlations with clinical data of bariatric surgery patients.
● Investigating whether there is a significant difference in the LDL-lipidome lipids and clinical parameters in the patients before and after the operation
The presentation will discuss the progress made on the project. It will cover the following points.
● Problem Overview: Theory and Data
● Solution Plan
● Step 1: Modelling of LDL-aggregation
- Nonlinear Mixed-Effect Models
- Modelling using the Bayesian approach
- Modelling Problems
- Possible Solutions
 George, S. and Johnson, J. (2010). Atherosclerosis: Molecular and Cellular Mechanisms. Weinheim: Wiley-VCH-Verl.
 Ference, B. et al (2017). Low-density lipoproteins cause atherosclerotic cardiovascular disease. 1. Evidence from genetic, epidemiologic, and clinical studies. A consensus statement from the European Atherosclerosis Society Consensus Panel. European Heart Journal, 38(32), pp.2459-2472.
 Ruuth, M. et al (2018). Susceptibility of low-density lipoprotein particles to aggregate depends on particle lipidome, is modifiable, and associates with future cardiovascular deaths. European Heart Journal, 39(27),pp.2562-2573.
- 18.6. 14:15 Tatu Hyytiäinen: Changepoint detection in network activity measurement data (diploma thesis talk). – M2 (M233)
- 7.6. 12:15 Maximilien Dreveton (Inria Sophia Antipolis): Almost exact recovery in label spreading – M2 (M233)
In semi-supervised graph clustering setting, an expert provides cluster membership of few nodes. This little amount of information allows one to achieve high accuracy clustering using efficient computational procedures. Our main goal is to provide a theoretical justification why the graph-based semi-supervised learning works very well. Specifically, for the Stochastic Block Model in the moderately sparse regime, we prove that popular semi-supervised clustering methods like Label Spreading achieve asymptotically almost exact recovery as long as the fraction of labeled points does not go to zero and the average degree goes to infinity.
- 20.5. 15:15 MSc Hoa Ngo (Aalto U): First passage percolation on mixed sparse random graphs with two types of nodes – M3 (M234)
A mixed graph is a graph consisting of both undirected edges and directed edges. This talk discusses first passage percolation on a connected mixed random graph with a given degree sequence, where an undirected edge is formed between type-1 nodes and a directed edge between type-1 and type-2 nodes. Weights on edges are assumed to be independent and exponentially distributed. We analyze a flooding time, which is the minimum time that a uniformly chosen node reaches all other nodes. We derive an asymptotic formula for the flooding time as the number of nodes tend to infinity. As an application, we discuss continuous time information spreading on a random regular graph, where we also take into account the impact of passive nodes. Type-1 nodes can be interpreted as active message spreaders and type-2 nodes can be interpreted as passive receivers which may only receive the message. In this setting we derive an asymptotic formula for the flooding time which is also called the broadcast time in the literature.
- 6.5. 15:15 Dr Augusto Gerolin (VU Amsterdam): An optimal transportation approach for the Schrödinger bridge problem and convergence of the Sinkhorn algorithm – M3 (M234)
- 21.3. 10:15 Dr Elena Magnanini (U Modena): On the scaled cumulant generating function of the triangle observable in the dense Erdӧs-Rényi model (further info) – M3 (M234)
The computation of the probability of rare events is the main purpose of large deviations theory. For instance, in a simple case, one can consider the rare event in which a sum of i.i.d. Bernoulli variables attains a value which is larger than its average. A completely different and much more difficult problem, is the computation of large deviations probability of nonlinear functionals of the Bernoulli variables, e.g. cubic polynomials. A case in which such nonlinear problems arise is, for instance, the study of complex networks. In this talk I will present the behavior of the so-called scaled cumulant generating function of the number of triangles of an Erdӧs-Rényi random graph (dense case). The scaled cumulant generating function is strictly connected with the theory of large deviations since, when it is possible to apply the Gärtner-Ellis theorem, it turns out to be the Legendre transform of the rate function. More precisely, the aim of this talk is twofold. On one hand, to describe a modified version of a known Monte Carlo method, called Cloning algorithm, tailored for approximating the scaled cumulant generating function of an additive observable in the framework of random graphs. One the other hand, keeping the focus on the triangle observable, to present the numerical investigation performed in the region where the analytical expression of such function is not known (replica breaking regime).
- 19.12.2018 16:15 Christian Webb (Aalto University): When is a random variable close to being normally distributed? (further info) – U3
- 19.12.2018 15:15 Alexandre Proutiere (KTH, Stockholm): Clustering in Block Markov Chains (further info) – U3
- 19.12.2018 14:00 Stefan Geiss (University of Jyväskylä): Approximation of stochastic integrals, Riemann-Liouville operators, and bounded mean oscillation (further info) – U3
- 19.12.2018 13:00 Mari Myllymäki (Natural Resources Institute Finland (Luke)): Global envelopes for testing with functional test statistics and functional data analysis (further info) – U3
- 19.12.2018 11:00 Ioan Manolescu (Université de Fribourg): Uniform Lipschitz functions on the triangular lattice have logarithmic variations (further info) – U3
- 19.12.2018 10:00 Luis Alvarez Esteban (University of Turku): A Class of Solvable Stationary Singular Stochastic Control Problems of Linear Diffusions (further info) – U3
- 18.12.2018 15:15 Joonas Laihanen: A distribution-based subpopulation framework for statistic estimation – M2 (M233)
- 17.12.2018 15:00 Istvan Prause: Arctic curves beyond the arctic circle – M3 (M234)
The dimer model studies random configurations of perfect matchings (dimer covers) of bipartite planar graphs. Through an associated height function such a configuration is encoded in a random surface. These random surfaces (with a fixed boundary) exhibit limit shape formation: a deterministic limit surface emerges in the macroscopic limit. The imposed boundary condition can have dramatic effect: in certain regions the dimers line up in an ordered fashion (form a frozen facet) and do not look random at all. A prime example of this phenomenon is the arctic circle of domino tilings of the Aztec diamond from 1995.
We now have, mostly due to Kenyon et al., a general theory which describes these phenomena in unprecedented detail. The limit shape is described by a convex but singular and degenerate variational problem with a gradient constraint. These features are responsible for facet formation and the appearance of arctic curves. In the talk, I will use the lozenge tiling model (dimer model on the hexagonal lattice) to showcase these issues and address how one can analyse the variational problem.
- 14.12.2018 11:15 Johan Salmelin (Aalto): Energy disaggregation of electric heating appliances (MSc thesis talk) – M3 (M234)
- 10.12.2018 15:15 Antti Pöllänen (Aalto): Optimization of dense Wi-Fi networks via Markov chain models – M3 (M234)
MSc thesis presentation.
- 3.12.2018 15:15 Eveliina Peltola (University of Geneva): Crossing Probabilities of Multiple Ising Interfaces – M3 (M234)
Crossing Probabilities of Multiple Ising Interfaces
The planar Ising model is one of the most studied lattice models in statistical physics. Exhibiting a continuous phase transition, it enjoys conformal invariance in the scaling limit, as has been verified recently in celebrated works initiated by S. Smirnov. In this talk, I discuss crossing probabilities of multiple interfaces in the critical Ising model with alternating boundary conditions. In the scaling limit, they are conformally invariant expressions given by so-called pure partition functions of multiple SLE(kappa) with kappa=3.
I also describe analogous results for critical percolation and the Gaussian free field.
Joint work with Hao Wu (Yau Mathematical Sciences Center, Tsinghua University)
- 30.8.2018 11:15 Marco Fiorucci (Ca' Foscari U, Venice): Graph Summarization Using Regular Partitions – M3 (M234)
The world we live in is becoming more and more interconnected and huge amounts of data are produced and stored every day by different interrelated entities. This high-throughput generation calls for the development of efficient algorithms to understand and process large and noisy network data. To address this challenging task, we develop a principled approach to summarize (compress) large graphs based on regular partitions, the existence of which was first established in a celebrated result proved by Endre Szemerédi in the mid-1970. A regular partition is defined as a partition of the vertex set into a bounded number of random-like bipartite graphs, called regular pairs. In particular, a regular pair is a highly uniform bipartite graph in which the density of any reasonably sized subgraphs is about the same as the overall density of the bipartite graph.
In this talk, I will provide an overview of the regularity lemma and will discuss its potential usefulness in real-world applications.
- 22.8.2018 15:15 Katri Ailus: On modeling train energy consumption (Master's thesis presentation) – M3 (M234)
- 15.8.2018 14:15 Sung Chul Park (EPFL): Local correlations in the critical and near-critical planar Ising model – M3 (M234)
The scaling limit of the 2D critical Ising model is expected to exhibit conformal invariance, which has been proved in the case of spin (Chelkak, Hongler and Izyurov 2015) and energy (local 2-point) correlations (Hongler and Smirnov 2013). We extend these results by giving a conformally covariant description for the local n-point correlations in the scaling limit. Then we will go on to discuss preliminary results and ongoing work in the near-critical (scaling towards criticality) setting and their significance from the viewpoint of Conformal Field Theory. Based on joint work with R. Gheissari (first part) and C. Hongler.
- 8.8.2018 16:30 Kalle Kytölä [Math physics afternoon]: Probabilistic lattice models and conformal field theory – M3 (M234)
A major conjecture in two-dimensional statistical mechanics is that scaling limits of lattice models are described by conformally invariant quantum field theories. The main ingredient of conformal field theories is a Virasoro algebra representation on local fields. In two lattice models, the critical Ising model and the discrete Gaussian free field, we find this exact structure even before passing to the scaling limit.
The result is joint work with Clément Hongler (EPFL) and Fredrik Viklund (KTH).
- 8.8.2018 16:00 Christian Webb [Math physics afternoon]: On the eigenvalues of a random Hermitian matrix – M3 (M234)
I will discuss some recent work concerning rigidity of eigenvalues of a random Hermitian matrix: that is, how much can the eigenvalues of a large random Hermitian matrix fluctuate around certain deterministic quantities.
- 8.8.2018 15:30 David Radnell [Math physics afternoon]: Moduli spaces in conformal field theory – M3 (M234)
One of the standard axiomatic approaches to conformal field theory involves infinite-dimensional moduli spaces of Riemann surfaces. The rigorous definition and study of these moduli spaces requires complex analysis and geometry, quasiconformal Teichmueller theory, functional analysis etc. I will outline the connection between these topics and state some recent results.
- 8.8.2018 14:30 Alex Karrila [Math physics afternoon]: On the weak convergence of multiple plane curves – M3 (M234)
In statistical mechanics, one often studies a random model on a fine-mesh lattice approximating a continuum domain. One descriptive feature of such models are interface curves, such as boundaries of magnetization clusters in a ferromagnetism model. Consider a situation where boundary conditions, for instance alternating +/- magnetizations on the boundary of the ferromagnet, force the existence of multiple macroscopic chordal interfaces. We derive criteria, valid for various random models, that guarantee the existence of a weak limit of such chordal interfaces as the lattice mesh turns finer.
- 8.8.2018 14:00 Armando Gutierrez [Math physics afternoon]: On the metric compactification of Banach spaces – M3 (M234)
I will explain a method that has recently appeared in metric geometry and has shown to be an effective technique to compactify metric spaces. Afterwards, I will present a complete description of the metric compactification of the classical Banach spaces Lp in finite and infinite dimensions.
- 8.8.2018 13:15 Antti Suominen [Math physics afternoon]: Spin correlation functions of the 2D Ising model [MSc talk] – M3 (M234)
I will discuss how discrete complex analysis and orthogonal polynomials can be used to study the spin correlation functions of the two dimensional Ising model.
- 8.8.2018 12:30 Osama Abuzaid [Math physics afternoon]: Infinite self avoiding half space random walks [MSc talk] – M3 (M234)
A self avoiding walk (SAW) is an injective walk in a lattice embedded in an Euclidean space. A random SAW of length n is a uniformly distributed random variable on all self avoiding walks of length n starting from origin. In this talk, we are mainly interested in random SAWs in a d-dimensional qubic lattice which are restricted to the upper half plane. These are called self avoiding half space random walks (SAHSW). I will present necessary tools to show the existence of an infinite random SAHSW which is defined as the limit of random SAHSWs of length n, as n tends to infinity.