On the mixing time of geographical threshold graphs
Conference
·
OSTI ID:988314
- Los Alamos National Laboratory
In this paper, we study the mixing time of 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). We specifically study the mixing times of random walks on 2-dimensional GTGs near the connectivity threshold. We provide a set of criteria on the distribution of vertex weights that guarantees that the mixing time is {Theta}(n log n).
- Research Organization:
- Los Alamos National Laboratory (LANL)
- Sponsoring Organization:
- DOE
- DOE Contract Number:
- AC52-06NA25396
- OSTI ID:
- 988314
- Report Number(s):
- LA-UR-09-02151; LA-UR-09-2151
- Country of Publication:
- United States
- Language:
- English
Similar Records
Coloring geographical threshold graphs
Efficient broadcast on random geometric graphs
Random broadcast on random geometric graphs
Conference
·
Mon Dec 31 23:00:00 EST 2007
·
OSTI ID:956667
Efficient broadcast on random geometric graphs
Conference
·
Wed Dec 31 23:00:00 EST 2008
·
OSTI ID:990765
Random broadcast on random geometric graphs
Conference
·
Wed Dec 31 23:00:00 EST 2008
·
OSTI ID:988313