This paper studies the temporal communication patterns of online communities of developers and users of the open source Eclipse Java development environment. It measures the productivity of each community and seeks to identify correlations that exist between group communication characteristics and productivity attributes. The study uses the TeCFlow (Temporal Communication Flow) visualizer to cr...

We propose as centrality measures for social networks two classical power indices, Banzhaf and Shapley-Shubik, and two new measures, effort and satisfaction, related to the spread of influence process that emerge from the subjacent influence game. We perform a comparison of these measures with three well known centrality measures, degree, closeness and betweenness, applied to three simple socia...

Brinkmann graph is a 4-regular with 21 nodes and 42 edges discovered by Gunnar in 1992. To our knowledge, the research specifically on still hard to find. Therefore, this was carried out analyze term of its centrality. The centrality measures used are degree, betweenness, closeness In paper, we presented not only but also after node deletion see how impact graph. Before deletion, results showed...

In computer networks and social networks, the betweenness centrality of a node measures the amount of information passing through the node when all pairs are conducting shortest-path exchanges. In this paper, we introduce a strategic network-formation game based on the betweenness centrality. In this game, nodes are selfish players, each of which has some budget to build connections. The goal o...

In the article, we describe a new algebraic approach to the temporal network analysis based on the notion of temporal quantities. We define the semiring for computing the foremost journey and the traveling semirings for the analysis of temporal networks where the latency is given, the waiting times are arbitrary, and some other information on the links are known. We use the operations in the tr...

Another class of centrality measures takes a geometric approach to identifying important vertices, relying on geodesic paths between pairs of vertices. Notably, geodesic distances are not metric— they do not obey the triangle inequality—which means applying our (Euclidean) intuition may provide incorrect interpretations of the results. In many cases, the most central vertices under these measur...

In this paper we analyze a major part of the research output of the Networked Knowledge Organization Systems (NKOS) community in the period 2000 to 2015 from a network analytical perspective. We focus on the paper output presented at the European NKOS workshops in the last 15 years. Our open dataset, the ”NKOS bibliography”, includes 14 workshop agendas (ECDL 2000-2010, TPDL 2011-2015) and 4 sp...