Thresholding random geometric graph properties motivated by ad hoc sensor networks
type: Item
instance of: scholarly article
title: Thresholding random geometric graph properties motivated by ad hoc sensor networks
zbMATH Open document ID: 1210.05159
author: J. Martínez
published in: Journal of Computer and System Sciences
publication date: 2010-08-18T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5772419
zbMATH Keywords: random geometric graphs
zbMATH Keywords: thresholds
zbMATH Keywords: sensor network models
zbMATH Keywords: local algorithm
zbMATH Keywords: coverage
zbMATH Keywords: stretch
zbMATH Keywords: connectivity
MaRDI profile type: Publication
full work available at URL: j.jcss.2010.01.002
OpenAlex ID: W1975478958
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Probability approximations via the Poisson clumping heuristic
cites work: The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).
cites work: The Maximum Vertex Degree of a Graph on Uniform Points in [0, 1]d
cites work: The Minimum Vertex Degree of a Graph on Uniform Points in [0, 1]d
cites work: Paths in graphs
cites work: A log log law for maximal uniform spacings
cites work: Randomization and approximation techniques in computer science. 2nd international workshop, RANDOM '98. Barcelona, Spain, October 8--10, 1998. Proceedings
cites work: Graph Drawing
cites work: Efficient communication in an ad-hoc network
cites work: Percolation
cites work: Sharp thresholds For monotone properties in random geometric graphs
cites work: Q4227226
cites work: The capacity of wireless networks
cites work: Q4040734
cites work: On properties of geometric random problems in the plane
cites work: The small-world phenomenon
cites work: Critical Density Thresholds in Distributed Wireless Networks
cites work: Continuum Percolation
cites work: Approximating the Stretch Factor of Euclidean Graphs
cites work: Random Geometric Graphs
cites work: The longest edge of the random minimal spanning tree
cites work: Q4265786
DOI: 10.1016/J.JCSS.2010.01.002
description: scientific article; zbMATH DE number 5772419