Abstract: The numerically challenging problem of generating the Jordan canonical form is attacked exclusively for a class of zero-one square matrices with the property that each column has at most one ...

Create a random weakly-connected Directed Acyclic Graph (DAG) on n nodes and m edges. Much like how an Erdos-Renyi graph can be created in a G(n, m) form, where n represents the number of nodes and m ...

Dir-GNN is a machine learning model that enables learning on directed graphs. This repository contains the official implementation of the paper "Edge Directionality Improves Learning on Heterophilic ...