We analyze the structure of random graphs generated by the geographic threshold model.
The model is a generalization of random geometric graphs. Nodes are distributed in space, and edges
are assigned according to a threshold function involving the distance between nodes as well as randomly
chosen node weights. We show how the degree distribution, percolation and connectivity transitions,
diameter and clustering coefficient are related to the weight distribution and threshold values. Joint
work with Aric Hagberg and Allon G. Percus.
|