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

R.H.P. Janssen and H. Monsuur

Mathematical Social Sciences, 2013, vol. 66, issue 3, 245-253

Abstract: 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.

Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489613000516
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:66:y:2013:i:3:p:245-253

DOI: 10.1016/j.mathsocsci.2013.05.005

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().