Log In Sign Up

A Weighted Quiver Kernel using Functor Homology

by   Manohar Kaul, et al.

In this paper, we propose a new homological method to study weighted directed networks. Our model of such networks is a directed graph Q equipped with a weight function w on the set Q_1 of arrows in Q. We require that the range W of our weight function is equipped with an addition or a multiplication, i.e., W is a monoid in the mathematical terminology. When W is equipped with a representation on a vector space M, the standard method of homological algebra allows us to define the homology groups H_*(Q,w;M). It is known that when Q has no oriented cycles, H_n(Q,w;M)=0 for n≥ 2 and H_1(Q,w;M) can be easily computed. This fact allows us to define a new graph kernel for weighted directed graphs. We made two sample computations with real data and found that our method is practically applicable.


The directed plump ordering

Based on Taylor's hereditarily directed plump ordinals, we define the di...

The Weight Function in the Subtree Kernel is Decisive

Tree data are ubiquitous because they model a large variety of situation...

Estimating Vector Fields on Manifolds and the Embedding of Directed Graphs

This paper considers the problem of embedding directed graphs in Euclide...

Poincare Hopf for vector fields on graphs

We generalize the Poincare-Hopf theorem sum_v i(v) = X(G) to vector fiel...

On fractional version of oriented coloring

We introduce the fractional version of oriented coloring and initiate it...

Enumeration of Preferred Extensions in Almost Oriented Digraphs

In this paper, we present enumeration algorithms to list all preferred e...

Simplex Closing Probabilities in Directed Graphs

Recent work in mathematical neuroscience has calculated the directed gra...