k-simplex2vec: a simplicial extension of node2vec
arXiv:2010.05636v222 citations
Originality Incremental advance
AI Analysis
This provides a method for analyzing higher-order interactions in graphs, but it is incremental as it builds directly on node2vec.
The authors tackled the problem of representing simplicial complexes for machine learning by extending node2vec to higher-dimensional simplices, enabling their use as input to statistical and ML tools.
We present a novel method of associating Euclidean features to simplicial complexes, providing a way to use them as input to statistical and machine learning tools. This method extends the node2vec algorithm to simplices of higher dimensions, providing insight into the structure of a simplicial complex, or into the higher-order interactions in a graph.