Exact solution of bond percolation on small arbitrary graphs
Département de physique, de génie physique, et d'optique, Université Laval - Québec (Qc), Canada G1V 0A6
Accepted: 2 March 2012
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.
PACS: 64.60.aq – Networks / 64.60.ah – Percolation / 02.10.Ox – Combinatorics; graph theory
© EPLA, 2012