Giant Component and Connectivity in Geographical Threshold Graphs

Cite Details

Milan Bradonjić, Aric Hagberg and Allon G. Percus, "Giant Component and Connectivity in Geographical Threshold Graphs", in Algorithms and Models for the Web-Graph (WAW 2007), (San Diego, CA USA), doi:10.1007/978-3-540-77004-6_18, pp. 209--216, 2007

PDF

HTML

Abstract

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.

BibTeX Entry

@inproceedings{bradonjic-2007-giant,

author = {Milan Bradonji\'c and Aric Hagberg and Allon G. Percus},

title = {Giant Component and Connectivity in Geographical Threshold Graphs},

year = {2007},

urlpdf = {http://math.lanl.gov/~hagberg/Papers/giant.pdf},

booktitle = {Algorithms and Models for the Web-Graph (WAW 2007)},

address = {San Diego, CA USA},

doi = {10.1007/978-3-540-77004-6_18},

pages = {209--216}

}