"A local limit theorem for the number of nodes, the height, and the number ..."

Harry Kesten, Boris G. Pittel (1996)

> Home

Details and statistics

DOI: 10.1002/(SICI)1098-2418(199607)8:4<243::AID-RSA1>3.0.CO;2-Y

access: closed

type: Journal Article

metadata version: 2019-07-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/KestenP96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/KestenP96
Harry Kesten, Boris G. Pittel:
A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree. Random Struct. Algorithms 8(4): 243-299 (1996)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.