Abstract
A family of new measures of point and graph centrality based on early intuitions of Bavelas (1948) is introduced. These measures define centrality in terms of the degree to which a point falls on the shortest path between others and there fore has a potential for control of communication. They may be used to index centrality in any large or small network of symmetrical relations, whether connected or unconnected.
Keywords
Affiliated Institutions
Related Publications
PageRank for ranking authors in co‐citation networks
Abstract This paper studies how varied damping factors in the PageRank algorithm influence the ranking of authors and proposes weighted PageRank algorithms. We selected the 108 ...
Routing in ad-hoc networks using minimum connected dominating sets
We impose a virtual backbone structure on the ad-hoc network, in order to support unicast, multicast, and fault-tolerant routing within the ad-hoc network. This virtual backbone...
VoxelNet: End-to-End Learning for Point Cloud Based 3D Object Detection
Accurate detection of objects in 3D point clouds is a central problem in many applications, such as autonomous navigation, housekeeping robots, and augmented/virtual reality. To...
How Many Interviews Are Enough?
Guidelines for determining nonprobabilistic sample sizes are virtually nonexistent. Purposive samples are the most commonly used form of nonprobabilistic sampling, and their siz...
A Computationally Efficient and Reliable Bond Order Measure
Bond order indexes are useful measures that connect quantum mechanical results with chemical understanding. One of these measures, the natural bond order index, based on the nat...
Publication Info
- Year
- 1977
- Type
- article
- Volume
- 40
- Issue
- 1
- Pages
- 35-35
- Citations
- 9828
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.2307/3033543