Discrete Algorithms for Solving Two Continuous Problems of Random

Аннотация

A combinatorial-discrete approach to solving continuous probabilistic problems arising in the analysis of random point structures is proposed. It is based on replacement of computational schemes based on calculations of cumbersome multidimensional integral expressions by schemes that do not require the use of the apparatus of differential and integral calculus. Another distinctive feature of the study is the systematic use of the generalized Catalan numbers from the multidimensional extension of the classical Catalan sequence for ranking random mutually dependent sequences.