Topological properties of the one dimensional exponential random geometric graph

Authors:
Bhupendra Gupta;Srikanth K. Iyer;D. Manjunath
Affiliations:
Department of Mathematics and Statistics, Indian Institute of Technology, Kanpur 208016, India;Department of Mathematics, Indian Institute of Science, Bangalore 560012, India;Department of Electrical Engineering, Indian Institute of Technology, Bombay, Mumbai 400076, India
Venue:
Random Structures & Algorithms
Year:
2008

Citing 6
Cited 0

On the connectivity of a random interval graph

Proceedings of the seventh international conference on Random structures and algorithms
On k-connectivity for a geometric random graph

Random Structures & Algorithms
The number of neighbors needed for connectivity of wireless networks

Wireless Networks
Threshold Functions for Random Graphs on a Line Segment

Combinatorics, Probability and Computing
On Range Matrices and Wireless Networks in d Dimensions

WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Introduction to Probability Models, Ninth Edition

Introduction to Probability Models, Ninth Edition

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article we study the one-dimensional random geometric (random interval) graph when the location of the nodes are independent and exponentially distributed. We derive exact results and limit theorems for the connectivity and other properties associated with this random graph. We show that the asymptotic properties of a graph with a truncated exponential distribution can be obtained using the exponential random geometric graph. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008