paper

Random Regular Graphs are not Asymptotically Gromov Hyperbolic

arXiv:1203.5069

Abstract

In this paper we prove that random --regular graphs with have traffic congestion of the order where is the number of nodes and geodesic routing is used. We also show that these graphs are not asymptotically --hyperbolic for any non--negative almost surely as .

arXiv comment6 pages, 2 figures

References in corpus (2)

Cited by in corpus (1)