paper-with-me

Papers

Simplex2Vec embeddings for community detection in simplicial complexes

2019-06-21 · Jacob Charles Wright Billings, Mirko Hu, Giulia Lerda, Alexey N. Medvedev, Francesco Mottes, Adrian Onicas, Andrea Santoro, Giovanni Petri

Topological representations are rapidly becoming a popular way to capture and encode higher-order interactions in complex systems. They have found applications in disciplines as different as cancer genomics, brain function, and computational social science, in representing both descriptive features of data and inference models. While intense research has focused on the connectivity and homological features of topological representations, surprisingly scarce attention has been given to the investigation of the community structures of simplicial complexes. To this end, we adopt recent advances in symbolic embeddings to compute and visualize the community structures of simplicial complexes. We first investigate the stability properties of embedding obtained for synthetic simplicial complexes to the presence of higher order interactions. We then focus on complexes arising from social and brain functional data and show how higher order interactions can be leveraged to improve clustering detection and assess the effect of higher order interaction on individual nodes. We conclude delineating limitations and directions for extension of this work.

📄 PDF Abstract BibTeX arXiv:1906.09068

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringCommunity DetectionDescriptive

Similar Papers 제목 키워드 기반

Dist2Cycle: A Simplicial Neural Network for Homology Localization

2021-10-28 · Alexandros Dimitrios Keros, Vidit Nanda, Kartic Subr

Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards …

Random walks on simplicial complexes

2024-04-12 · Thomas Bonis, Laurent Decreusefond, Viet Chi Tran, Zhihan Iris Zhang

The notion of Laplacian of a graph can be generalized to simplicial complexes and hypergraphs, and contains information on the topology of these structures. Even for a graph, the consideration of associated simplicial co…

k-simplex2vec: a simplicial extension of node2vec

2020-10-12 · Celia Hacker

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…

BIG-bench Machine Learning

$k$-simplex2vec: a simplicial extension of node2vec

2020-10-10 · NeurIPS Workshop TDA_and_Beyond 2020 12 · Celia Hacker

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…

BIG-bench Machine Learning

Loss Surface Simplexes for Mode Connecting Volumes and Fast Ensembling

2021-02-25 · Gregory W. Benton, Wesley J. Maddox, Sanae Lotfi, Andrew Gordon Wilson

With a better understanding of the loss surfaces for multilayer networks, we can build more robust and accurate training procedures. Recently it was discovered that independently trained SGD solutions can be connected al…