本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2006
摘要
We investigate a simple generative model for 網絡 formation. The model is designed to describ the growth of 網絡s of kinship, trading, corporate alliances, or autocatalytic chemical reactions, where feedback is an essential element of 網絡 growth. The underlying graphs in these situations grow via a competition between cycle formation and node addition. After choosing a given node, a search is made for another node at a suitable distance. If such a node is found, a link is added connecting this to the original node, and increasing the number of cycles in the graph; if such a node cannot be found, a new node is added, which is linked to the original node. We simulate this algorithm and find that we cannot reject the hypothesis that the empirical degree distribution is a q-exponential function, wh
※ 此為已發表論文，全文需透過期刊付費取得