Computation of the Greatest Regular Equivalence

The notion of social roles is a centerpiece of most sociological theoretical considerations. Regular equivalences were introduced by White and Reitz in [29] as the least restrictive among the most commonly used definitions of equivalence in social network analysis. In this paper we consider a genera...

Full description

Saved in:
Bibliographic Details
Published in:Filomat 2016-01, Vol.30 (1), p.179-190
Main Authors: Stankovic, Ivan, Micic, Ivana, Jancic, Zorana
Format: Article
Language:English
Subjects:
Boolean data
Equivalence relation
Induction assumption
Matrices
Social networking
Social roles
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The notion of social roles is a centerpiece of most sociological theoretical considerations. Regular equivalences were introduced by White and Reitz in [29] as the least restrictive among the most commonly used definitions of equivalence in social network analysis. In this paper we consider a generalization of this notion to a bipartite case. We define a pair of regular equivalences on a two-mode social network and we provide an algorithm for computing the greatest pair of regular equivalences.
ISSN:0354-5180
2406-0933
DOI:10.2298/FIL1601179S