Login / Signup

A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree.

Harry KestenBoris G. Pittel
Published in: Random Struct. Algorithms (1996)
Keyphrases
  • small number
  • computational complexity
  • upper bound
  • neural network
  • data mining
  • machine learning
  • objective function
  • tree structure
  • minimum cost
  • fixed number