Asymptotics in random recursive circuits
DOI10.1007/S10958-013-1637-6zbMATH Open1303.60021OpenAlexW2006821956MaRDI QIDQ487104FDOQ487104
Authors: José A. Moler, Fernando Plo, Henar Urmeneta, 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
Recommendations
- A limit law for outputs in random recursive circuits
- Asymptotic degree distribution in random recursive trees
- A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits
- scientific article; zbMATH DE number 1744826
- On the internal structure of random recursive circuits
Central limit and other weak theorems (60F05) Stochastic approximation (62L20) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits
- A limit law for outputs in random recursive circuits
- Central limit theorems for generalized Pólya urn models
- Non-negative matrices and Markov chains. 2nd ed
- The size of random bucket trees via urn models
- Weak convergence rates for stochastic approximation with application to multiple targets and simulated annealing
Cited In (5)
- On the internal structure of random recursive circuits
- A limit law for outputs in random recursive circuits
- A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits
- The number of descendants in a random directed acyclic graph
- Outputs in random \(f\)-ary recursive circuits
This page was built for publication: Asymptotics in random recursive circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q487104)
