The role assignment model nearly fits most social networks

DOI10.1016/S0165-4896(00)00064-0zbMath0991.91062OpenAlexW2075243601MaRDI QIDQ5939411

Aleksandar Saša Pekeč, Fred S. Roberts

Publication date: 8 September 2002

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0165-4896(00)00064-0

zbMATH Keywords

role assignmentrole coloringsocial networksocial role

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Computing role assignments of split graphs ⋮ An algorithmic framework for locally constrained homomorphisms ⋮ Locally constrained graph homomorphisms and equitable partitions ⋮ Computing role assignments of proper interval graphs in polynomial time ⋮ Technology driven organizational structure of the firm ⋮ Computing Role Assignments of Proper Interval Graphs in Polynomial Time ⋮ Computing role assignments of chordal graphs ⋮ Comparing universal covers in polynomial time ⋮ Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree

Cites Work

• Role colouring a graph
• Constructing blockmodels: how and why
• How hard is it to determine if a graph has a 2-role assignment?
• An algorithmic approach to the Lovász local lemma. I
• Regular equivalence: General theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The role assignment model nearly fits most social networks