ASIND: Alternating Sparse Identification for Predicting Network Dynamics Without Knowledge
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916031761481728 |
|---|---|
| author | Kang, Mingyu Gao, Jianxi Yu, Wenwu Lv, Linyuan |
| author_facet | Kang, Mingyu Gao, Jianxi Yu, Wenwu Lv, Linyuan |
| contents | Identifying network dynamics is a critical yet challenging task to to understand the mechanism of real-world social systems. There are two types of algorithms, and one requires the knowledge of self-dynamics function, interactive function, and interactive network to sparsely identify the network dynamics. Another one does not require any knowledge, but use simple functions to universally approximate complex functions. However, this type of algorithms lack interpretability, and the functional space is too extensive to search efficiently. Thus, to address this issue, this work proposes an Alternating Sparse Identification of Network Dynamics (ASIND) algorithm to sparsely identify the self-dynamics function, interactive function and interactive network alternatively. Extensive experiments are conducted to show the state-of-the-art identification and 100-steps prediction performance compared to the baseline. The experimental results also show the weak identifiability of interactive network, that means different networks can generate highly similar trajectories of network dynamics. The code is available at https://github.com/KMY-SEU/ASIND. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_21220 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | ASIND: Alternating Sparse Identification for Predicting Network Dynamics Without Knowledge Kang, Mingyu Gao, Jianxi Yu, Wenwu Lv, Linyuan Social and Information Networks Identifying network dynamics is a critical yet challenging task to to understand the mechanism of real-world social systems. There are two types of algorithms, and one requires the knowledge of self-dynamics function, interactive function, and interactive network to sparsely identify the network dynamics. Another one does not require any knowledge, but use simple functions to universally approximate complex functions. However, this type of algorithms lack interpretability, and the functional space is too extensive to search efficiently. Thus, to address this issue, this work proposes an Alternating Sparse Identification of Network Dynamics (ASIND) algorithm to sparsely identify the self-dynamics function, interactive function and interactive network alternatively. Extensive experiments are conducted to show the state-of-the-art identification and 100-steps prediction performance compared to the baseline. The experimental results also show the weak identifiability of interactive network, that means different networks can generate highly similar trajectories of network dynamics. The code is available at https://github.com/KMY-SEU/ASIND. |
| title | ASIND: Alternating Sparse Identification for Predicting Network Dynamics Without Knowledge |
| topic | Social and Information Networks |
| url | https://arxiv.org/abs/2605.21220 |