Incorporating a collection of recent results, Polya Urn Models deals with discrete probability through the modern and evolving urn theory and its numerous applications. It looks at how some classical problems of discrete probability have roots in urn models. The book covers the Polya-Eggenberger, Bernard Friedman's, the Bagchi-Pal, and the Ehrenfest urns. It also explains the processes of poissonization and depoissonization and presents applications to random trees, evolution, competitive exclusion, epidemiology, clinical trials, and random circuits. The text includes end-of-chapter exercises that range from easy to challenging, along with solutions in the back of the book.

Sri Gopal Mohanty has made pioneering contributions to lattice path counting and its applications to probability and statistics. This is clearly evident from his lifetime publications list and the numerous citations his publications have received over the past three decades. My association with him began in 1982 when I came to McMaster Univer sity. Since then, I have been associated with him on many different issues at professional as well as cultural levels; I have benefited greatly from him on both these grounds. I have enjoyed very much being his colleague in the statistics group here at McMaster University and also as his friend. While I admire him for his honesty, sincerity and dedication, I appreciate very much his kindness, modesty and broad-mindedness. Aside from our common interest in mathematics and statistics, we both have great love for Indian classical music and dance. We have spent numerous many different subjects associated with the Indian music and hours discussing dance. I still remember fondly the long drive (to Amherst, Massachusetts) I had a few years ago with him and his wife, Shantimayee, and all the hearty discussions we had during that journey. Combinatorics and applications of combinatorial methods in probability and statistics has become a very active and fertile area of research in the recent past.

In response to scientific needs for more diverse and structured explanations of statistical data, researchers have discovered how to model individual data points as belonging to multiple groups. Handbook of Mixed Membership Models and Their Applications shows you how to use these flexible modeling tools to uncover hidden patterns in modern high-dimensional multivariate data. It explores the use of the models in various application settings, including survey data, population genetics, text analysis, image processing and annotation, and molecular biology. Through examples using real data sets, you’ll discover how to characterize complex multivariate data in: Studies involving genetic databases Patterns in the progression of diseases and disabilities Combinations of topics covered by text documents Political ideology or electorate voting patterns Heterogeneous relationships in networks, and much more The handbook spans more than 20 years of the editors’ and contributors’ statistical work in the field. Top researchers compare partial and mixed membership models, explain how to interpret mixed membership, delve into factor analysis, and describe nonparametric mixed membership models. They also present extensions of the mixed membership model for text analysis, sequence and rank data, and network data as well as semi-supervised mixed membership models.

Sri Gopal Mohanty has made pioneering contributions to lattice path counting and its applications to probability and statistics. This is clearly evident from his lifetime publications list and the numerous citations his publications have received over the past three decades. My association with him began in 1982 when I came to McMaster Univer sity. Since then, I have been associated with him on many different issues at professional as well as cultural levels; I have benefited greatly from him on both these grounds. I have enjoyed very much being his colleague in the statistics group here at McMaster University and also as his friend. While I admire him for his honesty, sincerity and dedication, I appreciate very much his kindness, modesty and broad-mindedness. Aside from our common interest in mathematics and statistics, we both have great love for Indian classical music and dance. We have spent numerous many different subjects associated with the Indian music and hours discussing dance. I still remember fondly the long drive (to Amherst, Massachusetts) I had a few years ago with him and his wife, Shantimayee, and all the hearty discussions we had during that journey. Combinatorics and applications of combinatorial methods in probability and statistics has become a very active and fertile area of research in the recent past.

The purpose of this book is to give a unified treatment of the limit theory of branching processes. Since the publication of the important book of T E. Harris (Theory of Branching Processes, Springer, 1963) the subject has developed and matured significantly. Many of the classical limit laws are now known in their sharpest form, and there are new proofs that give insight into the results. Our work deals primarily with this decade, and thus has very little overlap with that of Harris. Only enough material is repeated to make the treatment essentially self-contained. For example, certain foundational questions on the construction of processes, to which we have nothing new to add, are not developed. There is a natural classification of branching processes according to their criticality condition, their time parameter, the single or multi-type particle cases, the Markovian or non-Markovian character of the pro cess, etc. We have tried to avoid the rather uneconomical and un enlightening approach of treating these categories independently, and by a series of similar but increasingly complicated techniques. The basic Galton-Watson process is developed in great detail in Chapters I and II.

A self-contained treatment of finite Markov chains and processes, this text covers both theory and applications. Author Marius Iosifescu, vice president of the Romanian Academy and director of its Center for Mathematical Statistics, begins with a review of relevant aspects of probability theory and linear algebra. Experienced readers may start with the second chapter, a treatment of fundamental concepts of homogeneous finite Markov chain theory that offers examples of applicable models. The text advances to studies of two basic types of homogeneous finite Markov chains: absorbing and ergodic chains. A complete study of the general properties of homogeneous chains follows. Succeeding chapters examine the fundamental role of homogeneous infinite Markov chains in mathematical modeling employed in the fields of psychology and genetics; the basics of nonhomogeneous finite Markov chain theory; and a study of Markovian dependence in continuous time, which constitutes an elementary introduction to the study of continuous parameter stochastic processes.