Exact solution of bond percolation on small arbitrary graphs

Antoine Allard, Laurent Hébert-Dufresne, Pierre-André Noël, Vincent Marceau, Louis J. Dubé

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment