Flooding And Diameter In General Weighted Random Graphs

In this paper we study first passage percolation on a random graph model, the configuration model. We first introduce the notions of weighted diameter, which is the maximum of the weighted lengths of all optimal paths between any two vertices in the graph, and the flooding time, which represents the time (weighted length) needed to reach all the vertices in the graph starting from a uniformly chosen vertex. Our result consists in describing the asymptotic behavior of the diameter and the flooding time, as the number of verticesntends to infinity, in the case where the weight distributionGhas an exponential tail behavior, and proving that this category of distributions is the largest possible for which the asymptotic behavior holds