An exact method for the computation of the connectivity of random nets

The problem of finding the “weak connectivity” of a random net is reduced to one involving a Markov process. This provides a mathematically exact treatment of the problem which had previously been treated by an approximation, whose justification was not rigorous. The exact method allows in principle not only the calculation of the “weak connectivity”, but also of the “strong connectivity”, and, in general, the probability that from a randomly selected neuron in the net there exist paths to a specified number of neurons. The computations become exceedingly involved for large nets.