SearcharxivSearch

arXiv · 2607.19651

Metastability and phase transition in a social network model with multiple opinions

Abstract

We consider a stochastic opinion dynamics model on a fully connected social network with $N$ actors interacting by expressing opinions from a set of $M$ opinions. At any time $t\geq 0$, each actor is associated to an $M$-tuple representing the social pressure exerted on this actor for each opinion. The evolution of the matrix containing the social pressure of all actors for all opinions is a Markov jump process. Each actor tends to express opinions according to their social pressure vector and this tendency is modulated by a polarization coefficient. When an actor expresses an opinion $o$, its social pressure for all opinions is reset to zero, while for other actors the social pressure for $o$ increases by 1 and the social pressure for other opinions decreases by $1/(M-1)$. In this setting, we prove fast consensus formation, existence of a unique invariant measure and metastability in a highly polarized network. Moreover, by considering a communication bias parameter, the system exhibits a phase transition described as follows. With a negative communication bias parameter, all actors except one stop expressing in a finite time almost surely. Otherwise, no actor stops expressing opinions.

Explore related subjects

Keep this discovery

BibTeXRIS

Felipe Penafiel, Kádmo Laxa. 2026-07-22. Metastability and phase transition in a social network model with multiple opinions. https://arxiv.org/abs/2607.19651

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