01.01.05 (Probability theory and mathematical statistics)
Birth date:
2.12.1934
E-mail:
Keywords:
hypertree, test of statistical hypotheses, enumeration, limit theorem,
random arragements, statisic of chi-square type.
UDC:
519.1, 519.2, 519.3, 519.4, 519.6, 519.24
Subject:
Theory of probability, mathematical statistic, combinatorial analysis.
Main publications:
O tsiklovom indekse eksponentsiatsii grupp. - V sb. "Kombinatornyi analiz", M.: MGU, 1971, # 1, s. 79–90.
Perechislitelnye zadachi dlya prostykh gipergrafov, I. II. - V sb. "Kombinatornyi analiz", M.: MGU, 1974, # 3, s. 57–67, 1976, # 4, s. 88–95 (sovmestno s V. N. Lyaminym).
Kombinatornoe dokazatelstvo teoremy perechisleniya dlya eksponentsiatsii grupp. - "Matemat. zametki", 1982, t. 32, # 6, s. 809–816.
Ob odnom klasse statistik tipa khi-kvadrat. - "Obozrenie prikladnoi i promyshlennoi matem.", 1995, t. 2, # 6, s. 226–266.
O kombinatornykh funktsiyakh, svyazannykh s ryadom Byurmana–Lagranzha. - "Diskretnaya matem.",
1998, t. 10, # 1, s. 127–140.
Ob odnom obobschenii klassicheskoi zadachi o drobinkakh. -
"Teoriya veroyatnostei i ee prmen.", 1998, t. 43, # 2, s. 315–330.
Semeistvo mnogomernykh statistik khi-kvadrat. - "Diskretnaya matem.", 2002, t. 14, # 3, s. 130–142.
B. I. Selivanov, V. P. Chistyakov, “On the waiting time for repeated hits of particles into the cells in the polynomial allocated scheme”, Discrete Math. Appl., 30:6 (2020), 409–415
2016
3.
B. I. Selivanov, V. P. Chistyakov, “Limit theorems for the number of successes in random binary sequences with random embeddings”, Discrete Math. Appl., 26:6 (2016), 355–367
2015
4.
A. M. Zubkov, B. I. Selivanov, “On a statistic for testing the homogeneity of polynomial samples”, Discrete Math. Appl., 25:2 (2015), 109–120
2011
5.
A. M. Zubkov, B. I. Selivanov, “Ob odnoi statistike dlya proverki odnorodnosti polinomialnykh vyborok”, Mezhdunarodnyi kongress po informatike. Informatsionnye sistemy i tekhnologii (g. Minsk, 31 oktyabrya–3 noyabrya 2011 g.), ch. 1, BGU, Minsk, 2011, 74–76
2009
6.
B. I. Selivanov, “On a class of statistics of polynomial samples”, Discrete Math. Appl., 19:3 (2009), 309–320
7.
A. M. Zubkov, B. I. Selivanov, “Novaya statistika dlya proverki odnorodnosti polinomialnykh vyborok”, Tezisy doklada, VII mezhdunarodnaya konferentsiya “Veroyatnostnye metody v diskretnoi matematike” (g. Petrozavodsk, 1–6 iyunya 2008 g.), OPPM, 16, no. 1, 2009, 78–79
2008
8.
B. I. Selivanov, “Limit Distributions of the $\chi^2$ Statistic of K. Pearson in a Sequence of Independent Trials”, Math. Notes, 83:6 (2008), 821–832
9.
B. I. Selivanov, “O nekotorykh statistikakh v skheme sluchainykh tablichnykh razmeschenii”, Tezisy doklada, IX Vserossiiskii simpozium po prikladnoi i promyshlennoi matematike (g. Kislovodsk, 1–8 maya 2008 g.), OPPM, 15, no. 6, 2008, 1131–1132
2007
10.
B. I. Selivanov, “Redutsirovannaya statistika khi-kvadrat Pirsona”, Tezisy doklada, XIII Vserossiiskaya shkola-kollokvium po stokhasticheskim metodam (g. Ioshkar-Ola, 16–22 dekabrya 2006), OPPM, 14, no. 2, 2007, 251–252
2006
11.
B. I. Selivanov, “On calculation of exact distributions of decomposable statistics in the multinomial scheme”, Discrete Math. Appl., 16:4 (2006), 359–369
12.
B. I. Selivanov, “O vychislenii tochnykh raspredelenii mnogomernykh razdelimykh statistik”, Tezisy doklada, VII Vserossiiskii simpozium po prikladnoi i promyshlennoi matematike (g. Kislovodsk, 2–8 maya 2006 g.), OPPM, 13, no. 2, 2006, 351–353
13.
B. I. Selivanov, “O statistike khi-kvadrat dlya proverki odnorodnosti polinomialnykh vyborok”, Tezisy doklada, VII Vserossiiskii simpozium po prikladnoi i promyshlennoi matematike (g. Kislovodsk, 2–8 maya 2006 g.), OPPM, 13, no. 3, 2006, 542–543
2005
14.
B. I. Selivanov, “Ob odnom semeistve statistik polinomialnoi skhemy”, Tezisy doklada, XII Vserossiiskaya shkola-kollokvium po stokhasticheskim metodam (g. Sochi-Dagomys, 1–7 oktyabrya 2005 g.), OPPM, 12, no. 4, 2005, 871–872
15.
B. I. Selivanov, “O statistikakh – differentsiruemykh funktsiyakh chastot iskhodov M polinomialnykh vyborok”, Tezisy doklada, XII Vserossiiskaya shkola-koollokvium po stokhasticheskim metodam (g. Sochi-Dagomys, 1–7 oktyabrya 2005 g.), OPPM, 12, no. 4, 2005, 872–873
2004
16.
B. I. Selivanov, “A family of multivariate $\chi^2$-statistics”, Discrete Math. Appl., 14:5 (2004), 527–533
17.
B. I. Selivanov, “Byurmana-Lagranzha formula dlya formalnykh stepennykh ryadov”, Diskretnaya matematika. Entsiklopediya, Nauchnoe izdatelstvo “Bolshaya Rossiiskaya entsiklopediya”, M., 2004, 44
18.
B. I. Selivanov, “Gipergrafy”, Diskretnaya matematika. Entsiklopediya, Nauchnoe izdatelstvo “Bolshaya Rossiiskaya entsiklopediya”, M., 2004, 55–57
19.
B. I. Selivanov, “Ob odnom vremeni ozhidaniya, svyazannom so sluchainymi razmescheniyami v dvumernoi tablitse”, Tezisy doklada, VI mezhdunarodnaya konferentsiya "Veroyatnostnye metody v diskretnoi matematike (g. Petrozavodsk, 10–16 iyunya 2004 g.), OPPM, 11, no. 2, 2004, 251
2002
20.
B. I. Selivanov, “A family of multivariate chi-square statistics”, Discrete Math. Appl., 12:4 (2002), 401–413
2001
21.
V. G. Mikhailov, B. I. Selivanov, “On some statistics in a scheme of particles allocation in cells of a two-dimensional table”, Tr. Diskr. Mat., 4, Fizmatlit, Moscow, 2001, 169–176
22.
B. I. Selivanov, “Ob odnom klasse uslovnykh raspredelenii, svyazannykh so sluchainymi tablichnymi razmescheniyami”, Tezisy doklada, VIII Vserossiiskaya shkola- kollokvium po stokhasticheskim metodam (g. Ioshkar-Ola, 1–6 dekabrya 2001 g.), OPPM, 8, no. 2, 2001, 800–801
1999
23.
B. I. Selivanov, V. P. Chistyakov, “Two remarks on the multidimensional $\chi^2$ statistic”, Discrete Math. Appl., 9:6 (1999), 645–651
24.
B. I. Selivanov, “On a generalization of the classical allocation problem”, Theory Probab. Appl., 43:2 (1999), 256–268
1998
25.
B. I. Selivanov, V. P. Chistyakov, “Multivariate chi-square distribution for a nonhomogeneous multinomial scheme”, Discrete Math. Appl., 8:3 (1998), 263–273
26.
B. I. Selivanov, “On combinatorial functions related to the Bürman–Lagrange series. Quasi-orthogonality relations”, Discrete Math. Appl., 8:1 (1998), 127–140
1997
27.
B. I. Selivanov, V. P. Chistyakov, “The sequential chi-square test based on $s$-tuples of states of a Markov chain”, Discrete Math. Appl., 7:5 (1997), 523–532
1995
28.
B. I. Selivanov, “On the waiting time in a scheme for the random allocation of colored particles”, Discrete Math. Appl., 5:1 (1995), 73–82
29.
B. I. Selivanov, “One class of statistics type chi-square”, Surveys in Applied and Industrial Mathematics, 2:6 (1995), 226–266
1991
30.
B. I. Selivanov, “Dimensions of branches of random $m$-trees”, Discrete Math. Appl., 1:1 (1991), 97–103
1988
31.
B. I. Selivanov, “On the number of edges in the branches of random m-trees”, Probabilistic Methods in Discrete Mathematics, Abstrackts of reports (Petrozavodsk, 1988, 05.24 - 05.26), 2, The Karelian branch of the USSR Academy of Sciences, Petrozavodsk, 1988, 92
32.
B. I. Selivanov, “Statistics type chi-square in the scheme of independent trials”, Probabilistic Methods in Discrete Mathematics, Abstrackts of reports (Petrozavodsk, 1988, 05.24 - 05.26), 2, The Karelian branch of the USSR Academy of Sciences, Petrozavodsk, 1988, 93–94
1985
33.
B. I. Selivanov, “On the limit distributions for $\chi^2$ statistic”, Theory Probab. Appl., 29:1 (1985), 133–134
1983
34.
B. I. Selivanov, “One class of statistics for polynomial samples”, Probabilistic methods in discrete mathematics, Abstrackts of reports (Petrozavodsk, 1983.05.31-06.02), The Karelian branch of the USSR Academy of Sciences, Petrozavodsk, 1983, 84–85
35.
A. F. Ronžin, B. I. Selivanov, “Limit theorems for a stopping time in a disorder problem”, Theory Probab. Appl., 27:3 (1983), 615–619
1982
36.
B. I. Selivanov, “A combinatorial proof of the enumeration theorem for exponentiation of groups”, Math. Notes, 32:6 (1982), 890–894
1979
37.
G. P. Gavrilov, V. A. Liskovets, P. P. Permyakov, B. I. Selivanov, “Some trends in the theory of enumeration”, Enumerative Problems in Combinatorial Analysis, eds. G. P. Gavrilov, Mir, M., 1979, 336–362
1978
38.
V. N. Lyamin, B. I. Selivanov, “Asymptotic normality of the number of edges of a given size in a random hypertree”, Problems of Cybernetics, Combinatorial Analysis and Graph Theory, 26, AS USSR, Scientific Council on the complex Problem “Cybernetics”, 1978, 26–37
1977
39.
B. I. Selivanov., “A combinatorial approach to the Burman-Lagrange inversion formula”, Combinatorial and Asymptotic. Analysis, 2, Krasnojarsk. Gos. Univ., Krasnojarsk, 1977, 153–169
1976
40.
V. N. Lyamin, B. I. Selivanov, “Enumeration problems for simple hypergraphs. II”, Kombinatornyĭ Analysis (M.: Mos. Gos. Univ.), 1976, no. 4, 88–95
41.
B. I. Selivanov, A. F. Ronžin, “Partition of colored sets”, Asymptotic and enumeration problems of combinatorial analysis, Irkutsk. and Krasnojarsk. Gos. Univ., Irkutsk, Krasnojarsk, 1976, 77-88
1975
42.
B. I. Selivanov, “Additional remarks on homogeneous hypertrees and hyperforest”, Combinatorial and Asymptotic Analysis, Krasnojarsk. Gos. Univ., Krasnojarsk, 1975, 137–146
1974
43.
V. N. Lyamin, B. I. Selivanov, “Enumeration problems for simple hypergraphs”, Kombinatornyĭ Analysis, 1974, no. 3, 57–67
44.
V. N. Lyamin, B. I. Selivanov, “Hypertrees with a given number of end vertices and edges”, Kombinatornyĭ Analysis, 1974, no. 3, 68–71
45.
V. N. Lyamin, B. I. Selivanov, “Random hypertrees and hyperforests”, Math. Notes, 15:4 (1974), 380–385
1972
46.
B. I. Selivanov., “Enumeration of homogeneous hypergraphs with a simple cycle structure”, Kombinatornyi Analysis, 1972, no. 2, 60–67
47.
B. I. Selivanov, “The generating function of a certain statistic in a multinomial scheme with a countable number of outcomes”, Kombinatornyi Analysis, 1972, no. 2, 11–16
1971
48.
B. I. Selivanov, “Generalization of the problem of the number of partitions of a finite set”, Math. Notes, 10:3 (1971), 639–642
49.
B. I. Selivanov., “The cycle index of the exponehtiation group”, Kombinatornyi Analysis, 1971, no. 1, 79–90
1969
50.
B. I. Selivanov, “Some explicit formulas in the theory of branching stochastic processes with discrete time and one-type particles”, Theory Probab. Appl., 14:2 (1969), 336–342
2020
Contact us: