Centrality is a family of metrics for characterizing the importance vertex in graph. Although large number centrality have been proposed, majority them ignores uncertainty graph data. In this paper, we formulate closeness on uncertain graphs and define batch evaluation problem that computes subset vertices an We develop three algorithms, MS-BCC , MG-BCC MGMS-BCC based sampling to approximate sp...

In two studies, college students’ achievement goals were linked to their perceptions of closeness to their parents following an exam. In Study 1, mastery-approach goals positively predicted perceived closeness immediately after an exam, prior to receiving feedback. In Study 2, mastery-approach goals again positively predicted perceived closeness, but performance–avoidance goals interacted with ...

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...

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...

This paper implements an estimated ranking algorithm of closeness centrality measures in large-scale workflow-supported social networks. The traditional ranking algorithms for large-scale networks have suffered from the time complexity problem. The larger the network size is, the bigger dramatically the computation time becomes. To solve the problem on calculating ranks of closeness centrality ...

In this article I examine whether turnout in the 2000 presidential election was influenced by closeness and candidate expenditures. Evidence that closeness affects turnout supports the theory that voters assign more weight to their votes in close elections. Evidence that expenditures increase turnout provides support for the argument that greater mobilization efforts increase turnout in close e...

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...