skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Coloring geographical threshold graphs

Abstract

We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyze the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: {chi}1n 1n n / 1n n (1 + {omicron}(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C 1n n / (1n 1n n){sup 2}, and specify the constant C.

Authors:
 [1];  [1];  [2]
  1. Los Alamos National Laboratory
  2. EINDHOVEN UNIV. OF TECH
Publication Date:
Research Org.:
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
956667
Report Number(s):
LA-UR-08-08014; LA-UR-08-8014
TRN: US201016%%2352
DOE Contract Number:  
AC52-06NA25396
Resource Type:
Conference
Resource Relation:
Conference: Analco Soda ; January 2, 2009 ; New York, NY
Country of Publication:
United States
Language:
English
Subject:
99; ALGORITHMS; COMPUTERIZED SIMULATION; COMPUTER NETWORKS; CORRECTIONS; DISTANCE; EUCLIDEAN SPACE; FUNCTIONS; INTERNET

Citation Formats

Bradonjic, Milan, Percus, Allon, and Muller, Tobias. Coloring geographical threshold graphs. United States: N. p., 2008. Web.
Bradonjic, Milan, Percus, Allon, & Muller, Tobias. Coloring geographical threshold graphs. United States.
Bradonjic, Milan, Percus, Allon, and Muller, Tobias. Tue . "Coloring geographical threshold graphs". United States. https://www.osti.gov/servlets/purl/956667.
@article{osti_956667,
title = {Coloring geographical threshold graphs},
author = {Bradonjic, Milan and Percus, Allon and Muller, Tobias},
abstractNote = {We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyze the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: {chi}1n 1n n / 1n n (1 + {omicron}(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C 1n n / (1n 1n n){sup 2}, and specify the constant C.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2008},
month = {1}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: