The Asymptotic Optimality of Spider-Web Networks

ID
TR-89-15
Authors
Nicholas Pippenger
Publishing date
January 1989
Abstract
We determine the limiting behavior of the linking probability for large spider web networks. The result confirms a conjecture made by Ikeno in 1959. We also show that no balanced crossbar network, in which the same components are interconnected according to a different pattern, can have an asymptotically larger linking probability.