Stopped Random Walks

Stopped Random Walks

EnglishHardback
Gut Allan
Springer-Verlag New York Inc.
EAN: 9780387878348
On order
Delivery on Friday, 28. of August 2026
CZK 1,175
Common price CZK 1,306
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

Classical probability theory provides information about random walks after a fixed number of steps. For applications, however, it is more natural to consider random walks evaluated after a random number of steps. Examples are sequential analysis, queueing theory, storage and inventory theory, insurance risk theory, reliability theory, and the theory of counters. Stopped Random Walks: Limit Theorems and Applications shows how this theory can be used to prove limit theorems for renewal counting processes, first passage time processes, and certain two-dimensional random walks, and to how these results are useful in various applications.

This second edition offers updated content and an outlook on further results, extensions and generalizations. A new chapter examines nonlinear renewal processes in order to present the analagous theory for perturbed random walks, modeled as a random walk plus “noise”.

EAN 9780387878348
ISBN 0387878343
Binding Hardback
Publisher Springer-Verlag New York Inc.
Publication date February 27, 2009
Pages 263
Language English
Dimensions 235 x 178
Country United States
Readership Postgraduate, Research & Scholarly
Authors Gut Allan
Illustrations XIV, 263 p.
Edition 2nd ed. 2009
Series Springer Series in Operations Research and Financial Engineering
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.