No CrossRef data available.
Article contents
The random division of faces in a planar graph
Published online by Cambridge University Press: 01 July 2016
Extract
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.
- Type
- Stochastic Geometry and Statistical Applications
- Information
- Copyright
- Copyright © Applied Probability Trust 1996