Poisson approximation in connection with clustering of random points
Let \(n\) particles be independently and uniformly distributed in a rectangle \({\mathbf A}\subset\mathbb{R}\). The number of \(k\) subsets of particles which are actually covered by some translate of a given convex set \({\mathbf A}\subset{\mathbf C}\) is denoted by \(W\). The positions of such subsets constitute a point process on \({\mathbf A}\). Each point of this process can be marked with the smallest necessary ``size of a set, of the same shape and orientation as \(C\), which covers the particles determining the point. This paper considers Poisson (process) approximations of \(W\) and of the above point process, by way of Stein's method.
- Approximations and Bounds for the Distribution of the Scan Statistic
- Approximations for Distributions of Scan Statistics
- Bounds on the distributions of extremal values of a scanning process
- Compound Poisson approximation for nonnegative random variables via Stein's method
- Dissociated random variables
- scientific article; zbMATH DE number 3820837 (Why is no real title available?)
- scientific article; zbMATH DE number 3905681 (Why is no real title available?)
- scientific article; zbMATH DE number 3011213 (Why is no real title available?)
- scientific article; zbMATH DE number 3048063 (Why is no real title available?)
- scientific article; zbMATH DE number 3055211 (Why is no real title available?)
- scientific article; zbMATH DE number 3104031 (Why is no real title available?)
- Iterations of translative integral formulae and non-isotropic Poisson processes of particles
- Large-deviation approximations to the distribution of scan statistics
- On interpoint distances for planar Poisson cluster processes
- On the Distributions of Scan Statistics of a Two-Dimensional Poisson Process
- Poisson approximation for dependent trials
- Poisson approximation for some statistics based on exchangeable trials
- Probability approximations via the Poisson clumping heuristic
- Rates of Poisson convergence for U-statistics
- Short distances, flat triangles and Poisson limits
- THE FUNDAMENTAL FORMULA OF BLASCHKE IN INTEGRAL GEOMETRY AND GEOMETRICAL PROBABILITY, AND ITS ITERATION, FOR DOMAINS WITH FIXED ORIENTATIONS
- Two moments suffice for Poisson approximations: The Chen-Stein method
- Probability approximations via the Poisson clumping heuristic
- Cluster size distributions of extreme values for the Poisson-Voronoi tessellation
- Two-point concentration in random geometric graphs
- Poisson approximation for large clusters in the supercritical FK model
- Compound Poisson approximation and the clustering of random points
- Cardinality estimation for random stopping sets based on Poisson point processes
- Stein's method in a two-dimensional coverage problem
- Normal approximation for coverage models over binomial point processes
This page was built for publication: Poisson approximation in connection with clustering of random points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1305421)