The Dynkin Festschrift - Markov Processes and their Applications (Paperback, Softcover reprint of the original 1st ed. 1994)

Onishchik, A. A. Kirillov, and E. B. Vinberg, who obtained their first results on Lie groups in Dynkin's seminar. At a later stage, the work of the seminar was greatly enriched by the active participation of 1. 1. Pyatetskii Shapiro. As already noted, Dynkin started to work in probability as far back as his undergraduate studies. In fact, his first published paper deals with a problem arising in Markov chain theory. The most significant among his earliest probabilistic results concern sufficient statistics. In [15] and [17], Dynkin described all families of one-dimensional probability distributions admitting non-trivial sufficient statistics. These papers have considerably influenced the subsequent research in this field. But Dynkin's most famous results in probability concern the theory of Markov processes. Following Kolmogorov, Feller, Doob and Ito, Dynkin opened a new chapter in the theory of Markov processes. He created the fundamental concept of a Markov process as a family of measures corresponding to var ious initial times and states and he defined time homogeneous processes in terms of the shift operators ()t. In a joint paper with his student A.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Progress in Probability, 34
Release date:	March 2013
First published:	1994
Editors:	Mark I. Freidlin
Dimensions:	235 x 155 x 23mm (L x W x T)
Format:	Paperback
Pages:	416
Edition:	Softcover reprint of the original 1st ed. 1994
ISBN-13:	978-1-4612-6691-4
Categories:	Books > Science & Mathematics > Mathematics > Probability & statistics Promotions
LSN:	1-4612-6691-2
Barcode:	9781461266914

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!