1 citations · 1 across the 9 of their papers we have counts for
11 papers
Limit theorems for a class of random outer measures in infinite urn schemes
Berhane Abebe, Mikhail Chebunin, Artyom Kovalevskii
An urn scheme is a probabilistic model in which balls are placed into urns sequentially and independently of each other. All balls share the same probability distribution for hitti…
Asymptotics of joint orderings of compound Poisson fields
Mikhail Chebunin, Artyom Kovalevskii
We are developing a new method for the analysis of queuing systems with heterogeneous in time and space compound (marked) Poisson input flow. The state space of the input flow is e…
Limit theorems for forward and backward processes of numbers of non-empty urns in infinite urn schemes
Mikhail Chebunin, Artyom Kovalevskii
We study the joint asymptotics of forward and backward processes of numbers of non-empty urns in an infinite urn scheme. The probabilities of balls hitting the urns are assumed to…
Asymptotics of sums of regression residuals under multiple ordering of regressors
Mikhail Chebunin, Artyom Kovalevskii
We prove theorems about the Gaussian asymptotics of an empirical bridge built from linear model regressors with multiple regressor ordering. We study the testing of the hypothesis…
Modifications of Simon text model
Mikhail Chebunin, Artyom Kovalevskii
We discuss probability text models and their modifications. We construct processes of different and unique words in a text. The models are to correspond to the real text statistics…
A statistical test for correspondence of texts to the Zipf-Mandelbrot law
Anik Chakrabarty, Mikhail Chebunin, Artyom Kovalevskii +3
We analyse correspondence of a text to a simple probabilistic model. The model assumes that the words are selected independently from an infinite dictionary. The probability distri…