Algorithmik sozialer Netzwerke
Zusammenfassung der Projektergebnisse
Social Network Algorithmics is a methodological project aimed at bridging the gap between social theory and network-analytic methods. Major categories in the analysis of networks are indicators of micro- and macro-structural features such as triad census, degree distribution, or core-periphery structure, indices of centrality such as degree, closeness, or betwenness centrality, assignments of roles such as structural or regular equivalence, and partitions into relatively cohesive subsets such as modularity clustering. In applied settings, substantive arguments usually motivate why an analytic category may be relevant but stop short of identifying appropriate methods in that category. Since results crucially depend on the choice of method, network analyses are often considered to be problematic. With a focus on social networks and social theory, this project developed an analytic pipeline of smaller-scale elements by which the process of analysis and method selection can be structured. Organized around the central notion of network positions, i.e., the observed or derived relationships actors have with all others, the positional approach explicates assumptions and therefore unveils opportunities for theorizing and empirical testing. As a byproduct, it enables more general mathematical statements and identifies algorithmic and statistical challenges. Although the project has concluded, it sparked a long-term research agenda.
Projektbezogene Publikationen (Auswahl)
- Studying Social Networks – A Guide to Empirical Research. Campus, Frankfurt/New York, 2012
Marina Hennig, Ulrik Brandes, Jürgen Pfeffer, and Ines Mergel
- Was messen Zentralitätsindizes? In Marina Hennig and Christian Stegbauer, editors, Die Integration von Theorie und Methode in der Netzwerkforschung, pages 33–52. Springer VS, 2012
Ulrik Brandes, Sven Kosub, and Bobo Nick
(Siehe online unter https://doi.org/10.1007/978-3-531-93464-8_3) - Link prediction with social vector clocks. In Proceedings of the 19th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 2013), pages 784–792, 2013
Conrad Lee, Bobo Nick, Ulrik Brandes, and Pádraig Cunningham
(Siehe online unter https://doi.org/10.1145/2487575.2487615) - Relative importance of effects in stochastic actor-oriented models. Network Science, 1(3):278–304, 2013
Natalie Indlekofer and Ulrik Brandes
(Siehe online unter https://doi.org/10.1017/nws.2013.21) - Simmelian backbones: Amplifying hidden homophily in facebook networks. In Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Network Analysis and Mining (ASONAM 2013), pages 525–532. IEEE, 2013
Bobo Nick, Conrad Lee, Pádraig Cunningham, and Ulrik Brandes
(Siehe online unter https://doi.org/10.1145/2492517.2492569) - What is network science? Network Science, 1(1):1–15, 2013
Ulrik Brandes, Garry Robins, Ann McCranie, and Stanley Wasserman
(Siehe online unter https://doi.org/10.1017/nws.2013.2) - Smallest graphs with distinct singleton centers. Network Science, 2(3):416–418, 2014
Ulrik Brandes and Jan Hildenbrand
(Siehe online unter https://doi.org/10.1017/nws.2014.25) - Graph based relational features for collective classification. In Proceedings of the 19th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2015), volume 9078 of Lecture Notes in Computer Science, pages 447–458. Springer-Verlag, 2015
Immanuel Bayer, Uwe Nagel, and Steffen Rendle
(Siehe online unter https://doi.org/10.1007/978-3-319-18032-8_35) - Untangling the hairballs of multi-centered, small-world online social media networks. Journal of Graph Algorithms and Applications, 19(2):595–618, 2015
Arlind Nocaj, Mark Ortmann, and Ulrik Brandes
(Siehe online unter https://doi.org/10.7155/jgaa.00370) - Investigating link inference in partially observable networks: Friendship ties and interaction. IEEE Transactions on Computational Social Systems, 3(3):113–119, 2016
Mehwish Nasim, Raphaël Charbey, Christophe Prieur, and Ulrik Brandes
(Siehe online unter https://doi.org/10.1109/TCSS.2016.2618998) - Maintaining the duality of closeness and betweenness centrality. Social Networks, 44:153–159, 2016
Ulrik Brandes, Stephen P. Borgatti, and Linton C. Freeman
(Siehe online unter https://doi.org/10.1016/j.socnet.2015.08.003) - Network positions. Methodological Innovations, 9:1–19, 2016
Ulrik Brandes
(Siehe online unter https://doi.org/10.1177%2F2059799116630650) - Re-conceptualizing centrality in social networks. European Journal of Applied Mathematics, 27(6):971–985, 2016
David Schoch and Ulrik Brandes
(Siehe online unter https://doi.org/10.1017/S0956792516000401) - Correlations among centrality indices and a class of uniquely ranked graphs. Social Networks, 50:46–54, 2017
David Schoch, Thomas W. Valente, and Ulrik Brandes
(Siehe online unter https://doi.org/10.1016/j.socnet.2017.03.010)
