本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2020-06-08
摘要
網絡 science is a rapidly expanding field, with a large and growing body of work on 網絡-based dynamical processes. Most theoretical results in this area rely on the so-called locally treelike approximation. This is, however, usually an "uncontrolled" approximation, in the sense that the magnitudes of the error are typically unknown, although numerical results show that this error is often surprisingly small. In this paper we place this approximation on more rigorous footing by calculating the magnitude of deviations away from tree-based theories in the context of discrete-time critical 網絡 cascades with re-excitable nodes. We discuss the conditions under which tree-like approximations give good results for calculating 網絡 臨界性, and also explain the reasons for deviation from this approximation,
※ 此為已發表論文，全文需透過期刊付費取得