Exact Scale Invariance in Mixing of Binary Candidates in Voting Model

preprint2010arXivOpen access

Abstract

We introduce a voting model and discuss the scale invariance in the mixing of candidates. The Candidates are classified into two categories μ∈{0,1}μ\in \{0,1\} and are called as `binary' candidates. There are in total N=N0+N1N=N_{0}+N_{1} candidates, and voters vote for them one by one. The probability that a candidate gets a vote is proportional to the number of votes. The initial number of votes (`seed') of a candidate μμ is set to be sμs_μ. After infinite counts of voting, the probability function of the share of votes of the candidate μμ obeys gamma distributions with the shape exponent sμs_μ in the thermodynamic limit Z0=N1s1+N0s0→∞Z_{0}=N_{1}s_{1}+N_{0}s_{0}\to \infty. Between the cumulative functions {xμ}\{x_μ\} of binary candidates, the power-law relation 1−x1∼(1−x0)α1-x_{1} \sim (1-x_{0})^α with the critical exponent α=s1/s0α=s_{1}/s_{0} holds in the region 1−x0,1−x1<<11-x_{0},1-x_{1}<<1. In the double scaling limit (s1,s0)→(0,0)(s_{1},s_{0})\to (0,0) and Z0→∞Z_{0} \to \infty with s1/s0=αs_{1}/s_{0}=α fixed, the relation 1−x1=(1−x0)α1-x_{1}=(1-x_{0})^α holds exactly over the entire range 0≤x0,x1≤10\le x_{0},x_{1} \le 1. We study the data on horse races obtained from the Japan Racing Association for the period 1986 to 2006 and confirm scale invariance.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.