Identifying sets of key players in a social network

Stephen P. Borgatti

doi:10.1007/s10588-006-7084-x

Identifying sets of key players in a social network

Stephen P. Borgatti

Management

Producción científica: Article › revisión exhaustiva

931 Citas (Scopus)

Resumen

A procedure is described for finding sets of key players in a social network. A key assumption is that the optimal selection of key players depends on what they are needed for. Accordingly, two generic goals are articulated, called KPP-POS and KPP-NEG. KPP-POS is defined as the identification of key players for the purpose of optimally diffusing something through the network by using the key players as seeds. KPP-NEG is defined as the identification of key players for the purpose of disrupting or fragmenting the network by removing the key nodes. It is found that off-the-shelf centrality measures are not optimal for solving either generic problem, and therefore new measures are presented.

Idioma original	English
Páginas (desde-hasta)	21-34
Número de páginas	14
Publicación	Computational and Mathematical Organization Theory
Volumen	12
N.º	1
DOI	https://doi.org/10.1007/s10588-006-7084-x
Estado	Published - abr 2006

Nota bibliográfica

Funding Information:
Acknowledgements This research is supported by Office of Naval Research grant number N000140211032. Thanks to Scott Clair for leading me to this problem, Mark Newman for suggesting reciprocal distances, Kathleen Carley for useful discussions, and Valdis Krebs for providing illustrative data.

Financiación

Acknowledgements This research is supported by Office of Naval Research grant number N000140211032. Thanks to Scott Clair for leading me to this problem, Mark Newman for suggesting reciprocal distances, Kathleen Carley for useful discussions, and Valdis Krebs for providing illustrative data.

Financiadores	Número del financiador
Office of Naval Research	N000140211032

ASJC Scopus subject areas

General Decision Sciences
General Computer Science
Modeling and Simulation
Computational Mathematics
Applied Mathematics

Acceder al documento

10.1007/s10588-006-7084-x

Otros archivos y enlaces

Citar esto

@article{522886d4fcd7415d8f9d5b640ab425ba,

title = "Identifying sets of key players in a social network",

abstract = "A procedure is described for finding sets of key players in a social network. A key assumption is that the optimal selection of key players depends on what they are needed for. Accordingly, two generic goals are articulated, called KPP-POS and KPP-NEG. KPP-POS is defined as the identification of key players for the purpose of optimally diffusing something through the network by using the key players as seeds. KPP-NEG is defined as the identification of key players for the purpose of disrupting or fragmenting the network by removing the key nodes. It is found that off-the-shelf centrality measures are not optimal for solving either generic problem, and therefore new measures are presented.",

keywords = "Centrality, Cohesion, Social networks",

author = "Borgatti, \{Stephen P.\}",

note = "Funding Information: Acknowledgements This research is supported by Office of Naval Research grant number N000140211032. Thanks to Scott Clair for leading me to this problem, Mark Newman for suggesting reciprocal distances, Kathleen Carley for useful discussions, and Valdis Krebs for providing illustrative data.",

year = "2006",

month = apr,

doi = "10.1007/s10588-006-7084-x",

language = "English",

volume = "12",

pages = "21--34",

number = "1",

}

TY - JOUR

T1 - Identifying sets of key players in a social network

AU - Borgatti, Stephen P.

N1 - Funding Information: Acknowledgements This research is supported by Office of Naval Research grant number N000140211032. Thanks to Scott Clair for leading me to this problem, Mark Newman for suggesting reciprocal distances, Kathleen Carley for useful discussions, and Valdis Krebs for providing illustrative data.

PY - 2006/4

Y1 - 2006/4

N2 - A procedure is described for finding sets of key players in a social network. A key assumption is that the optimal selection of key players depends on what they are needed for. Accordingly, two generic goals are articulated, called KPP-POS and KPP-NEG. KPP-POS is defined as the identification of key players for the purpose of optimally diffusing something through the network by using the key players as seeds. KPP-NEG is defined as the identification of key players for the purpose of disrupting or fragmenting the network by removing the key nodes. It is found that off-the-shelf centrality measures are not optimal for solving either generic problem, and therefore new measures are presented.

AB - A procedure is described for finding sets of key players in a social network. A key assumption is that the optimal selection of key players depends on what they are needed for. Accordingly, two generic goals are articulated, called KPP-POS and KPP-NEG. KPP-POS is defined as the identification of key players for the purpose of optimally diffusing something through the network by using the key players as seeds. KPP-NEG is defined as the identification of key players for the purpose of disrupting or fragmenting the network by removing the key nodes. It is found that off-the-shelf centrality measures are not optimal for solving either generic problem, and therefore new measures are presented.

KW - Centrality

KW - Cohesion

KW - Social networks

UR - https://www.scopus.com/pages/publications/33646385629

UR - https://www.scopus.com/pages/publications/33646385629#tab=citedBy

U2 - 10.1007/s10588-006-7084-x

DO - 10.1007/s10588-006-7084-x

M3 - Article

AN - SCOPUS:33646385629

SN - 1381-298X

VL - 12

SP - 21

EP - 34

JO - Computational and Mathematical Organization Theory

JF - Computational and Mathematical Organization Theory

IS - 1

ER -

Identifying sets of key players in a social network

Resumen

Nota bibliográfica

Financiación

ASJC Scopus subject areas

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto