2 ALGORITHMS FOR COMPUTING REGULAR EQUIVALENCE

In this paper we present two algorithms for computing the extent of re gular equivalence among pairs of nodes in a network. The first algorit hm, REGE, is well known, but has not previously been described in the literature. The second algorithm, CATREGE, is new. Whereas REGE is app licable to quantitative data, CATREGE is used for categorical data. Fo r binary data, either algorithm may be used, though the CATREGE algori thm is significantly faster and its output similarity coefficients hav e better metric properties. The CATREGE algorithm is also useful pedag ogically, because it is easier to grasp.