Asymptotics in random recursive circuits

DOI10.1007/s10958-013-1637-6zbMath1303.60021OpenAlexW2006821956MaRDI QIDQ487104

Henar Urmeneta, Fernando Plo, José A. Moler, Miguel San Miguel

Publication date: 19 January 2015

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-013-1637-6

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Stochastic approximation (62L20)

Related Items (1)

The number of descendants in a random directed acyclic graph

Cites Work

• Non-negative matrices and Markov chains. 2nd ed
• Weak convergence rates for stochastic approximation with application to multiple targets and simulated annealing
• The size of random bucket trees via urn models
• A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits
• Central limit theorems for generalized Pólya urn models
• A limit law for outputs in random recursive circuits
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotics in random recursive circuits