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.
Parametric hypothesis testing (62F03) Central limit and other weak theorems (60F05) Nonparametric tolerance and confidence regions (62G15) Strong limit theorems (60F15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Stochastic mechanics (including stochastic electrodynamics) (81P20) Research exposition (monographs, survey articles) pertaining to probability theory (60-02)
Related Items
The probability of successful allocation of particles in cells (the general case) ⋮ Balanced Allocation: Patience Is Not a Virtue ⋮ The probability generating function of empty cell variable in a randomized occupancy problem ⋮ Images of a finite set under iterations of two random dependent mappings ⋮ From local interactions to population dynamics in site-based models of ecology ⋮ Limit theorems for empirical Rényi entropy and divergence with applications to molecular diversity analysis ⋮ Beating the Birthday Paradox in Dining Cryptographer Networks ⋮ Limit theorem for stationary distribution of a critical controlled branching process with immigration ⋮ On a functional of the number of nonoverlapping chains appearing in the polynomial scheme and its connection with entropy ⋮ Approaching the coupon collector’s problem with group drawings via Stein’s method ⋮ On a number of particles in a marked set of cells in a general allocation scheme ⋮ Local limit theorem for the number of empty cells in a scheme of random equiprobable allocations ⋮ Mixing Rates for a Random Walk on the Cube ⋮ Classical and almost sure local limit theorems ⋮ On the average complexity of some bucketing algorithms ⋮ Poisson limit theorems in an allocation scheme with an even number of particles in each cell ⋮ On the number of empty cells in the allocation scheme of indistinguishable particles ⋮ On numbers related to partitions of unlike objects and occupancy problems ⋮ Poisson limit theorems in allocation schemes of distinguishable particles ⋮ Hopf algebras and Markov chains: two examples and a theory ⋮ Estimates of the mean size of the subset image under composition of random mappings ⋮ Optimal estimation of variance in nonparametric regression with random design ⋮ On the waiting times to repeated hits of cells by particles for the polynomial allocation scheme ⋮ Large cliques in sparse random intersection graphs ⋮ On the number of empty cells in a non-homogeneous allocation scheme ⋮ In 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 drawings ⋮ Improved Side-Channel Collision Attacks on AES ⋮ How much data may be safely processed on one key in different modes? ⋮ On the minimum value of a cell from a pointed set of cells ⋮ On the maximal value of a cell from a pointed set of cells ⋮ Poisson limit theorems for number of given value cells in non-homogeneous generalized allocation scheme ⋮ Limit theorems for number of particles from a fixed set of cells ⋮ Computation of distributions of statistics by means of Markov chains ⋮ Structure and complexity of extreme Nash equilibria ⋮ Speed and concentration of the covering time for structured coupon collectors ⋮ Weak Convergence of Finite-Dimensional Distributions of the Number of Empty Boxes in the Bernoulli Sieve ⋮ Lah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walks ⋮ Asymptotics of the overflow in urn models ⋮ On the asymptotic distribution of the multinomial maximum with an increasing number of classes
This page was built for publication: