Asymptotics of connectivity probabilities for pairs of graph nodes

For graphs with low reliable arcs, asymptotics of probabilities for connectivities between all pairs of nodes are constructed. Parameters of these asymptotics are characteristics of shortest paths in the graph. To calculate these characteristics, some modifications of classical algorithms are developed. On the base of these results, numerical experiment is realized. This experiment demonstrates advantages of suggested algorithms.