Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph

References

• Bapat, R. B. (1998). A max version of the perron-frobenius theorem. Linear Algebra and Its Applications, 275, 3–18. doi:10.1016/S0024-3795(97)10057-X
   Google Scholar
• Bapat, R. B., & Raghavan, T. E. S. (1997). Nonnegative matrices and applications. New York, NY: Cambridge University Press.
   Google Scholar
• Berkhin, P. (2005). A survey on pagerank computing. Internet Mathematics, 2(1), 73–120. doi:10.1080/15427951.2005.10129098
   Google Scholar
• 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.
   Google Scholar
• Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. The Journal of Mathematical Sociology, 2(1), 113–120. doi:10.1080/0022250X.1972.9989806
   Web of Science ®Google Scholar
• Bonacich, P. (1978). Using boolean algebra to analyze overlapping memberships. Sociological Methodology, 9, 101–115. doi:10.2307/270805
   Google Scholar
• Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182. doi:10.1086/228631
   Web of Science ®Google Scholar
• Bonacich, P., & Lloyd, P. (2001). Eigenvector-like measures of centrality for asymmetric relations. Social Networks, 23(3), 191–201. doi:10.1016/S0378-8733(01)00038-7
   Web of Science ®Google Scholar
• Bonacich, P., & Lloyd, P. (2004). Calculating status with negative relations. Social Networks, 26(4), 331–338. doi:10.1016/j.socnet.2004.08.007
   Web of Science ®Google Scholar
• Borgatti, S. P. (2002). NetDraw: Graph visualization software. Harvard, MA: Analytic Technologies.
   Google Scholar
• Borgatti, S. P., & Everett, M. G. (1999). Models of core/periphery structures. Social Networks, 21(4), 375–395. doi:10.1016/S0378-8733(99)00019-2
   Web of Science ®Google Scholar
• Borgatti, S. P., Everett, M. G., & Freeman, L. C. (2002). Ucinet 6 for windows: Software for social network analysis. Harvard, MA: Analytic Technologies.
   Google Scholar
• Bozzo, E., & Franceschet, M. (2016). A theory on power in networks. Communications of the ACM, 59(11), 75–83. doi:10.1145/3013530
   Web of Science ®Google Scholar
• Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., … Wiener, J. (2000). Graph structure in the web. Computer Networks, 33(1–6), 309–320. doi:10.1016/S1389-1286(00)00083-9
   Web of Science ®Google Scholar
• Brualdi, R. A. (2010). Spectra of digraphs. Linear Algebra and Its Applications, 432(9), 2181–2213. doi:10.1016/j.laa.2009.02.033
   Web of Science ®Google Scholar
• Chung, F. R. K. (1997). Spectral graph theory. Providence, RI: American Mathematical Society.
   Google Scholar
• Freeman, L. C., & White, D. R. (1993). Using galois lattices to represent network data. Sociological Methodology, 23, 127–146. doi:10.2307/271008
   Web of Science ®Google Scholar
• Friedkin, N. E. (1991). Theoretical foundations for centrality measures. American Journal of Sociology, 96(6), 1478–1504. doi:10.1086/229694
   Web of Science ®Google Scholar
• Gleich, D. F. (2015). PageRank beyond the web. SIAM Review, 57(3), 321–363. doi:10.1137/140976649
   Web of Science ®Google Scholar
• Gould, R. V. (2002). The origins of status hierarchies: A formal theory and empirical test. American Journal of Sociology, 107(5), 1143–1178. doi:10.1086/341744
   Web of Science ®Google Scholar
• Harary, F. (1959). Status and contrastatus. Sociometry, 22(1), 23–43. doi:10.2307/2785610
   Google Scholar
• Hubbell, C. (1965). An input-output approach to clique identification. Sociometry, 28(4), 377–399. doi:10.2307/2785990
   Google Scholar
• Katz, L. (1953). A new status index derived from sociometric analysis. Psychometrika, 18(1), 39–43. doi:10.1007/BF02289026
   Google Scholar
• Langville, A. N., & Meyer, C. D. (2006). Google’s pagerank and beyond: The science of search engine rankings. Princeton, NJ: Princeton University Press.
   Google Scholar
• Lu, N.-P. (2016). Using eigenvectors of perturbed and collapsed adjacency matrices to explore bowtie structures in directed networks. Journal of the Chinese Institute of Engineers, 39(8), 936–945. doi:10.1080/02533839.2016.1225517
   Web of Science ®Google Scholar
• 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. doi:10.1080/0022250X.2017.1328680
   Web of Science ®Google Scholar
• Page, L., Brin, S., Motwani, R., & Winograd, T. (1999). The pagerank citation ranking: Bringing order to the web(Technical Report). Stanford InfoLab. Retrieved from: http://ilpubs.stanford.edu:8090/422/1/1999-66.pdf
   Google Scholar
• Richards, W., & Seary, A. (2000). Eigen analysis of networks. Journal of Social Structure, 1(2), 1–17.
   Google Scholar
• Sahni, S. (2001). Data structures, algorithms, and applications in java. New York, NY: McGraw-Hill.
   Google Scholar
• Sampson, S. F. (1968). A novitiate during a period of change: An experimental and case study of relationships (Unpublished Ph. D. dissertation). Department of Sociology, Cornell University.
   Google Scholar
• Seary, A., & Richards, W. (2003). Spectral methods for analyzing and visualizing networks: An introduction. In B. Breiger, K. Carley, & P. Pattison (Eds.), Dynamic social network modeling and analysis: Workshop summary and papers (pp. 209–228). Washington, DC: The National Academies Press.
   Google Scholar
• Spielman, D. (2012). Spectral graph theory. In U. Naumann & O. Schenk (Eds.), Combinatorial Scientific Computing (pp. 495–524). Boca Raton, FL: CRC Press.
   Google Scholar