Weak laws of large numbers in geometric probability (Q1872342): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Asymptotics for Euclidean minimal spanning trees on random points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous uniqueness of infinite clusters in stationary random labeled graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation and minimal spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern multidimensional scaling: theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic procedures for dimension identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expected size of some graphs in computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nearest-neighbor graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The proportion of triangles in a Poisson-Voronoi tessellation of the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fraction of random points by specified nearest-neighbour interrelations and degree of attraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4238439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong laws for Euclidean graphs with general edge weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: The central limit theorem for weighted minimal spanning trees on random points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4084463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics for Voronoi tessellations on random samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The random minimal spanning tree in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random parking, sequential adsorption, and the jamming limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Central limit theorems for some graphs in computational geometry. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit theory for random sequential packing and deposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of leaves of a euclidean minimal spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability theory of classical Euclidean optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics for weighted minimal spanning trees on random points / rank
 
Normal rank

Latest revision as of 15:55, 5 June 2024

scientific article
Language Label Description Also known as
English
Weak laws of large numbers in geometric probability
scientific article

    Statements

    Weak laws of large numbers in geometric probability (English)
    0 references
    0 references
    0 references
    6 May 2003
    0 references
    The authors use a coupling argument to establish a general weak law of large numbers for functionals of binomial point processes in \(d\)-dimensional Euclidean space. The limit depends explicitly on the density, possibly non-uniform, of the process. When the point set forms the vertex set of a graph, functionals of interest include total edge length with arbitrary weighting, number of edges and number of components. The general result is applied to various graphs. Weak laws of large numbers are also obtained for functionals of marked point processes, including statistics of Boolean models. The methods were used previously to obtain a strong law of large numbers for functionals on uniform point sets; see e.g. the authors [Ann. Appl. Probab. 12, 272-301 (2002; Zbl 1018.60023)].
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    weak law of large numbers
    0 references
    computational geometry
    0 references
    objective method
    0 references
    minimal spanning tree
    0 references
    nearest neighbours graph
    0 references
    Voronoi graph
    0 references
    sphere of influence graph
    0 references
    proximity graph
    0 references
    Boolean model
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references