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

Forgiveness. The Bible says we have offended a holy God and that we need to be forgiven of that offense before we can be in fellowship with God. There are not many ways to receive such forgiveness, because only the One who has been offended can forgive us of our offense (Mark 2:5-7). Jesus alone paid the penalty for our sin through His death on the cross (2 Cor. 5:21). He thereby cleared the wa...

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