DeGroot learning explained

DeGroot learning refers to a rule-of-thumb type of social learning process. The idea was stated in its general form by the American statistician Morris H. DeGroot; antecedents were articulated by John R. P. French and Frank Harary. The model has been used in physics, computer science and most widely in the theory of social networks.^[1]

Setup and the learning process

Take a society of

n agents where everybody has an opinion on a subject, represented by a vector of probabilities p( 0 ) = (p _{1(0),} ... , p _{n(0)} ) . Agents obtain no new information based on which they can update their opinions but they communicate with other agents. Links between agents (who knows whom) and the weight they put on each other's opinions is represented by a trust matrix T where T _{ij} is the weight that agent i puts on agent j 's opinion. The trust matrix is thus in a one-to-one relationship with a weighted, directed graph where there is an edge between i and j if and only if T _{ij} > 0 . The trust matrix is stochastic, its rows consists of nonnegative real numbers, with each row summing to 1.

Formally, the beliefs are updated in each period as

p(t) = T p(t -1 )

so the

t th period opinions are related to the initial opinions byp(t) = T ^{t} p( 0 )

Convergence of beliefs and consensus

An important question is whether beliefs converge to a limit and to each other in the long run. As the trust matrix is stochastic, standard results in Markov chain theory can be used to state conditions under which the limit

p( inf ty) = \lim _{t} p(t) = \lim _{t} T ^{t} p( 0 ) exists for any initial beliefs p( 0 ) \in [ 0 , 1 ] ^{n} . The following cases are treated in Golub and Jackson (2010).

Strongly connected case

If the social network graph (represented by the trust matrix) is strongly connected, convergence of beliefs is equivalent to each of the following properties:

• the graph represented by

T is aperiodics of T corresponding to eigenvalue 1 whose entries sum to 1 such that, for every p \in [ 0 , 1 ] ^{n} , \left( \lim _{t} T ^{t} p \right) _{i} = s ⋅ p for every i \in \{ 1 , ... , n \} where ⋅ denotes the dot product.The equivalence between the last two is a direct consequence from Perron–Frobenius theorem.

General case

It is not necessary to have a strongly connected social network to have convergent beliefs, however,the equality of limiting beliefs does not hold in general.

We say that a group of agents

C \subseteq \{ 1 , ... , n \} is closed if for any i \in C , T _{ij} > 0 only if j \in C . Beliefs are convergent if and only if every set of nodes (representing individuals) that is strongly connected and closed is also aperiodic.

Consensus

A group

C of individuals is said to reach a consensus if p _{i(infty)=} p _{j(infty)} for any i, j \in C . This means that, as a result of the learning process, in the limit they have the same belief on the subject.

With a strongly connected and aperiodic network the whole group reaches a consensus.In general, any strongly connected and closed group

C of individuals reaches a consensus for every initial vector of beliefs if and only if it is aperiodic. If, for example, there are two groups satisfying these assumptions, they reach a consensus inside the groups but there is not necessarily a consensus at the society level.

Social influence

Take a strongly connected and aperiodic social network. In this case, the common limiting belief is determined by the initial beliefs through

p( inf ty) = s ⋅ p( 0 )

where

s is the unique unit length left eigenvector of T corresponding to the eigenvalue 1. The vector s shows the weights that agents put on each other's initial beliefs in the consensus limit. Thus, the higher is s _{i} , the more influence individual i has on the consensus belief.

The eigenvector property

s = s T implies that s _{i} = \sum ^{n} _{j =1} T _{ji} s _{j}

This means that the influence of

i is a weighted average of those agents' influence s _{j} who pay attention to i , with weights of their level of trust. Hence influential agents are characterized by being trusted by other individuals with high influence.

Examples

These examples appear in Jackson (2008).

Convergence of beliefs

Consider a three-individual society with the following trust matrix:

