TutorialΒΆ
The tutorial will take you step by step from the biadjacency matrix of a real-data network to the calculation of the p-values. Our example bipartite network will be the following:
The structure of the network can be caught in the biadjacency matrix. In our case, the matrix is
\[\begin{split}\left[
\begin{matrix}
1 & 1 & 0 & 0 \\
0 & 1 & 1 & 1 \\
0 & 1 & 0 & 1
\end{matrix}
\right]\end{split}\]
Note that the nodes of the layers of the bipartite network are ordered along
the rows and the columns, respectively. In the algorithms, the two layers are
identified by the boolean values True for the row-nodes and False for
the column-nodes. In our example image, the row-nodes are colored in blue
(top layer) and the column-nodes in red (bottom layer).
Note
Tutorial has to be finished.