Graphs with Polarities
In fields ranging from business to systems biology, directed graphs with edges labeled by signs are used to model systems in a very simple way: the nodes represent entities of some sort, and an edge indicates that one entity directly affects another either positively or negatively. Multiplying the signs along a directed path of edges lets us determine indirect positive or negative effects, and if the path is a loop we call this a positive or negative feedback loop. Here we generalize this to graphs with edges labeled by a commutative monoid, whose elements represent "polarities" possibly more general than simply "positive" or "negative". We define and study the "1st homology monoid" of a directed graph, different from the usual 1st homology group in that it only detects directed loops. This is joint work with Adittya Chaudhuri.
You can see my slides here.
For more, read these: