Recurrent random walks, Liouville's theorem and circle packings
Published online by Cambridge University Press: 01 May 1997
Abstract
It has been shown that univalent circle packings filling the complex plane C are unique up to similarities of C. Here we prove that bounded degree branched circle packings properly covering C are uniquely determined, up to similarities of C, by their branch sets. In particular, when branch sets of the packings considered are empty we obtain the earlier result.
We also establish a circle packing analogue of Liouville's theorem: if f is a circle packing map whose domain packing is infinite, univalent, and has recurrent tangency graph, then the ratio map associated with f is either unbounded or constant.
- Type
- Research Article
- Information
- Mathematical Proceedings of the Cambridge Philosophical Society , Volume 121 , Issue 3 , May 1997 , pp. 531 - 546
- Copyright
- Cambridge Philosophical Society 1997
Footnotes
- 4
- Cited by