Abstract
In a previous paper, Kovacs (2010) proposed a generalized relational similarity measure based on iterated correlations of entities in a network calibrated by their relational similarity to other entities. Here I show that, in the case of two-mode network data, Kovacs’s approach can be simplified and generalized similarities calculated non-iteratively. The basic idea is to rely on initial similarities calculated from transforming the two-mode data into one-mode projections using the familiar duality approach due to Breiger (1974). I refer to this as two-mode relational similarities and show, using the Southern Women’s data and data from Senate voting in the 112th U.S. Congress, that it yields results substantively indistinguishable from Kovacs’s iterative strategy.
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.
