Author:
Cowan Richard,Chen Simone
Abstract
Consider a connected planar graph. A bounded face is said to be of type k, or is called a k-face, if the boundary of that face contains k edges. Under various natural rules for randomly dividing bounded faces by the addition of new edges, we investigate the limiting distribution of face type as the number of divisions increases.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Statistics and Probability