Abstract
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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
