scientific article

From MaRDI portal
Publication:3915690

zbMath0464.60003MaRDI QIDQ3915690

V. F. Kolchin, B. A. Sevast'yanov, Vladimir P. Chistyakov

Publication date: 1978


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

The probability of successful allocation of particles in cells (the general case)Balanced Allocation: Patience Is Not a VirtueThe probability generating function of empty cell variable in a randomized occupancy problemImages of a finite set under iterations of two random dependent mappingsFrom local interactions to population dynamics in site-based models of ecologyLimit theorems for empirical Rényi entropy and divergence with applications to molecular diversity analysisBeating the Birthday Paradox in Dining Cryptographer NetworksLimit theorem for stationary distribution of a critical controlled branching process with immigrationOn a functional of the number of nonoverlapping chains appearing in the polynomial scheme and its connection with entropyApproaching the coupon collector’s problem with group drawings via Stein’s methodOn a number of particles in a marked set of cells in a general allocation schemeLocal limit theorem for the number of empty cells in a scheme of random equiprobable allocationsMixing Rates for a Random Walk on the CubeClassical and almost sure local limit theoremsOn the average complexity of some bucketing algorithmsPoisson limit theorems in an allocation scheme with an even number of particles in each cellOn the number of empty cells in the allocation scheme of indistinguishable particlesOn numbers related to partitions of unlike objects and occupancy problemsPoisson limit theorems in allocation schemes of distinguishable particlesHopf algebras and Markov chains: two examples and a theoryEstimates of the mean size of the subset image under composition of random mappingsOptimal estimation of variance in nonparametric regression with random designOn the waiting times to repeated hits of cells by particles for the polynomial allocation schemeLarge cliques in sparse random intersection graphsOn the number of empty cells in a non-homogeneous allocation schemeIn Memory of B. A. Sevast'yanov (29.09.1923--30.08.2013)Results and conjectures on the role of the uniform distribution in the coupon collector's problem with group drawingsImproved Side-Channel Collision Attacks on AESHow much data may be safely processed on one key in different modes?On the minimum value of a cell from a pointed set of cellsOn the maximal value of a cell from a pointed set of cellsPoisson limit theorems for number of given value cells in non-homogeneous generalized allocation schemeLimit theorems for number of particles from a fixed set of cellsComputation of distributions of statistics by means of Markov chainsStructure and complexity of extreme Nash equilibriaSpeed and concentration of the covering time for structured coupon collectorsWeak Convergence of Finite-Dimensional Distributions of the Number of Empty Boxes in the Bernoulli SieveLah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walksAsymptotics of the overflow in urn modelsOn the asymptotic distribution of the multinomial maximum with an increasing number of classes




This page was built for publication: