A limit law for outputs in random recursive circuits
From MaRDI portal
Publication:5953107
DOI10.1007/s00453-001-0044-4zbMath0989.68107OpenAlexW2015846053MaRDI QIDQ5953107
No author found.
Publication date: 2 April 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0044-4
Graph theory (including graph drawing) in computer science (68R10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Related Items (15)
Two-color balanced affine urn models with multiple drawings ⋮ Characterization and enumeration of certain classes of tenable Pólya urns grown by drawing multisets of balls ⋮ Longest Path Distance in Random Circuits ⋮ A generalized urn with multiple drawing and random addition ⋮ On nodes of small degrees and degree profile in preferential dynamic attachment 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 ⋮ Analysis of a generalized Friedman's urn with multiple drawings ⋮ The degree profile in some classes of random graphs that generalize recursive trees ⋮ Asymptotics in random recursive circuits ⋮ Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees ⋮ Central limit theorems for generalized Pólya urn models ⋮ On martingale tail sums in affine two-color urn models with multiple drawings ⋮ Functional limit theorems for multitype branching processes and generalized Pólya urns. ⋮ On the internal structure of random recursive circuits
This page was built for publication: A limit law for outputs in random recursive circuits
