5 results for "Kirkpatrick, Scott"
Showing 1–5 · 0.29 seconds · RSS
-
Journal Article Full text
Once the Internet can measure itself
In communications, the obstacle to high bandwidth and reliable transmission is usually the interconnections, not the links. Nowhere is this more evident than on the Internet, where broadband connections to homes, offices and now mobile smart phones are a frequent source of frustration, and the…
-
Journal Article Full text
Hard optimization problems have soft edges
Finding a Maximum Clique is a classic property test from graph theory; find any one of the largest complete subgraphs in an Erdös-Rényi G(N, p) random graph. We use Maximum Clique to explore the structure of the problem as a function of N, the graph size, and K, the clique size sought. It displays…
-
Preprint Full text
Selfish vs. Unselfish Optimization of Network Creation
We investigate several variants of a network creation model: a group of agents builds up a network between them while trying to keep the costs of this network small. The cost function consists of two addends, namely (i) a constant amount for each edge an agent buys and (ii) the minimum number of…
-
Preprint Full text
Comparing Beliefs, Surveys and Random Walks
Survey propagation is a powerful technique from statistical physics that has been applied to solve the 3-SAT problem both in principle and in practice. We give, using only probability arguments, a common derivation of survey propagation, belief propagation and several interesting hybrid methods. We…
-
Journal Article Full text
A model of Internet topology using k-shell decomposition
We study a map of the Internet (at the autonomous systems level), by introducing and using the method of k-shell decomposition and the methods of percolation theory and fractal geometry, to find a model for the structure of the Internet. In particular, our analysis uses information on the…