Volume 8 (2026)


1. Abstract Markov Random Fields

Lang, Leon ; de Mulatier, Clélia ; Quax, Rick ; Forré, Patrick.
Markov random fields are known to be fully characterized by properties of their information diagrams, or I-diagrams. In particular, for Markov random fields, regions in the I-diagram corresponding to disconnected vertex sets in the graph vanish. Recently, I-diagrams have been generalized to F-diagrams, for a larger class of functions F satisfying the chain rule beyond Shannon entropy, such as Kullback-Leibler divergence and cross-entropy. In this work, we generalize the notion and characterization of Markov random fields to this larger class of functions F and investigate preliminary applications. We define F-independences, F-mutual independences, and F-Markov random fields and characterize them by their F-diagram. In the process, we also define F-dual total correlation and prove that its vanishing is equivalent to F-mutual independence. We then apply our results to information functions F that are applied to probability mass functions. We show that if the probability distributions of a set of random variables are Markov random fields for the same graph, then we formally recover the notion of an F-Markov random field for that graph. We then study the Kullback-Leibler diagrams on specific Markov chains, leading to a visual representation of the second law of thermodynamics and a simple explicit derivation of the decomposition of the evidence lower bound for diffusion models.

2. Rank-based linkage I: triplet comparisons and oriented simplicial complexes

Darling, R. W. R. ; Grilliette, Will ; Logan, Adam.
Rank-based linkage is a new tool for summarizing a collection $S$ of objects according to their relationships. These objects are not mapped to vectors, and ``similarity'' between objects need be neither numerical nor symmetrical. All an object needs to do is rank nearby objects by similarity to itself, using a Comparator which is transitive, but need not be consistent with any metric on the whole set. Call this a ranking system on $S$. Rank-based linkage is applied to the $K$-nearest neighbor digraph derived from a ranking system. Computations occur on a 2-dimensional abstract oriented simplicial complex whose faces are among the points, edges, and triangles of the line graph of the undirected $K$-nearest neighbor graph on $S$. In $|S| K^2$ steps it builds an edge-weighted linkage graph $(S, \mathcal{L}, σ)$ where $σ(\{x, y\})$ is called the in-sway between objects $x$ and $y$. Take $\mathcal{L}_t$ to be the links whose in-sway is at least $t$, and partition $S$ into components of the graph $(S, \mathcal{L}_t)$, for varying $t$. Rank-based linkage is a functor from a category of ``out-ordered'' digraphs to a category of partitioned sets, with the practical consequence that augmenting the set of objects in a rank-respectful way gives a fresh clustering which does not ``rip apart'' the previous one. The same holds for single linkage clustering in the metric space context, but not for typical optimization-based methods. Orientation sheaves play in a […]

3. Compositionality in algorithms for smoothing

Schauer, Moritz ; van der Meulen, Frank ; Wang, Andi Q..
Backward Filtering Forward Guiding (BFFG) is a bidirectional algorithm proposed in Mider et al. [2021] and studied more in depth in a general setting in Van der Meulen and Schauer [2022]. In category theory, optics have been proposed for modelling systems with bidirectional data flow. We connect BFFG with optics by demonstrating that the forward and backwards map together define a functor from a category of Markov kernels into a category of optics, which is furthermore lax monoidal in the case when the guiding kernels coincide with the generative dynamics

4. A Categorical Realization of the (2-)Category of Monoids via Sch{ü}tzenberger Categories and Strict Factorization Systems

Mary, Xavier.
We construct a category equivalent to the category $\mathbf{Mon}$ of monoids and monoid homomorphisms, based on the Sch{ü}tzenberger category of semigroups and categories with strict factorization systems. This equivalence is then extended to the category $\mathbf{Mon_s}$ of unital semigroups and semigroup homomorphisms. By introducing suitable natural transformations, we turn these equivalences into 2-equivalences between 2-categories. The 2-category $\mathbf{Mon_s^{(2)}}$ constructed this way proves the good one to study Morita equivalence of monoids.

5. Categorical foundations of discrete dynamical systems

Carranza, Daniel ; Kapulkin, Chris ; Kershaw, Nathan ; Laubenbacher, Reinhard ; Wheeler, Matthew.
We develop categorical foundations of discrete dynamical systems, aimed at understanding how the structure of the system affects its dynamics. We introduce the notion of cycle sets to analyze attractors of a system, and use this to generalize multiple decomposition theorems of Kadelka, Veliz-Cuba, Murrugarra, and the last two authors from Boolean networks to arbitrary discrete dynamical systems.