Hardcover ISBN:  9780821804773 
Product Code:  GSM/13 
List Price:  $99.00 
MAA Member Price:  $89.10 
AMS Member Price:  $79.20 
eBook ISBN:  9781470420710 
Product Code:  GSM/13.E 
List Price:  $85.00 
MAA Member Price:  $76.50 
AMS Member Price:  $68.00 
Hardcover ISBN:  9780821804773 
eBook: ISBN:  9781470420710 
Product Code:  GSM/13.B 
List Price:  $184.00 $141.50 
MAA Member Price:  $165.60 $127.35 
AMS Member Price:  $147.20 $113.20 
Hardcover ISBN:  9780821804773 
Product Code:  GSM/13 
List Price:  $99.00 
MAA Member Price:  $89.10 
AMS Member Price:  $79.20 
eBook ISBN:  9781470420710 
Product Code:  GSM/13.E 
List Price:  $85.00 
MAA Member Price:  $76.50 
AMS Member Price:  $68.00 
Hardcover ISBN:  9780821804773 
eBook ISBN:  9781470420710 
Product Code:  GSM/13.B 
List Price:  $184.00 $141.50 
MAA Member Price:  $165.60 $127.35 
AMS Member Price:  $147.20 $113.20 

Book DetailsGraduate Studies in MathematicsVolume: 13; 1996; 249 ppMSC: Primary 28; 94; Secondary 60;
This book is about finitealphabet stationary processes, which are important in physics, engineering, and data compression. The focus is on the combinatorial properties of typical finite sample paths drawn from a stationary, ergodic process. A primary goal, only partially realized, is to develop a theory based directly on sample path arguments with minimal appeals to the probability formalism. A secondary goal is to give a careful presentation of the many models for stationary finitealphabet processes that have been developed in probability theory, ergodic theory, and information theory.
Features:
 Emphasis on recent combinatorial results about sample paths.
 Careful treatment of many models found to be useful in engineering.
 Applications of entropy ideas to coding, sample path structure, distribution estimation, recurrence times, waiting times, and prefix trees.
 Simplification, adaptation, and updating to the process setting of Ornstein isomorphism theory.
ReadershipGraduate students and faculty members in mathematics, engineering, statistics, and physics who are interested in measure theory and probability theory.

Table of Contents

Chapters

Chapter I. Basic concepts

Chapter II. Entropyrelated properties

Chapter III. Entropy for restricted classes

Chapter IV. Bprocesses


Reviews

A very original book on a topic of current interest written by an experienced author.
Zentralblatt MATH 
This is a wellwritten book. Being an expert in the field, the author has chosen his own way of organization and presentation of the material. The result is a unique book with many interesting details for the expert and a text for the graduate student which is well thought out ... covers important and useful aspects of probabilistic discretesamplepaths theory.
Mathematical Reviews 
This is an interesting and wellwritten account of the ergodic theory of stationary processes from the viewpoint of entropy theory. This book is a beautiful and very readable treatment of an important part of ergodic theory. It is written by an expert in the field who has made very significant contributions and who has an excellent knowledge of the great relevance of the theory to other fields such as information theory ... strongly recommend this book to anyone who is interested in ergodic theory, stochastic processes or information theory.
Bulletin of the London Mathematical Society


RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Reviews
 Requests
This book is about finitealphabet stationary processes, which are important in physics, engineering, and data compression. The focus is on the combinatorial properties of typical finite sample paths drawn from a stationary, ergodic process. A primary goal, only partially realized, is to develop a theory based directly on sample path arguments with minimal appeals to the probability formalism. A secondary goal is to give a careful presentation of the many models for stationary finitealphabet processes that have been developed in probability theory, ergodic theory, and information theory.
Features:
 Emphasis on recent combinatorial results about sample paths.
 Careful treatment of many models found to be useful in engineering.
 Applications of entropy ideas to coding, sample path structure, distribution estimation, recurrence times, waiting times, and prefix trees.
 Simplification, adaptation, and updating to the process setting of Ornstein isomorphism theory.
Graduate students and faculty members in mathematics, engineering, statistics, and physics who are interested in measure theory and probability theory.

Chapters

Chapter I. Basic concepts

Chapter II. Entropyrelated properties

Chapter III. Entropy for restricted classes

Chapter IV. Bprocesses

A very original book on a topic of current interest written by an experienced author.
Zentralblatt MATH 
This is a wellwritten book. Being an expert in the field, the author has chosen his own way of organization and presentation of the material. The result is a unique book with many interesting details for the expert and a text for the graduate student which is well thought out ... covers important and useful aspects of probabilistic discretesamplepaths theory.
Mathematical Reviews 
This is an interesting and wellwritten account of the ergodic theory of stationary processes from the viewpoint of entropy theory. This book is a beautiful and very readable treatment of an important part of ergodic theory. It is written by an expert in the field who has made very significant contributions and who has an excellent knowledge of the great relevance of the theory to other fields such as information theory ... strongly recommend this book to anyone who is interested in ergodic theory, stochastic processes or information theory.
Bulletin of the London Mathematical Society