Betweenness Centrality (BC) is a powerful metric for identifying central nodes in complex network analysis, but its computation in large and dynamic systems is costly. Most of the previous approximations for computing BC are either restricted to only one type of networks, or are too computationally inefficient to be applied to large or dynamically changing networks. We explore two approximative...

This study explores the interrelationships between health-related quality of life and conflict structures in family networks of older adults. Data were derived from a sample of 2,858 elders (aged 65 years and older) from the Vivre/Leben/Vivere study, a large survey addressing family life and health conditions of older people in Switzerland. Conflict density in family networks and the betweennes...

In this work, we quantitatively investigate the ways in which a given person influences the joint turn-taking behavior in a conversation. After collecting an auditory database of social interactions among a group of twenty-three people via wearable sensors (66 hours of data each over two weeks), we apply speech and conversation detection methods to the auditory streams. These methods automatica...

Apathy is defined as a mental state characterized by a lack of goal-directed behavior. However, the underlying mechanisms of apathy remain to be fully understood. Apathy shares certain symptoms with depression and both these affective disorders are known to be associated with dysfunctions of the frontal cortex-basal ganglia circuits. It is expected that clarifying differences in neural mechanis...

In a social network individuals have prominent centrality if they are intermediaries between the communication of others. The betweenness centrality of a vertex measures the number of intersecting geodesics between two other vertices. Formally, the betweenness centrality of a vertex v is the ratio of the number of shortest paths between two other vertices u and w which contain v to the total nu...

One of the most fundamental problems in large scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely used metric to measure the importance of a node in a network. Currently the fastest known algorithm [5], to compute betweenness of all nodes, requires O(nm) time for unweighted graphs and O(nm + n logn) time for weighted...

When transport in networks follows the shortest paths, the union of all shortest path trees G union or logical sum SPT can be regarded as the "transport overlay network." Overlay networks such as peer-to-peer networks or virtual private networks can be considered as a subgraph of G union or logical sum SPT. The traffic through the network is examined by the betweenness Bl of links in the overla...

We deliver a short overview of different centrality measures and influence concepts in social networks, and present the relation-algebraic approach to the concepts of power and influence. First, we briefly discuss four kinds of measures of centrality: the ones based on degree, closeness, betweenness, and the eigenvector-related measures. We consider centrality of a node and of a network. Moreov...