Documentation

Dynamics.MajorityMap

The majority map and the recursions of conformist transmission and of Galam's rule #

The probability that the majority of three independent samples, each of type 1 with probability p, is of type 1 is p³ + 3p²(1 - p) = 3p² - 2p³: the majority map (majorityMap). It is the expected one-round map of binary 3-Majority and of 2-Choices (the binary median rule), a mean field in the sense of Dynamics.Kernel.MeanField (packages plurality and median), and the deterministic recursion of two models of other fields (rows three-majority and two-choices of the cross-field dictionary):

The majority map #

The majority map p ↦ 3p² - 2p³: the probability that the majority of three independent samples is of type 1 when each sample is of type 1 with probability p.

Equations
Instances For
    theorem Dynamics.majorityMap_eq_prob (p : ℝ) (h0 : 0 ≤ p) (h1 : p ≤ 1) :
    ((Distribution.binomial 3 p h0 h1).prob fun (j : Fin (3 + 1)) => 2 ≤ ↑j) = majorityMap p

    The majority of three independent samples: the map is the probability that at least two of three independent coins of bias p show heads.

    The two types are symmetric: the other type follows the same map.

    Conformist transmission #

    Conformist transmission (Boyd and Richerson 1985, Eq. 7.1): the frequency p of a variant becomes p + D p (1 - p)(2p - 1) in the next generation, D measuring the strength of conformism.

    Equations
    Instances For
      noncomputable def Dynamics.conformistTable (D : ℝ) :
      Fin 4 → ℝ

      Boyd and Richerson's table of conformist transmission: a naive individual whose three models include j holders of the variant acquires it with probability 0, 1/3 - D/3, 2/3 + D/3, 1 for j = 0, 1, 2, 3.

      Equations
      Instances For
        theorem Dynamics.conformistTable_eq (D : ℝ) (j : Fin 4) :
        conformistTable D j = (D * if 2 ≤ ↑j then 1 else 0) + (1 - D) * (↑↑j / 3)

        The table adopts the majority with probability D and otherwise copies one model. With j holders among the three models, the acquisition probability is D times the indicator that they are a majority plus 1 - D times the probability j/3 that a model drawn uniformly among the three holds the variant.

        theorem Dynamics.conformistMap_eq_expect (D p : ℝ) (h0 : 0 ≤ p) (h1 : p ≤ 1) :

        Boyd and Richerson's Eq. 7.1 from the table. If the three models are independent and each holds the variant with probability p, so that the number of holders among them has the law Bin(3, p), the variant is acquired with probability p + D p (1 - p)(2p - 1).

        theorem Dynamics.conformistMap_eq_mix (D p : ℝ) :
        conformistMap D p = (1 - D) * p + D * majorityMap p

        Conformist transmission is a mixture of unbiased transmission and of the majority map.

        With D = 1, conformist transmission is the majority map p ↦ 3p² - 2p³.

        With D = 0, conformist transmission is unbiased: the frequency is unchanged.

        theorem Dynamics.conformistMap_nonneg {D p : ℝ} (hD0 : 0 ≤ D) (hD1 : D ≤ 1) (h0 : 0 ≤ p) (h1 : p ≤ 1) :
        theorem Dynamics.conformistMap_le_one {D p : ℝ} (hD0 : 0 ≤ D) (hD1 : D ≤ 1) (h0 : 0 ≤ p) (h1 : p ≤ 1) :

        Galam's majority rule #

        Galam's majority rule with groups of three (Galam 2002, Eq. 4 with a_3 = 1): every group of three adopts its majority, and the proportion P of an opinion becomes P³ + 3P²(1 - P).

        Equations
        Instances For

          Galam's map is the majority map.