Cognitive Resonance, Trust, and the Geometry of Opinion Diversity
Emphasis throughout is on the two social-dynamics frameworks (Parts I & II).
Why one number is not enough
Human opinion is fundamentally multidimensional, yet the dominant mathematical models of opinion dynamics represent it as a single scalar.
Foundational models, DeGroot, Friedkin–Johnsen, bounded confidence, all share one feature:
Two individuals may agree on economic policy yet hold incompatible views on social identity, environmental regulation, and institutional trust.
Plus six peer-reviewed papers grounding the work in the social-media discourse context (Part III).
| Chapter | Content |
|---|---|
| 1, Introduction | Motivation, questions, contributions |
| 2, Background | Graphs, classical & extended models, cognition, communities |
| 3, PSCR-T | Cognitive resonance & trust dynamics (Part I) |
| 4, Community detection | Spatial opinion models & diversity (Part II) |
| 5, Conclusions | Synthesis, limitations, future work |
Graphs · opinion dynamics · cognition · communities
A social network is a graph \(G=(V,E)\): vertices are agents, edges are relationships.
A full model needs topology, edge weights, and node attributes.
Social life unfolds across many contexts simultaneously: work, family, online.
This multi-layer substrate is used throughout the thesis.
Graph Laplacian \(L = D - A\) encodes structure through its spectrum \(0=\lambda_1\le\lambda_2\le\dots\le\lambda_N\):
Centrality: degree, closeness, betweenness, eigenvector, who is influential.
Simple micro-rules → complex macro-behaviour (French 1956; Abelson 1964; Epstein 1996).
Row-stochastic trust matrix \(W\) (\(\sum_j W_{ij}=1\)); repeated averaging:
\[ x_i(t+1) = \sum_{j} W_{ij}\, x_j(t), \qquad \mathbf{x}(t) = W^t\mathbf{x}(0) \]
Inevitable consensus conflicts with reality, add attachment to initial beliefs:
\[ x_i(t+1) = \lambda_i x_i(0) + (1-\lambda_i)\sum_j W_{ij} x_j(t) \]
Converges to a stable disagreement equilibrium:
\[ \mathbf{x}_f = \big(I - (I-\Lambda)W\big)^{-1}\Lambda\,\mathbf{x}(0) \]
Stubborn agents at the periphery amplify disagreement (Acemoglu & Ozdaglar 2011).
Agents interact only within a confidence bound \(\epsilon\), the source of polarization.
\( \mathcal{N}_i(t)=\{j:\|x_i-x_j\|\le\epsilon\} \)
\( x_i(t{+}1)=\frac{1}{|\mathcal{N}_i|}\sum_{j\in\mathcal{N}_i}x_j \)
random pair, if \(\|x_i-x_j\|\le\epsilon\):
\( x_i \mathrel{+}= \mu(x_j-x_i) \)
Large \(\epsilon\) → consensus; small \(\epsilon\) → fragmentation (Lorenz 2007).
Topological antagonism sustains disagreement, a contrast to PSCR-T's resonance gating.
Kelman's three processes of social influence, increasing depth & permanence:
Trust is the catalyst: \(W_{ij}=f(\text{Trust}_i(j))\), and it evolves dynamically.
Grounds susceptibility in individual-difference constructs, not free parameters.
These three, salience, resonance, trust, become the core mechanisms of PSCR-T.
A community = vertices more densely connected internally than externally. Quality via modularity:
\[ Q = \frac{1}{2m}\sum_{i,j}\Big[A_{ij}-\frac{k_i k_j}{2m}\Big]\delta(c_i,c_j) \]
The remaining chapters build multidimensional, psychologically grounded models that co-evolve with structure.
Perceptual Salience · Cognitive Resonance · Trust
A psychologically-grounded model for multidimensional opinion dynamics on multiplex networks.
Aggregated influence across layers:
\[ \mathbf{W} = \sum_{\ell=1}^{L} w_\ell\, \mathbf{D}^{[\ell]-1}\mathbf{A}^{[\ell]}, \qquad \sum_\ell w_\ell = 1 \]
\(\mathbf{W}\) is row-stochastic if each agent has \(\ge 1\) incoming edge.
A single agent pair may be tied across several relational contexts at once:
Multiplexity enlarges the region of parameter space where consensus is reachable, yet can also sustain layer-specific clusters.
Before the psychology, establish the linear backbone:
\[ \mathbf{O}(t+1) = \boldsymbol{\Lambda}\mathbf{W}\,\mathbf{O}(t) + (\mathbf{I}-\boldsymbol{\Lambda})\,\mathbf{O}(0) \]
Each agent has a salience vector \(\mathbf{s}_i\in[0,1]^d\): how much issue \(\ell\) matters to \(i\).
Salience-weighted distance via the Hadamard product:
\[ d_{ij}(t) = \big\|\,(\mathbf{o}_i(t)-\mathbf{o}_j(t))\circ\mathbf{s}_i\,\big\|_2 \]
Issue publics (Krosnick): tolerate large gaps on low-salience issues, sensitive to small gaps on high-salience ones.
Two agents may nominally hold positions on the same \(d\) issues, yet:
Media and political actors compete to raise the salience of their preferred issues, shaping which dimensions are active in an interaction.
A soft gate on social influence based on belief alignment:
\[ R_{ij}(t) = \sigma\!\big(-\beta\,d_{ij}(t)^2\big) = \frac{1}{1+e^{\beta d_{ij}(t)^2}} \]
Personality profile \(\boldsymbol{\theta}_i\in\mathbb{R}^k\) (e.g. Big Five); compatibility distance \(\Delta_{ij}=\|\boldsymbol{\theta}_i-\boldsymbol{\theta}_j\|_2\).
Trust \(A_{ij}(t)\in[0,1]\) evolves with memory:
\[ A_{ij}(t+1) = \alpha A_{ij}(t) + (1-\alpha)\,\sigma\!\big(-\Delta_{ij} + \beta R_{ij}(t)\big) \]
Personality distance \(\Delta_{ij}\), stable dispositional compatibility.
Opinion distance \(d_{ij}(t)\), transient, current alignment.
Prior co-evolutionary models collapse both into one similarity measure. PSCR-T keeps them distinct, enabling stable long-run trust between compatible agents even when opinions temporarily diverge.
The same \(\beta\) governs two things by design:
Fewer free parameters; encodes that a distance-sensitive agent is correspondingly sensitive when updating trust. Decouple to \(\beta_T\) if needed.
All mechanisms combine in the opinion update:
\[ \mathbf{o}_i(t+1) = \lambda_i \cdot \frac{\sum_j A_{ij}(t)R_{ij}(t)\,\mathbf{o}_j(t)}{\sum_j A_{ij}(t)R_{ij}(t) + \varepsilon} + (1-\lambda_i)\,\mathbf{o}_i(0) \]
A product of structural trust and cognitive resonance.
| Model | Recovered by |
|---|---|
| Friedkin–Johnsen | \(d{=}1\), \(A_{ij}\) constant, \(R_{ij}{=}1\), \(\sum_j A_{ij}{=}1\) |
| DeGroot | additionally \(\lambda_i = 1\) (no anchoring) |
| Bounded confidence | \(R_{ij}(t)=\mathbb{I}(d_{ij}(t)<\epsilon)\) hard threshold |
PSCR-T is a strict superset: it interpolates between them via soft gating.
Friedkin et al. (Science 2016) show logical constraints between issues reshape equilibria. PSCR-T does not impose them, by design:
Define the normalised effective weight per source:
\[ \tilde{W}_{ij}(t) = \frac{A_{ij}(t)R_{ij}(t)}{\sum_m A_{im}(t)R_{im}(t) + \varepsilon} \]
The PSCR-T update, derived purely from social psychology, is structurally isomorphic to scaled dot-product attention in Transformers.
A structural analogy between two independently motivated formulations, no claim of deep equivalence, but analytically informative.
\[ \mathrm{Attention}(\mathbf{Q},\mathbf{K},\mathbf{V}) = \mathrm{softmax}\!\Big(\tfrac{\mathbf{Q}\mathbf{K}^\top}{\sqrt{d_k}}\Big)\mathbf{V} \]
Per token: \( \mathrm{out}_i = \sum_j a_{ij}\mathbf{v}_j \), with softmax weights over all sources.
Softmax forces weights to a probability distribution → attention is competitive (a fixed budget).
| Function | PSCR-T | Transformer |
|---|---|---|
| Compatibility | \(d_{ij}^2=\|(\mathbf{o}_i-\mathbf{o}_j)\circ\mathbf{s}_i\|^2\) | \(\mathbf{q}_i\cdot\mathbf{k}_j/\sqrt{d_k}\) |
| Content gate | \(R_{ij}=\sigma(-\beta d_{ij}^2)\) | softmax \(a_{ij}\) |
| Structural gate | Trust \(A_{ij}(t)\) | learned attention |
| Values | opinions \(\mathbf{o}_j\) | values \(\mathbf{v}_j\) |
| Identity | \(\Delta_{ij}=\|\boldsymbol{\theta}_i-\boldsymbol{\theta}_j\|\) | positional embedding |
| Residual | anchoring \((1{-}\lambda_i)\mathbf{o}_i(0)\) | residual + LayerNorm |
| Multi-channel | multiplex layers | multi-head attention |
Normalised across sources → reallocation of a fixed attention budget. Zero-sum.
Each \(R_{ij}\) computed independently → withdrawal from dissonant sources. Not zero-sum.
Human attention need not be zero-sum: one can become less receptive to all dissonant voices at once.
Boundedness → local stability → impossibility → attenuation
Both follow because updates are convex combinations of points already in the domain (\(\sigma\to(0,1)\)).
Decompose the coupled Jacobian at a fixed point:
\[ J = \begin{bmatrix} J_{OO} & J_{OA} \\ J_{AO} & J_{AA} \end{bmatrix}, \quad \gamma_O=\|J_{OO}\|_\infty,\; \gamma_A=\|J_{AA}\|_\infty \]
For PSCR-T the gains have closed forms:
Network-aware: stronger trust memory (\(\alpha\uparrow\)) or weaker susceptibility (\(\lambda\downarrow\)) both help stability.
Why: the Neumann series \((\mathbf{I}-\boldsymbol{\Lambda}\mathbf{W})^{-1}=\sum_k(\boldsymbol{\Lambda}\mathbf{W})^k\) has all strictly positive entries for primitive \(\mathbf{W}\).
Classical FJ forces connected agents into permanent compromise, no dynamic echo chambers.
PSCR-T circumvents the impossibility via resonance gating. For two agents with distance floor \(D_{\min}>0\):
\[ W_{12}^{\text{eff}}(t) \le \frac{1}{1+e^{\beta D_{\min}^2}} \le e^{-\beta D_{\min}^2} \]
The mechanism is not edge deletion. Trust persists; influence is gated to zero by resonance.
Scope: an illustrative two-agent bound, a sufficient condition for attenuation, not a full basin-of-attraction result.
| Static FJ | PSCR-T | |
|---|---|---|
| Influence weights | fixed at init | gated by \(A_{ij}R_{ij}\) |
| Neumann series | all-positive | opinion-dependent |
| Fragmentation | impossible | achievable |
| Cannot be faked by | – | tuning \(\lambda_i\) alone |
The distinction is structural, not a matter of parameter choice.
Four real multiplex networks, an order of magnitude apart in size
| Dataset | Context | \(|V|\) | \(|E|\) | \(L\) | \(\rho\) |
|---|---|---|---|---|---|
| Vickers | Students | 29 | 250 | 3 | 0.616 |
| CS-Aarhus | University | 61 | 353 | 5 | 0.193 |
| Lazega | Law firm | 71 | 1008 | 3 | 0.406 |
| Copenhagen | DTU study | 851 | 85115 | 4 | 0.235 |
Copenhagen: proximity (Bluetooth), calls, SMS, Facebook, tests scalability to ~800 agents.
| Hypothesis | Metric | With | Without |
|---|---|---|---|
| Resonance → echo chambers | Trust segregation | 1.15 | 1.00 |
| Personality → trust diversity | Trust variance | 0.0094 | 0.0088 |
| Memory → stability | Volatility reduction | n/a | n/a |
In dense multiplex graphs, \(\lambda\) does not differentiate behaviour, the diagnostic axis is resonance \(\beta\).
| Metric | FJ | HK | PSCR-T |
|---|---|---|---|
| Final variance | 0.0176 | 0.0246 | 0.0185 |
| Entropy | 1.4056 | 1.4567 | 1.4137 |
PSCR-T occupies a principled middle ground: more spread than globally-coupled FJ, less than threshold-driven HK.
All three converge to \(\approx 2\) clusters, the macro-partition is driven by network community topology.
The geometry of opinion diversity
A social network that looks like one homogeneous blob almost always decomposes into smaller, opinion-coherent communities.
Components sum to 1; raising one lowers the others, a trade-off constraint.
Each component independent in \([0,1]\); overlapping strong stances allowed with no trade-off.
The independent-vector choice lets an agent care strongly about many issues at once.
\[ Q = \frac{1}{2m}\sum_{i,j}\Big[A_{ij}-\frac{k_i k_j}{2m}\Big]\delta(c_i,c_j) \]
Also: Leiden (well-connected guarantee), Infomap, stochastic block models, spectral.
Smallest axis-aligned box enclosing an opinion polygon. Cheap proxy: disjoint MBRs ⇒ no intersection.
Height-balanced hierarchical index of MBRs. Prunes disjoint subtrees → sub-linear queries.
These make opinion-overlap queries scale to tens of thousands of users.
Three research streams intersect here:
None combine geometric multidimensional representation with spatial indexing for reassignment, the gap this chapter fills.
Weighted network, anchoring weights \(w_{ii}\in(0,1]\), \(w_{ii}+\sum_{j\ne i}w_{ij}=1\):
\[ x_i(t) = \sum_{j\ne i} w_{ij}x_j(t-1) + w_{ii}x_i(0) \;\Rightarrow\; \mathbf{x}^* = (I-A)^{-1}B\,\mathbf{x}(0) \]
\(A\) substochastic (\(\rho(A)<1\)) ⇒ unique stable state; \(\epsilon\)-convergence in \(O(\ln(n/\epsilon))\) steps.
Each individual \(v_i\) holds \(p_i\ge 1\) perspectives → add perspective nodes \(v_{i1},\dots,v_{ip_i}\):
\[ V' = V \cup \{v_{ij}\}, \qquad E' = E \cup \{(v_{ij},v_{kl}) : (v_i,v_k)\in E\} \]
Every perspective of \(i\) links to every perspective of each neighbour \(k\). All aspects of a belief influence one another.
Each perspective updates by FJ over neighbours' perspectives:
\[ x_{ij}(t{+}1) = \lambda_{ij}x_{ij}(t) + (1-\lambda_{ij})\!\!\sum_{v_k\in N(v_i)}\sum_{l=1}^{p_k} w_{ij,kl}\,x_{kl}(t) \]
with \(\sum_{k,l} w_{ij,kl}=1\). Weights depend on relationship strength, perspective similarity and \(p_i,p_k\).
Map an \(N\)-dim opinion vector to a regular \(N\)-gon inscribed in the unit circle:
\[ \theta_i = \frac{2\pi(i-1)}{N}, \qquad P_i = (x_i\cos\theta_i,\; x_i\sin\theta_i) \]
Add a \(z\)-coordinate = a user metric (mean opinion, centrality, influence):
\[ z_u = \frac{1}{N}\sum_{i=1}^{N} o_i \]
Connecting corresponding vertices across users forms a polyhedron. Volume via tetrahedral decomposition:
\[ V_{\text{tetra}} = \tfrac{1}{6}\big|\det[\,\cdots\,]\big|, \qquad V_{\text{poly}} = \sum V_{\text{tetra}} \]
The polyhedron couples opinion spread with network position in one geometric object.
Same construction, different \(z\) → different question answered about the same community.
Per community \(k\): a polyhedron volume \(V_k\). Stack into the opinion volume vector \(\mathbf{v}=(V_1,\dots,V_k)\):
Normalised by node count → comparable across networks of different sizes.
All opinions \(=0\) → polygons collapse to origin → volume \(= 0\).
All opinions \(=1\) → full regular \(n\)-gons: \( V \approx \tfrac{1}{2}n\sin(\tfrac{2\pi}{n}) \).
Any interior configuration shrinks each inscribed polygon → smaller volume.
| Dataset | Nodes | Edges | Avg deg | Clustering |
|---|---|---|---|---|
| WOSN 2009 | 63,731 | 817,090 | 25.64 | 0.22 |
| Karate Club | 34 | 78 | 4.59 | 0.571 |
Opinion vectors synthetically augmented (no public ground-truth multidimensional opinions). Volumes via Quickhull (SciPy).
Validity scope: a controlled structural stress test of the geometry, methodological, not calibrated behavioural claims.
| Dataset | Metric | Dim | Communities | \(D(G)\) |
|---|---|---|---|---|
| Karate | Mean | 3 | 4 | 0.0132 |
| Karate | Mean | 6 | 4 | 0.0324 |
| Karate | Mean | 9 | 4 | 0.0384 |
| WOSN | Mean | 9 | 209 | 1.0e-4 |
| WOSN | Centrality | 9 | 195 | 1.26e-6 |
Mean-opinion \(z\) amplifies divergence; centrality-based \(z\) is lower, influential users hold more cohesive opinions.
Louvain + MBR overlap + R-tree reassignment
Result: communities that are structurally connected and opinion coherent.
For each opinion \(o_{ij}\): \((x,y)=(o_{ij}\cos\theta_j, o_{ij}\sin\theta_j)\); track min/max → box.
Recurse the R-tree, pruning children whose MBR is disjoint from the query. \(O(\log n + k)\) per node.
Reference point stored: a point (1D), segment centre (2D), or polygon centre (\(\ge\)3D).
After Louvain gives a structural partition, for each node \(i\):
A structural pass (Louvain) followed by an opinion-coherence pass (R-tree), kept polylogarithmic per node.
| Step | Complexity |
|---|---|
| Louvain detection | \(O(I\cdot|E|\cdot\log n)\) |
| R-tree construction | \(O(n\log n)\) |
| Overlap queries | \(O(n(\log n + k))\) |
| Community updates | \(O(n\cdot k)\) |
| Total | \(O(n\log n + n\cdot k)\) |
Preserves Louvain's practical scalability; degrades only when overlaps \(k\) or density explode.
Intra-community agreement (lower = tighter):
\[ O_{\text{coh}} = \tfrac{1}{|\mathcal{C}|}\sum_k\sum_d \mathrm{Var}(\{o_{i,d}: i\in k\}) \]
Inter-community differentiation (higher = distinct):
\[ O_{\text{sep}} = \tfrac{1}{|\mathcal{C}|^2}\sum_{k_1,k_2}\|c_{k_1}-c_{k_2}\| \]
Two lenses on opinion structure inside and across communities.
| Dataset | D | Algorithm | Modularity | Cohesion | Separation |
|---|---|---|---|---|---|
| Karate | 5 | Modified | 0.4198 | 13.28 | 0.1623 |
| Karate | 5 | Original | 0.4151 | 12.97 | 0.1729 |
| Karate | 15 | Modified | 0.3920 | 42.64 | 0.0699 |
| Karate | 15 | Original | 0.4151 | 42.19 | 0.0723 |
Modified Louvain keeps structural connectivity while improving opinion cohesion/separation, advantage grows with dimensionality.
| Dataset | D | Algorithm | Modularity | Cluster coeff. | Cohesion |
|---|---|---|---|---|---|
| Random | 2 | Modified | 0.4188 | 0.5533 | 7.20 |
| Random | 2 | Original | 0.3949 | 0.5244 | 5.19 |
| Random | 15 | Modified | 0.4188 | 0.5533 | 45.22 |
| Random | 15 | Original | 0.4198 | 0.5502 | 45.06 |
Structural metrics (modularity, clustering) stay consistent; opinion cohesion strengthens as dimensionality rises.



Same node positions; colours change as opinion-space overlap moves nodes between communities.
Complementary published work, the environment opinion dynamics live in
Online influence is mediated through language carrying framing, emotion, and strategic ambiguity.
Two are closest to social dynamics (discord, narrative); two set boundary conditions (irony, ethics).
Online fragmentation is often not about missing exposure, but the quality of interaction after exposure.
A contextual signal generator for opinion dynamics: which dimensions become salient, which relations credible.
Together they ground the theory in the concrete challenges of real social-media environments.
Synthesis · limitations · future work
The gap between scalar models and human belief is not one of parameterisation, it is one of fundamental structure.
No single scalar can capture all of this.
A theoretically grounded, empirically tested foundation from which a richer science of collective opinion can be built.
Echo chambers, misinformation, resilient polarization remain pressing. Treating opinion as the multidimensional, psychologically grounded, structurally embedded quantity it truly is offers one principled path toward understanding, and mitigating, these dynamics at scale.
Questions?