Two algorithms for computing regular equivalence

Stephen P. Borgatti; Martin G. Everett

doi:10.1016/0378-8733(93)90012-A

Two algorithms for computing regular equivalence

Stephen P. Borgatti, Martin G. Everett

Management

Research output: Contribution to journal › Article › peer-review

91 Scopus citations

Abstract

In this paper we present two algorithms for computing the extent of regular equivalence among pairs of nodes in a network. The first algorithm, REGE, is well known, but has not previously been described in the literature. The second algorithm, CATREGE, is new. Whereas REGE is applicable to quantitative data, CATREGE is used for categorical data. For binary data, either algorithm may be used, though the CATREGE algorithm is significantly faster and its output similarity coefficients have better metric properties. The CATREGE algorithm is also useful pedagogically, because it is easier to grasp.

Original language	English
Pages (from-to)	361-376
Number of pages	16
Journal	Social Networks
Volume	15
Issue number	4
DOIs	https://doi.org/10.1016/0378-8733(93)90012-A
State	Published - Dec 1993

ASJC Scopus subject areas

Anthropology
Sociology and Political Science
General Social Sciences
General Psychology

Access to Document

10.1016/0378-8733(93)90012-A

Cite this

@article{ad660f1ca00c492c9f9b7f7878bb34a6,

title = "Two algorithms for computing regular equivalence",

abstract = "In this paper we present two algorithms for computing the extent of regular equivalence among pairs of nodes in a network. The first algorithm, REGE, is well known, but has not previously been described in the literature. The second algorithm, CATREGE, is new. Whereas REGE is applicable to quantitative data, CATREGE is used for categorical data. For binary data, either algorithm may be used, though the CATREGE algorithm is significantly faster and its output similarity coefficients have better metric properties. The CATREGE algorithm is also useful pedagogically, because it is easier to grasp.",

author = "Borgatti, {Stephen P.} and Everett, {Martin G.}",

year = "1993",

month = dec,

doi = "10.1016/0378-8733(93)90012-A",

language = "English",

volume = "15",

pages = "361--376",

number = "4",

}

TY - JOUR

T1 - Two algorithms for computing regular equivalence

AU - Borgatti, Stephen P.

AU - Everett, Martin G.

PY - 1993/12

Y1 - 1993/12

N2 - In this paper we present two algorithms for computing the extent of regular equivalence among pairs of nodes in a network. The first algorithm, REGE, is well known, but has not previously been described in the literature. The second algorithm, CATREGE, is new. Whereas REGE is applicable to quantitative data, CATREGE is used for categorical data. For binary data, either algorithm may be used, though the CATREGE algorithm is significantly faster and its output similarity coefficients have better metric properties. The CATREGE algorithm is also useful pedagogically, because it is easier to grasp.

AB - In this paper we present two algorithms for computing the extent of regular equivalence among pairs of nodes in a network. The first algorithm, REGE, is well known, but has not previously been described in the literature. The second algorithm, CATREGE, is new. Whereas REGE is applicable to quantitative data, CATREGE is used for categorical data. For binary data, either algorithm may be used, though the CATREGE algorithm is significantly faster and its output similarity coefficients have better metric properties. The CATREGE algorithm is also useful pedagogically, because it is easier to grasp.

UR - http://www.scopus.com/inward/record.url?scp=0011628559&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0011628559&partnerID=8YFLogxK

U2 - 10.1016/0378-8733(93)90012-A

DO - 10.1016/0378-8733(93)90012-A

M3 - Article

AN - SCOPUS:0011628559

SN - 0378-8733

VL - 15

SP - 361

EP - 376

JO - Social Networks

JF - Social Networks

IS - 4

ER -

Two algorithms for computing regular equivalence

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this