Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs (Q3059690): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Minimum Vertex Degree of a Graph on Uniform Points in [0, 1]<sup><i>d</i></sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The limit distribution of the largest nearest-neighbour link in the unit <i>d</i>-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological properties of the one dimensional exponential random geometric graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremes on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest edge of the random minimal spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremes for the minimal spanning tree on normally distributed points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strong Law for the Largest Nearest-Neighbour Link between Random Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary domination and the distribution of the largest nearest-neighbor link in higher dimensions / rank
 
Normal rank

Latest revision as of 13:16, 3 July 2024

scientific article
Language Label Description Also known as
English
Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs
scientific article

    Statements

    Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs (English)
    0 references
    0 references
    0 references
    26 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    random geometric graph
    0 references
    nearest-neighbor graph
    0 references
    Poisson point process
    0 references
    largest nearest-neighbor link
    0 references
    vertex degree
    0 references
    0 references
    0 references