摘要 Traditional 隨機圖 models of 網絡s generate 網絡s that a

本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。

原文連結

• SFI 頁面

論文資訊

• 類型：已發表論文
• 日期：2010

摘要

Traditional 隨機圖 models of 網絡s generate 網絡s that are locally treelike, meaning that all local neighborhoods take the form of trees. In this respect such models are highly unrealistic, most real 網絡s having strongly nontreelike neighborhoods that contain short loops, cliques, or other biconnected subgraphs. In this paper we propose and analyze a class of 隨機圖 models that incorporates general subgraphs, allowing for nontreelike neighborhoods while still remaining solvable for many fundamental 網絡 properties. Among other things we give solutions for the size of the giant component, the position of the 相變 at which the giant component appears, and 滲流 properties for both site and bond 滲流 on 網絡s generated by the model.

※ 此為已發表論文，全文需透過期刊付費取得