Technical Reports

The ICICS/CS Reading Room


UBC CS TR-89-15 Summary

The Asymptotic Optimality of Spider-Web Networks, January 1989 Nicholas Pippenger

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.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.