Renewal Theory for Perturbed Random Walks and Similar Processes (Hardcover, 1st ed. 2016)

This book offers a detailed review of perturbed random walks, perpetuities, and random processes with immigration. Being of major importance in modern probability theory, both theoretical and applied, these objects have been used to model various phenomena in the natural sciences as well as in insurance and finance. The book also presents the many significant results and efficient techniques and methods that have been worked out in the last decade. The first chapter is devoted to perturbed random walks and discusses their asymptotic behavior and various functionals pertaining to them, including supremum and first-passage time. The second chapter examines perpetuities, presenting results on continuity of their distributions and the existence of moments, as well as weak convergence of divergent perpetuities. Focusing on random processes with immigration, the third chapter investigates the existence of moments, describes long-time behavior and discusses limit theorems, both with and without scaling. Chapters four and five address branching random walks and the Bernoulli sieve, respectively, and their connection to the results of the previous chapters. With many motivating examples, this book appeals to both theoretical and applied probabilists.

General

Imprint:	Birkhauser Verlag AG
Country of origin:	Switzerland
Series:	Probability and Its Applications
Release date:	2017
First published:	2016
Authors:	Alexander Iksanov
Dimensions:	235 x 155 x 20mm (L x W x T)
Format:	Hardcover
Pages:	250
Edition:	1st ed. 2016
ISBN-13:	978-3-319-49111-0
Categories:	Books > Science & Mathematics > Mathematics > Probability & statistics Promotions
LSN:	3-319-49111-3
Barcode:	9783319491110

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!