Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Timashev, Aleksandr Nikolaevich

Statistics Math-Net.Ru
Total publications: 40
Scientific articles: 40
Presentations: 11

Number of views:
This page:3864
Abstract pages:15573
Full texts:6027
References:1382

https://www.mathnet.ru/eng/person27782
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/293200

Publications in Math-Net.Ru Citations
2021
1. A. N. Timashev, “On a generalization of class of negative binomial distributions”, Diskr. Mat., 33:1 (2021),  64–81  mathnet  mathscinet; Discrete Math. Appl., 32:4 (2022), 247–261
2. A. N. Timashev, “Local limit theorems for compound discrete distributions”, Teor. Veroyatnost. i Primenen., 66:3 (2021),  589–600  mathnet  zmath; Theory Probab. Appl., 66:3 (2021), 474–481  scopus 1
2020
3. A. N. Timashev, “Linear recurrent relations, power series distributions, and generalized allocation scheme”, Diskr. Mat., 32:3 (2020),  98–112  mathnet  mathscinet; Discrete Math. Appl., 32:1 (2022), 47–58
2019
4. A. N. Timashev, “Local limit theorems for generalized scheme of allocation of particles into ordered cells”, Diskr. Mat., 31:4 (2019),  70–87  mathnet  mathscinet; Discrete Math. Appl., 31:4 (2021), 293–307  isi  scopus
5. A. N. Timashev, “Generalized allocation scheme with cell occupancies from a fixed finite set”, Diskr. Mat., 31:1 (2019),  125–132  mathnet  mathscinet  elib; Discrete Math. Appl., 30:5 (2020), 347–352  isi  scopus
6. A. N. Timashev, “Random mappings with component sizes from a given set”, Teor. Veroyatnost. i Primenen., 64:3 (2019),  599–609  mathnet  mathscinet  zmath  elib; Theory Probab. Appl., 64:3 (2019), 481–489  isi  scopus 4
2018
7. A. N. Timashev, “Limit theorems for some classes of power series type distributions”, Diskr. Mat., 30:4 (2018),  134–145  mathnet  mathscinet  elib; Discrete Math. Appl., 30:1 (2020), 69–78  isi  scopus
8. A. N. Timashev, “Limit theorems for power-series distributions with finite radius of convergence”, Teor. Veroyatnost. i Primenen., 63:1 (2018),  57–69  mathnet  elib; Theory Probab. Appl., 63:1 (2018), 45–56  isi  scopus 4
2017
9. A. N. Timashev, “Limit Poisson law for the distribution of the number of components in generalized allocation scheme”, Diskr. Mat., 29:4 (2017),  143–157  mathnet  elib; Discrete Math. Appl., 29:4 (2019), 255–266  isi 6
10. A. N. Timashev, “Local limit theorems for one class of distributions in probabilistic combinatorics”, Diskr. Mat., 29:2 (2017),  109–132  mathnet  elib; Discrete Math. Appl., 28:6 (2018), 405–420  isi  scopus 1
2016
11. A. N. Timashev, “Random permutations with prime lengths of cycles”, Teor. Veroyatnost. i Primenen., 61:2 (2016),  365–377  mathnet  mathscinet  elib; Theory Probab. Appl., 61:2 (2017), 309–320  isi  scopus 3
2014
12. A. N. Timashev, “On the probability of coincidence of cycle lengths for independent random permutations with given number of cycles”, Diskr. Mat., 26:4 (2014),  110–118  mathnet  mathscinet  elib; Discrete Math. Appl., 25:6 (2015), 385–392  isi  scopus
2013
13. A. N. Timashev, “On an additive problem of number theory with random number of summands”, Mat. Vopr. Kriptogr., 4:1 (2013),  129–150  mathnet
2011
14. A. N. Timashov, “Asymptotic expansions for the distribution of the number of components in random mappings and partitions”, Diskr. Mat., 23:2 (2011),  66–75  mathnet  mathscinet  elib; Discrete Math. Appl., 21:3 (2011), 291–301  scopus 2
15. A. N. Timashov, “Limit theorems for the joint distribution of component sizes of a random mapping with a known number of components”, Diskr. Mat., 23:1 (2011),  21–27  mathnet  mathscinet  elib; Discrete Math. Appl., 21:1 (2011), 39–46  scopus
2008
16. A. N. Timashev, “Random permutations with cycle lengths in a given finite set”, Diskr. Mat., 20:1 (2008),  25–37  mathnet  mathscinet  elib; Discrete Math. Appl., 18:1 (2008), 25–39  scopus 8
2006
17. A. N. Timashev, “Large deviations for the number of trees of a given size and for the maximum size of a tree in a random forest”, Diskr. Mat., 18:3 (2006),  77–84  mathnet  mathscinet  zmath  elib; Discrete Math. Appl., 16:6 (2006), 555–561  scopus 1
2005
18. A. N. Timashev, “The law of large numbers for permanents of random matrices”, Diskr. Mat., 17:4 (2005),  59–71  mathnet  mathscinet  zmath  elib; Discrete Math. Appl., 15:5 (2005), 513–526
2004
19. A. N. Timashev, “Random free trees and forests with constraints on the multiplicities of vertices”, Diskr. Mat., 16:4 (2004),  117–133  mathnet  mathscinet  zmath; Discrete Math. Appl., 14:6 (2004), 603–618 1
20. A. N. Timashev, “Limit theorems for allocation of particles over different cells with restrictions to the size of the cells”, Teor. Veroyatnost. i Primenen., 49:4 (2004),  712–725  mathnet  mathscinet  zmath; Theory Probab. Appl., 49:4 (2005), 659–670  isi 11
2003
21. A. N. Timashev, “On asymptotic expansions for the distribution of the number of cycles in a random permutation”, Diskr. Mat., 15:3 (2003),  117–127  mathnet  mathscinet  zmath; Discrete Math. Appl., 13:5 (2003), 417–427 3
22. A. N. Timashev, “Random partitions of sets with a known number of blocks”, Diskr. Mat., 15:2 (2003),  138–148  mathnet  mathscinet  zmath; Discrete Math. Appl., 13:3 (2003), 307–317 2
23. A. N. Timashev, “Random mappings of finite sets with a known number of components”, Teor. Veroyatnost. i Primenen., 48:4 (2003),  818–828  mathnet  mathscinet  zmath; Theory Probab. Appl., 48:4 (2004), 741–751  isi 6
2002
24. A. N. Timashev, “On permanents of random doubly stochastic matrices and on asymptotic estimates for the number of Latin rectangles and Latin squares”, Diskr. Mat., 14:4 (2002),  65–86  mathnet  mathscinet  zmath; Discrete Math. Appl., 12:5 (2002), 431–452 5
25. A. N. Timashev, “On the asymptotics of the probabilities of large deviations for a negative polynomial distribution”, Diskr. Mat., 14:1 (2002),  75–81  mathnet  mathscinet  zmath; Discrete Math. Appl., 12:1 (2002), 61–68
26. A. N. Timashev, “Integral limit theorems on large deviations for multidimensional hypergeometric distribution”, Teor. Veroyatnost. i Primenen., 47:1 (2002),  71–79  mathnet  mathscinet  zmath; Theory Probab. Appl., 47:1 (2003), 91–98  isi
2001
27. A. N. Timashev, “On the distribution of the number of cycles of a given length in the class of permutations with known number of cycles”, Diskr. Mat., 13:4 (2001),  60–72  mathnet  mathscinet  zmath; Discrete Math. Appl., 11:5 (2001), 471–483 5
2000
28. A. N. Timashev, “On asymptotic expansions in local limit theorems for equiprobable schemes of allocating particles to distinguishable cells”, Diskr. Mat., 12:1 (2000),  60–69  mathnet  mathscinet  zmath; Discrete Math. Appl., 10:1 (2000), 63–73 4
29. A. N. Timashev, “On the large-deviation asymptotics in an allocation scheme of particles into distinguishable cells with restrictions on the size of the cells”, Teor. Veroyatnost. i Primenen., 45:3 (2000),  521–535  mathnet  mathscinet  zmath; Theory Probab. Appl., 45:3 (2001), 494–506  isi 1
1999
30. A. N. Timashev, “The law of large numbers for permanents of random stochastic matrices”, Diskr. Mat., 11:3 (1999),  91–98  mathnet  mathscinet  zmath; Discrete Math. Appl., 9:4 (1999), 375–383 3
1998
31. A. N. Timashev, “On asymptotic expansions of Stirling numbers of the first and second kinds”, Diskr. Mat., 10:3 (1998),  148–159  mathnet  mathscinet  zmath; Discrete Math. Appl., 8:5 (1998), 533–544 9
32. A. N. Timashev, “On asymptotic expansions in the domain of large deviations for binomial and Poisson distributions”, Teor. Veroyatnost. i Primenen., 43:1 (1998),  57–68  mathnet  mathscinet  zmath; Theory Probab. Appl., 43:1 (1999), 89–98  isi 3
1997
33. A. S. Ambrosimov, A. N. Timashev, “On a randomized approach to the construction of tests for the equiprobability of outcomes of a multinomial scheme”, Diskr. Mat., 9:3 (1997),  43–51  mathnet  mathscinet  zmath; Discrete Math. Appl., 7:4 (1997), 399–407 1
34. A. N. Timashev, “Estimates for the probability of the coincidence of the frequency vectors of outcomes of independent multinomial schemes”, Diskr. Mat., 9:1 (1997),  59–70  mathnet  mathscinet  zmath; Discrete Math. Appl., 7:1 (1997), 65–76
1995
35. A. N. Timashev, “Poisson limit distribution of the number of empty cells in a generalized equiprobable scheme for the distribution of particles by groups”, Diskr. Mat., 7:2 (1995),  140–145  mathnet  mathscinet  zmath; Discrete Math. Appl., 5:3 (1995), 277–281
36. A. S. Ambrosimov, A. N. Timashev, “The Law of Large Numbers for Capacity of Memoryless Channels with a Random Matrix of Transition Probabilities”, Probl. Peredachi Inf., 31:3 (1995),  24–34  mathnet  mathscinet  zmath; Problems Inform. Transmission, 31:3 (1995), 216–224 1
1993
37. A. N. Timashev, “Large deviation theorems in a scheme of allocating identical particles to different cells”, Diskr. Mat., 5:4 (1993),  29–42  mathnet  mathscinet  zmath; Discrete Math. Appl., 3:6 (1993), 635–647 1
38. A. N. Timashev, “Large deviation theorems in a multinomial scheme of trials”, Diskr. Mat., 5:2 (1993),  83–89  mathnet  mathscinet  zmath; Discrete Math. Appl., 3:4 (1993), 443–449 1
1992
39. A. N. Timashev, “A multidimensional integral theorem on large deviations in a uniform probability allocation scheme”, Diskr. Mat., 4:4 (1992),  74–81  mathnet  mathscinet  zmath
1990
40. A. N. Timashev, “Multidimensional local theorems on large deviations in an equiprobable allocation scheme”, Diskr. Mat., 2:2 (1990),  145–149  mathnet  mathscinet  zmath; Discrete Math. Appl., 2:2 (1992), 235–239

