Identifying stable network structures and sets of key players using a w-covering perspective

In evaluating and benchmarking positions of nodes within networks, several network statistics can be considered. A new benchmark is introduced that can be used to investigate whether or not a node is outperformed by another node regarding the connections to some fixed set W of nodes. Networks where these subdued positions do not exist are called W-stable. In this paper special attention is paid to minimal W-stable (random) networks, where W is the set of nodes having a degree crossing some fixed number. The notion of W-covering also makes possible to disclose an alternative definition and role of key players in social networks.

[1]  P.A.L. Ducheine,et al.  Cyber warfare : Critical perspectives , 2012 .

[2]  Herman Monsuur,et al.  Stable network topologies using the notion of covering , 2012, Eur. J. Oper. Res..

[3]  S. Goyal.  Connections: An Introduction to the Economics of Networks , 2009 .

[4]  Stephen P. Borgatti,et al.  Identifying sets of key players in a social network , 2006, Comput. Math. Organ. Theory.

[5]  H. Monsuur,et al.  Analysing and modelling the interconnected cyberspace , 2012 .

[6]  Tom A. B. Snijders,et al.  Introduction to stochastic actor-based models for network dynamics , 2010, Soc. Networks.

[7]  Paul Erdös,et al.  On the chromatic index of almost all graphs , 1977, J. Comb. Theory, Ser. B.

[8]  Herman Monsuur.  Stable and emergent network topologies: A structural approach , 2007, Eur. J. Oper. Res..

[9]  Roger B. Myerson,et al.  Graphs and Cooperation in Games , 1977, Math. Oper. Res..

[10]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[11]  Jie Wu,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .

[12]  H. Monsuur,et al.  Networks, Information and Choice , 2010 .

[13]  Béla Bollobás,et al.  Random Graphs , 1985 .

[14]  Nicholas R. Miller.  A New Solution Set for Tournaments and Majority Voting: Further Graph- Theoretical Approaches to the Theory of Voting , 1980 .

[15]  Herman Monsuur,et al.  Centers in Connected Undirected Graphs: An Axiomatic Approach , 2004, Oper. Res..