Porcolation simulations were carried out on various networks: both regular and irregular. The saturation curve was obtained for cubic networks, localized and completely random 3D networks and networks based on exotic graphs like Sierpiński triangle and carpet. For the random graph generation, a modification of the cell list algorithm was introduced, which is capable of generating local random graphs efficiently. With the help of this graph generation method, the effect of locality was investigated, and it was proven to be an important property of random networks from the viewpoint of liquid propagation. The saturation curves of local random networks with different prescribed pore degree distributions were also obtained.
Random graph generation for scheduling simulations
