Exploring structure: A blockmodel approach

Abstract

The problem of network-based disaggregation as an aid to structuring design problems was first proposed by Christopher Alexander. In this paper a new algorithm is described based on the principle of the blockmodel commonly found in the social sciences. The method is simpler than that of Alexander (and that of Elms). The consequences of this simplicity are explored by comparative evaluation using two problems and all three methods. The inherent complexity of the problem is examined in terms of the small world hypothesis, indicating that relatively little interaction between problem components may greatly increase the complexity of the network and thereby increase the arbitrary basis of the structure expressed.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 7 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.