A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...

Using data collected across 19 years, the chief goal of this study was to discover predictors of continued relational closeness between best friends. Participants were same-sex and cross-sex best friend pairs recruited from a small Midwestern college. In 1983, participants completed several tests and activities designed to assess facets of intimacy, with follow-up studies in 1987 and 2002 measu...

k-Anonymity and ε-differential privacy are two mainstream privacy models, the former introduced to anonymize data sets and the latter to limit the knowledge gain that results from the inclusion of one individual in the data set. Whereas basic k-anonymity only protects against identity disclosure, t-closeness was presented as an extension of k-anonymity that also protects against attribute discl...

We introduce H -group closeness centrality in this work. H -group closeness centrality of a group of nodes measures how close this node group is to other nodes in a graph, and can be used in numerous applications such as measuring the importance and influence of a group of users in a social network. When a large graph contains billions of edges that cannot reside entirely in a computer’s main m...

One prediction of the calculus of voting is that electoral closeness positively affects turnout via a higher probability of one vote being decisive. I test this theory with data on all mayoral elections in the German state of Bavaria between 1946 and 2009. Importantly, I use constitutionally prescribed two-round elections to measure electoral closeness and thereby improve on existing work that ...

A new characteristic (residual closeness) which can measure the network resistance is presented. It evaluates closeness after removal of vertices or links, hence two types are considered—vertices and links residual closeness. This characteristic is more sensitive than the well-known measures of vulnerability—it captures the result of actions even if they are small enough not to disconnect the g...