In elections, the vote shares or turnout rates show a strong spatial correlation. The logarithmic decay with distance suggests that a two-dimensional (2D) noisy diffusive equation describes the system. Based on the study of U.S. presidential elections data, it was determined that the fluctuations of vote shares also exhibit a strong and long-range spatial correlation. Previously, it was considered difficult to induce strong and long-range spatial correlation of the vote shares without breaking the empirically observed narrow distribution. We demonstrate that a voter model on networks shows such a behavior. In the model, there are many voters in a node who are affected by the agents in the node and by the agents in the linked nodes. A multivariate Wright-Fisher diffusion equation for the joint probability density of the vote shares is derived. The stationary distribution is a multivariate generalization of the beta distribution. In addition, we also estimate the equilibrium values and the covariance matrix of the vote shares and obtain a correspondence with a multivariate normal distribution. This approach largely simplifies the calibration of the parameters in the modeling of elections.
This paper considers a multiterm urn process that has a correlation in the same term and temporal correlation. .The objective is to clarify the relationship between the urn model and the Hawkes process. Correlation in the same term is represented by the Pólya urn model and the temporal correlation is incorporated by introducing the conditional initial condition. In the double scaling limit of this urn process, the self-exciting negative binomial distribution process, which is a marked Hawkes process, is obtained. In the standard continuous limit, this process becomes the Hawkes process, which has no correlation in the same term. The difference is the variance of the intensity function in that the phase transition from the steady to the nonsteady state can be observed. The critical point, at which the power-law distribution is obtained, is the same for the Hawkes and the urn processes. These two processes are used to analyze empirical data of financial default to estimate the parameters of the model. For the default portfolio, the results produced by the urn process are superior to those obtained with the Hawkes process and confirm self-excitation.
We study a simple model for social learning agents in a restless multiarmed bandit. There are agents, and the bandit has good arms that change to bad with the probability . If the agents do not know a good arm, they look for it by a random search (with the success probability ) or copy the information of other agents' good arms (with the success probability ) with probabilities or , respectively. The distribution of the agents in good arms obeys the Yule distribution with the power-law exponent in the limit and . The system shows a phase transition at . For , the variance of per agent is finite (diverges as with ). There is a threshold value for the system size that scales as . The expected value of the number of the agents with a good arm increases with for . For and , all agents tend to share only one good arm. If the shared arm changes to be bad, it takes a long time for the agents to find another good one. decreases to zero as , which is referred to as the “echo chamber.”
15 February 2018 in Journal of the Physical Society of Japan
This study discusses choice behavior using a voting model in which voters can obtain information from a finite number of previous r voters. Voters vote for a candidate with a probability proportional to the previous vote ratio, which is visible to the voters. We obtain the Pitman sampling formula as the equilibrium distribution of r votes. We present the model as a process of posting on a bulletin board system, 2ch.net, where users can choose one of many threads to create a post. We explore how this choice depends on the last r posts and the distribution of these last r posts across threads. We conclude that the posting process is described by our voting model with analog herders for a small r, which might correspond to the time horizon of users’ responses.
15 August 2021 in Journal of the Physical Society of Japan
In this article, we discuss the random graph, Barabási–Albert (BA) model, and lattice networks from a unified view point, with the parameter ω with values \(1,0, - 1\) characterizing these networks...
Ant colony optimization (ACO) is a stochastic optimization algorithm inspired by the foraging behavior of ants. We investigate a simplified computational model of ACO, wherein ants sequentially engage in binary decision-making tasks, leaving pheromone trails contingent upon their choices. The quantity of pheromone left is the number of correct answers. We scrutinize the impact of a salient parameter in the ACO algorithm, specifically, the exponent , which governs the pheromone levels in the stochastic choice function. In the absence of pheromone evaporation, the system is accurately modeled as a multivariate nonlinear Pólya urn, undergoing phase transition as varies. The probability of selecting the correct answer for each question asymptotically approaches the stable fixed point of the nonlinear Pólya urn. The system exhibits dual stable fixed points for and a singular stable fixed point for where is the critical value. When pheromone evaporates over a time scale , the phase transition does not occur and leads to a bimodal stationary distribution of probabilities for and a monomodal distribution for .