
A⊗B∈Rml×nk is defined as
A⊗B=
a11B . . . a1nB
.
.
.....
.
.
am1B . . . amnB
.
A real square matrix Ahas the strong Perron-Frobenius
property if it has a unique dominant eigenvalue λ=ρ(A)
satisfying λ≥ |λi|for all λi6=λin σ(A)and its
corresponding eigenvector satisfies v0.Ais irreducible
if it cannot be transformed into an upper triangular matrix
through similarity transformations. Ais eventually positive
(eventually nonnegative) if there exists a positive integer k0
such that Ak0N×N(Ak0N×N) for all integers k > k0.
Proposition II.1. [16, Theorem 2.2] The following state-
ments are equivalent for a real square matrix A: (1) A
and AThave the strong Perron-Frobenius property; (2) Ais
eventually positive; (3) ATis eventually positive.
B. Signed graphs
A graph G= (V,E)is a set of nodes V={1, . . . , N}and
a set of edges E. We assume the graph is simple, i.e., there
is at most one edge between any two nodes. The adjacency
matrix A= (aik)of Gsatisfies aik = 0 if eik 6∈ E and
aik 6= 0 otherwise. Ais weighted if nonzero entries aik ∈R.
Gis unweighted if aik ∈ {0,1}or signed unweighted if
aik ∈ {0,1,−1}for all i, k ∈ V.Gis undirected whenever
aik =aki for all i, k ∈ V, and directed otherwise.
The in-degree of node ion Gis Pkaik. A path on Gis
a finite or infinite sequence of edges that joins a sequence
of nodes. Gis strongly connected if there exists a path from
any node to any other node. Gis strongly connected if and
only if Ais an irreducible matrix. A switching matrix Mis
a diagonal matrix with diagonal entries that are either 1or
−1. Two graphs G1,G2with adjacency matrices A1, A2are
switching equivalent whenever A1=MA2M.
C. Hopf bifurcation
Assume without loss of generality that (x, p)=(0,0) is
an equilibrium of a system ˙
x=f(x, p), where xis the state
and pa parameter. Then (0,0) is a Hopf bifurcation point
if it satisfies the following: i) The Jacobian Df(0,0) has a
complex conjugate pair of eigenvalues ±iω(0);ii) No other
eigenvalues of Df(0,0) lie on the imaginary axis; iii) Let
λ(p) = r(p)+iω(p),λ(p) = r(p)−iω(p)be the eigenvalues
of Df(x, p)that are smoothly parametrized by pand for
which r(0) = 0; then ∂r
∂p (0,0) 6= 0. We use Lyapunov-
Schmidt reduction methods [17, Chapter VIII] to study the
limit cycles that emerge through a Hopf bifurcation.
III. BELIEF FORMATION MODEL
We study a nonlinear model of Nahomogeneous agents
forming beliefs about Notopics, adapted from [13], [14].
zij ∈Ris the belief of agent iabout topic j. Whenever
zij >0(<0), agent iis in favor of (in opposition to) topic
j, and when zij = 0 it has a neutral belief on the topic. The
magnitude |zij |signifies the strength of commitment to the
belief on topic j. The total belief state of agent iis the vector
Zi= (zi1, . . . , ziNo)∈RNo, and the total network belief
state is Z= (Z1,...,ZNa)∈RNaNo. We say agents iand
kagree (disagree) on topic jif they both form a non-neutral
belief on the topic and sign(zij ) = sign(zkj )(6= sign(zkj )).
Agent iupdates its belief on topic jin continuous time as
˙zij =−d zij +uS1
αzij +γPNa
k=1
k6=i
(Aa)ikzkj
+PNo
l6=j
l=1
S2
β(Ao)jlzil +δ(Ao)jl PNa
k=1
k6=i
(Aa)ikzkl (1)
where S1, S2:R→Rare bounded saturation functions
satisfying Sr(0) = 0,S0
r(0) = 1,S00
r(0) = 0,S000
r(0) 6= 0,
with an odd symmetry Sr(−y) = −Sr(y)where r∈
{1,2}.S1saturates same-topic information and S2saturates
inter-topic information. These saturations reflect that social
network influence on each topic is bounded, and that an agent
is maximally affected by small changes in its neighbors’
beliefs on a topic when their weighted average is close to
zero. Parameter d > 0represents the agents’ resistance to
forming strong beliefs. Parameter u≥0regulates the amount
of attention agents allocate towards their social interactions,
or their susceptibility to social influence.
There are two signed directed graphs underlying the belief
formation process. One is the communication graph Ga=
(Va,Ea, sa), with signed adjacency matrix Aa∈RNa×Na.
(Aa)ik = 1 means agent iis cooperative towards agent k,
and (Aa)ik =−1means it is antagonistic towards agent
k. The other is the belief system graph Go= (Vo,Eo, so),
with signed adjacency matrix Ao∈RNo×No. The graph
Goencodes the logical interdependence between different
topics in the set Vo. Whenever (Ao)jl = 1(−1), topic j
is positively (negatively) aligned with topic laccording to
the belief system, and whenever (Ao)jl = 0, topic jis
independent of topic l. In the model (1) we assume that all
agents form beliefs following a single shared belief system.
The gains α, γ, β, δ ≥0regulate the relative strengths
of influence on beliefs in (1). αis the strength of agent
self-reinforcement of already-held beliefs; βis the strength
of agent internal adherence to the belief system Go.γis
the strength of agent social imitation, i.e. to mimic the
beliefs of neighbors towards whom the agent is cooperative
and to oppose the beliefs of those towards whom it is
antagonistic. δis agent ideological commitment; when δ
is large, agents evaluate their neighbors’ influence more
holistically according to the belief system Gorather than
through pure imitation along each topic. An illustration of
these four effects and their respective cumulative weights in
the model (1) is shown in Fig. 1.
IV. INDECISION-BREAKING AND OSCILLATIONS
We establish sufficient conditions for the onset of small-
amplitude periodic oscillations in the dynamics of beliefs (1).
The indecision state Z=0in which all agents have neutral
beliefs on all topics is an equilibrium of (1) for all parameter
values. To establish the onset of oscillations we first study