Giant Component and Connectivity in Geographical Threshold Graphs

The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We study this model and give conditions for the absence and existence of the giant component, as well as for connectivity.

• Type: Conference
• Year: 2007
• Where: WAW
• Authors: Milan Bradonjic, Aric A. Hagberg, Allon G. Percus
• Keywords: Algorithms, Graph Model, Random Graph Model, Threshold Graph Model, WAW 2007