Centrality without indices: Partial rankings and rank probabilities in networks

Social Networks

Volumn 54, Issue , 2018, Pages 50-60

  Schoch, David ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Centrality indices; Neighborhood inclusion; Network centrality; Partial orders; Rank probabilities

Indexed keywords

EID: 85039738339     PISSN: 03788733     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.socnet.2017.12.003     Document Type: Article

References (60)

1. Agneessens, F., Borgatti, S.P., Everett, M.G., Geodesic based centrality: unifying the local and the global. Soc. Netw. 49 (2017), 12–26.
2. Anthonisse, J.M., The Rush in a Directed Graph. Tech. Rep. BN 9/71. 1971, Mathematical Centre, Amsterdam.
3. Bartel, H.-G., Mucha, H.-J., Measures of incomparability and of inequality and their applications. Multi-Indicator Systems and Modelling in Partial Order, 2014, Springer-Verlag, 47–67.
4. Batagelj, V., Semirings for social network analysis. J. Math. Sociol. 19:1 (1994), 53–68.
5. Bavelas, A., A mathematical model for group structures. Hum. Organ. 7:3 (1948), 16–30.
6. Belton, V., Gear, T., On a short-coming of Saaty's method of analytic hierarchies. Omega 11:3 (1983), 228–230.
7. Belton, V., Stewart, T.J., Multiple Criteria Decision Analysis: An Integrated Approach. 2002, Springer Science & Business Media.
8. Benzi, M., Klymko, C., Total communicability as a centrality measure. J. Complex Netw. 1:2 (2013), 124–149.
9. Berge, C., Théorie des Graphes et ses Applications. 1958, Paris, France.
10. Boldi, P., Vigna, S., Axioms for centrality. Internet Math. 10:3–4 (2014), 222–262.
11. Bonacich, P., Factoring and weighting approaches to status scores and clique identification. J. Math. Sociol. 2 (1972), 113–120.
12. Bonacich, P., Lloyd, P., Eigenvector-like measures of centrality for asymmetric relations. Soc. Netw. 23:3 (2001), 191–201.
13. Borgatti, S.P., Centrality and network flow. Soc. Netw. 27:1 (2005), 55–71.
14. Borgatti, S.P., Everett, M.G., A graph-theoretic perspective on centrality. Soc. Netw. 28:4 (2006), 466–484.
15. Brandes, U., Network positions. Methodol. Innov. 9 (2016), 1–19.
16. Brightwell, G., Winkler, P., Counting linear extensions. Order 8:3 (1991), 225–242.
17. Brüggemann, R., Carlsen, L., Incomparable-what now?. MATCH Commun. Math. Comput. Chem. 71 (2014), 694–716.
18. Brüggemann, R., Lerche, D., Sørensen, P.B., First attempts to relate structures of Hasse diagrams with mutual probabilities. Technical Report 479. The 5th workshop held at the National Environmental Research Institute (NERI), 2003, 7–52.
19. Brüggemann, R., Simon, U., Mey, S., Estimation of averaged ranks by extended local partial order models. MATCH Commun. Math. Comput. Chem. 54 (2005), 489–518.
20. Brüggemann, R., Sørensen, P.B., Lerche, D., Carlsen, L., Estimation of averaged ranks by a local partial order model. J. Chem. Inform. Comput. Sci. 44:2 (2004), 618–625.
21. Bubley, R., Dyer, M., Faster random generation of linear extensions. Discrete Math. 201:1 (1999), 81–88.
22. Dangalchev, C., Residual closeness in networks. Phys. A: Stat. Mech. Appl. 365:2 (2006), 556–564.
23. Davey, B.A., Priestley, H.A., Introduction to Lattices and Order. 2002, Cambridge University Press.
24. De Loof, K., Efficient Computation of Rank Probabilities in Posets (Ph.D. thesis). 2009, Ghent University.
25. De Loof, K., De Baets, B., De Meyer, H., Properties of mutual rank probabilities in partially ordered sets. Multicriteria Ordering and Ranking: Partial Orders, Ambiguities and Applied Issues, 2008, Systems Research Institute, Polish Academy of Sciences, 145–165.
26. De Loof, K., De Meyer, H., De Baets, B., Exploiting the lattice of ideals representation of a poset. Fundamenta Informaticae 71:2–3 (2006), 309–321.
27. Estrada, E., Higham, D.J., Hatano, N., Communicability betweenness in complex networks. Phys. A: Stat. Mech. Appl. 388:5 (2009), 764–774.
28. Estrada, E., Rodríguez-Velázquez, J.A., Spectral measures of bipartivity in complex networks. Phys. Rev. E, 4, 2005 046105.
29. Estrada, E., Rodríguez-Velázquez, J.A., Subgraph centrality in complex networks. Phys. Rev. E, 5, 2005 056103.
30. Fishburn, P.C., Gehrlein, W.V., A comparative analysis of methods for constructing weak orders from partial orders. J. Math. Sociol. 4:1 (1975), 93–102.
31. Freeman, L.C., A set of measures of centrality based on betweenness. Sociometry 40:1 (1977), 35–41.
32. Freeman, L.C., Centrality in social networks: conceptual clarification. Soc. Netw. 1:3 (1979), 215–239.
33. Gondran, M., Minoux, M., Graphs, Diods and Semirings. 2008, Springer-Verlag.
34. Grätzer, G., General Lattice Theory. 2002, Springer Science & Business Media.
35. Habib, M., Medina, R., Nourine, L., Steiner, G., Efficient algorithms on distributive lattices. Discrete Appl. Math. 110:2 (2001), 169–187.
36. Hage, P., Harary, F., Eccentricity and centrality in networks. Soc. Netw. 17 (1995), 57–63.
37. Harris, C.D., The market as a factor in the localization of industry in the United States. Ann. Assoc. Am. Geogr. 4 (1954), 315–348.
38. Jackson, M.O., Social and Economic Networks. 2010, Princeton University Press.
39. Janicki, R., Ranking with partial orders and pairwise comparisons. International Conference on Rough Sets and Knowledge Technology, 2008, Springer, 442–451.
40. Janicki, R., Pairwise comparisons based non-numerical ranking. Fundamenta Informaticae 94:2 (2009), 197–217.
41. Katz, L., A new status index derived from sociometric analysis. Psychometrika 18:1 (1953), 39–43.
42. Kitti, M., Axioms for Centrality Scoring with Principal Eigenvectors. Tech. Rep. 79. 2012, Aboa Centre for Economics, Turku University.
43. Landherr, A., Friedl, B., Heidemann, J., A critical review of centrality measures in social networks. Bus. Inf. Syst. Eng. 2:6 (2010), 371–385.
44. Lü, L., Chen, D., Ren, X.-L., Zhang, Q.-M., Zhang, Y.-C., Zhou, T., Vital nodes identification in complex networks. Phys. Rep. 650 (2016), 1–6.
45. Neggers, J., Kim, H.S., Basic Posets. 1998, World Scientific.
46. Newman, M.E.J., A measure of betweenness centrality based on random walks. Soc. Netw. 27:1 (2005), 39–54.
47. Nieminen, J., On the centrality in a graph. Scand. J. Psychol. 15 (1974), 332–336.
48. Padgett, J.F., Ansell, C.K., Robust action and the rise of the Medici 1400-1434. Am. J. Sociol. 98:6 (1993), 1259–1319.
49. Patil, G.P., Taillie, C., Multiple indicators, partially ordered sets, and linear extensions: multi-criterion ranking and prioritization. Environ. Ecol. Stat. 11:2 (2004), 199–228.
50. Pavan, M., Todeschini, R., New indices for analysing partial ranking diagrams. Anal. Chim. Acta 515:1 (2004), 167–181.
51. Ruhnau, B., Eigenvector-centrality – a node-centrality?. Soc. Netw. 22:4 (2000), 357–365.
52. Sabidussi, G., The centrality index of a graph. Psychometrika 31:4 (1966), 581–603.
53. Schoch, D., Brandes, U., Re-conceptualizing centrality in social networks. Eur. J. Appl. Math. 27:6 (2016), 971–985.
54. Schoch, D., Valente, T.W., Brandes, U., Correlations among centrality indices and a class of uniquely ranked graphs. Soc. Netw. 50 (2017), 46–54.
55. Stewart, T.J., A critical survey on the status of multiple criteria decision making theory and practice. Omega 20:5–6 (1992), 569–586.
56. Triantaphyllou, E., Multi-Criteria Decision Making Methods: A Comparative Study, vol. 44, 2013, Springer Science & Business Media.
57. Triantaphyllou, E., Mann, S.H., An examination of the effectiveness of multi-dimensional decision-making methods: a decision-making paradox. Decis. Support Syst. 5:3 (1989), 303–312.
58. Valente, T.W., Foreman, R.K., Integration and radiality: measuring the extent of an individual's connectedness and reachability in a network. Soc. Netw. 20:1 (1998), 89–105.
59. Wasserman, S., Faust, K., Social Network Analysis. Methods and Applications. 1994, Cambridge University Press, Cambridge, UK.
60. Wei, T.-H., Algebraic Foundations of Ranking Theory (Ph.D. thesis). 1952, University of Cambridge.