RUS  ENG
Full version
PEOPLE

Chebunin Mikhail Georgievich

Publications in Math-Net.Ru

  1. Limit theorems for forward and backward processes of numbers of non-empty urns in infinite urn schemes

    Sib. Èlektron. Mat. Izv., 20:2 (2023),  913–922
  2. Stability and instability of a random multiple access system with an energy harvesting and self-discharge mechanism

    Sib. Èlektron. Mat. Izv., 20:2 (2023),  735–754
  3. Modifications of Karlin and Simon text models

    Sib. Èlektron. Mat. Izv., 19:2 (2022),  708–723
  4. Stability and instability of a random multiple access system with an energy harvesting mechanism

    Sib. Èlektron. Mat. Izv., 19:1 (2022),  1–17
  5. Harris ergodicity of a Split Transmission Control Protocol

    Sib. Èlektron. Mat. Izv., 18:2 (2021),  1493–1505
  6. Asymptotics of sums of regression residuals under multiple ordering of regressors

    Sib. Èlektron. Mat. Izv., 18:2 (2021),  1482–1492
  7. On the accuracy of the poissonisation in the infinite occupancy scheme

    Sib. Èlektron. Mat. Izv., 18:2 (2021),  1035–1045
  8. A statistical test for correspondence of texts to the Zipf—Mandelbrot law

    Sib. Èlektron. Mat. Izv., 17 (2020),  1959–1974
  9. A statistical test for the Zipf's law by deviations from the Heaps' law

    Sib. Èlektron. Mat. Izv., 16 (2019),  1822–1832
  10. On stability of multiple access systems with minimal feedback

    Sib. Èlektron. Mat. Izv., 16 (2019),  1805–1821
  11. Spatially decentralized protocols in random multiple access networks

    Sib. Èlektron. Mat. Izv., 15 (2018),  135–152
  12. Functional central limit theorem in an infinite urn scheme for distributions with superheavy tails

    Sib. Èlektron. Mat. Izv., 14 (2017),  1289–1298
  13. On ergodic algorithms in systems of multiple access with partial feedback

    Sib. Èlektron. Mat. Izv., 13 (2016),  762–781
  14. Estimation of parameters of probabilistic models which is based on the number of different elements in a sample

    Sib. Zh. Ind. Mat., 17:3 (2014),  135–147
  15. Estimating a Number of Cells via a Number of Occupied Ones under Random Choice

    Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 14:3 (2014),  107–113


© Steklov Math. Inst. of RAS, 2024