Abstract:
A computational method for probability of majority connectedness of the two-pole network of a random graph is stated when the union of circuits is used as a connectedness carrier of node-poles. Formal rules for calculations of this type illustrated by the corresponding examples are given.
PACS:02.10.Ox
Presented by the member of Editorial Board:B. G. Volik