Keywords
Related Publications
An improved index of centrality
Increasing interest in the application of graph theory to the behavioral sciences is evidenced by the 1963 publication of the book "Applications of Graph Theory to Group Structu...
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 ...
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
This paper demonstrates theoretically and empirically that a greedy algorithm called Orthogonal Matching Pursuit (OMP) can reliably recover a signal with $m$ nonzero entries in ...
Numerical operator calculus in higher dimensions
When an algorithm in dimension one is extended to dimension d , in nearly every case its computational cost is taken to the power d . This fundamental difficulty is the single g...
A Set of Measures of Centrality Based on Betweenness
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 whic...
Publication Info
- Year
- 1966
- Type
- article
- Volume
- 31
- Issue
- 4
- Pages
- 581-603
- Citations
- 2371
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1007/bf02289527