本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2010
摘要
The feed-forward relationship naturally observed in time- dependent processes and in a diverse number of real systems-such as some 食物網s and electronic and 神經 wiring-can be described in terms of the so-called directed acyclic graphs (DAGs). An important ingredient of the analysis of such 網絡s is a proper comparison of their observed architecture against an ensemble of randomized graphs, thereby quantifying the randomness of the real systems with respect to suitable null models. This approximation is particularly relevant when the finite size and/or large connectivity of real systems make inadequate a comparison with the predictions obtained from the so-called configuration model. In this paper we analyze two methods of DAG randomization as defined by the desired combination of two topologica
※ 此為已發表論文，全文需透過期刊付費取得