Discrete Algorithms for Solving Two Continuous Problems of Random
- 8 Downloads
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.
Keywordsrandom compact groups computer-assisted analytical calculations generalized Catalan numbers
Unable to display preview. Download preview PDF.
- 1.V. M. Efimov, A. M. Iskol’dskii, Z. A. Lifshits, and Yu. M. Krendel, “On Characteristics of Various Methods of Reading Images of Discrete Structures,” Avtometriya, No. 1, 3–7 (1973).Google Scholar
- 2.A. L. Reznik, A. V. Tuzikov, A. A. Soloview, and A. V. Torgov, “Time-Optimal Algorithms of Searching for Pulsed-Point Sources for Systems with Several Detectors,” Avtometriya 53 (3), 3–11 (2017) [Optoelectron., Instrum. Data Process. 53 (3), 203–209 (2017)].Google Scholar
- 4.A. L. Reznik, A. V. Tuzikov, A. A. Solov’ev, and A. V. Torgov, “Analysis of Random Point Images with the Use of Symbolic Computation Codes and Generalized Catalan Numbers,” Avtometriya 52 (6), 3–11 (2016) [Optoelectron., Instrum. Data Process. 52 (6), 529–536 (2016)].Google Scholar
- 11.A. L. Reznik, V. M. Efimov, and A. A. Solov’ev, “Computer-Analytical Calculation of the Probability Characteristics of Readout of Random Point Images,” Avtometriya 47 (1), 10–16 (2011) [Optoelectron., Instrum. Data Process. 47 (1), 7–11 (2011)].Google Scholar