We investigate whether Swampland constraints on the low-energy dynamics of weakly coupled string vacua in AdS can be related to inconsistencies of their putative holographic duals or, more generally, recast in terms of CFT data. In the main part of the talk, we shall illustrate how various swampland consistency constraints are equivalent to a negativity condition on the sign of certain mixed anomalous dimensions. This condition is similar to established CFT positivity bounds arising from causality and unitarity, but not known to hold in general. Our analysis will include LVS, KKLT, perturbative and racetrack stabilisation, and we shall also point out an intriguing connection to the Distance Conjecture. In the final part we will take a complementary approach, and show how a recent, more rigorous CFT inequality maps to non-trivial constraints on AdS, mentioning possible applications along the way.

We study several matrix diffusion processes constructed from a unitary Brownian motion. In particular, we use the Stiefel fibration to lift the Brownian motion of the complex Grass- mannian to the complex Stiefel manifold and deduce a skew-product decomposition of the Stiefel Brownian motion. As an application, we prove asymptotic laws for the determinants of the block entries of the unitary Brownian motion.

The study of motifs in networks can help researchers uncover links between structure and function of networks in biology, the sociology, economics, and many other areas. Empirical studies of networks have identified feedback loops, feedforward loops, and several other small structures as "motifs" that occur frequently in real-world networks and may contribute by various mechanisms to important functions these systems. However, the mechanisms are unknown for many of these motifs. We propose to distinguish between "structure motifs" (i.e., graphlets) in networks and "process motifs" (which we define as structured sets of walks) on networks and consider process motifs as building blocks of processes on networks. Using the covariances and correlations in a multivariate Ornstein--Uhlenbeck process on a network as examples, we demonstrate that the distinction between structure motifs and process motifs makes it possible to gain quantitative insights into mechanisms that contribute to important functions of dynamical systems on networks.

This is an elementary talk introducing the rational Cherednik algebra and its representations. Especially, we are interested in the case of complex reflection group. A tool called the Dunkl-Opdam subalgebra is used to decompose the standard modules into weight spaces and to construct the correspondence with the partitions of integers. If time allows, we might explore the concept of unitary representation and what condition a representation needs to satisfy to be qualified as one.

The well-known Schur-Weyl duality provides a link between the representation theories of the general linear group $GL_n$ and the symmetric group $S_r$ by studying tensor space $(\mathbb{C}^n)^{\otimes r}$ as a ${(GL_n,S_r)}$-bimodule. We will discuss a few variations of this idea which replace $GL_n$ with some other interesting algebraic object (e.g. O$_n$ or $S_n$) and $S_r$ with a so-called diagram algebra. If time permits, we will also briefly look at how this can be used to define Deligne's category which 'interpolates' Rep($S_t$) for any complex number $t \in \mathbb{C}$.

How can a random walker on a network be helpful for patients suffering from amyotrophic lateral sclerosis (ALS)? Clinical trials in ALS continue to rely on survival or clinical functional scales as endpoints, since anatomical patterns of disease spread in ALS are poorly characterized in vivo. In this study, we generated individual brain networks of patients and controls based on cerebral magnetic resonance imaging (MRI) data. Then, we applied a computational model with a random walker to the brain MRI scan of patients to simulate this progressive network degeneration. We observe that computer‐simulated aggregation levels of the random walker mimic true disease patterns in ALS patients. Our results demonstrate the utility of computational network models in ALS to predict disease progression and underscore their potential as a prognostic biomarker.

After presenting this study on characterizing the structural changes in neurodegenerative diseases with network science, I will give an outlook on my new work on characterizing the dynamic changes in brain networks for Parkinson’s disease and counteracting these with (simulated) deep brain stimulation using the neuroinformatics platform The Virtual Brain (www.thevirtualbrain.org) .

Article link: https://onlinelibrary.wiley.com/doi/full/10.1002/ana.25706

The goal of sequential learning is to draw inference from data that is gathered gradually through time. This is a typical situation in many applications, including finance. A sequential inference procedure is `anytime-valid’ if the decision to stop or continue an experiment can depend on anything that has been observed so far, without compromising statistical error guarantees. A recent approach to anytime-valid inference views a test statistic as a bet against the null hypothesis. These bets are constrained to be supermartingales - hence unprofitable - under the null, but designed to be profitable under the relevant alternative hypotheses. This perspective opens the door to tools from financial mathematics. In this talk I will discuss how notions such as supermartingale measures, log-optimality, and the optional decomposition theorem shed new light on anytime-valid sequential learning. (This talk is based on joint work with Wouter Koolen (CWI), Aaditya Ramdas (CMU) and Johannes Ruf (LSE).)