The centrality index of a graph
By G. Sabidussi. 1966
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Linyuan Lu
- Duanbing Chen
- Tao Zhou
- Jian-Xiong Zhang
- Eliav Buchnik
- Yang-Yu Liu
- Albert-László Barabási
- Kousik Das
Citations in the corpus
- The Connectivity Structure, Giant Strong Component and Centrality of Metabolic Networks (2003, background): “Sabidussi (1966) defined the term ‘closeness centrality’ of node x(C(x)) as follows:”
- Disease candidate gene identification and prioritization using protein interaction networks (2009, background): “For instance, a variety of measures (degree centrality [36], closeness centrality [37] and betweenness centrality [38]) have been proposed by sociologists to determine the "centrality" of a node in a social network.”
- Identifying a set of influential spreaders in complex networks (2016, methodology): “Up to now, many methods for ranking nodes by their influences have been proposed, such as degree, closeness[7], betweenness[8] centralities, and other heuristic algorithms[9, 10, 11, 12].”
- Centrality Estimation in Large Networks (2007, background): “Depending on the type of network studied, they are proxies for the structural importance of an element for the overall functioning of the network.”
- What do centrality measures measure in psychological networks? (2019, background): “A plausible way to quantify closeness or minimum reachability time is by finding the fastest route between two nodes (often referred to Running head: WHAT DO CENTRALITY MEASURES MEASURE? as the geodesic distance ; Sabidussi, 1966).”
- Approximating Betweenness Centrality (2007, background): “Some of the well-known metrics for computing centrality are closeness [1], stress [2] and betweenness [3,4].”
- A Survey on Trust Modeling (2015, background): “There are abundant metrics in the literature to model centrality or influence in networks [Everett and Borgatti 2005; Bonacich 1987; Brandes 2001; Freeman 1979; Freeman et al. 1991; Goh et al. 2003; Sabidussi 1966; Hage and Harary 1995; Shimbel 1953].”
- Vital nodes identification in complex networks (2016, background): “Both eccentricity centrality [43] and closeness centrality [44, 45] think that the shorter the distance a node from all other nodes, the faster the information disseminated.”
- An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation (2010, background): “KPP is similar to the better known closeness centrality measure [54] which is defined as the reciprocal of the total shortest distance from a given node to all other nodes.”
- An empirical study of the Mexican banking system’s network and its implications for systemic risk (2012, unknown): “For example, in Sabidussi (1966), the author proposes that the centrality of a node should increase if an arc is added to such a node. Additionally, to add a node anywhere in the network should not decrease the centrality of any node. Betweenness centrality does not satisfy this criteria, but this c”
- CytoNCA: A cytoscape plugin for centrality analysis and evaluation of protein interaction networks (2015, methodology): “Eight centrality measures provided by CytoNCA are: Between-ness (Anthonisse, 1971; Newman, 2005), Closeness Centrality (Sabidussi, 1966), Degree Centrality (Jeong et al., 2001), Eigenvec-tor Centrality (Bonacich, 1987), Local Average Connectivity-based Centrality (Li et al., 2011), Network…”
- Identification of influencers - Measuring influence in customer networks (2008, background): “Hakimi [34] and Sabidussi [53] developed a measure that central members are close, by stating that central nodes in a network have shortest paths to all other nodes.”
- State of the aRt personality research: A tutorial on network analysis of personality data in R (2015, unknown): “Closeness centrality (Freeman, 1978; Sabidussi, 1966) is defined as the inverse of the sum of the distances of the focal node from all the other nodes in the network 5 .”