SearcharxivSearch

arXiv · 1305.4892

Galam's bottom-up hierarchical system and public debate model revisited

Abstract

This article is concerned with the bottom-up hierarchical system and public debate model proposed by Galam, as well as a spatial version of the public debate model. In all three models, there is a population of individuals who are characterized by one of two competing opinions, say opinion -1 and opinion +1. This population is further divided into groups of common size s. In the bottom-up hierarchical system, each group elects a representative candidate, whereas in the other two models, all the members of each group discuss at random times until they reach a consensus. At each election/discussion, the winning opinion is chosen according to Galam's majority rule: the opinion with the majority of representants wins when there is a strict majority while one opinion, say opinion -1, is chosen by default in case of a tie. For the public debate models, we also consider the following natural updating rule that we shall call proportional rule: the winning opinion is chosen at random with a probability equal to the fraction of its supporters in the group. The three models differ in term of their population structure: in the bottom-up hierarchical system, individuals are located on a finite regular tree, in the non-spatial public debate model, they are located on a complete graph, and in the spatial public debate model, they are located on the $d$-dimensional regular lattice. For the bottom-up hierarchical system and non-spatial public debate model, Galam studied the probability that a given opinion wins under the majority rule and assuming that individuals' opinions are initially independent, making the initial number of supporters of a given opinion a binomial random variable. The first objective of this paper is to revisit his result assuming that the initial number of individuals in favor of a given opinion is a fixed deterministic number ...

Explore related subjects

Keep this discovery

BibTeXRIS

Nicolas Lanchier, Nicole Taylor. 2013-05-21. Galam's bottom-up hierarchical system and public debate model revisited. https://arxiv.org/abs/1305.4892

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR