Far-out Vertices In Weighted Repeated Configuration Model - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Far-out Vertices In Weighted Repeated Configuration Model


We consider an edge-weighted uniform random graph with a given degree sequence (Repeated Configuration Model) which is a useful approximation for many real-world networks. It has been observed that the vertices which are separated from the rest of the graph by a distance exceeding certain threshold play an important role in determining some global properties of the graph like diameter, flooding time etc., in spite of being statistically rare. We give a convergence result for the distribution of the number of such far-out vertices. We also make a conjecture about how this relates to the longest edge of the minimal spanning tree on the graph under consideration.

Dates and versions

hal-00733414 , version 1 (18-09-2012)



Bartlomiej Blaszczyszyn, Kumar Gaurav. Far-out Vertices In Weighted Repeated Configuration Model. MAMA workshop, held in conjunction with ACM Sigmetrics/Performance, acm, Jun 2012, London, United Kingdom. pp.100-103, ⟨10.1145/2425248.2425276⟩. ⟨hal-00733414⟩
151 View
0 Download



Gmail Facebook Twitter LinkedIn More