2007 | OriginalPaper | Chapter
Giant Component and Connectivity in Geographical Threshold Graphs
Authors : Milan Bradonjić, Aric Hagberg, Allon G. Percus
Published in: Algorithms and Models for the Web-Graph
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.