混乱的
网络拓扑
计算机科学
财产(哲学)
班级(哲学)
噪音(视频)
拓扑(电路)
统计物理学
秩(图论)
基质(化学分析)
匹配(统计)
物理
数学
人工智能
组合数学
复合材料
统计
材料科学
认识论
哲学
图像(数学)
操作系统
作者
Hauke Haehne,Jose Casadiego,Joachim Peinke,Marc Timme
标识
DOI:10.1103/physrevlett.122.158301
摘要
The number of units of a network dynamical system, its size, arguably constitutes its most fundamental property. Many units of a network, however, are typically experimentally inaccessible such that the network size is often unknown. Here we introduce a detection matrix that suitably arranges multiple transient time series from the subset of accessible units to detect network size via matching rank constraints. The proposed method is model-free, applicable across system types and interaction topologies, and applies to nonstationary dynamics near fixed points, as well as periodic and chaotic collective motion. Even if only a small minority of units is perceptible and for systems simultaneously exhibiting nonlinearities, heterogeneities, and noise, exact size detection is feasible. We illustrate applicability for a paradigmatic class of biochemical reaction networks.
科研通智能强力驱动
Strongly Powered by AbleSci AI