Presentations in Math-Net.Ru
1. Локальные предельные теоремы для одного класса распределений в вероятностной комбинаторике
A. N. Timashev
Seminar by Department of Discrete Mathematic, Steklov Mathematical Institute of RAS
January 31, 2017 16:00
2. Случайные подстановки с длинами циклов из заданного множества нулевой плотности
A. N. Timashev
Seminar by Department of Discrete Mathematic, Steklov Mathematical Institute of RAS
July 7, 2015 16:00
3. О числе целых точек в многомерных шарах и на сферах растущей размерности
A. N. Timashev
Seminar by Department of Discrete Mathematic, Steklov Mathematical Institute of RAS
May 20, 2014 16:00
4. Проблема Варинга в простых числах и случайные подстановки с простыми длинами циклов
A. N. Timashev
Seminar by Department of Discrete Mathematic, Steklov Mathematical Institute of RAS
November 28, 2013 16:00
5. Аддитивная задача с простыми числами в обобщенной схеме размещения
A. N. Timashev
Seminar by Department of Discrete Mathematic, Steklov Mathematical Institute of RAS
May 14, 2013 17:00
6. Предельные теоремы в проблеме Варинга с растущим числом слагаемых
A. N. Timashev
Seminar by Department of Discrete Mathematic, Steklov Mathematical Institute of RAS
December 28, 2010 16:00
7. Предельные теоремы для распределений, связанных с бесселевыми функциями
A. N. Timashev
Seminar by Department of Discrete Mathematic, Steklov Mathematical Institute of RAS
April 14, 2009 15:00
8. Асимптотические разложения для распределения числа компонент в случайных отображениях, подстановках и разбиениях
A. N. Timashev
Seminar by Department of Discrete Mathematic, Steklov Mathematical Institute of RAS
March 13, 2007 16:00
9. Предельный закон Пуассона в обобщенной схеме размещения
A. N. Timashev
Seminar by Department of Discrete Mathematic, Steklov Mathematical Institute of RAS
June 13, 2006
10. Предельные теоремы в обобщенной схеме размещения с ограничениями на заполнения ячеек
A. N. Timashev
Seminar by Department of Discrete Mathematic, Steklov Mathematical Institute of RAS
April 26, 2005
11. Предельные теоремы в схемах размещения частиц по различимым ячейкам с ограничениями на заполнения ячеек
A. N. Timashev
Seminar by Department of Discrete Mathematic, Steklov Mathematical Institute of RAS
September 21, 2004

Organisations
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024