Probabilities and Potential, C (eBook, ePUB)
Potential Theory for Discrete and Continuous Semigroups
PAYBACK Punkte
72 °P sammeln!
This third volume of the monograph examines potential theory. The first chapter develops potential theory with respect to a single kernel (or discrete time semigroup). All the essential ideas of the theory are presented: excessive functions, reductions, sweeping, maximum principle. The second chapter begins with a study of the notion of reduction in the most general situation possible - the ``gambling house'' of Dubins and Savage. The beautiful results presented have never been made accessible to a wide public. These are then connected with the theory of sweeping with respect to a cone of cont...
This third volume of the monograph examines potential theory. The first chapter develops potential theory with respect to a single kernel (or discrete time semigroup). All the essential ideas of the theory are presented: excessive functions, reductions, sweeping, maximum principle. The second chapter begins with a study of the notion of reduction in the most general situation possible - the ``gambling house'' of Dubins and Savage. The beautiful results presented have never been made accessible to a wide public. These are then connected with the theory of sweeping with respect to a cone of continuous functions, and the integral representation in compact convex sets. The third chapter presents new or little-known results, with the aim of illustrating the effectiveness of capacitary methods in the most varied fields. The last two chapters are concerned with the theory of resolvents.
The fourth and last part of the English edition will be devoted to the theory of Markov processes.
The fourth and last part of the English edition will be devoted to the theory of Markov processes.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
Andere Kunden interessierten sich für
