On the connectivity of configuration graphs

We consider configuration graphs with vertex degrees being independent identically distributed random variables. The distribution of these variables satisfies only relatively weak constraints on the probabilities of large values of degrees. For the case when the number of vertices tends to infinity, the conditions are found under which the graph is asymptotically almost surely connected. We also give estimates of the rate of convergence to zero of the probability that the graph is not connected.