T = \begin{pmatrix} 0 & 1 / 2 & 1 / 2 \\ 1 & 0 & 0 \\ 0 & 1 & 0 \\ \end{pmatrix}

Hence the first person weights the beliefs of the other two with equally, while the second listens only to the first, the third only to the second individual.For this social trust structure, the limit exists and equals

\lim _{t} T ^{t} p( 0 ) = \left(\lim _{t} T ^{t\right)} p( 0 ) = \begin{pmatrix} 2 / 5 & 2 / 5 & 1 / 5 \\ 2 / 5 & 2 / 5 & 1 / 5 \\ 2 / 5 & 2 / 5 & 1 / 5 \\ \end{pmatrix} p( 0 )

so the influence vector is

s = \left( 2 / 5 , 2 / 5 , 1 / 5 \right) and the consensus belief is 2 / 5 p _{1(0)} + 2 / 5 p _{2(0)} + 1 / 5 p _{3(0)} . In words, independently of the initial beliefs, individuals reach a consensus where the initial belief of the first and the second person has twice ashigh influence than the third one's.

Non-convergent beliefs

If we change the previous example such that the third person also listens exclusively to the firstone, we have the following trust matrix:

T = \begin{pmatrix} 0 & 1 / 2 & 1 / 2 \\ 1 & 0 & 0 \\ 1 & 0 & 0 \\ \end{pmatrix}

In this case for any

k \geq 1 we haveT ^{2k} = \begin{pmatrix} 0 & 1 / 2 & 1 / 2 \\ 1 & 0 & 0 \\ 1 & 0 & 0 \\ \end{pmatrix}

and

T ^{2k} = \begin{pmatrix} 1 & 0 & 0 \\ 0 & 1 / 2 & 1 / 2 \\ 0 & 1 / 2 & 1 / 2 \\ \end{pmatrix}

so

\lim _{t} T ^{t} does not exist and beliefs do not converge in the limit. Intuitively, 1 is updating based on 2 and 3's beliefs while2 and 3 update solely based on 1's belief so they interchange their beliefs in each period.

Asymptotic properties in large societies: wisdom

It is possible to examine the outcome of the DeGroot learning process in large societies,that is, in the

n \to inf ty limit.

Let the subject on which people have opinions be a "true state"

\mu \in [ 0 , 1 ] . Assume that individualshave independent noisy signals p ^{( 0 )} _{i} (n) of \mu (now superscript refers to time, the argument to the size of the society).Assume that for all n the trust matrix T(n) is such that the limiting beliefs p ^{( inf ty)} _{i} (n) exists independently from the initial beliefs. Then the sequence of societies \left( T(n) \right) ^{inf ty} _{n =1} is called wise ifmax _{i} | p ^{( inf ty)} _{i} - \mu | \xrightarrow{ p } 0

where

\xrightarrow{ p } denotes convergence in probability.This means that if the society grows without bound, over time they will have a common and accurate belief on the uncertain subject.

A necessary and sufficient condition for wisdom can be given with the help of influence vectors. A sequence of societies is wise if and onlyif

\lim _{n} max _{i} s _{i(n)} = 0 that is, the society is wise precisely when even the most influential individual's influence vanishes in the large society limit. For further characterization and examples see Golub and Jackson (2010).

References

1. Book: Koley . Gaurav . Deshmukh . Jayati . Srinivasa . Srinath . Social Informatics . Social Capital as Engagement and Belief Revision . 2020 . Aref . Samin . Bontcheva . Kalina . Braghieri . Marco . Dignum . Frank . Giannotti . Fosca . Grisolia . Francesco . Pedreschi . Dino . https://link.springer.com/chapter/10.1007/978-3-030-60975-7_11 . Lecture Notes in Computer Science . 12467 . en . Cham . Springer International Publishing . 137–151 . 10.1007/978-3-030-60975-7_11 . 978-3-030-60975-7. 222233101 .

• ^[2]
• ^[3]
• ^[4]
• ^[5]
• ^[6]