The discrete Hodge Laplacian offers a way to extract network topology and geometry from higher-ordered networks. The operator is inspired by concepts from algebraic topology and differential geometry and generalises the graph Laplacian. In particular, it allows to relate global structure of networks to the local properties of nodes. In my talk, I will talk about some general behaviour of the Hodge Laplacian and then continue to show how to use the extracted information to a) to use trajectory data infer the topology of the underlying network while simultaneously classifying the trajectories and b) to extract cell differentiation trees from single-cell data, an exciting new application in computational genomics.    

The normal covering number $\gamma(G)$ of a finite group $G$ is the minimal size of a collection of proper subgroups whose conjugates cover the group. This definition is motivated by number theory and related to the concept of intersective polynomials. For the symmetric and alternating groups we will see how these numbers are closely connected to some elementary (as in "relating to basic concepts", not "easy") problems in additive combinatorics, and we will use this connection to better understand the asymptotics of $\gamma(S_n)$ and $\gamma(A_n)$ as $n$ tends to infinity.

Quotients of hyperbolic groups (groups that act geometrically on a hyperbolic space) and their generalizations have long been a powerful tool for proving strong algebraic results. In this talk, I will describe the geometry of random quotients of certain of groups, that is, a quotient by a subgroup normally generated by k independent random walks.  I will focus on the class of hierarchically hyperbolic groups (HHGs), a generalization of hyperbolic groups that includes hyperbolic groups, mapping class groups, most CAT(0) cubical groups including right-angled Artin and Coxeter groups, many 3–manifold groups, and various combinations of such groups.  In this context, I will explain why a random quotient of an HHG that does not split as a direct product is again an HHG, definitively showing that the class of HHGs is quite broad.  I will also describe how the result can also be applied to understand the geometry of random quotients of hyperbolic and relatively hyperbolic groups. This is joint work with Giorgio Mangioni, Thomas Ng, and Alexander Rasmussen.

Our Random Walkers Induced temporal Graphs (RWIG) model generates temporal graph sequences based on M independent, random walkers that traverse an underlying graph as a function of time. Co-location of walkers at a given node and time defines an individual-level contact. RWIG is shown to be a realistic model for temporal human contact graphs.   

A key idea is that a random walk on a Markov graph executes the Markov process. Each of the M walkers traverses the same set of nodes (= states in the Markov graph), but with own transition probabilities (in discrete time) or rates (in continuous time). Hence, the Markov transition probability matrix P_j reflects the policy of motion of walker w_j. RWIG is analytically feasible: we derive closed form solutions for the probability distribution of contact graphs.

Usually, human mobility networks are inferred through measurements of timeseries of contacts between individuals. We also discuss this “inverse RWIG problem”, which aims to determine the parameters in RWIG (i.e. the set of probability transfer matrices P₁, P₂, ..., P_M and the initial probability state vectors s₁[0], ...,s_M[0] of walkers w₁,w₂, ...,w_M in discrete time), given a timeseries of contact graphs.

This talk is based on the article:
Almasan, A.-D., Shvydun, S., Scholtes, I. and P. Van Mieghem, 2025, "Generating Temporal Contact Graphs Using Random Walkers", IEEE Transactions on Network Science and Engineering, to appear.

Nichols algebras, also known as small shuffle algebras, are a family of graded bialgebras including the symmetric algebras, the exterior algebras, the positive parts of quantized enveloping algebras, and, conjecturally, Fomin-Kirillov algebras. As the case of Fomin-Kirillov algebra shows, it can be very
difficult to determine the maximum degree of a minimal generating set of relations of a Nichols algebra. 

Building upon Kapranov and Schechtman’s equivalence between the category of perverse sheaves on Sym(C) and the category of graded connected bialgebras,  we describe the geometric counterpart of the maximum degree of a generating set of relations of a graded connected bialgebra, and we show how this specialises to the case o Nichols algebras.

The talk is based on joint work with Francesco Esposito and Lleonard Rubio y Degrassi.
 

Let X be a smooth rigid-analytic variety. Ardakov and Wadsley introduced the sheaf D-cap of infinite order differential operators on X, along with the category of coadmissible D-cap-modules. In this talk, we present a Riemann–Hilbert correspondence for these coadmissible D-cap-modules. Specifically, we interpret a coadmissible D-cap-module as a p-adic differential equation, explain what it means to solve such an equation, and describe how to reconstruct the module from its solutions.