Topology recognition and leader election are fundamental tasks in distributed computing in networks. The first of them requires each node to find a labeled isomorphic copy of the network, while the result of the second one consists in a single node adopting the label 1 (leader), with all other nodes adopting the label 0 and learning a path to the leader. We consider both these problems in netwo...

A Distributed system is an application which executes a collection of protocols to coordinate the actions of multiple processes on a network, such that all components cooperate together in order to perform a single or small set of related tasks. It is very difficult for processes to cooperate with each other because of failures of any of the process during communication. The leader election is ...

We consider a continuous time model for election timing in a Majoritarian Parliamentary System where the government maintains a constitutional right to call an early election. Our model is based on the two-party-preferred data that measure the popularity of the government and the opposition over time. We describe the poll process by a Stochastic Differential Equation (SDE) and use a martingale ...

This paper examines the impact of political uncertainty on financial crises using a panel of twenty-two emerging markets. By examining political election cycles, we find that eight out of nine of the financial crises happened during the periods of political election and transition. Using a combination of probit and switching regression analysis, we find that there is a significant relationship ...

Verifiability is an important component of elections. It is related to aspects like trust in the correctness of the election results, transparency of the election processes, and preparation for a possible contestation of the election. In particular the last aspect is of crucial importance in legally regulated elections. Verifiability in this context means that voting systems must be designed co...

In an election year, political messaging can become feisty or even violent. In the 2012 U.S. presidential election, Americans were inundated with statements that metaphorically referred to violence, such as “Romney slams Obama” and”Romney slaughtered Obama.” Such expressions grab our attention and resonate with our understanding of actual physical violence. Despite their frequent use in electio...

— Electing leader is a vital issue not only in distributed computing but also in communication network [1, A leader is required to make synchronization between different processes. And different election algorithms are used to elect a coordinator among the available processes in the system such a way that there will be only one coordinator at any time. Bully election algorithm is one of the cla...

Following the 1995 Russian parliamentary election, it was suggested that Russian voters may have used their votes to send a message to the then current Russian president, Boris Yeltsin, who was scheduled to run for reelection six months later. Building on this observation, we consider the incentives for information transmission through strategic voting in systems with sequential elections. We f...

Consensus protocols inherently rely on the notion of leader election, in which one or a subset of participants are temporarily elected to authorize and announce the network’s latest state. While leader election is a well studied problem, the rise of distributed ledgers (i.e., blockchains) has led to a new perspective on how to perform large-scale leader elections via solving a computationally d...

Election data represent a precious source of information to study human behavior at a large scale. In proportional elections with open lists, the number of votes received by a candidate, rescaled by the average performance of all competitors in the same party list, has the same distribution regardless of the country and the year of the election. Here we provide the first thorough assessment of ...