These are the values of the fill (p) for all networks to which the statistic applies and for which it was computed. In total, it has been computed for 1,243 networks.
The fill (p) of a network is the probability that two randomly chosen edges are connected. This takes into account the type of network, i.e., whether the network is directed or undirected, and whether loops are allowed. The fill equals one when all possible edges are present.
The full definition of the fill as well as its properties and relationships to other graph statistics can be found in the KONECT handbook.