Skip to main content
SpringerLink
Log in

A Limit Law for Outputs in Random Recursive Circuits

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. School of Informatics and Sciences, Nagoya University, Nagoya 464-8601, Japan. tsukiji@info.human.nagoya-u.ac.jp., JP

    T. Tsukiji

  2. The George Washington University, Washington, DC 20052, USA. hosam@gwu.edu., US

    H. Mahmoud

Authors
  1. T. Tsukiji
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Mahmoud
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received September 6, 2000; revised October 5, 2000.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tsukiji, T., Mahmoud, H. A Limit Law for Outputs in Random Recursive Circuits. Algorithmica 31, 403–412 (2001). https://doi.org/10.1007/s00453-001-0044-4

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-001-0044-4

Search

Navigation