MATLAB iterative algorithm that fits a n-dimensional simplicial complex to a point cloud in arbitrary dimensions based on a generalization of k-means clustering
-
Updated
Oct 6, 2021 - MATLAB
MATLAB iterative algorithm that fits a n-dimensional simplicial complex to a point cloud in arbitrary dimensions based on a generalization of k-means clustering
We introduce simplicial VAR models for time-varying processes observed on higher-order networks. These models adeptly capture intricate spatio-temporal dependencies within simplicial signals while significantly reducing parameter complexity relative to conventional VAR models.
Add a description, image, and links to the simplicial-complex topic page so that developers can more easily learn about it.
To associate your repository with the simplicial-complex topic, visit your repo's landing page and select "manage topics."