k-simplex2vec: a simplicial extension of node2vec
2020-10-10NeurIPS Workshop TDA_and_Beyond 2020Unverified0· sign in to hype
Celia Hacker
Unverified — Be the first to reproduce this paper.
ReproduceAbstract
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.