Article
Licensed
Unlicensed
Requires Authentication
Minimal points of a supercritical branching walk on the lattice Nr0 and many-type Galton-Watson branching processes
-
B.A. SEVASTYANOV
Published/Copyright:
October 9, 2009
Published Online: 2009-10-09
Published in Print: 2000
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
- Titelei
- Minimal points of a supercritical branching walk on the lattice Nr0 and many-type Galton-Watson branching processes
- Convergence conditions for weighted branching processes
- Matchings up to the permutations which form a Latin rectangle
- A remark on the Galton-Watson forests
- On asymptotic expansions in local limit theorems for equiprobable schemes of allocating particles to distinguishable cells
- Approximation of optima of integer programs of the packing—covering type
- A local limit theorem for the distribution of a part of the spectrum of a random binary function
- On the radius of stability of a vector problem of linear Boolean programming
- A counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope
Articles in the same Issue
- Titelei
- Minimal points of a supercritical branching walk on the lattice Nr0 and many-type Galton-Watson branching processes
- Convergence conditions for weighted branching processes
- Matchings up to the permutations which form a Latin rectangle
- A remark on the Galton-Watson forests
- On asymptotic expansions in local limit theorems for equiprobable schemes of allocating particles to distinguishable cells
- Approximation of optima of integer programs of the packing—covering type
- A local limit theorem for the distribution of a part of the spectrum of a random binary function
- On the radius of stability of a vector problem of linear Boolean programming
- A counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope