k-simplex2vec: a simplicial extension of node2vec
arXiv:2010.05636
Abstract
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.
References in corpus (6)
- Efficient Estimation of Word Representations in Vector Space
- Distributed Representations of Words and Phrases and their Compositionality
- Natural Scales in Geographical Patterns
- Graph Embedding Techniques, Applications, and Performance: A Survey
- Simplicial complexes: spectrum, homology and random walks
- Simplex2Vec embeddings for community detection in simplicial complexes