Using the idea of the dependence graph, Frank and Strauss (1986) were first to show that cliques of tie-variables correspond to specific configurations of actual ties in a network. In the case of binary network, configuration can either be present, when all tie-variables making it are present, or not otherwise. Thus probability of any network can be expressed as a function of presence or absence of the pull of configurations.