|
1. |
A general poisson approximation theorem |
|
Stochastics,
Volume 7,
Issue 3,
1982,
Page 159-171
Esko Valkeila,
Preview
|
PDF (321KB)
|
|
摘要:
We study the rate of convergence in a limit theorem due to Kabanov-Liptser-Shiryayev. We show how the probabilitiesP(Nt=k) can be computed from the compensator, when it is deterministic.
ISSN:0090-9491
DOI:10.1080/17442508208833216
出版商:Gordon and Breach Science Publishers Inc,
年代:1982
数据来源: Taylor
|
2. |
On the interchange of subdifferentiation and conditional expectation for convex functionals |
|
Stochastics,
Volume 7,
Issue 3,
1982,
Page 173-182
R. T. Rockafellar,
R. J. B. Wets,
Preview
|
PDF (308KB)
|
|
摘要:
We show that the operators Eg(conditional expectation given a σ-field g) and ∂ (subdifferentiation), when applied to a normal convex integrand ƒ commute if the effective domain multifunction Ω→{xεRnf(ω,x)<+∞ isg-measurable.
ISSN:0090-9491
DOI:10.1080/17442508208833217
出版商:Gordon and Breach Science Publishers Inc,
年代:1982
数据来源: Taylor
|
3. |
Approximate finite-dimensional filters for some nonlinear problems |
|
Stochastics,
Volume 7,
Issue 3,
1982,
Page 183-203
Héctor J. Sussmann,
Preview
|
PDF (519KB)
|
|
摘要:
We study the robust solutions of nonlinear filtering problemsdX=dW,dY=[X+∈ƒ(X)]dt+dV, where ƒ is a polynomial, and ∈on a parameter. We show that, as ∈→0, the solution has an asymptotic series in powers of ∈, whose coefficients are outputs of finite-dimensional filters. This result had been suggested by Lie-algebraic calculations made by Hazewinkel. The proof given here is rigorous, and does not use Lie algebraic techniques.
ISSN:0090-9491
DOI:10.1080/17442508208833218
出版商:Gordon and Breach Science Publishers Inc,
年代:1982
数据来源: Taylor
|
4. |
Flow in networks with random capacities |
|
Stochastics,
Volume 7,
Issue 3,
1982,
Page 205-229
G. R. Grimmett,
D. J. A. Welsh,
Preview
|
PDF (740KB)
|
|
摘要:
We study the problem of finding the maximum flow through a capacitated network in which the set of capacities is a collection of independent random variables, drawn from some known distribution. We find limit theorems when the underlying graph is either a branching tree or a complete graph. Finally, we discuss the difficulty of the problem of finding the expected maximum flow, using the language of computational complexity, and propose an easy approximate solution to the closely related reliability problem.
ISSN:0090-9491
DOI:10.1080/17442508208833219
出版商:Gordon and Breach Science Publishers Inc,
年代:1982
数据来源: Taylor
|
|