Abstract. Communities in social networks are often defined as groups of densely connected actors. However, members of the same dense group are not equal but may differ largely in their social position or in the role they play. Furthermore, the same positions can be found across the borders of dense communities so that networks contain a significant group structure which does not coincide with the structure of dense groups. This papers gives a survey over formalizations of network-positions with a special emphasis on the use of algebraic notions.

@inproceedings{Brandes07Role, author = {Brandes, Ulrik and Lerner, Jürgen}, title = {Role-equivalent Actors in Networks}, editor = {Obiedkov, Sergei and Roth, Camille}, booktitle = {ICFCA 2007 Satellite Workshop on Social Network Analysis and Conceptual Structures: Exploring Opportunities}, year = {2007}, url = {http://www.inf.uni-konstanz.de/algo/publications/bl-rean-07.pdf}, keywords = {actor, role, seminar2009, structure, sna, analysis, network, social}, abstract = {Abstract. Communities in social networks are often defined as groups of densely connected actors. However, members of the same dense group are not equal but may differ largely in their social position or in the role they play. Furthermore, the same positions can be found across the borders of dense communities so that networks contain a significant group structure which does not coincide with the structure of dense groups. This papers gives a survey over formalizations of network-positions with a special emphasis on the use of algebraic notions.} }

%0 = inproceedings %A = Brandes, Ulrik and Lerner, Jürgen %B = ICFCA 2007 Satellite Workshop on Social Network Analysis and Conceptual Structures: Exploring Opportunities %D = 2007 %T = Role-equivalent Actors in Networks %U = http://www.inf.uni-konstanz.de/algo/publications/bl-rean-07.pdf

Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Several classes of equivalence relations such as regular equivalence and equitable partitions have been proposed for role assignment, but they all suffer from the strictness of classifying vertices into being either equivalent or not. It is an open problem how to allow for varying degrees of similarity. Proposals include ad-hoc algorithmic approaches and optimization approaches which are computationally hard. In this paper we introduce the concept of structural similarity by relaxation of equitable partitions, thus providing a theoretical foundation for similarity measures which enjoys desirable properties with respect to existence, structure, and tractability.

@inproceedings{conf/isaac/BrandesL04, author = {Brandes, Ulrik and Lerner, Jürgen}, title = {Structural Similarity in Graphs (A Relaxation Approach for Role Assignment).}, editor = {Fleischer, Rudolf and Trippen, Gerhard}, booktitle = {ISAAC}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, year = {2004}, volume = {3341}, pages = {184-195}, url = {http://kops.ub.uni-konstanz.de/volltexte/2009/7777/}, isbn = {3-540-24131-0}, keywords = {actor, assignment, graph, relaxation, role, similarity, structure}, abstract = {Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Several classes of equivalence relations such as regular equivalence and equitable partitions have been proposed for role assignment, but they all suffer from the strictness of classifying vertices into being either equivalent or not. It is an open problem how to allow for varying degrees of similarity. Proposals include ad-hoc algorithmic approaches and optimization approaches which are computationally hard. In this paper we introduce the concept of structural similarity by relaxation of equitable partitions, thus providing a theoretical foundation for similarity measures which enjoys desirable properties with respect to existence, structure, and tractability.} }

%0 = inproceedings %A = Brandes, Ulrik and Lerner, Jürgen %B = ISAAC %D = 2004 %I = Springer %T = Structural Similarity in Graphs (A Relaxation Approach for Role Assignment). %U = http://kops.ub.uni-konstanz.de/volltexte/2009/7777/