93
Views
1
CrossRef citations to date
0
Altmetric
Research Article

A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph

Pages 51-64 | Received 13 Jun 2019, Accepted 02 Jan 2020, Published online: 12 Jan 2020

References

  • Ball, B., & Newman, M. E. (2013). Friendship networks and social status. Network Science, 1(1), 16–30.
  • Bapat, R. B. (1998). A max version of the Perron-Frobenius theorem. Linear Algebra and Its Applications, 275, 3–18.
  • Berman, A., & Shaked-Monderer, N. (2012). Non-negative matrices and digraphs. In R. A. Meyers (Ed.), Computational Complexity: Theory, Techniques, and Applications (pp. 2082–2095). New York, NY: Springer.
  • Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. The Journal of Mathematical Sociology, 2(1), 113–120.
  • Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182.
  • Bonacich, P., & Lloyd, P. (2001). Eigenvector-like measures of centrality for asymmetric relations. Social Networks, 23(3), 191–201.
  • Borgatti, S. P. (2002). NetDraw: Graph Visualization Software. Harvard, MA: Analytic Technologies.
  • Borgatti, S. P., & Everett, M. G. (2006). A graph-theoretic perspective on centrality. Social Networks, 28(4), 466–484.
  • de Sola Pool, I., & Kochen, M. (1978). Contacts and influence. Social Networks, 1(1), 5–51.
  • Estrada, E., & Higham, D. J. (2010). Network properties revealed through matrix functions. SIAM Review, 52(4), 696–714.
  • Estrada, E., & Rodriguez-Velazquez, J. A. (2005). Subgraph centrality in complex networks. Physical Review E, 71(5), 056103.
  • Friedkin, N. E. (1991). Theoretical foundations for centrality measures. American Journal of Sociology, 96(6), 1478–1504.
  • Gleich, D. F. (2015). PageRank beyond the web. SIAM Review, 57(3), 321–363.
  • Gould, R. V. (2002). The origins of status hierarchies: A formal theory and empirical test. American Journal of Sociology, 107(5), 1143–1178.
  • Hubbell, C. (1965). An input-output approach to clique identification. Sociometry, 28(4), 377–399.
  • Hummon, N. P., & Doreian, P. (1989). Connectivity in a citation network: The development of DNA theory. Social Networks, 11(1), 39–63.
  • Kadushin, C. (2012). Understanding Social Networks: Theories, Concepts, and Findings. New York, NY: Oxford University Press.
  • Katz, L. (1953). A new status index derived from sociometric analysis. Psychometrika, 18(1), 39–43.
  • Lu, N.-P. (2017). Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph. The Journal of Mathematical Sociology, 41(3), 139–154.
  • Lu, N.-P. (2019). Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph. The Journal of Mathematical Sociology, 43(3), 164–178.
  • Page, L., Brin, S., Motwani, R., & Winograd, T. (1999). The PageRank Citation Ranking: Bringing Order to the Web. Technical Report. Stanford InfoLab. http://ilpubs.stanford.edu:8090/422/1/1999-66.pdf
  • Strahler, A. N. (1952). Hypsometric (area-altitude) analysis of erosional topology. Geological Society of America Bulletin, 63(11), 1117–1142.
  • Vigna, S. (2016). Spectral ranking. Network Science, 4(4), 433–445.
  • Weeks, M. R., Clair, S., Borgatti, S. P., Radda, K., & Schensul, J. J. (2002). Social networks of drug users in high-risk sites: Finding the connections. AIDS and Behavior, 6(2), 193–206.
  • Wellman, B. (1983). Network analysis: Some basic principles. Sociological Theory, 1(1), 155–200.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.