Regular equivalence and dynamic logic

This paper describes a precise linguistic counterpart to the notion of a regular equivalence relation on a social network. That is, a formal language of position terms is defined with the property that on finite networks, two actors are regularly equivalent if and only if they cannot be distinguishe...

Full description

Saved in:
Bibliographic Details
Published inSocial networks Vol. 25; no. 1; pp. 51 - 65
Main Authors Marx, Maarten, Masuch, Michael
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 2003
Elsevier Science
Subjects
Computer science
Dynamic logic
Equivalence
History, theory and methodology
Logic
Methodology
Network Analysis
Regular equivalence
Simulation
Social Networks
Social roles
Sociology
Regular equivalence
Network analysis
Dynamic logic
Dynamic
Language
Sociology of organizations
Social network
Social Role
Network Analysis
Logic
Online AccessGet full text

Cover

More Information
Summary:This paper describes a precise linguistic counterpart to the notion of a regular equivalence relation on a social network. That is, a formal language of position terms is defined with the property that on finite networks, two actors are regularly equivalent if and only if they cannot be distinguished by a position term. The paper also contains an exact characterization of the set of complex relations which are preserved under regular equivalences. The results presented here are known from logic and computer science, in which the mentioned language is called dynamic logic. The aim of the paper is to make these results available to social network analysts and explain why they are of interest to them.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0378-8733
1879-2111
DOI:10.1016/S0378-8733(02)00036-9