On the homogeneous planar Poisson point process

DOI10.1016/0025-5564(70)90061-1zbMath0196.19403MaRDI QIDQ2539516

Publication date: 1970

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0025-5564(70)90061-1

zbMATH Keywords

probability theory

Mathematics Subject Classification ID

60G55: Point processes (e.g., Poisson, Cox, Hawkes processes)

Related Items

DATA GENERATION FOR GEOMETRIC ALGORITHMS ON NON-UNIFORM DISTRIBUTIONS, Some methods for statistical analysis of planar random tessellations, Cardinality estimation for random stopping sets based on Poisson point processes, Unnamed Item, Unnamed Item, Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally, Weighted Poisson--Delaunay Mosaics, Expected sizes of Poisson–Delaunay mosaics and their discrete Morse functions, PROXIMITY GRAPHS: E, δ, Δ, χ AND ω, A more comprehensive complementary theorem for the analysis of Poisson point processes, The Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case Study, Measure Distributions for Some Poisson Process Random Domains and Statistical Applications, Unnamed Item, The Poisson-Voronoi tessellation: relationships for edges, Circumspheres of sets of n + 1 random points in the d-dimensional Euclidean unit ball (1 ≤ n ≤ d), Counting pairs of saddle connections, On the number of higher order Delaunay triangulations, Random Delaunay simplexes in \({\mathbb{R}}^ m\), Connected spatial networks over random points and a route-length statistic, A straightforward iterative algorithm for the planar Voronoi diagram, On the average length of Delaunay triangulations, Computing relative neighbourhood graphs in the plane, Random spheres in a convex body, The \(\gamma\)-neighborhood graph, The various aggregates of random polygons determined by random lines in a plane, Properties of the random search in global optimization, GLIM and normalising constant models in spatial and directional data analysis, Combinatorial aspects of geometric graphs, Rounding Voronoi diagram, Asymptotics for Voronoi tessellations on random samples, Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics, \(k\)-nearest-neighbor clustering and percolation theory, The role of spatial pattern in the competition between crop plants and weeds. A theoretical analysis, Laplace transform identities for the volume of stopping sets based on Poisson point processes, Topological relationships in spatial tessellations, Distribution of size, structure and number of vacant regions in a high-intensity mosaic, Mixed Random Mosaics, The average performance analysis of a closest‐pair algorithm, Explicit laws of large numbers for random nearest-neighbour-type graphs, Numerical and Analytical Computation of Some Second-Order Characteristics of Spatial Poisson-Voronoi Tessellations, Monte carlo estimates of the distributions of the random polygons of the voronoi tessellation with respect to a poisson process, Two algorithms for constructing a Delaunay triangulation, A vector identity for the Dirichlet tessellation, Studies in the robustness of multidimensional scaling: euclidean models and simulation studies, Estimates for distributions of the Voronoi polygon's geometric characteristics, Punktprozesse mit Wechselwirkung, Monte carlo estimates of the distributions of the random polygons determined by random lines in a plane, Ergodic theorems for spatial processes

Cites Work