L2

Adaptive agents through active inference: The main fields of research that are used to model and realise adaptive agents are optimal control, reinforcement learning and active inference. Active inference is a probabilistic description of adaptive agents that is relatively less known to mathematicians, as it originated from neuroscience in the last decade. This talk presents the mathematical underpinnings of active inference, starting from fundamental considerations about agents that maintain their structural integrity in the face of environmental perturbations. Through this, we derive a probability distribution over actions, that describes decision-making under uncertainty in adaptive agents . Interestingly, this distribution has an interesting information geometric structure, combining, for instance, drives for exploration and exploitation, which may yield a principled answer to the exploration-exploitation trade-off. Preserving this geometric structure enables to realise adaptive agents in practice. We illustrate their behaviour with simulation examples and empirical comparisons with reinforcement learning.

Scaling Limits of Random Graphs: The scaling limit of directed random graphs remains relatively unexplored compared to their undirected counterparts. In contrast, many real-world networks, such as links on the world wide web, financial transactions and “follows” on Twitter, are inherently directed. Previous work by Goldschmidt and Stephenson established the scaling limit for the strongly connected components (SCCs) of the Erdős -- Rényi model in the critical window when appropriately rescaled. In this talk, we present a result showing the SCCs of another class of critical random directed graphs will converge when rescaled to the same limit. Central to the proof is an exploration of the directed graph and subsequent encodings of the exploration as real valued random processes. We aim to present this exploration algorithm and other key components of the proof.

From Mathematics to Data Science and Back: We give an overview of the interaction between rough path theory and data science at the current time.
 

 I will review some well-established relationships between four manifolds and vertex algebras that can be deduced from studying the M5-brane worldvolume theory, and outline some of the corresponding results in mathematics which have been understood so far. I will then describe a proposal of Gaiotto-Rapcak to generalize these ideas to the setting of multiple M5 branes wrapping divisors in toric Calabi-Yau threefolds, and explain work in progress on understanding the mathematical implications of this proposal as a complex network of relationships between the enumerative geometry of sheaves on threefolds and the representation theory of affine Lie algebras.

 In this talk I will discuss an algorithm to piecewise dualise linear quivers into their mirror duals. This applies to the 3d N=4 version of mirror symmetry as well as its recently introduced 4d counterpart, which I will review. The algorithm uses two basic duality moves, which mimic the local S-duality of the 5-branes in the brane set-up of the 3d theories, and the properties of the S-wall. The S-wall is known to correspond to the N=4 T[SU(N)] theory in 3d and I will argue that its 4d avatar corresponds to an N=1 theory called E[USp(2N)], which flows to T[SU(N)] in a suitable 3d limit. All the basic duality moves and S-wall properties needed in the algorithm are derived in terms of some more fundamental Seiberg-like duality, which is the Intriligator--Pouliot duality in 4d and the Aharony duality in 3d.

Actin filaments are polymers that interact with myosin motor
proteins and play important roles in cell motility, shape, and
development. Depending on its function, this dynamic network of
interacting proteins reshapes and organizes in a variety of structures,
including bundles, clusters, and contractile rings. Motivated by
observations from the reproductive system of the roundworm C. elegans,
we use an agent-based modeling framework to simulate interactions
between actin filaments and myosin motor proteins inside cells. We also
develop tools based on topological data analysis to understand
time-series data extracted from these filament network interactions. We
use these tools to compare the filament organization resulting from
myosin motors with different properties. We have also recently studied
how myosin motor regulation may regulate actin network architectures
during cell cycle progression. This work also raises questions about how
to assess the significance of topological features in common topological
summary visualizations.