Article
Licensed
Unlicensed
Requires Authentication
A conditional limit theorem for random number of summands
Published/Copyright:
October 9, 2009
Published Online: 2009-10-09
Published in Print: 1997
Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On the closed classes of multivalued logic containing the polynomial class
- A lower bound on the complexity of realization of a Boolean function by two-layer contact circuits on the planar integer lattice
- Realization of hypergraphs by trees of minimal diameter
- Large deviation probabilities for sums of lattice random vectors with heavy-tailed distribution
Articles in the same Issue
- On the closed classes of multivalued logic containing the polynomial class
- A lower bound on the complexity of realization of a Boolean function by two-layer contact circuits on the planar integer lattice
- Realization of hypergraphs by trees of minimal diameter
- Large deviation probabilities for sums of lattice random vectors with heavy-tailed distribution
