Abstract
The probability distribution of the diameter of a network model consisting of a complete digraph with positive integer random edge costs is considered. Edge costs are chosen independently for each node pair according to common probability distributions for each edge direction. Bounds and some sharp limit results for the diameter distribution in the limit as the number of nodes tends to infinity are derived. In addition, limit bounds are determined for the distribution of the number of hops in a shortest path between two arbitrary nodes in the graph. Numerical examples are presented to illustrate these results. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
