Node centrality in weighted networks: Generalizing degree and shortest paths
Social NetworksPublished 1 May 2010
Tore Opsahl, Filip Agneessens, John Skvoretz
Citations3,527
SJR quartileQ1
SJR score1.17
SNIP1.50
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper proposes generalizations that combine tie strength and node centrality, and illustrates the benefits of this approach by applying one of them to Freeman’s EIES dataset.
Abstract
Ties often have a strength naturally associated with them that differentiate them from each other. Tie strength has been operationalized as weights. A few network measures have been proposed for weighted networks, including three common measures of node centrality: degree, closeness, and betweenness. However, these generalizations have solely focused on tie weights, and not on the number of ties, which was the central component of the original measures. This paper proposes generalizations that combine both these aspects. We illustrate the benefits of this approach by applying one of them to Freeman's EIES dataset. © 2010 Elsevier B.V.
Keywords
Biochemistry, Genetics and Molecular BiologyPhysics and Astronomy
NatureCollective dynamics of ‘small-world’ networks
43,160 Citations1998Duncan J. Watts, Steven H. Strogatz
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Annual Review of SociologyBirds of a Feather: Homophily in Social Networks
18,576 Citations2001Miller McPherson, Lynn Smith‐Lovin +1 more
Social NetworksCentrality in social networks conceptual clarification
16,883 Citations1978Linton C. Freeman
Three distinct intuitive conceptions of centrality are uncovered and existing measures are refined to embody these conceptions, one absolute and one relative measure of the centrality of positions in a network and one reflecting the degree of centralization of the entire network.
Administrative Science QuarterlyThe Search-Transfer Problem: The Role of Weak Ties in Sharing Knowledge across Organization Subunits
5,815 Citations1999Morten T. Hansen
American Journal of SociologyPower and Centrality: A Family of Measures
5,205 Citations1987Phillip Bonacich
Journal of Mathematical SociologyA faster algorithm for betweenness centrality*
4,926 Citations2001Ulrik Brandes
New algorithms for betweenness are introduced in this paper and require O(n + m) space and run in O(nm) and O( nm + n2 log n) time on unweighted and weighted networks, respectively, where m is the number of links.
Proceedings of the National Academy of SciencesThe architecture of complex weighted networks
4,249 Citations2004Alain Barrat, Marc Barthélemy +2 more
This work studies the scientific collaboration network and the world-wide air-transportation network, which are representative examples of social and large infrastructure systems, respectively, and defines appropriate metrics combining weighted and topological observables that enable it to characterize the complex statistical properties and heterogeneity of the actual strength of edges and vertices.
PsychometrikaA New Status Index Derived from Sociometric Analysis
3,863 Citations1953Leo Katz
A new method of computation which takes into account who chooses as well as how many choose is presented, which introduces the concept of attenuation in influence transmitted through intermediaries.
Social NetworksCentrality and network flow
3,061 Citations2005Stephen P. Borgatti
A key claim made in this paper is that centrality measures can be regarded as generating expected values for certain kinds of node outcomes given implicit models of how traffic flows, and that this provides a new and useful way of thinking about centrality.
SSRN Electronic JournalStructural Holes: The Social Structure of Competition
3,037 Citations1992Ronald S. Burt
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsScientific collaboration networks. II. Shortest paths, weighted networks, and centrality
2,612 Citations2001M. E. J. Newman
It is argued that simple networks such as these cannot capture variation in the strength of collaborative ties and proposed a measure of collaboration strength based on the number of papers coauthored by pairs of scientists, and thenumber of other scientists with whom they coauthored those papers.
Physical Review EAnalysis of weighted networks
2,451 Citations2004M. E. J. Newman
It is pointed out that weighted networks can in many cases be analyzed using a simple mapping from a weighted network to an unweighted multigraph, allowing us to apply standard techniques for unweighting graphs to weighted ones as well.
Centrality and network flow
1,739 Citations2005Stephen P. Borgatti
Administrative Science QuarterlyBeing in the Right Place: A Structural Analysis of Individual Influence in an Organization
1,549 Citations1984Daniel J. Brass
Computational and Mathematical Organization TheoryNetwork models of the diffusion of innovations
1,230 Citations1996Thomas W. Valente
Social NetworksCentrality in valued graphs: A measure of betweenness based on network flow
1,074 Citations1991Linton C. Freeman, Stephen P. Borgatti +1 more
A new measure of centrality, C, is introduced, based on the concept of network flows, which is defined for both valued and non-valued graphs and applicable to a wider variety of network datasets.
Social NetworksClustering in weighted networks
1,026 Citations2009Tore Opsahl, Pietro Panzarasa
This paper focuses on a measure originally defined for unweighted networks: the global clustering coefficient, and proposes a generalization of this coefficient that retains the information encoded in the weights of ties.
Social NetworksOn variants of shortest-path betweenness centrality and their generic computation
1,013 Citations2008Ulrik Brandes
In this paper, a number of variants are reviewed, placed into context, and shown to be computable with simple variants of the algorithm commonly used for the standard case.
Nature PhysicsReaction–diffusion processes and metapopulation models in heterogeneous networks
877 Citations2007Vittoria Colizza, Romualdo Pastor‐Satorras +1 more
This work lays out a theoretical and computational microscopic framework for the study of a wide range of realistic metapopulation and agent-based models that include the complex features of real-world networks.
Social NetworksOn the robustness of centrality measures under conditions of imperfect data
722 Citations2005Stephen P. Borgatti, Kathleen M. Carley +1 more
Dense networks were the most robust in the face of all kinds of error except edge deletion, which suggests that, for random networks and random error, the authors shall be able to construct confidence intervals around centrality scores.
Cambridge University Press eBooksGeneralized Blockmodeling
470 Citations2004Patrick Doreian, Vladimir Batagelj +1 more
Physical Review LettersProminence and Control: The Weighted Rich-Club Effect
382 Citations2008Tore Opsahl, Vittoria Colizza +2 more
A new general framework for studying the tendency of prominent elements to form clubs with exclusive control over the majority of a system's resources is proposed and associations between prominence and control in the fields of transportation, scientific collaboration, and online communication are explored.
Physical Review EErratum: Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality [Phys. Rev. E<b>64</b>, 016132 (2001)]
208 Citations2006M. E. J. Newman
Social NetworksOptimal connections: strength and distance in valued graphs
52 Citations2001Yang Song, David Knoke
This work proposed two alternative measures of optimal connections between dyads, respectively, dividing each measure by the distance between a pair (number of lines in a path) and average path length (APL), and illustrated a hypothetical five-actor valued graph.
IGI Global eBooksSocial Network Analysis
36 Citations2011Peter Busch
This invention is generally directed to one or more systems or methods relating to social network analysis and the analysis of personal-communication-network data.
Social NetworksConnectedness in a general model for valued networks
33 Citations1980Edmund R. Peay
This model for valued graphs, or vigraphs, provides a unified representation and matrix methodology for dealing with qualitative and quantitative structures, incorporates many existing methods as special cases, and suggests new applications.