Search arXivSearch

arXiv · 2609.11039

Uniform-in-Time Boltzmann Mean-Field Limits for Anchored Binary Opinion Dynamics

Abstract

We study a continuous-time opinion model in which agents interact in pairs and each agent has a fixed anchor. At each interaction, both opinions are updated according to a possibly nonlinear rule with random inputs. Under suitable stability and moment assumptions, we establish uniform-in-time propagation of chaos: as the population grows, any fixed number of agents become asymptotically independent, with a common law solving a nonlinear Boltzmann equation. The proof combines a graphical approximation on finite time intervals with exponential convergence of the finite system and its nonlinear limit to their respective stationary laws. We examine two applications. For an anchored variant of the Friedkin-Johnsen model with random coefficients, we give conditions for sub-Gaussian or power-law tails of stationary deviations from the anchors. Occasional overreaction can produce power-law tails with Gaussian anchors and noise, even as the nonlinear law converges exponentially fast to stationarity. We also study an anchored model of biased assimilation, determining when a nearby opinion moves toward or away from neutrality with the anchor and incoming evidence held at neutral values. Simulations illustrate the tail predictions and show how a single peak in the smoothed empirical opinion profile can split into two.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jingyi Zhang, Debankur Mukherjee. 2026-09-15. Uniform-in-Time Boltzmann Mean-Field Limits for Anchored Binary Opinion Dynamics. https://arxiv.org/abs/2609.11039

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

KEEP EXPLORING

Related papers

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR