本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2015-09-21
摘要
The organization of interactions in 複雜系統s can be described by 網絡s connecting different units. These graphs are useful representations of the local and global complexity of the underlying systems. The origin of their topological structure can be diverse, resulting from different mechanisms including multiplicative processes and optimization. In spatial 網絡s or in graphs where cost constraints are at work, as it occurs in a plethora of situations from power grids to the wiring of neurons in the 大腦, optimization plays an important part in shaping their organization. In this paper we study 網絡 designs resulting from a Pareto optimization process, where different simultaneous constraints are the targets of selection. We analyze three variations on a problem, finding 相變s of different kinds. Distin
※ 此為已發表論文，全文需透過期刊付費取得