本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2021
摘要
A common approach for analyzing hypergraphs is to consider the projected adjacency or Laplacian matrices for each order of interactions (e.g., dyadic, triadic, etc.). However, this method can lose 資訊 about the hypergraph structure and is not universally applicable for studying dynamical processes on hypergraphs, which we demonstrate through the framework of cluster 同步化. Specifically, we show that the projected 網絡 does not always correspond to a unique hypergraph structure. This means the projection does not always properly predict the true dynamics unfolding on the hypergraph. Additionally, we show that the symmetry group consisting of per突變s that preserve the hypergraph structure can be distinct from the symmetry group of its projected matrix. Thus, considering the full hypergraph is requ
※ 此為已發表論文，全文需透過期刊付費取得