SearcharxivSearch

arXiv · 2506.13587

Non-exchangeable mean-field theory for adaptive weights: propagation of dissociatedness and graphon sampling lemma

Abstract

We develop a mean-field theory for large, non-exchangeable particle (agent) systems where the states and interaction weights co-evolve in a coupled system of SDEs. A first main result is the establishment of the propagation of dissociatedness, a conceptual generalization of the classical propagation of chaos that accommodates the intrinsic local correlations between particles and their weights. The limiting McKean-Vlasov process is characterized by an Aldous-Hoover representation on a filtered probability space, beyond the standard one-particle law (or a family thereof). Paralleling the classical equivalence between propagation of chaos and the convergence of empirical measures to the one-particle law, we show that the propagation of dissociatedness corresponds to the convergence of the empirical structure under a distance unifying the Wasserstein distance for particles and the cut distance for weights. This quantitative stability is grounded in an adaptation of the sampling lemma from dense graph theory, analogous to the classical concentration results for empirical measures in the Wasserstein distance.

Explore related subjects

Keep this discovery

BibTeXRIS

Datong Zhou. 2025-06-16. Non-exchangeable mean-field theory for adaptive weights: propagation of dissociatedness and graphon sampling lemma. https://arxiv.org/abs/2506.13587

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