# Motivic clustering schemes for directed graphs

arXiv: https://arxiv.org/abs/2001.00278 · HTML: https://mlsanity.com/paper/2001.00278/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 1 Jan 2020.

## Built on by (most cited first, 1 of 1)

- [Robust Hierarchical Clustering for Directed Networks: An Axiomatic Approach](https://mlsanity.com/paper/2108.07247/) (2021)

## Abstract (arXiv)

Motivated by the concept of network motifs we construct certain clustering methods (functors) which are parametrized by a given collection of motifs (or representers).