In this possibly speculative talk I will try to outline a way to define analytic D-modules, using (higher) category theory and the ``six operations" on quasicoherent sheaves as the main tools. The aim is to follow the successful approach of Andy Jiang in the algebraic setting, who obtained such a theory without using stacks or formal schemes (as in Gaitsgory-Rozenblyum's approach). By using local cohomology, Jiang was able to avoid enlarging the category of algebras beyond the usual ones. We believe that an analytic variant of local cohomology can be used to recover the Ardakov-Wadsley theory of D-cap modules ``on the nose". (Work in progress).

In the world of von Neumann algebras, the factors that do not have a trace, the so-called type III factors, are the most difficult to study. Some of their key structural properties are still not well-understood. In this talk, I will give a gentle introduction to Connes's Bicentralizer Problem, which is the most important open problem in the theory of type III factors. I will then present some recent progress on this problem and its applications.

Often, one tries to understand the behaviour of non-commutative random variables or of von Neumann algebras through matricial approximations. In some cases, such as when appealing to the determinant conjecture or investigating the soficity of a group, it is important to find approximations by matrices with good algebraic conditions on their entries (e.g., being integers). On the other hand, the most common tool for generating asymptotic independence -- conjugating with random unitaries -- often destroys such delicate structure.

 I will speak on recent joint work with de Santiago, Hayes, Jekel, Kunnawalkam Elayavalli, and Nelson, where we investigate graph products (an interpolation between free and tensor products) and conjugation of matrix models by large structured random permutations. We show that with careful control of how the permutation matrices are chosen, we can achieve asymptotic graph independence with amalgamation over the diagonal matrices. We are able to use this fine structure to prove that strong $1$-boundedness for a large class of graph product von Neumann algebras follows from the vanishing of the corresponding first $L^2$-Betti number. The main idea here is to show that a version of the determinant conjecture holds as long as the individual algebras have generators with approximations by matrices with entries in the ring of integers of some finite extension of Q satisfying some conditions strongly reminiscent of soficity for groups.

A plethora of stochastic models used in particular in mathematical finance, but also population genetics and physics, stems from the class of affine and polynomial processes. The history of these processes is on the one hand closely connected with the important concept of tractability, that is a substantial reduction of computational efforts due to special structural features, and on the other hand with a unifying framework for a large number of probabilistic models. One early instance in the literature where this unifying affine and polynomial point of view can be applied is Lévy's stochastic area formula. Starting from this example,  we present a guided tour through the main properties and recent results, which lead to signature stochastic differential equations (SDEs). They constitute a large class of stochastic processes, here driven by Brownian motions, whose characteristics are entire or real-analytic functions of their own signature, i.e. of iterated integrals of the process with itself, and allow therefore for a generic path dependence. We show that their prolongation with the corresponding signature is an affine and polynomial process taking values in subsets of group-like elements of the extended tensor algebra. Signature SDEs are thus a class of stochastic processes, which is universal within Itô processes with path-dependent characteristics and which allows - due to the affine theory - for a relatively explicit characterization of the Fourier-Laplace transform and hence the full law on path space.