No label defined (Q3317809)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3848301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3848301 |
Statements
1984
0 references
exchangeable random variables
0 references
random mappings of finite sets
0 references
allocating particles
0 references
random trees
0 references
0.8400839567184448
0 references
0.8400838971138
0 references
The purpose of this monograph is to present some recent combinatorial results obtained by asymptotic methods of probability theory. The combinatorial objects under consideration are permutations, trees, forests and mappings of finite sets. The sets of these objects are equiped with the uniform probability measure. So, each numerical characteristic of the objects may be considered as a random variable and may be investigated by well-known probabilistic methods. Usually these characteristics are dependent random variables and their joint probability distributions are invariant with respect to a permutation of their indexes. By analogy with the case of infinite sequences of exchangeable random variables a representation of these joint distributions as conditional distributions of independent random variables should be expected. The possibility of this representation, established by the author in previous papers [see for example Teor. Veroyatn. Primen. 16, 67-82 (1971; Zbl 0239.60014); English translation in Theory Probab. Appl. 16, 74-90 (1971); ibid. 21, 48-63 (1976; Zbl 0366.60015); English translation in Theory Probab. Appl. 21, 48-62 (1976); Mat. Zametki 21, 691-705 (1977; Zbl 0363.60070); English translation in Math. Notes 21, 386-394 (1977); ibid. 24, 859-871 (1978; Zbl 0415.60079); English translation in Math. Notes 24, 954-961 (1979)], is employed in the whole monograph and a great number of asymptotic results, formulated as probabilistic limit theorems, is presented. The statement is based on connections between random mappings of finite sets and the general scheme of allocating particles into cells and between random trees (or forests) and branching processes. Let us note that mappings of finite sets as well as trees and forests have unique graph-representations and most of the random variables under consideration characterize some concrete graph properties of these objects. All limit theorems stated in the monograph are proved under the assumption that the number of the vertices in the corresponding graph- representations tends to infinity. In other words, the statement concerns typically random graphtheoretic problems for establishing the weak convergence of sequences of probability distributions. The monograph is broken into three chapters and contains a bibliography with 112 references. In chapter I the results obtained by the reduction to the general scheme of allocating particles into cells are stated and limit theorems for the cyclic and component's structure of random single- valued mappings and permutations are proved. In chapter II some characteristics of random trees are investigated by methods of the theory of branching processes. In chapter III the relation between random trees and branching processes is extended to random forests. Using that, some properties of random single-valued mappings are studied. All references are given in the concluding sections of each chapter, however the author's aim is not to present an exhausting survey of the investigations in the subject. Besides the papers used directly in the basic text, some results similar to it or obtained by other methods are included in the survey sections. To monograph contains many important facts and general probability methods for studying problems in the branches of discrete mathematics mentioned above. Most of the results stated are obtained during the last 15 years and published in a book for the first time. Thus, the material included would be very useful for specialists who are interested in combinatorial probabilities and limit theorems. Many proofs of the theorems will also be instructive for students who specialize in probability theory and stochastic processes.
0 references