Exact solution of bond percolation on small arbitrary graphs

被引：8
|
作者：
Allard, A. [1 ]
Hebert-Dufresne, L. [1 ]
Noel, P. -A. [1 ]
Marceau, V. [1 ]
Dube, L. J. [1 ]
机构：
[1] Univ Laval, Dept Phys Genie Phys & Opt, Quebec City, PQ G1V 0A6, Canada
来源：
EPL | 2012年 / 98卷 / 01期
基金：
加拿大自然科学与工程研究理事会; 加拿大健康研究院;
关键词：
PLAGUE;
D O I：
10.1209/0295-5075/98/16001
中图分类号：
O4 [物理学];
学科分类号：
0702 ;
摘要：
We introduce a set of iterative equations that exactly solves the size distribution of components on small arbitrary graphs after the random removal of edges. We also demonstrate how these equations can be used to predict the distribution of the node partitions (i.e., the constrained distribution of the size of each component) in undirected graphs. Besides opening the way to the theoretical prediction of percolation on arbitrary graphs of large but finite size, we show how our results find application in graph theory, epidemiology, percolation and fragmentation theory. Copyright (C) EPLA, 2012
引用
收藏
页数：6
相关论文
共 50 条
12345