The asymptotic optimality of spider-web networks

The asymptotic optimality of spider-web networks

0.00 Avg rating0 Votes
Article ID: iaor1993676
Country: Netherlands
Volume: 37/38
Issue: 1/5
Start Page Number: 437
End Page Number: 450
Publication Date: Jul 1992
Journal: Discrete Applied Mathematics
Authors:
Abstract:

The paper determines the limiting behavior of the linking probability for large spider-web networks. The result confirms a conjecture made by Ikeno in 1959. The paper also shows that no balanced crossbar network, in which the same components are interconnected according to a different pattern, can have an asymptotically larger linking probability.

Reviews

Required fields are marked *. Your email address will not be published.