arXiv · 1201.4369
Exact solution of bond percolation on small arbitrary graphs
Abstract
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.
Explore related subjects
Keep this discovery
Antoine Allard, Laurent Hébert-Dufresne, Pierre-André Noël, Vincent Marceau, Louis J. Dubé. 2012-04-27. Exact solution of bond percolation on small arbitrary graphs. https://doi.org/10.1209/0295-5075%2F98%2F16001
Cite the original work for its findings. Save a collection to share your selection of sources.