Identifying stable network structures and sets of key players using a \(W\)-covering perspective

DOI10.1016/j.mathsocsci.2013.05.005zbMath1296.91239OpenAlexW2027414297MaRDI QIDQ459386

Herman Monsuur, Réne H. P. Janssen

Publication date: 8 October 2014

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

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2013.05.005

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Related Items (1)

Structural stability of coalitions: a formal model highlighting the role of participants positioned between members and neutral actors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Identifying sets of key players in a social network
• Stable network topologies using the notion of covering
• On the chromatic index of almost all graphs
• Tournament solutions and majority voting
• Stable and emergent network topologies: a structural approach
• Networks, Information and Choice
• Centers in Connected Undirected Graphs: An Axiomatic Approach
• Graphs and Cooperation in Games
• Paths in graphs

This page was built for publication: Identifying stable network structures and sets of key players using a \(W\)-covering perspective