A novel centrality method for weighted networks based on the Kirchhoff polynomial

Pattern Recognition Letters

Volumn 58, Issue , 2015, Pages 51-60

  Qi, Xingqin ^a   Fuller, Edgar ^b   Luo, Rong ^b   Zhang, Cun Quan ^b  

^a SHANDONG UNIVERSITY   (China)

^b WEST VIRGINIA UNIVERSITY   (United States)

Author keywords

Centrality method; Kirchhoff polynomial; Matrix tree theorem; Spanning tree; Weighted network

Indexed keywords

POLYNOMIALS;

CENTRALITY METHOD; KIRCHHOFF; MATRIX-TREE THEOREM; SPANNING TREE; WEIGHTED NETWORKS;

TREES (MATHEMATICS);

EID: 84925387554     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2015.02.007     Document Type: Article

References (22)

1. S. Sreenivasan, R. Cohen, E. Lopez, Z. Toroczkai, and H.E. Stanley Structural bottlenecks for communication in networks Phys. Rev. E 75 2007 036105
2. G. Ranjan, and Z.L. Zhang Geometry of complex networks and topological centrality Physica A: Stat. Mech. Appl. 392 17 2013 3833 3845
3. L. Rossi, A. Torsello, and E.R. Hancock Node centrality for continuous-time quantum walks Structural, Syntactic, and Statistical Pattern Recognition 2014 Springer 103 112
4. N. Perra, and S. Fortunato Spectral centrality measures in complex networks Phys. Rev. E 78 3 2008 036107
5. A. Landherr, B. Friedl, and J. Heidemann A critical review of centrality measures in social networks Bus. Inform. Syst. Eng. 6 2010 371 385
6. A. Barrat, M. Barthelemy, R. Pastor-Satorras, and A. Vespignani The architecture of complex weighted networks Proc. Natl. Acad. Sci. U.S.A. 101 2004 3747 3752
7. M.E.J. Newman Scientific collaboration networks. II. shortest paths, weighted networks, and centrality Phys. Rev. E 64 2001 016132
8. U. Brandes A faster algorithm for betweenness centrality J. Math. Sociol. 25 2001 163 177
9. E.W. Dijkstra A note on two problems in connexion with graphs Numer. Math. 1 1959 269 271
10. T. Opsahl, F. Agneessens, and J. Skvoretz Node centrality in weighted networks: generalizing degree and shortest paths Soc. Netw. 32 2010 245 251
11. X. Qi, E. Fuller, Q. Wu, and C.Q. Zhang Laplacian centrality: a new centrality measure for weighted networks Inform. Sci. 194 2012 240 253
12. A.S. Teixeira, P.T. Monteiro, J.A. Carriço, M. Ramirez, and A.P. Francisco Spanning edge betweenness Workshop on Mining and Learning with Graphs 24 2013 27 31
13. J. Bondy, and U. Murty Graph Theory With Applications first ed. 1976 North-Holland New York
14. B. Mohar The Laplacian spectrum of graphs Y. Alavi, G. Chartrand, O.R. Oellermann, A.J. Schwenk, Graph Theory, Combinatorics, and Applications 1991 Wiley 871 898
15. C. Fan, and C. Yang On polynomials of spanning trees Ann. Comb. 4 1 2000 13 25
16. M.A. Duval, J.C. Klivans, and L.J. Martin Simplicial matrix-tree theorems Trans. Am. Math. Soc. 361 11 2009 6073 6114
17. S.C. Freeman, and L.C. Freeman The Networkers Network: A Study of the Impact of a New Communications Medium on Sociometric Structure (Social sciences research reports) first ed. 1979 School of Social Sciences University of California Irvine, CA
18. W.W. Zachary An information flow model for conflict and fission in small groups J. Anthropol. Res. 30 4 1977 452 473
19. M.G. Everett, and S.P. Borgatti The centrality of groups and classes J. Math. Soc. 23 3 1999 181 201
20. J. Magouirk, S. Atran, and M. Sageman Connecting terrorist networks Stud. Conf. Terror. 31 1 2008 1 16
21. S. Koschade A social network analysis of Jemaah Islamiyah: the applications to counterterrorism and intelligence Stud. Confl. Terror. 29 6 2006 559 575
22. L.C. Freeman Centrality in social networks conceptual clarification Soc. Networks 1 3 1978 - 1979 215 239