Optimal algebras of random-walk plans kindred to polynomial plans (Q1112526)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal algebras of random-walk plans kindred to polynomial plans |
scientific article; zbMATH DE number 4078590
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal algebras of random-walk plans kindred to polynomial plans |
scientific article; zbMATH DE number 4078590 |
Statements
Optimal algebras of random-walk plans kindred to polynomial plans (English)
0 references
1988
0 references
In the following every plan of random walk on the lattice of integers in \(R^ m\) whose polynomial algebra coincides with the algebra of the polynomial plan with the same stopping boundary will be called a polynomial-kindred (PK) plan. We find necessary and sufficient conditions for the completeness of PK plans and discuss the problem of optimal estimation based on incomplete plans. Moreover, we present a variant of the solution to the problem of choosing the best plan for the estimation of the main parameters in the case of plans for which the mean length of trajectories is uniformly bounded.
0 references
optimal algebra
0 references
necessary and sufficient conditions
0 references
best plan
0 references
uniformly bounded mean path
0 references
random walk on the lattice of integers
0 references
polynomial algebra
0 references
polynomial plan
0 references
stopping boundary
0 references
polynomial- kindred (PK) plan
0 references
completeness of PK plans
0 references
optimal estimation
0 references
incomplete plans
0 references
mean length of trajectories
0 references
0.8049026727676392
0 references
0.7347126603126526
0 references
0.7347124814987183
0 references