| Article ID: | iaor20121061 |
| Volume: | 31 |
| Issue: | 3 |
| Start Page Number: | 403 |
| End Page Number: | 412 |
| Publication Date: | Nov 2001 |
| Journal: | Algorithmica |
| Authors: | Tsukiji T, Mahmoud H |
| Keywords: | graphs |
We study the structure of uniform random binary recursive circuits. We show that a suitably normalized version of the number of outputs converges in distribution to a normal random variate. We also discuss the connection of the number of outputs to a non‐classical urn model, and our investigation provides a first solved instance of this new class of urns.