SearcharxivSearch

arXiv · 2508.03452

Reconstructing the Probability Measure of a Curie-Weiss Model Observing the Realisations of a Subset of Spins

Abstract

We study the problem of reconstructing the probability measure of the Curie-Weiss model from a sample of the voting behaviour of a subset of the population. While originally used to study phase transitions in statistical mechanics, the Curie-Weiss or mean-field model has been applied to study phenomena, where many agents interact with each other. It is useful to measure the degree of social cohesion in social groups, which manifests in the way the members of the group influence each others' decisions. In practice, statisticians often only have access to survey data from a representative subset of a population. As such, it is useful to provide methods to estimate social cohesion from such data. The estimators we study have some positive properties, such as consistency, asymptotic normality, and large deviation principles. The main advantages are that they require only a sample of votes belonging to a (possibly very small) subset of the population and have a low computational cost. Due to the wide application of models such as Curie-Weiss, these estimators are potentially useful in disciplines such as political science, sociology, automated voting, and preference aggregation.

Explore related subjects

Keep this discovery

BibTeXRIS

Miguel Ballesteros, Ivan Naumkin, Gabor Toth. 2025-08-05. Reconstructing the Probability Measure of a Curie-Weiss Model Observing the Realisations of a Subset of Spins. https://arxiv.org/abs/2508.03452

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