Results 1 
7 of
7
The Structure of Geographical Threshold Graphs
 9 M. Bradonjić and Joseph Kong, Wireless Ad Hoc Networks with Tunable Topology, Proceedings of the 45th Annual Allerton Conference on Communication, Control and Computing
, 2007
"... Abstract. We analyze the structure of random graphs generated by the geographical 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 random ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
Abstract. We analyze the structure of random graphs generated by the geographical 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, clustering coefficient, and diameter relate to the threshold value and weight distribution. We give bounds on the threshold value guaranteeing the presence or absence of a giant component, connectivity and disconnectivity of the graph, and small diameter. Finally, we consider the clustering coefficient for nodes with a given degree l, finding that its scaling is very close to 1/l when the node weights are exponentially distributed. 1.
Giant component and connectivity in geographical threshold graphs
 In Proceedings of the 5th Workshop On Algorithms And Models For The WebGraph (WAW2007
, 2007
"... 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 connec ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
(Show Context)
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.
Optimal Interdiction of Unreactive Markovian Evaders
, 903
"... Abstract. The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counterterrorism. In the typical formulation of network interdiction, the task of the interdictor is to find a set of edges in a weighted network such that the removal of th ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
(Show Context)
Abstract. The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counterterrorism. In the typical formulation of network interdiction, the task of the interdictor is to find a set of edges in a weighted network such that the removal of those edges would maximally increase the cost to an evader of traveling on a path through the network. Our work is motivated by cases in which the evader has incomplete information about the network or lacks planning time or computational power, e.g. when authorities set up roadblocks to catch bank robbers, the criminals do not know all the roadblock locations or the best path to use for their escape. We introduce a model of network interdiction in which the motion of one or more evaders is described by Markov processes and the evaders are assumed not to react to interdiction decisions. The interdiction objective is to find an edge set of size B, that maximizes the probability of capturing the evaders. We prove that similar to the standard leastcost formulation for deterministic motion this interdiction problem is also NPhard. But unlike that problem our interdiction problem is submodular and the optimal solution can be approximated within 1 − 1/e using a greedy algorithm. Additionally, we exploit submodularity through a priority evaluation strategy that eliminates the linear complexity scaling in the number of network edges and speeds up the solution by orders of magnitude. Taken together the results bring closer the goal of finding realistic solutions to the interdiction problem on globalscale networks. 1 1
Coloring Geographical Threshold Graphs
"... 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 ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
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 ln n chromatic number is identical: χ = (1 + o(1)). Finally, ln ln n 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 ln n/(ln ln n) 2, and specify the constant C. 1
Combinatorial and Numerical Analysis of Geographical Threshold Graphs
"... Abstract. 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 ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. 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. Key words: random graph, geographical threshold graph, giant component, connectivity, clustering coefficient. 1
On the Mixing Time of Geographical Threshold Graphs
"... 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 ..."
Abstract
 Add to MetaCart
(Show Context)
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. We specifically study the mixing times of random walks on ddimensional GTGs near the connectivity threshold for d ≥ 2. If the weight distribution function decays with Pr[W ≥ x] = O(1/x d+ν) for an arbitrarily small constant ν> 0 then the mixing time of GTG is O(n 2/d (log n) (d−2)/d). This matches the known mixing bounds for the ddimensional RGG. 1.