Threshold Functions for Random Graphs on a Line Segment

Authors:
Gregory L. McColm
Affiliations:
Department of Mathematics, University of South Florida, Tampa, FL 33620, USA (e-mail: mccolm@math.usf.edu URL: http://www.math.usf.edu/~mccolm)
Venue:
Combinatorics, Probability and Computing
Year:
2004

Citing 4
Cited 5

Unit disk graphs

Discrete Mathematics - Topics on domination
Probability (2nd ed.)

Probability (2nd ed.)
First order zero-one laws for random graphs on the circle

Random Structures & Algorithms
Proximity Drawability: a Survey

GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing

Topological properties of the one dimensional exponential random geometric graph

Random Structures & Algorithms
Sensitivity of critical transmission ranges to node placement distributions

IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
One-dimensional geometric random graphs with nonvanishing densities: part I: a strong zero-one law for connectivity

IEEE Transactions on Information Theory
Results on finite wireless networks on a line

IEEE Transactions on Communications
One-dimensional geometric random graphs with nonvanishing densities II: a very strong zero-one law for connectivity

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.06

Visualization

Abstract

We look at a model of random graphs suggested by Gilbert: given an integer $n$ and $\delta 0$, scatter $n$ vertices independently and uniformly on a metric space, and then add edges connecting pairs of vertices of distance less than $\delta$ apart.We consider the asymptotics when the metric space is the interval [0, 1], and $\delta = \delta(n)$ is a function of $n$, for $n \to \infty$. We prove that every upwards closed property of (ordered) graphs has at least a weak threshold in this model on this metric space. (But we do find a metric space on which some upwards closed properties do not even have weak thresholds in this model.) We also prove that every upwards closed property with a threshold much above connectivity's threshold has a strong threshold. (But we also find a sequence of upwards closed properties with lower thresholds that are strictly weak.)