Dependence with complete connections and its applications

Bibliographic Information

Dependence with complete connections and its applications

Marius Iosifescu, Serban Grigorescu

(Cambridge tracts in mathematics, 96)

Cambridge University Press, 1990

Search this Book/Journal
Note

Bibliography: p. [284]-302

Includes index

Description and Table of Contents

Description

Dependence with complete connections is a more general type of stochastic process than the well-known Markovian dependence, accounting for a complete history of a stochastic evolution. This book is an authoritative survey of knowledge of the subject, dealing with the basic theoretical understanding and also with applications. These arise in a variety of situations as diverse as stochastic models of learning, branching processes in random environments, continued fractions and dynamical systems. Thus the book will appeal to mathematicians working in probability theory, ergodic theory and number theory, as well as applied mathematicians, engineers, biologists and social scientists interested in applications of stochastic methods.

Table of Contents

  • Preface
  • Introduction
  • 1. Fundamental notions
  • 2. Ergodicity
  • 3. The associated Markov chain
  • 4. Asymptotic behaviour
  • 5. Some special systems
  • Appendices
  • Notes and comments
  • Reference
  • Index.

by "Nielsen BookData"

Related Books: 1-1 of 1
Details
Page Top