Towards Consensus: Reducing Polarization by Perturbing Social Networks

Miklos Z. Racz, Daniel E. Rigobon

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


This article studies how a centralized planner can modify the structure of a social or information network to reduce polarization. First, polarization is found to be highly dependent on degree and structural properties of the network - including the well-known isoperimetric number (i.e., Cheeger constant). We then formulate the planner's problem under full information, and motivate disagreement-seeking and coordinate descent heuristics. A novel setting for the planner in which the population's innate opinions are adversarially chosen is introduced, and shown to be equivalent to maximization of the Laplacian's spectral gap. We prove bounds for the effectiveness of a strategy that adds edges between vertices on opposite sides of the cut induced by the spectral gap's eigenvector. Finally, these strategies are evaluated on six real-world and synthetic networks. In several networks, we find that polarization can be significantly reduced through the addition of a small number of edges.

Original languageEnglish (US)
Pages (from-to)3450-3464
Number of pages15
JournalIEEE Transactions on Network Science and Engineering
Issue number6
StatePublished - Nov 1 2023
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Networks and Communications
  • Computer Science Applications


  • Network consensus and synchronization
  • opinion dynamics
  • social influence and recommendations
  • social network design and architecture


Dive into the research topics of 'Towards Consensus: Reducing Polarization by Perturbing Social Networks'. Together they form a unique fingerprint.

Cite this