Closeness is a widely-studied centrality measure. Since it requires all pairwise distances, computing closeness for all nodes is infeasible for large real-world networks. However, for many applications, it is only necessary to find the k most central nodes and not all closeness values. Prior work has shown that computing the top-k nodes with highest closeness can be done much faster than comput...

Qualitative reasoning is an area of AI which provides solutions to problems where the quantitative information either is not available or can not be used; in particular, order of magnitude qualitative reasoning assumes different qualitative classes and relations such as negligibility and closeness. In this paper, we focus mainly on the very important notion of closeness from the logical point o...

We provide a characterization of closeness centrality in the class distance-based centralities. To this end, we introduce natural property, called majority comparison, that states out two adjacent nodes one closer to more is central. prove any satisfies property gives same ranking every graph as centrality. The axiom inspired by interpretation an election which are both voters and candidates th...

In temporal networks, where nodes interact via sequences of temporary events, information or resources can only flow through paths that follow the time ordering of events. Such temporal paths play a crucial role in dynamic processes. However, since networks have so far been usually considered static or quasistatic, the properties of temporal paths are not yet well understood. Building on a defi...

The current study examined the effect of empathy on friendship quality in the context of dyadic same-sex friendships, and how such an effect might be mediated by interpersonal competence. A special version of the actor-partner interdependence model (APIM) was used to examine this hypothesis in 146 same-sex friend dyads in 10th grade. Results showed that empathy was positively related to intimac...

Designing large scale real estate projects often requires collaboration between consultants and agencies that are located in different geographical areas. The added constraint of geographical distance to a design approach that already involves multiple participants makes design collaboration a particularly challenging task. This study hypothesizes that design collaboration could benefit from ha...

We propose a method for the Distributed Assessment of Network CEntrality (DANCE) in complex networks. DANCE attributes to each node a volume-based centrality computed using only localized information, thus not requiring knowledge of the full network topology. We show DANCE is simple, yet efficient, in assessing node centrality in a distributed way. Our proposal also provides a way for locating ...

Relying on random and purposive moving agents, we simulated human movement in large street networks. We found that aggregate flow, assigned to individual streets, is mainly shaped by the underlying street structure, and that human moving behavior (either random or purposive) has little effect on the aggregate flow. This finding implies that given a street network, the movement patterns generate...