A Deep Autoregressive Model for Dynamic Combinatorial Complexes
This addresses the challenge of representing evolving networks like social or biological systems with higher-order structures, though it is foundational and incremental in applying autoregressive methods to a new domain.
The paper tackled the problem of modeling dynamic combinatorial complexes (CCs) that capture higher-order interactions in networks, introducing DAMCC as the first deep learning model for this task and demonstrating its ability to capture temporal and higher-order dependencies in experiments.
We introduce DAMCC (Deep Autoregressive Model for Dynamic Combinatorial Complexes), the first deep learning model designed to generate dynamic combinatorial complexes (CCs). Unlike traditional graph-based models, CCs capture higher-order interactions, making them ideal for representing social networks, biological systems, and evolving infrastructures. While existing models primarily focus on static graphs, DAMCC addresses the challenge of modeling temporal dynamics and higher-order structures in dynamic networks. DAMCC employs an autoregressive framework to predict the evolution of CCs over time. Through comprehensive experiments on real-world and synthetic datasets, we demonstrate its ability to capture both temporal and higher-order dependencies. As the first model of its kind, DAMCC lays the foundation for future advancements in dynamic combinatorial complex modeling, with opportunities for improved scalability and efficiency on larger networks.