Ergodic Theory of Discrete Sample Paths

First Printing. small Qto. VG+/-no DJ. HC glossy spine and panel HC, with diagonal colorblocks across rear, spine and front board. spine is titled in tiny dark teal character [more]

First Printing. small Qto. VG+/-no DJ. HC glossy spine and panel HC, with diagonal colorblocks across rear, spine and front board. spine is titled in tiny dark teal characters, light blue for author and publisher, all within a thin light blue line border. titling repeats upon uneven bands and oddly shaped teal textbox. stark white endsheets, upper left corner has very tiny ink date, else clear and excellent. volume lightly perused and with no interior marks. solidly bound and edges smooth on the exterior. a clean tight copy. 249 pp. ISBN # 0821804774.[less]

Brand new. We distribute directly for the publisher. This book is about finite-alphabet stationary processes, which are important in physics, engineering, and data compressio [more]

Brand new. We distribute directly for the publisher. This book is about finite-alphabet 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 man[less]

Brand new. We distribute directly for the publisher. This book is about finite-alphabet stationary processes, which are important in physics, engineering, and data compressio [more]

Brand new. We distribute directly for the publisher. This book is about finite-alphabet 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 finite-alphabet processes that have been developed in probability theory, ergodic theory, and information theory.[less]