Invariant Representations of Embedded Simplicial Complexes

원문 초록

Analyzing embedded simplicial complexes, such as triangular meshes and graphs, is an important problem in many fields. We propose a new approach for analyzing embedded simplicial complexes in a subdivision-invariant and isometry-invariant way using only topological and geometric information. Our approach is based on creating and analyzing sufficient statistics and uses a graph neural network. We demonstrate the effectiveness of our approach using a synthetic mesh data set.

함께 살펴볼 논문

공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.

arXiv:2507.15205공통 태그 Graph Neural Network공식 코드 · Papers with Code 등록 2025-07-21

Long-Short Distance Graph Neural Networks and Improved Curriculum Learning for Emotion Recognition in Conversation

arXiv:2507.03947공통 태그 Graph Neural Network공식 코드 · Papers with Code 등록 2025-07-05

Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs

arXiv:2507.02690공통 태그 Graph Neural Network공식 코드 · Papers with Code 등록 2025-07-03

RLHGNN: Reinforcement Learning-driven Heterogeneous Graph Neural Network for Next Activity Prediction in Business Processes

arXiv:2506.17064공통 태그 Graph Neural Network공식 코드 · Papers with Code 등록 2025-06-20

Generative Modeling of Full-Atom Protein Conformations using Latent Diffusion on Graph Embeddings

arXiv:2506.14470공통 태그 Graph Neural Network공식 코드 · Papers with Code 등록 2025-06-17

AST-Enhanced or AST-Overloaded? The Surprising Impact of Hybrid Graph Representations on Code Clone Detection

arXiv:2506.14684공통 태그 Graph Neural Network공식 코드 · Papers with Code 등록 2025-06-17

Refining music sample identification with a self-supervised graph neural network

토론

이 논문과 연결된 포럼 글이 아직 없습니다.

포럼에서 토론 찾기