Average distance in a general class of scale-free networks

HIGHLIGHTS

• What: The authors show in Theorem 4 that every edge probability function p satisfying w w max{α,1} u v puv=min 1, ( xu - xv )-dα · W follows (EP1) and_(EP2), so it is a special case of the model . As the main result, the authors determine the average distance between two randomly chosen nodes in the giant component to be the same as in Chung-Lu random graphs up to a factor 1 + o(1), showing that the underlying geometry is negligible for this graph parameter. The authors show that the GIRG model introduced is a . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.