Representing a network with two types of connections: A fishing application I want to represent a fishing network using a graph representation. My question surrounds how I can write the adjacency matrix if there are two types of connections, which I want to capture together. 

Here's the most basic setup. Say there are two people represented by nodes. 


Person one owns a fishing right and also acts as an authority who can land fish.
Person two is a fisherman. 


Person one sells the signle fishing right to person two. Person two catches the fish and sells the fish back to person one. Intuitively, I want to write a directed adjacency matrix, in which positive i,j values represent the fishing rights transaction and negative j,i values represent the physical fish transaction, which leads to the following adjacency matrix: 

\begin{bmatrix}
     0 &amp; 1 \\
     -1 &amp; 0 
   \end{bmatrix}

My question is: Can I use signs like this to represent related but distinct connections? The basic logis follows from the fact the total fish caught = the total fishing rights. By summing the elements, we get zero representing a closed system. Here is a more complicated example: 

\begin{bmatrix}
      0 &amp; 1  &amp; 0  \\
      0 &amp; 0  &amp; 0  \\
      0 &amp; -1 &amp; 0 \\
   \end{bmatrix}

In this example person one sells the fishing right to person two as before. Now there is a person three, however, who lands the fish. Again the sum of all the elements is zero as total fishing rights = total fish caught. The network captures a different reality, however. In this second network, all the activities are separated as in an open market. In the original network, all the activities were through a relationship between person one and person two.
Sure, of course.  You can define a matrix to contain whatever numbers you want it to contain.  There's nothing that prevents you.  The real question is whether the result has the properties you want it to have, but since you haven't listed any properties, there's nothing to answer here.