Computation of the greatest regular equivalence | Zendy

Ivan Stanković | Zendy; Ivana Mičić | Zendy; Zorana Jančić | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Computation of the greatest regular equivalence

Author(s) -

Ivan Stanković,

Ivana Mičić,

Zorana Jančić

Publication year - 2016

Publication title -

filomat

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.449

H-Index - 34

eISSN - 2406-0933

pISSN - 0354-5180

DOI - 10.2298/fil1601179s

Subject(s) - equivalence (formal languages) , mathematics , generalization , bipartite graph , computation , theoretical computer science , discrete mathematics , algebra over a field , algorithm , pure mathematics , computer science , graph , mathematical analysis

The notion of social roles is a centerpiece of most sociological theoretical considerations. Regular equivalences were introduced by White and Reitz in [15] as the least restrictive among the most commonly used definitions of equivalence in social network analysis. In this paper we consider a generalisation 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research