One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity (Q383292): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The connectivity of a graph on uniform points on [0,\,1]\(^{d}\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong limit theorems for maximal spacings from a general univariate distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connectivity of a random interval graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Dimensional Geometric Random Graphs With Nonvanishing Densities—Part I: A Strong Zero-One Law for Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Density Thresholds in Distributed Wireless Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Functions for Random Graphs on a Line Segment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Measure and Probability / rank
 
Normal rank

Revision as of 02:01, 7 July 2024

scientific article
Language Label Description Also known as
English
One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity
scientific article

    Statements

    One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity (English)
    0 references
    0 references
    0 references
    25 November 2013
    0 references
    one-dimensional geometric random graphs
    0 references
    connectivity
    0 references
    non-uniform node distribution
    0 references
    very strong zero-one laws
    0 references

    Identifiers