SearcharxivSearch

arXiv · 2601.21023

The fractal geometry of opinion formation

Abstract

In this manuscript, we introduce and study a variant of the agent-based opinion dynamics proposed in a recent work [9], within the framework of an interacting multi-agent system, where agents are assumed to interact with each other and update their opinions after each pairwise encounter. Specifically, our opinion model involves a large crowd of $N$ indistinguishable agents, each characterized by an opinion value ranging within the interval $[-1,1]$. At each update time, two agents are picked uniformly at random and the opinion of one agent will either shift by a proportion $\mu \in (0,1]$ towards $+1$, or by a proportion $\lambda \in (0,1]$ towards $-1$, with probabilities depending on the other agent's opinion. We rigorously derive the mean-field limit PDE that governs the large-population limit of the agent-based model and present several quantitative results demonstrating convergence to the unique equilibrium distribution. Remarkably, for a suitable choice of model parameters, the long-term equilibrium opinion profile displays a striking self-similar structure that generalizes the celebrated Bernoulli convolution, a topic extensively studied in the context of fractal geometry [24,51]. These findings also enhance our understanding of the opinion fragmentation phenomenon and may provide valuable insights for the development of more sophisticated models in future research.

Explore related subjects

Keep this discovery

BibTeXRIS

Fei Cao, Roberto Cortez. 2026-01-28. The fractal geometry of opinion formation. https://arxiv.org/abs/2601.21023

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR