Threshold Functions for Random Graphs on a Line Segment

DOI10.1017/S0963548304006121MaRDI QIDQ4819249zbMATH OpenFDO

Authors Gregory Loren McColm

Publication date 24 September 2004

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

thresholdrandom graphgeometric graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Geometric probability and stochastic geometry (60D05)

Recommendations

• scientific article; zbMATH DE number 3168330
• Random threshold graphs
• On threshold properties
• Random Geometric Graphs
• scientific article; zbMATH DE number 1943957

Cited in

(13)

• Topological properties of random wireless networks
• scientific article; zbMATH DE number 7650133 (Why is no real title available?)
• Logconcave random graphs
• Monotone properties of random geometric graphs have sharp thresholds
• Sharp threshold for embedding balanced spanning trees in random geometric graphs
• Sharp thresholds for monotone properties in random geometric graphs
• A random-line-graph approach to overlapping line segments
• The bin-covering technique for thresholding random geometric graph properties
• On the equivalence between random graph models
• On threshold properties
• Searching for (sharp) thresholds in random structures: where are we now?
• Plane and planarity thresholds for random geometric graphs
• One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity

This page was built for publication: Threshold Functions for Random Graphs on a Line Segment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819249)