2006 • Conference Paper
Social leaders in graphs
Authors:
Blondel, Vincent ,
de Kerchove D'Exaerde, Cristobald,
Huens, Etienne,
Van Dooren, Paul
Published in:
Lecture Notes in Control and Information Sciences
Volume: 341 • Pages: 231-237
We introduce the definition of Social Leader that gives a local centrality measure for each node in a graph. A node a is a Social Leader if the number of cycles of length 3 passing through u is greater than the corresponding number for its neighbors. This concept is used to visualize large graphs, identify influent agents in social networks (word of mouth effect) and find communities.