本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2000
摘要
Recent work on the Internet, 社會 網絡s, and the power grid has addressed the 韌性 of these 網絡s to either random or targeted deletion of 網絡 nodes or links. Such deletions include, for example, the failure of Internet routers or power 傳播 Lines. 滲流 models on 隨機圖s provide a simple representation of this process but have typically been limited to graphs with Poisson degree distribution at their vertices. Such graphs are quite unlike real-world 網絡s, which often possess power-law or other highly skewed degree distributions. In this paper we study 滲流 on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site 滲流, bond 滲流, and models in which occupation probabilities depend on vertex degree. We discuss the application of our theory to the understa
※ 此為已發表論文，全文需透過期刊付費取得