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

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

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