Coalgebraic analysis of social systems

TL;DR

This paper introduces a category-theoretic, coalgebraic framework to extend social system role and position analysis from graphs to hypergraphs, enabling higher-order interaction modeling.

Contribution

It formalizes role and positional analysis for hypergraphs using universal coalgebra, generalizing existing graph-based methods with a functoriality theorem.

Findings

Formalization of role and positional analysis for hypergraphs

Proof of a general functoriality theorem

Extension of social network analysis methods to higher-order interactions

Abstract

The algebraic analysis of social systems, or algebraic social network analysis, refers to a collection of methods designed to extract information about the structure of a social system represented as a directed graph. Central among these are methods to determine the roles that exist within a given system, and the positions. The analysis of roles and positions is highly developed for social systems that involve only pairwise interactions among actors - however, in contemporary social network analysis it is increasingly common to use models that can take into account higher-order interactions as well. In this paper we take a category-theoretic approach to the question of how to lift role and positional analysis from graphs to hypergraphs, which can accommodate higher-order interactions. We use the framework of universal coalgebra - a 'theory of systems' with origins in computer science and logic - to formalize the main concepts of role and positional analysis and extend them to a large class of structures that includes both graphs and hypergraphs. As evidence for the validity of our definitions, we prove a very general functoriality theorem that specializes, in the case of graphs, to a folkloric observation about the compatibility of positional and role analysis.